QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#565167#9310. Permutation Counting 4wxgmjfhyWA 128ms3808kbC++20932b2024-09-15 20:28:292024-09-15 20:28:33

Judging History

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

  • [2024-09-18 14:56:40]
  • hack成功,自动添加数据
  • (/hack/835)
  • [2024-09-18 14:41:06]
  • hack成功,自动添加数据
  • (/hack/831)
  • [2024-09-17 12:14:52]
  • hack成功,自动添加数据
  • (/hack/825)
  • [2024-09-15 20:28:33]
  • 评测
  • 测评结果:WA
  • 用时:128ms
  • 内存:3808kb
  • [2024-09-15 20:28:29]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
// #pragma GCC optimize(3)
#define int long long

// std::mt19937_64 rng {std::chrono::steady_clock::now().time_since_epoch().count()};

int n;

inline void solve(){
    cin>>n;

    vector<vector<int> >g(n+2);
    for(int i=1;i<=n;i++){
        int l,r;
        cin>>l>>r;
        g[l].push_back(r+1);
        g[r+1].push_back(l);
    }

    vector<int>f(n+2);
    auto dfs=[&](auto self,int u,int fa)->bool {
        f[u]=1;
        for(auto t:g[u]){
            if(t==fa)continue;
            if(f[t])return false;
            if(!self(self,t,u))return false;
        }
        return true;
    };

    cout<<dfs(dfs,1,-1)<<"\n";
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    // cout<<setiosflags(ios::fixed)<<setprecision(10);

    int _=1;
    cin>>_;
    while(_--){
        solve();
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 128ms
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
1
0
0
0
1
1
1
1
0
0
1
1
1
1
1
0
1
0
0
1
0
1
0
1
1
1
1
1
0
1
1
1
1
1
1
1
1
1
1
0
1
1
0
1
0
0
1
0
1
0
1
1
0
1
1
1
0
1
0
1
1
0
0
1
1
1
1
1
1
1
1
1
0
1
1
1
1
1
1
1
1
1
0
0
1
1
0
0
1
1
0
1
1
1
1
1
1
1
0
0
1
1
1
0
0
1
1
0
0
1
0
1
0
1
0
1
0
0
0
0
1
1
0
0
1
1
1
1
1
0
0
1
1
0
0
1
0
1
1
...

result:

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