QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#401704	#6667. Prosjek	Kevin5307	0	10ms	3856kb	C++23	1.5kb	2024-04-29 10:33:14	2024-04-29 10:33:14

Judging History

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

[2024-04-29 10:33:14]
评测

测评结果：0
用时：10ms
内存：3856kb

查看

[2024-04-29 10:33:14]
提交

answer

//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		multiset<int> ms[4];
		for(int i=1;i<=n;i++)
		{
			int x;
			cin>>x;
			ms[x&3].insert(x);
		}
		while(sz(ms[0])>1||sz(ms[2])>1)
		{
			if(sz(ms[0])>1)
			{
				int x=*ms[0].begin();
				int y=*ms[0].rbegin();
				ms[0].erase(ms[0].lower_bound(x));
				ms[0].erase(ms[0].lower_bound(y));
				int z=x+y>>1;
				ms[z&3].insert(z);
				cout<<x<<" "<<y<<'\n';
			}
			else
			{
				int x=*ms[2].begin();
				int y=*ms[2].rbegin();
				ms[2].erase(ms[2].lower_bound(x));
				ms[2].erase(ms[2].lower_bound(y));
				int z=x+y>>1;
				ms[z&3].insert(z);
				cout<<x<<" "<<y<<'\n';
			}
		}
		if(sz(ms[0])&&sz(ms[2]))
			cout<<*ms[0].begin()<<" "<<*ms[2].begin()<<'\n';
	}
	return 0;
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0

Wrong Answer

Test #1:

score: 0

Wrong Answer

time: 0ms

memory: 3492kb

input:

99
4
739880851158065302 19206582949872932 883064254701115295 222072661880779376
7
148399819461615003 209088712310207988 53191076581680214 445068618251612752 230505279594622109 115754892157516718 804173775829453588
2
77979357045500669 41693388829622019
3
341612949433488278 609808714829036935 19994167...

output:

result:

wrong output format Unexpected end of file - int64 expected (test case 1)

Subtask #2:

score: 0

Wrong Answer

Test #16:

score: 0

Wrong Answer

time: 0ms

memory: 3560kb

input:

100
3
3 3 2
3
4 1 1
4
1 3 4 4
6
4 4 2 3 1 2
4
0 2 1 4
3
0 2 0
7
3 3 1 1 3 4 0
2
0 4
4
1 4 2 3
7
4 0 0 3 2 3 4
4
4 2 0 3
7
0 2 2 1 4 2 4
7
3 0 3 1 2 0 3
4
4 3 1 4
6
2 3 0 1 3 4
5
1 4 0 3 4
5
4 2 0 4 2
3
0 1 2
6
4 1 4 2 0 4
7
4 2 4 3 1 3 1
4
1 4 4 0
2
1 1
6
0 3 3 0 0 4
7
4 3 0 3 3 3 4
4
4 1 1 3
6
2 0 ...

output:

result:

wrong answer there's no 4 in the current set (test case 1)

Subtask #3:

score: 0

Wrong Answer

Test #34:

score: 0

Wrong Answer

time: 10ms

memory: 3856kb

input:

100000
5
846784256447769304 457696478728961702 128469521648960690 597630796847754190 104256763714529164
5
658897822238868978 472135077337628566 399538027669313322 622703684108675696 425723088635325654
5
917704960887390986 140817562615382054 877934664521057998 782212806618666818 616380973421914538
8
...

output:

result:

wrong output format Unexpected end of file - int64 expected (test case 1)

Subtask #4:

score: 0

Time Limit Exceeded

Test #46:

score: 0

Time Limit Exceeded

input:

100
211957
911918942087402387 344230223346742784 16289402153237664 528890583619159010 886281719684850237 865484734102017297 321851390502278959 754268375474197153 237414161302130571 135637002716682378 824412491959977735 162505521049217610 246319278060116103 666703181591704279 650875500699154233 96397...