| Task: | Anime Shops |
| Sender: | Sofie Fu |
| Submission time: | 2024-07-10 00:58:47 +0300 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.01 s | 1, 3 | details |
| #2 | WRONG ANSWER | 0.01 s | 1, 3 | details |
| #3 | WRONG ANSWER | 0.01 s | 1, 3 | details |
| #4 | ACCEPTED | 0.01 s | 1, 3 | details |
| #5 | WRONG ANSWER | 0.11 s | 3 | details |
| #6 | WRONG ANSWER | 0.11 s | 3 | details |
| #7 | WRONG ANSWER | 0.11 s | 3 | details |
| #8 | ACCEPTED | 0.14 s | 3 | details |
| #9 | WRONG ANSWER | 0.04 s | 2, 3 | details |
| #10 | WRONG ANSWER | 0.04 s | 2, 3 | details |
| #11 | ACCEPTED | 0.07 s | 2, 3 | details |
| #12 | WRONG ANSWER | 0.04 s | 3 | details |
| #13 | WRONG ANSWER | 0.04 s | 3 | details |
| #14 | WRONG ANSWER | 0.05 s | 3 | details |
| #15 | ACCEPTED | 0.03 s | 3 | details |
| #16 | WRONG ANSWER | 0.04 s | 3 | details |
Code
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vo vector
#define pb push_back
#define se second
#define fi first
#define all(v) v.begin(), v.end()
typedef vector<int> vi;
typedef pair<int, int> pii;
#define umap unordered_map
#define uset unordered_set
#define rep(i, a, b) for(int i=(a); i<b; i++)
#define pr1(x) cerr << #x << '=' << x << ' ';
//for google contests
#define repd(i, a, b) for(int i=(b-1); i >= a; i--)
void _pr(signed x) {cerr << x;}
void _pr(long long x) {cerr << x;}
void _pr(size_t x) {cerr << x;}
void _pr(double x) {cerr << x;}
void _pr(char x) {cerr << '\'' << x << '\'';}
void _pr(const char* x) {cerr << x;}
void _pr(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V> void _pr(const pair<T, V> &x);
template<typename T, typename V> void _pr(const pair<T, V> &x) {cerr << "\e[95m" << "[ "; _pr(x.first); cerr << ", "; _pr(x.second); cerr << "\e[95m" << ']';}
template<typename T> void _pr(const T &x) {int F=0; cerr << '{'; for(auto &i: x) cerr << (F++ ? ", " : ""), _pr(i); cerr << "\e[91m" << '}';}
template <typename T, typename... V> void _pr(T t, V... v) {_pr(t); if(sizeof...(v)) cerr << ", "; _pr(v...);}
#define pr(x...) cerr << "\e[91m" << __func__ << ':' << __LINE__ << " [" << #x << "] = ["; _pr(x); cerr << "\e[91m" << ']' << "\033[0m" << endl;
//go for outline with ;, then details
int const inf = LLONG_MAX, mxn = 1e5+4;
int n, m, k, anime[mxn];
vo<vi> adj(mxn);
vi dist(mxn, -1);
signed main(){
cin.tie(0)->sync_with_stdio(0);
cin>>n>>m>>k;
queue<array<int, 3>> qu; //dist and node coming from
rep(i, 0, k) { int a; cin>>a; qu.push({0, a, a}); anime[a] = 1;}
rep(i, 0, m) {
int a, b; cin>>a>>b; adj[a].pb(b), adj[b].pb(a);
}
while(qu.size()){
auto [d, v, root] = qu.front(); qu.pop();
for(auto x: adj[v]){
if(x == root) continue;
if(anime[x]){
if(dist[root] == -1) dist[root] = d+1;
}
if(dist[x] == -1){
dist[x] = d+1;
qu.push({d+1, x, root});
}
else if(dist[root] == -1){
dist[root] = dist[x] + d + 1;
}
}
}
rep(i, 1, n+1) cout << dist[i] << " ";
}Test details
Test 1
Group: 1, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 2000 1 816 1 868 976 995 377 536 ... |
| correct output |
|---|
| 4 3 3 4 6 4 -1 4 5 2 2 5 5 3 5... |
| user output |
|---|
| 4 3 3 4 6 4 -1 4 5 2 2 5 5 3 5... Truncated |
Test 2
Group: 1, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 2000 20 578 955 222 813 494 962 753 71... |
| correct output |
|---|
| 5 6 4 3 4 2 -1 3 3 3 4 3 2 3 -... |
| user output |
|---|
| 5 6 4 3 4 2 -1 3 3 3 4 3 2 3 -... Truncated |
Test 3
Group: 1, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 2000 100 945 230 119 680 975 520 490 28... |
| correct output |
|---|
| 2 2 3 -1 2 -1 3 2 2 1 2 -1 3 2... |
| user output |
|---|
| 2 2 3 -1 2 -1 3 2 2 1 2 -1 3 2... Truncated |
Test 4
Group: 1, 3
Verdict: ACCEPTED
| input |
|---|
| 1000 2000 1000 150 443 960 545 218 487 896 38... |
| correct output |
|---|
| 1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 ... |
| user output |
|---|
| 1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 ... Truncated |
Test 5
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 1 77222 59470 61811 43092 48939 14395 19964 ... |
| correct output |
|---|
| 8 10 8 8 8 8 8 8 9 7 7 8 8 8 6... |
| user output |
|---|
| 8 10 8 8 8 8 8 8 9 7 7 8 8 8 6... Truncated |
Test 6
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 20 70440 82302 64483 96767 51485 ... |
| correct output |
|---|
| -1 8 6 5 5 7 6 7 6 6 8 5 6 4 5... |
| user output |
|---|
| -1 8 6 5 5 7 6 7 6 6 8 5 6 4 5... Truncated |
Test 7
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 100 68738 37820 55519 77758 46482 ... |
| correct output |
|---|
| 4 5 5 5 5 4 6 -1 5 4 5 6 4 5 5... |
| user output |
|---|
| 4 5 5 5 5 4 6 -1 5 4 5 6 4 5 5... Truncated |
Test 8
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 200000 100000 47137 80137 73347 78145 9205 6... |
| correct output |
|---|
| 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| user output |
|---|
| 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... Truncated |
Test 9
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 99999 1 44158 1 2 2 3 3 4 ... |
| correct output |
|---|
| 44157 44156 44155 44154 44153 ... |
| user output |
|---|
| 44157 44156 44155 44154 44153 ... Truncated |
Test 10
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 99999 20 44158 25720 84658 90057 99607 ... |
| correct output |
|---|
| 361 360 359 358 357 356 355 35... |
| user output |
|---|
| 361 360 359 358 357 356 355 35... Truncated |
Test 11
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 100000 99999 100000 44158 25720 84658 90057 99607 ... |
| correct output |
|---|
| 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| user output |
|---|
| 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... Truncated |
Test 12
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 99999 3 99998 99999 100000 1 2 1 3 1 4 ... |
| correct output |
|---|
| 33333 33332 33332 33332 33331 ... |
| user output |
|---|
| 33333 33332 33332 33332 33331 ... Truncated |
Test 13
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 99999 300 99701 99702 99703 99704 99705 ... |
| correct output |
|---|
| 333 333 333 333 333 333 333 33... |
| user output |
|---|
| 333 333 333 333 333 333 333 33... Truncated |
Test 14
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 99999 30000 70001 70002 70003 70004 70005 ... |
| correct output |
|---|
| 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ... |
| user output |
|---|
| 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ... Truncated |
Test 15
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 0 100000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 ... |
| user output |
|---|
| -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 ... Truncated |
Test 16
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 100000 2 1 50001 1 2 2 3 3 4 ... |
| correct output |
|---|
| 50000 1 2 3 4 5 6 7 8 9 10 11 ... |
| user output |
|---|
| 4 1 2 3 4 5 6 7 8 9 10 11 12 1... Truncated |
