QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#689228 | #9310. Permutation Counting 4 | LETTER | WA | 138ms | 3796kb | C++20 | 910b | 2024-10-30 15:56:33 | 2024-10-30 15:56:34 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
//#define int ll
void solve()
{
int n;
cin>>n;
vector<vector<int>>g(n+1);
for(int i=1;i<=n;i++)
{
int l,r;
cin>>l>>r;
l--;
g[l].push_back(r);
g[r].push_back(l);
}
vector<int>vis(n+1);
int f=1;
auto dfs=[&](auto self,int u,int fa)->void
{
if(vis[u]==0)
{
vis[u]=1;
for(auto v:g[u])
{
if(v!=fa)
{
self(self,v,u);
}
}
}
else
{
f=0;
}
};
dfs(dfs,0,-1);
cout<<f<<"\n";
}
signed main()
{
ios::sync_with_stdio(false), cin.tie(nullptr);
int t = 1;
cin >> t;
while (t--)
{
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
input:
4 5 1 2 1 5 1 2 1 2 2 2 5 1 1 2 4 2 3 5 5 3 4 5 3 5 1 2 3 4 3 5 3 3 5 1 5 1 4 4 5 5 5 1 2
output:
0 1 0 0
result:
ok 4 tokens
Test #2:
score: -100
Wrong Answer
time: 138ms
memory: 3796kb
input:
66725 14 7 7 4 6 7 8 8 13 2 13 6 13 6 10 14 14 1 10 9 11 7 9 3 8 4 12 5 12 12 2 6 3 6 7 11 2 5 1 1 6 12 8 12 2 3 7 9 7 8 1 10 1 4 10 4 8 4 4 6 10 9 10 2 3 2 7 1 3 3 4 2 2 3 10 20 3 12 10 14 19 20 19 20 1 9 7 9 13 16 17 17 16 18 2 11 5 19 6 17 11 17 3 6 3 11 7 20 8 17 3 18 10 15 9 20 16 5 10 2 10 2 1...
output:
1 1 0 0 1 0 1 1 0 1 1 1 0 0 0 1 1 1 1 0 0 1 1 1 1 1 0 1 0 0 1 0 1 0 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 0 1 1 0 1 0 0 1 0 1 0 1 1 0 1 1 1 0 1 0 1 1 0 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 0 1 1 0 0 1 1 0 1 1 1 1 1 1 1 0 0 1 1 1 0 0 1 1 0 0 1 0 1 0 1 0 1 0 0 0 0 1 1 0 0 1 1 1 1 1 0 0 1 1 0 0 1 0 1 1 ...
result:
wrong answer 12th words differ - expected: '0', found: '1'