QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#565402#9310. Permutation Counting 4zhouyidieWA 69ms3712kbC++17815b2024-09-15 21:11:432024-09-15 21:11:45

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 21:11:45]
  • 评测
  • 测评结果:WA
  • 用时:69ms
  • 内存:3712kb
  • [2024-09-15 21:11:43]
  • 提交

answer

#include<bits/stdc++.h>
using namespace  std ;
typedef long long LL ;
typedef pair<int,int> PII ;
#define endl '\n';
const int N = 1e6 + 100 ;
const int M=1e5+100;
const int mod = 1e9+7;

int n , m , k ;
int e[N];
void AC(){
    cin >> n ;
    for (int i = 1 ; i <= n ; i++ ) {
        e[i] = 0 ;
    }
    for ( int i = 1 ; i <= n ; i ++ ) {
        int u , v ; cin >> u >> v ;
        e[u] ++ ; e[v] ++ ;
    }
    bool fg = true ;
    for ( int i = 1 ; i <= n ; i++ ) {
        if ( e[i] & 1 ) {
            fg = false ;
            break;
        }
    }
    cout << fg << '\n';
    return;
}



int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int tt = 1 ;
    cin >> tt ;
    while( tt-- ) {
        AC();
    }
}

//  1  2  3 4 5 6 7 ....n

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 69ms
memory: 3668kb

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

result:

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