Task: | Peli |
Sender: | qanpi |
Submission time: | 2024-01-20 15:47:37 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.24 s | 1, 2 | details |
#2 | TIME LIMIT EXCEEDED | -- | 1, 2 | details |
#3 | RUNTIME ERROR | 0.39 s | 2 | details |
#4 | TIME LIMIT EXCEEDED | -- | 1, 2 | details |
#5 | WRONG ANSWER | 0.23 s | 1, 2 | details |
#6 | RUNTIME ERROR | 0.39 s | 2 | details |
#7 | RUNTIME ERROR | 0.39 s | 2 | details |
#8 | WRONG ANSWER | 0.24 s | 1, 2 | details |
#9 | TIME LIMIT EXCEEDED | -- | 2 | details |
#10 | RUNTIME ERROR | 0.40 s | 2 | details |
Code
#include<iostream> #include<string> #include<algorithm> #include<vector> #include<set> using namespace std; vector<int> adj[2510]; set<int> dp[2510][2510]; bool search(int a, int b, int x) { if (x < 0 || (a != b && x == 0)) return false; for (int d : dp[a][b]){ if (x % (d * 2) == d) { return true; } } if (a == b && x % 2 == 0) { return true; } else if (a== b && x == 1) { return false; } bool flag = false; for (int u : adj[a]) { flag = search(u, b, x-1); if (flag) { break; }; } if (flag) { dp[a][b].insert(x); dp[b][a].insert(x); } return flag; } int main() { int n, m, q; cin >> n >> m >> q; for (int i=0; i<m; i++) { int a, b; cin >> a >> b; adj[a].push_back(b); adj[b].push_back(a); } for (int i=0; i<q; i++) { int a, b, x; cin >> a >> b >> x; bool ans = search(a, b, x); if (ans) { cout << "YES" << endl; } else { cout << "NO" << endl; } } for (int i=1; i<=4; i++) { cout << i << ": "; for (int j=1; j<=4; j++) { if (i == j) continue; for (auto d : dp[i][j]) { cout << d << " "; } } cout << endl; } }
Test details
Test 1
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
2 1 100 1 2 1 1 0 1 2 0 2 1 0 ... |
correct output |
---|
YES NO NO YES NO ... |
user output |
---|
YES NO NO YES NO ... Truncated |
Test 2
Group: 1, 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
50 49 100 33 34 7 8 49 50 47 48 ... |
correct output |
---|
NO NO NO NO NO ... |
user output |
---|
(empty) |
Test 3
Group: 2
Verdict: RUNTIME ERROR
input |
---|
2500 2499 100000 821 822 2351 2352 752 753 832 833 ... |
correct output |
---|
NO YES YES NO NO ... |
user output |
---|
(empty) |
Test 4
Group: 1, 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
12 12 100 9 10 2 3 1 12 1 2 ... |
correct output |
---|
NO NO NO NO NO ... |
user output |
---|
(empty) |
Test 5
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
11 11 100 10 11 7 8 1 2 5 6 ... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
YES YES YES YES YES ... Truncated |
Test 6
Group: 2
Verdict: RUNTIME ERROR
input |
---|
2500 2500 100000 1936 1937 1884 1885 751 752 831 832 ... |
correct output |
---|
NO YES YES NO NO ... |
user output |
---|
(empty) |
Test 7
Group: 2
Verdict: RUNTIME ERROR
input |
---|
2499 2499 100000 821 822 2351 2352 752 753 832 833 ... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
(empty) |
Test 8
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
50 99 100 40 47 34 50 44 47 15 16 ... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
YES YES YES YES YES ... Truncated |
Test 9
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
2500 4999 100000 1191 2361 251 399 1026 2300 82 1655 ... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
(empty) |
Test 10
Group: 2
Verdict: RUNTIME ERROR
input |
---|
2500 4999 100000 2023 2218 23 51 1020 1272 11 114 ... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
(empty) |