| Task: | Peli |
| Sender: | vgtcross |
| Submission time: | 2024-01-20 13:36:10 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 42 |
| #2 | ACCEPTED | 58 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.04 s | 1, 2 | details |
| #2 | ACCEPTED | 0.04 s | 1, 2 | details |
| #3 | ACCEPTED | 0.24 s | 2 | details |
| #4 | ACCEPTED | 0.04 s | 1, 2 | details |
| #5 | ACCEPTED | 0.04 s | 1, 2 | details |
| #6 | ACCEPTED | 0.22 s | 2 | details |
| #7 | ACCEPTED | 0.35 s | 2 | details |
| #8 | ACCEPTED | 0.04 s | 1, 2 | details |
| #9 | ACCEPTED | 0.66 s | 2 | details |
| #10 | ACCEPTED | 0.66 s | 2 | details |
Code
#include <bits/stdc++.h>
#define all(x) begin(x),end(x)
#define fi first
#define se second
using namespace std;
using ll = long long;
using pic = pair<int, char>;
using pii = pair<int, int>;
const int N = 2525;
int ans[N][N][2];
bool vis[N][2];
vector<int> adj[N];
void solve() {
int n, m, q;
cin >> n >> m >> q;
memset(ans, 0x3f, sizeof ans);
for (int i = 0; i < m; ++i) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
for (int i = 1; i <= n; ++i) {
queue<pii> bfs;
memset(vis, 0, sizeof vis);
ans[i][i][0] = 0;
vis[i][0] = 1;
bfs.push({i, 0});
while (bfs.size()) {
auto p = bfs.front();
bfs.pop();
for (int v : adj[p.fi]) if (!vis[v][(p.se & 1) ^ 1]) {
vis[v][(p.se & 1) ^ 1] = 1;
ans[i][v][(p.se & 1) ^ 1] = p.se+1;
bfs.push({v, p.se+1});
}
}
}
while (q--) {
int a, b, x;
cin >> a >> b >> x;
cout << (ans[a][b][x & 1] <= x ? "YES" : "NO") << '\n';
}
}
int main() {
cin.tie(0) -> sync_with_stdio(0);
solve();
return 0;
}Test details
Test 1
Group: 1, 2
Verdict: ACCEPTED
| 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: ACCEPTED
| input |
|---|
| 50 49 100 33 34 7 8 49 50 47 48 ... |
| correct output |
|---|
| NO NO NO NO NO ... |
| user output |
|---|
| NO NO NO NO NO ... Truncated |
Test 3
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 2500 2499 100000 821 822 2351 2352 752 753 832 833 ... |
| correct output |
|---|
| NO YES YES NO NO ... |
| user output |
|---|
| NO YES YES NO NO ... Truncated |
Test 4
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 12 12 100 9 10 2 3 1 12 1 2 ... |
| correct output |
|---|
| NO NO NO NO NO ... |
| user output |
|---|
| NO NO NO NO NO ... Truncated |
Test 5
Group: 1, 2
Verdict: ACCEPTED
| 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: ACCEPTED
| input |
|---|
| 2500 2500 100000 1936 1937 1884 1885 751 752 831 832 ... |
| correct output |
|---|
| NO YES YES NO NO ... |
| user output |
|---|
| NO YES YES NO NO ... Truncated |
Test 7
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 2499 2499 100000 821 822 2351 2352 752 753 832 833 ... |
| correct output |
|---|
| YES YES YES YES YES ... |
| user output |
|---|
| YES YES YES YES YES ... Truncated |
Test 8
Group: 1, 2
Verdict: ACCEPTED
| 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: ACCEPTED
| input |
|---|
| 2500 4999 100000 1191 2361 251 399 1026 2300 82 1655 ... |
| correct output |
|---|
| YES YES YES YES YES ... |
| user output |
|---|
| YES YES YES YES YES ... Truncated |
Test 10
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 2500 4999 100000 2023 2218 23 51 1020 1272 11 114 ... |
| correct output |
|---|
| YES YES YES YES YES ... |
| user output |
|---|
| YES YES YES YES YES ... Truncated |
