| Task: | Peli |
| Sender: | Kemm1706 |
| Submission time: | 2025-01-15 08:53:21 +0200 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 42 |
| #2 | ACCEPTED | 58 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 2 | details |
| #2 | ACCEPTED | 0.00 s | 1, 2 | details |
| #3 | ACCEPTED | 0.32 s | 2 | details |
| #4 | ACCEPTED | 0.00 s | 1, 2 | details |
| #5 | ACCEPTED | 0.00 s | 1, 2 | details |
| #6 | ACCEPTED | 0.30 s | 2 | details |
| #7 | ACCEPTED | 0.41 s | 2 | details |
| #8 | ACCEPTED | 0.00 s | 1, 2 | details |
| #9 | ACCEPTED | 0.73 s | 2 | details |
| #10 | ACCEPTED | 0.73 s | 2 | details |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:43:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
43 | auto [u, v] = q.front(); q.pop();
| ^Code
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector <ll> vl;
typedef vector <vl> vvl;
typedef pair <ll, ll> pl;
const ll inf = 1e18;
#define fi first
#define se second
#define pb push_back
void out(const vl &a)
{
for(auto x : a)
cerr << x << " ";
cerr << "\n";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
ll n, m, i, j, qu;
cin >> n >> m >> qu;
vvl g(n + 1);
vector <vvl> ans(2, vvl(n + 1, vl(n + 1, inf)));
queue <pl> q;
while(m--)
{
cin >> i >> j;
g[i].pb(j);
g[j].pb(i);
}
for(i = 1; i <= n; i++)
{
ans[0][i][i] = 0;
q.push({0, i});
while(!q.empty())
{
auto [u, v] = q.front(); q.pop();
u = u + 1;
for(auto x : g[v])
{
if(ans[u % 2][i][x] > u)
{
ans[u % 2][i][x] = u;
q.push({u, x});
}
}
}
}
/*for(auto x : ans[0])
out(x);
cerr << "\n";
for(auto x : ans[1])
out(x);
cerr << "\n";*/
while(qu--)
{
cin >> i >> j >> m;
if(ans[m % 2][i][j] <= m)
//if((m - ans[m % 2][i][j]) % 2)
// cout << "NO\n";
//else
cout << "YES\n";
else
cout << "NO\n";
}
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 |
