Task: | Anime Shops |
Sender: | Teo Lovmar |
Submission time: | 2024-03-06 16:24:38 +0200 |
Language: | C++ (C++11) |
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.00 s | 1, 3 | details |
#2 | WRONG ANSWER | 0.00 s | 1, 3 | details |
#3 | WRONG ANSWER | 0.00 s | 1, 3 | details |
#4 | WRONG ANSWER | 0.01 s | 1, 3 | details |
#5 | WRONG ANSWER | 0.11 s | 3 | details |
#6 | RUNTIME ERROR | 0.01 s | 3 | details |
#7 | RUNTIME ERROR | 0.01 s | 3 | details |
#8 | RUNTIME ERROR | 0.01 s | 3 | details |
#9 | WRONG ANSWER | 0.05 s | 2, 3 | details |
#10 | RUNTIME ERROR | 0.01 s | 2, 3 | details |
#11 | RUNTIME ERROR | 0.01 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.01 s | 3 | details |
#16 | WRONG ANSWER | 0.05 s | 3 | details |
Code
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define fi first #define se second ll n, m, k; bool marked[10000] = {}; set<ll> marks; ll dist[10000] = {}; vector<vector<ll>> adj; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m >> k; for (ll i = 0; i < k; i++) { ll mark; cin >> mark; marked[mark - 1] = 1; marks.insert(mark - 1); } adj.resize(n); for (ll i = 0; i < m; i++) { ll a, b; cin >> a >> b; a--; b--; adj[a].push_back(b); adj[b].push_back(a); } for (ll i = 0; i < n; i++) { if (marked[i]) marks.erase(i); auto ub = marks.upper_bound(i); ll min_dist = abs((*ub) - i); if (ub != marks.begin()) { auto lb = prev(ub); min_dist = min(abs(i - (*lb)), min_dist); } cout << min_dist << "\n"; if (marked[i]) marks.insert(i); } /* for (ll i = 0; i < n; i++) { dist[i] = -1; } for (ll start = 0; start < n; start++) { deque<ll> tovis; set<ll> vis; tovis.push_back(0); while (0 < tovis.size()) { ll node = *tovis.begin(); tovis.pop_front(); if (vis.find(node) != vis.end()) continue; for (auto nbr : adj[node]) { if (vis.find(nbr) != vis.end()) continue; tovis.push_back(nbr); } vis.insert(node); } } */ return 0; }
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 |
---|
815 814 813 812 811 ... 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 |
---|
204 203 202 201 200 ... 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 |
---|
8 7 6 5 4 ... Truncated |
Test 4
Group: 1, 3
Verdict: WRONG ANSWER
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 ... 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 |
---|
77221 77220 77219 77218 77217 ... Truncated |
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: 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: RUNTIME ERROR
input |
---|
100000 99999 20 44158 25720 84658 90057 99607 ... |
correct output |
---|
361 360 359 358 357 356 355 35... |
user output |
---|
(empty) |
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) |
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) |
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 |
---|
50000 1 2 3 4 ... Truncated |