QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #567486 | #9310. Permutation Counting 4 | xunxxxx | WA | 49ms | 7836kb | C++17 | 522b | 2024-09-16 12:14:13 | 2024-09-16 12:14:14 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int n,l[1000010],r[1000010],fa[1000010],fl,fr;
int find(int x)
{
if(x==fa[x]) return x;
return fa[x]=find(fa[x]);
}
void solve()
{
cin>>n;
for(int i=0;i<=n;i++) cin>>l[i]>>r[i],fa[i]=i;
for(int i=1;i<=n;i++)
{
fl=find(l[i]-1);
fr=find(r[i]);
if(fl==fr)
{
cout<<"0\n";
return ;
}
fa[fl]=fr;
}
cout<<"1\n";
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int T=1;
cin>>T;
while(T--) solve();
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 7760kb
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: 49ms
memory: 7836kb
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:
0 1 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 1 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 1 0 1 0 0 0 0 1 0 1 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 1 0 0 0 0 1 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 1 1 1 1 1 0 0 0 1 0 0 0 ...
result:
wrong answer 1st words differ - expected: '1', found: '0'