QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#578438#9310. Permutation Counting 4UltimatesWA 140ms3612kbC++171.1kb2024-09-20 19:12:202024-09-20 19:12:22

Judging History

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

  • [2024-09-20 19:12:22]
  • 评测
  • 测评结果:WA
  • 用时:140ms
  • 内存:3612kb
  • [2024-09-20 19:12:20]
  • 提交

answer

#include <bits/stdc++.h>

#define endl '\n'
#define ll long long
using namespace std;

void solve(){
    ll n;
    cin>>n;
    vector<vector<ll>> e(n+1);
    for(ll i=0;i<n;i++){
        ll l,r;
        cin>>l>>r;
        e[l-1].emplace_back(r);
    }
    vector<bool> vis(n+1,false);
    for(ll i=0;i<=n;i++){
        if(!vis[i]){
            queue<ll> q;
            q.emplace(i);
            vis[i]=true;
            while(!q.empty()){
                ll u=q.front();
                q.pop();
                for(auto v:e[u]){
                    if(!vis[v]){
                        vis[v]=true;
                        q.emplace(v);
                    }
                    else{
                        cout<<0<<endl;
                        return;
                    }
                }
            }
        }
        vis.assign(n+1,false);
    }
    cout<<1<<endl;
}
int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    ll t;
    cin>>t;
    while(t--)
        solve();
    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3612kb

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: 140ms
memory: 3536kb

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
0
0
0
0
0
1
0
1
0
0
1
0
0
1
1
0
1
0
0
0
1
1
0
1
1
1
1
1
0
1
0
1
1
1
1
1
1
1
1
0
1
1
1
0
1
0
1
0
1
0
1
1
0
1
1
1
0
1
1
1
0
0
0
1
1
1
0
1
1
1
1
1
0
1
1
1
1
1
1
1
0
1
0
0
1
1
0
0
1
1
0
0
1
1
1
1
1
1
0
0
1
1
1
0
1
1
1
0
0
1
0
1
0
1
0
1
1
0
0
1
0
1
0
0
1
1
1
1
1
0
0
0
1
0
0
1
0
1
1
...

result:

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