QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#572002#9310. Permutation Counting 4MrLiWA 0ms3684kbC++17715b2024-09-18 10:59:432024-09-18 10:59:44

Judging History

你现在查看的是最新测评结果

  • [2024-09-18 14:56:40]
  • hack成功,自动添加数据
  • (/hack/835)
  • [2024-09-18 14:41:06]
  • hack成功,自动添加数据
  • (/hack/831)
  • [2024-09-18 10:59:44]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3684kb
  • [2024-09-18 10:59:43]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
//#define int long long
typedef pair<string,char> pii;
#define endl "\n"
const int N=2e5+5;
int a[N],p[N];
int find(int x)
{
    if(x!=p[x]) p[x]=find(p[x]);
    return p[x];
}
void solve()
{
   int n;
   cin>>n;
   for(int i=0;i<=n+20;i++) p[i]=i;
   int val=1;
   for(int i=1;i<=n+1;i++)
   {
       int l,r;
       cin>>l>>r;
       l--;
       int fa=find(l),fb=find(r);
       if(fa==fb) val=0;
       else p[fa]=fb;
       //cout<<l<<" "<<r<<endl;
   }
   cout<<val<<endl;
   
}
signed main()
{ 
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    while(t--) solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3684kb

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
1

result:

wrong answer 4th words differ - expected: '0', found: '1'