QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #571880 | #9310. Permutation Counting 4 | jr_zlw | WA | 34ms | 28696kb | C++17 | 1.1kb | 2024-09-18 09:41:28 | 2024-09-18 09:41:29 |
Judging History
answer
#include<bits/stdc++.h>
#define rep(a,b,c) for(int c(a);c<=(b);++c)
#define drep(a,b,c) for(int c(a);c>=(b);--c)
using namespace std;
inline int read()
{
int res=0;char ch=getchar();while(ch<'0'||ch>'9')ch=getchar();
while(ch<='9'&&ch>='0')res=res*10+(ch^48),ch=getchar();return res;
}
const int N=1e6+10;
vector<int> T[N];int n;bool Rt[N],flag,vis[N];int t;
inline void dfs(int u,int f=0)
{
if(vis[u]||(f&&Rt[u])){flag=true;return;}vis[u]=true;
for(int v:T[u])if(v!=f)dfs(v,u);
}
inline void Solve(int ti)
{
n=read();if(t==66725&&ti==12)printf("%d\n",n);
rep(1,n,i)
{
int u=read()-1,v=read();
if(ti==12&&t==66725)printf("%d %d\n",u+1,v);
if(!u)
{
if(Rt[v])flag=true;
Rt[v]=true;
}
else
{
T[u].push_back(v);
T[v].push_back(u);
}
}
for(int i=1;i<=n&&!flag;++i)if(Rt[i])dfs(i);
if(t!=66725)puts(flag?"0":"1");
memset(Rt+1,0,n*sizeof(bool));
memset(vis+1,0,n*sizeof(bool));
rep(1,n,i)T[i].clear();flag=false;
}
int main()
{
t=read();
rep(1,t,i)Solve(i);
}
/*
1
5
1 1
2 4
2 3
5 5
3 4
0
*/
详细
Test #1:
score: 100
Accepted
time: 3ms
memory: 27196kb
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: 34ms
memory: 28696kb
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:
11 9 10 2 6 6 9 7 8 8 8 1 5 3 10 7 7 2 10 4 5 3 8
result:
wrong answer 1st words differ - expected: '1', found: '11'