QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#863308	#9975. Hitoshizuku	myloveATRI	WA	54ms	7908kb	C++20	1.6kb	2025-01-19 15:53:23	2025-01-19 15:53:24

Judging History

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

[2025-01-19 15:53:24]
评测

测评结果：WA
用时：54ms
内存：7908kb

查看

[2025-01-19 15:53:23]
提交

answer

#include<bits/stdc++.h>
#include<queue>
#include<string.h>
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#define int long long
#define ll long long
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define nl t[n].l
#define nr t[n].r
#define gcd __gcd
#define itn int
#define db long double
using namespace std;
const int maxn=4e6+50;
const int inf=1e18+10;
const int INF=2e18;
const int mod=998244353;
//const db eps=1e-8;
//const db pi=acos(-1.0);
#define pop_count __builtin_popcountll
int a[maxn],b[maxn];
int vis[maxn];
void solve(){
    int n;
    cin>>n;
    priority_queue<array<int,2>> p,q;
    rep(i,1,3*n)
    {
        vis[i]=0;
        cin>>a[i]>>b[i];
        p.push({a[i],i});
        q.push({b[i],i});
    }
    vector<array<int,3>> ans;
    while(ans.size()<n)
    {
        while(vis[p.top()[1]]) p.pop();
        auto x=p.top();
        p.pop();
        vis[x[1]]=1;
        while(vis[q.top()[1]]) q.pop();
        auto y=q.top();
        q.pop();
        vis[y[1]]=1;
        while(vis[q.top()[1]]) q.pop();
        auto z=q.top();
        q.pop();
        vis[z[1]]=1;
        if(x[0]>min(y[0],z[0]))
        {
            cout<<"No\n";
            return;
        }
        ans.push_back({x[1],y[1],z[1]});
    }
    cout<<"Yes\n";
    for(auto x:ans)
    {
        cout<<x[0]<<' '<<x[1]<<' '<<x[2]<<'\n';
    }
}


signed main()
{
   ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
   int __=1;
   srand((time(0)));
   cin>>__;
  while(__--)
  {
       solve();
  }
    return 0;
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 7904kb

input:

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

output:

Yes
6 4 5
3 2 1
No

result:

ok >_< (2 test cases)

Test #2:

score: 0

Accepted

time: 54ms

memory: 7780kb

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
3 2 1
No
Yes
3 1 2
No
No
No
No
No
Yes
2 3 1
Yes
3 2 1
No
No
No
No
Yes
2 1 3
No
Yes
2 1 3
No
No
Yes
2 1 3
No
No
Yes
2 1 3
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
3 1 2
Yes
1 2 3
No
No
Yes
3 1 2
No
No
No
Yes
2 3 1
Yes
3 1 2
No...

result:

ok >_< (100000 test cases)

Test #3:

score: -100

Wrong Answer

time: 50ms

memory: 7908kb

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
4 1 3
6 2 5
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
1 4 5
3 2 6
No
No
No
No
No
Yes
5 3 6
4 1 2
Yes
5 4 1
2 3 6
No
No
No
Yes
2 6 1
4 5 3
No
No
No
No
No
No
Yes
2 1 5
3 6 4
No
No
No
No
Yes
6 4 1
3 2 5
No
No
No
No
No
No
No
No
No...

result:

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