QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #116966 | #6667. Prosjek | xtqqwq# | 0 | 163ms | 12072kb | C++14 | 1.3kb | 2023-06-30 11:39:27 | 2024-05-31 18:36:07 |
Judging History
answer
#include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
ll readint(){
ll x=0,f=1; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int n;
ll a[1000005];
vector<ll> b[20][10005];
void solve(){
n=readint();
for(int i=1;i<=n;i++) a[i]=readint();
b[2][0].clear(),b[2][2].clear();
for(int i=1;i<=n;i++) if(a[i]%2==0) b[2][a[i]%4].pb(a[i]);
for(int i=1;i<n;i++){
if(b[2][0].size()>=2){
ll x=b[2][0].back(); b[2][0].pop_back();
ll y=b[2][0].back(); b[2][0].pop_back();
printf("%lld %lld\n",x,y);
b[2][(x+y)/2%4].pb((x+y)/2);
}
else if(b[2][2].size()>=2){
ll x=b[2][2].back(); b[2][2].pop_back();
ll y=b[2][2].back(); b[2][2].pop_back();
printf("%lld %lld\n",x,y);
b[2][(x+y)/2%4].pb((x+y)/2);
}
else printf("%lld %lld\n",b[2][0][0],b[2][0][1]);
}
}
int main(){
int T=readint();
while(T--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 2ms
memory: 8732kb
input:
99 4 739880851158065302 19206582949872932 883064254701115295 222072661880779376 7 148399819461615003 209088712310207988 53191076581680214 445068618251612752 230505279594622109 115754892157516718 804173775829453588 2 77979357045500669 41693388829622019 3 341612949433488278 609808714829036935 19994167...
output:
222072661880779376 19206582949872932 120639622415326154 739880851158065302 430260236786695728 222072661880779376 804173775829453588 445068618251612752 624621197040533170 115754892157516718 370188044599024944 209088712310207988 289638378454616466 53191076581680214 171414727518148340 37018804459902494...
result:
wrong answer there's no 222072661880779376 in the current set (test case 1)
Subtask #2:
score: 0
Runtime Error
Test #16:
score: 0
Runtime Error
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:
Subtask #3:
score: 0
Wrong Answer
Test #34:
score: 0
Wrong Answer
time: 87ms
memory: 9892kb
input:
100000 5 846784256447769304 457696478728961702 128469521648960690 597630796847754190 104256763714529164 5 658897822238868978 472135077337628566 399538027669313322 622703684108675696 425723088635325654 5 917704960887390986 140817562615382054 877934664521057998 782212806618666818 616380973421914538 8 ...
output:
104256763714529164 846784256447769304 475520510081149234 597630796847754190 128469521648960690 457696478728961702 293083000188961196 536575653464451712 425723088635325654 399538027669313322 412630558152319488 622703684108675696 472135077337628566 658897822238868978 565516449788248772 517667121130497...
result:
wrong answer there's no 565516449788248772 in the current set (test case 3)
Subtask #4:
score: 0
Wrong Answer
Test #46:
score: 0
Wrong Answer
time: 163ms
memory: 12072kb
input:
100 211957 911918942087402387 344230223346742784 16289402153237664 528890583619159010 886281719684850237 865484734102017297 321851390502278959 754268375474197153 237414161302130571 135637002716682378 824412491959977735 162505521049217610 246319278060116103 666703181591704279 650875500699154233 96397...
output:
187349684646959176 897655518245439560 542502601446199368 780438536468326472 661470568957262920 444950768839720960 553210668898491940 186730312418961600 988268985652269236 473341823171477140 730805404411873188 109948005973364296 494927481562234444 365104786688751580 430016134125493012 224603118414672...
result:
wrong answer there's no 274530178102612796 in the current set (test case 1)