QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#576554#9310. Permutation Counting 4xiaomoWA 0ms3632kbC++20450b2024-09-19 20:59:592024-09-19 20:59:59

Judging History

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

  • [2024-09-19 20:59:59]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3632kb
  • [2024-09-19 20:59:59]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
void sovle(){
	int n;cin>>n;
	vector<pair<int,int>> a(n+1);
	for(int i=0;i<n;i++){
		cin>>a[i].first>>a[i].second;
	}
	int cnt=0;
	for(int i=0;i<n;i++){
		if(i+1>=a[i].first&&i+1<=a[i].second)cnt++;
	}
	cout<<cnt%2<<endl;
	return;
}

int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int _;cin>>_;
	while(_--)sovle();
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3632kb

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

result:

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