Task: | Anime Shops |
Sender: | Akseli Järvinen |
Submission time: | 2024-03-06 17:04:43 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 23 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 23 |
#2 | RUNTIME ERROR | 0 |
#3 | RUNTIME ERROR | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.04 s | 1, 3 | details |
#2 | ACCEPTED | 0.01 s | 1, 3 | details |
#3 | ACCEPTED | 0.01 s | 1, 3 | details |
#4 | ACCEPTED | 0.01 s | 1, 3 | details |
#5 | RUNTIME ERROR | 0.00 s | 3 | details |
#6 | RUNTIME ERROR | 0.00 s | 3 | details |
#7 | RUNTIME ERROR | 0.00 s | 3 | details |
#8 | RUNTIME ERROR | 0.04 s | 3 | details |
#9 | RUNTIME ERROR | 0.01 s | 2, 3 | details |
#10 | RUNTIME ERROR | 0.01 s | 2, 3 | details |
#11 | RUNTIME ERROR | 0.04 s | 2, 3 | details |
#12 | RUNTIME ERROR | 0.01 s | 3 | details |
#13 | RUNTIME ERROR | 0.01 s | 3 | details |
#14 | RUNTIME ERROR | 0.01 s | 3 | details |
#15 | RUNTIME ERROR | 0.04 s | 3 | details |
#16 | RUNTIME ERROR | 0.01 s | 3 | details |
Compiler report
input/code.cpp: In function 'int main()': input/code.cpp:74:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' 74 | auto [s,d] = q.front(); | ^ input/code.cpp:31:10: warning: variable 'ok' set but not used [-Wunused-but-set-variable] 31 | bool ok = 1; | ^~
Code
#include <bits/stdc++.h> #define int long long using namespace std; const int mxN = 2222; vector<int> adj[mxN]; bool shop[mxN]; signed main() { int n, m, k; cin >> n >> m >> k; for (int i = 0; i < k; ++i) { int ki; cin >> ki; shop[ki] = 1; } vector<int> deg(n+1,0); for (int i = 0; i < m; ++i) { int a, b; cin >> a >> b; adj[a].push_back(b); adj[b].push_back(a); ++deg[a]; ++deg[b]; } bool ok = 1; int c = 0; for (int i = 1; i <= n; ++i) { if (deg[i] == 2) ++c; else if (deg[i] > 2) { ok = 0; break; } } if (c == 2 && m == n-1) { set<int> ne, pre; for (int i = 1; i <= n; ++i) { if (shop[i]) { ne.insert(i); pre.insert(-i); } } for (int i = 1; i <= n; ++i) { auto it1 = ne.upper_bound(i); auto it2 = pre.upper_bound(-i); int ans = -1; if (it1 == ne.end()) { ans = abs(*it1-i); } else if (it2 == pre.end()) { ans = abs((-*it2)-i); } else { ans = min(abs(*it1-i),abs((-*it2)-i)); } cout << ans << ' '; } cout << '\n'; return 0; } for (int i = 1; i <= n; ++i) { queue<pair<int,int>> q; vector<int> vis(n+1,0); q.push({i,0}); int ans = -1; while (q.size()) { auto [s,d] = q.front(); if (d != 0 && shop[s]) { ans = d; break; } q.pop(); vis[s] = 1; for (int u : adj[s]) { if (!vis[u]) { q.push({u,d+1}); } } } cout << ans << ' '; } }
Test details
Test 1
Group: 1, 3
Verdict: ACCEPTED
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: ACCEPTED
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: ACCEPTED
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: 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: RUNTIME ERROR
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 |
---|
(empty) |
Test 9
Group: 2, 3
Verdict: RUNTIME ERROR
input |
---|
100000 99999 1 44158 1 2 2 3 3 4 ... |
correct output |
---|
44157 44156 44155 44154 44153 ... |
user output |
---|
(empty) |
Test 10
Group: 2, 3
Verdict: RUNTIME ERROR
input |
---|
100000 99999 20 44158 25720 84658 90057 99607 ... |
correct output |
---|
361 360 359 358 357 356 355 35... |
user output |
---|
(empty) |
Error:
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc
Test 11
Group: 2, 3
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
Error:
malloc(): unaligned tcache chunk detected
Test 12
Group: 3
Verdict: RUNTIME ERROR
input |
---|
100000 99999 3 99998 99999 100000 1 2 1 3 1 4 ... |
correct output |
---|
33333 33332 33332 33332 33331 ... |
user output |
---|
(empty) |
Test 13
Group: 3
Verdict: RUNTIME ERROR
input |
---|
100000 99999 300 99701 99702 99703 99704 99705 ... |
correct output |
---|
333 333 333 333 333 333 333 33... |
user output |
---|
(empty) |
Test 14
Group: 3
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
Test 15
Group: 3
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
Error:
malloc(): unaligned tcache chunk detected
Test 16
Group: 3
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
Error:
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc