Task: | Anime Shops |
Sender: | Þórhallur Tryggvason |
Submission time: | 2024-03-06 19:10:54 +0200 |
Language: | C++ (C++20) |
Status: | READY |
Result: | 23 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 23 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.10 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 | TIME LIMIT EXCEEDED | -- | 3 | details |
#6 | TIME LIMIT EXCEEDED | -- | 3 | details |
#7 | TIME LIMIT EXCEEDED | -- | 3 | details |
#8 | ACCEPTED | 0.29 s | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#10 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#11 | ACCEPTED | 0.17 s | 2, 3 | details |
#12 | TIME LIMIT EXCEEDED | -- | 3 | details |
#13 | TIME LIMIT EXCEEDED | -- | 3 | details |
#14 | TIME LIMIT EXCEEDED | -- | 3 | details |
#15 | ACCEPTED | 0.08 s | 3 | details |
#16 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <bits/stdc++.h> using namespace std; int main() { int n,m,k; cin >> n >> m >> k; vector<int> shops(k); for (int i = 0; i < k; i++) { int a; cin >> a; a--; shops[i] = a; } sort(shops.begin(), shops.end()); vector<vector<int>> adj(n); for (int i = 0; i < m; i++) { int a,b; cin >> a >> b; a--, b--; adj[a].push_back(b); adj[b].push_back(a); } vector<int> distances(n, -1); for (int i = 0; i < n; i++) { vector<bool> visited(n, false); priority_queue<pair<int, int>, deque<pair<int, int>>, greater<pair<int, int>>> pq; pq.push(make_pair(0, i)); while (!pq.empty()) { auto curr = pq.top(); pq.pop(); if (visited[curr.second]) continue; if (curr.second != i) { // find if in shops if (*lower_bound(shops.begin(), shops.end(), curr.second) == curr.second) { distances[i] = curr.first; break; } } visited[curr.second] = true; for (auto x : adj[curr.second]) { if (!visited[x]) { pq.push(make_pair(curr.first + 1, x)); } } } } for (auto dist : distances) { cout << dist << " "; } cout << endl; }
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: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
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: 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: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
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: 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: TIME LIMIT EXCEEDED
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) |