QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #609220 | #9310. Permutation Counting 4 | DarksideCoder | WA | 119ms | 5748kb | C++14 | 757b | 2024-10-04 11:17:39 | 2024-10-04 11:17:44 |
Judging History
answer
#include<bits/stdc++.h>
using std::vector;
#define fn std::function
int n;
void Solve(){
scanf("%d",&n);
vector<int>Dad;Dad.reserve(2000000);
fn<void()> Init=[&]() {
for(int i=1;i<=n;i++)
Dad[i]=i;
};
fn<int(int)> Gd=[&](int a){
return (Dad[a]==a)?a:Dad[a]=Gd(Dad[a]);
};
fn<void(int,int)> Us=[&](int a,int b){
a=Gd(a);b=Gd(b);
if(a!=b)Dad[a]=b;
};
Init();
bool flag=false;
for(int i=1;i<=n;i++){
int a,b;
scanf("%d%d",&a,&b);
a=Gd(a-1);b=Gd(b);
if(a==b)flag=true;
Us(a,b);
}
if(flag)puts("0");
else puts("1");
}
int main(){
#ifdef LOCAL
freopen("In.txt","r",stdin);
freopen("Out.txt","w",stdout);
#endif
int Task;scanf("%d",&Task);
while(Task--){Solve();}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 5748kb
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: 119ms
memory: 3640kb
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 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
result:
wrong answer 5th words differ - expected: '1', found: '0'