Task: | Anime Shops |
Sender: | Erik Hedin |
Submission time: | 2024-03-06 15:37:15 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 16 |
group | verdict | score |
---|---|---|
#1 | RUNTIME ERROR | 0 |
#2 | ACCEPTED | 16 |
#3 | RUNTIME ERROR | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | RUNTIME ERROR | 0.00 s | 1, 3 | details |
#2 | RUNTIME ERROR | 0.01 s | 1, 3 | details |
#3 | RUNTIME ERROR | 0.01 s | 1, 3 | details |
#4 | ACCEPTED | 0.01 s | 1, 3 | details |
#5 | RUNTIME ERROR | 0.13 s | 3 | details |
#6 | RUNTIME ERROR | 0.16 s | 3 | details |
#7 | RUNTIME ERROR | 0.16 s | 3 | details |
#8 | ACCEPTED | 0.20 s | 3 | details |
#9 | ACCEPTED | 0.05 s | 2, 3 | details |
#10 | ACCEPTED | 0.07 s | 2, 3 | details |
#11 | ACCEPTED | 0.08 s | 2, 3 | details |
#12 | ACCEPTED | 0.06 s | 3 | details |
#13 | ACCEPTED | 0.06 s | 3 | details |
#14 | ACCEPTED | 0.07 s | 3 | details |
#15 | ACCEPTED | 0.03 s | 3 | details |
#16 | ACCEPTED | 0.07 s | 3 | details |
Code
#include <iostream> #include <vector> #include <algorithm> #include <map> #include <set> #include <numeric> #include <functional> #include <queue> using namespace std; typedef long long int ll; typedef vector<ll> vll; typedef pair<ll, ll> pll; typedef vector<pll> vpll; typedef vector<vll> vvll; typedef vector<vpll> vvpll; typedef vector<bool> vb; typedef pair<ll, pll> pll_pll; #define rep(i, a, b) for (ll i = a; i < b; i++) #define sz(a) (ll) a.size() #define mp(a, b) make_pair(a, b) #define pb(a) push_back(a) #define trav(itr, a, t) for (t::iterator itr = a.begin(); itr != a.end(); itr++) pll inline operator+(const pll& lhs, const pll& rhs) {return mp(lhs.first + rhs.first, lhs.second + rhs.second);} ll n, m, k; vb anime; vvll g; int main() { cin.tie(NULL)->sync_with_stdio(false); cin >> n >> m >> k; anime.resize(n); g.resize(n); rep(i, 0, k) { static ll tmp; cin >> tmp; tmp--; anime[tmp] = true; } rep(e, 0, m) { static ll tmpu, tmpv; cin >> tmpu >> tmpv; tmpu--; tmpv--; g[tmpu].pb(tmpv); g[tmpv].pb(tmpu); } vvpll shop(n); deque<pll_pll> BFS; // (cur, (dst, src)) rep(i, 0, n) if (anime[i]) BFS.pb(mp(i, mp(0, i))); while (!BFS.empty()) { pll_pll cur = BFS.front(); BFS.pop_front(); // check bool cont = false; if (sz(shop[cur.first]) == 0) { shop[cur.first].pb(cur.second); cont = true; } else if (sz(shop[cur.first]) == 1) { if (shop[cur.first][0].second != cur.second.second) { shop[cur.first].pb(cur.second); cont = true; } } if (cont) { // propagate trav(e, g[cur.first], vll) { BFS.pb(mp(*e, mp(cur.second.first + 1, cur.second.second))); } } } rep(i, 0, n) { if (anime[i]) { if (sz(shop[i]) == 1) cout << "-1 "; else cout << shop[i][1].first << " "; } else { cout << shop[i][0].first << " "; } } cout << endl; return 0; }
Test details
Test 1
Group: 1, 3
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
Test 2
Group: 1, 3
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
Test 3
Group: 1, 3
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
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: RUNTIME ERROR
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 |
---|
(empty) |
Test 6
Group: 3
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
Test 7
Group: 3
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
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: ACCEPTED
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: ACCEPTED
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: ACCEPTED
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: ACCEPTED
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: ACCEPTED
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: ACCEPTED
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 |
---|
50000 1 2 3 4 5 6 7 8 9 10 11 ... Truncated |