QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#875688	#9975. Hitoshizuku	wjwweiwei	WA	42ms	9960kb	C++14	1.3kb	2025-01-30 08:49:48	2025-01-30 08:49:49

Judging History

This is the latest submission verdict.

[2025-01-30 08:49:49]
Judged

Verdict: WA
Time: 42ms
Memory: 9960kb

Show

[2025-01-30 08:49:48]
Submitted

answer

#include<bits/stdc++.h>
using namespace std;
const int N=3e5+5;
using ll=long long;
int T;
int n;
struct node{
	int a,b,id; 
}p[N],q[N];
struct ANS{
	int x,y,z;
}ans[N];
priority_queue<int>pq;
int to[N],tmp[N];
bool vis[N];
int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>T;
	while(T--){
		cin>>n;
		int m=3*n;
		for(int i=1;i<=m;i++){
			vis[i]=0;
			cin>>p[i].a>>p[i].b;p[i].id=i;
			q[i]=p[i];
		}
		sort(p+1,p+1+m,[&](const node A,const node B){
			return A.b==B.b?A.a<B.a:A.b<B.b; 
		});
		for(int i=1;i<=m;i++)to[p[i].id]=i;
		sort(q+1,q+1+m,[&](const node A,const node B){
			return A.a<B.a;
		});
		while(!pq.empty())pq.pop();
		int pos=1,tot=0;
		bool fl=1;
		for(int i=1;i<=m;i++){
			if(vis[p[i].id])continue;
			while(pos<=m&&q[pos].a<=p[i].b)pq.push(to[q[pos].id]),pos++;
			int cnt=1;tmp[1]=p[i].id;
			vis[p[i].id]=1;
			while(!pq.empty()){
				int u=pq.top();pq.pop();
				if(vis[p[u].id])continue;
				tmp[++cnt]=p[u].id;
				if(cnt==3)break;
			}
			if(cnt^3){
				fl=0;break;
			}
			++tot;
			ans[tot]={tmp[1],tmp[2],tmp[3]};
			for(int i=1;i<=3;i++)vis[tmp[i]]=1;
		}
		if(!fl){
			cout<<"No\n";continue;
		}
		cout<<"Yes\n";
		for(int i=1;i<=n;i++){
			cout<<ans[i].x<<" "<<ans[i].y<<" "<<ans[i].z<<"\n";
		}
	}
	return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 2ms

memory: 9960kb

input:

2
2
1 2
2 2
2 3
3 5
4 4
4 5
1
1 1
1 1000000000
1000000000 1000000000

output:

Yes
1 3 2
5 6 4
No

result:

ok >_< (2 test cases)

Test #2:

score: 0

Accepted

time: 42ms

memory: 9960kb

input:

100000
1
164154503 167959139
178382610 336470888
12298535 642802746
1
165064830 773386884
353585658 396628655
792066242 971207868
1
1607946 2087506
21674839 46761498
9518201 16843338
1
262361007 691952768
190585553 787375312
637191526 693319712
1
41970708 45277106
197619816 762263554
308360206 40724...

output:

No
No
No
Yes
1 2 3
No
Yes
2 3 1
No
No
No
No
No
Yes
2 3 1
Yes
1 3 2
No
No
No
No
Yes
2 1 3
No
Yes
2 1 3
No
No
Yes
2 1 3
No
No
Yes
3 2 1
No
No
No
No
No
No
No
Yes
3 1 2
No
No
Yes
3 1 2
No
No
No
No
No
No
No
No
No
No
No
No
Yes
3 1 2
No
No
Yes
2 1 3
Yes
3 1 2
No
No
Yes
2 3 1
No
No
No
Yes
1 3 2
Yes
3 1 2
No...

result:

ok >_< (100000 test cases)

Test #3:

score: -100

Wrong Answer

time: 40ms

memory: 9960kb

input:

50000
2
36364670 641009859
15071436 75475634
20446080 476927808
357784519 503158867
206641725 322595515
268011721 645468307
2
247717926 939887597
808609669 973764525
496738491 710156469
463547010 860350786
757388873 784695957
29903136 208427221
2
26681139 67590963
458238185 475357775
80127817 135993...

output:

No
No
No
No
No
No
No
No
No
No
No
No
Yes
5 1 3
4 2 6
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
Yes
2 3 6
1 5 4
No
No
No
Yes
3 6 1
4 5 2
No
No
Yes
6 4 3
1 2 5
Yes
2 6 5
1 3 4
No
No
Yes
4 3 6
5 1 2
No
No
No
No
Yes
3 2 5
1 4 6
No
No
No
No
No
Yes
2 1 4
3...

result:

wrong answer There is a valid answer, but participant did not find it. (test case 30)