QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#574542#9310. Permutation Counting 4495684945WA 137ms3628kbC++20907b2024-09-18 22:39:352024-09-18 22:39:35

Judging History

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

  • [2024-09-18 22:39:35]
  • 评测
  • 测评结果:WA
  • 用时:137ms
  • 内存:3628kb
  • [2024-09-18 22:39:35]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define inf 0x3f3f3f3f3f3f3f3f
typedef pair<int,int> PII;
void solve(){
	int n;
	cin>>n;
	priority_queue<PII,vector<PII>,greater<PII>>q;
	for(int i=1,x,y;i<=n;i++){
		cin>>x>>y;
		q.push({x,y});
	}
	vector<PII>ans;
	for(int i=1;i<=n;i++){
		int x,y=-1;
		if(q.size()==0){
			cout<<0<<endl;
			return ;
		}
		while(q.size()&&(y<i)){
			x=q.top().first;
			y=q.top().second;
			q.pop();
			if(x>i){
				cout<<0<<endl;
				return ;
			}
		}
		ans.push_back({i,y});
	}
//	for(auto [x,y]:ans){
//		cout<<x<<" "<<y<<endl;
//	}
	for(int i=1;i<ans.size();i++){
		auto [x,y]=ans[i-1];
		auto [x2,y2]=ans[i];
		if(x2>y+1||x2<y){
			cout<<0<<endl;
			return ;
		}
	}
	cout<<1<<endl;
}
signed main(){
	int t=1;ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>t;
	while(t--)solve();
	return 0;
}

详细

Test #1:

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

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: 137ms
memory: 3572kb

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'