QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#401915 | #6667. Prosjek | Tx_Lcy | 0 | 0ms | 0kb | C++14 | 1.4kb | 2024-04-29 16:37:04 | 2024-04-29 16:37:06 |
answer
//A tree without skin will surely die.
//A man without face will be alive.
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(),(x).end()
#define rep(i,j,k) for (int i=j;i<=k;++i)
#define per(i,j,k) for (int i=j;i>=k;--i)
int const N=1e6+10;
mt19937 rnd(time(0));
int n,a[N];vector<int>c[2];
inline int work(){
vector< pair<int,int> >ans;
c[0].clear(),c[1].clear();
shuffle(a+1,a+n+1,rnd);
rep(i,1,n) c[a[i]&1].push_back(a[i]);
rep(i,1,n-1){
if (c[0].size()==1 && c[1].size()==1) return 0;
vector<int>prio;
prio.push_back(0),prio.push_back(1);
if (rnd()&1) swap(prio[0],prio[1]);
for (auto it:prio)
if (c[it].size()>1){
int x=c[it].back();c[it].pop_back();
int y=c[it].back();c[it].pop_back();
ans.push_back({x,y}),x+=y,x/=2;
c[x&1].push_back(x);
break;
}
}
for (auto i:ans) cout<<i.first<<' '<<i.second<<'\n';
return 1;
}
inline void solve(){
cin>>n;
rep(i,1,n) cin>>a[i];
rep(T,1,350) if (work()) return;
cout<<"-1\n";
}
signed main(){
freopen("cow.in","r",stdin);
freopen("cow.out","w",stdout);
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int t=1;
cin>>t;
while (t--) solve();
cerr<<"Time: "<<(double)clock()/CLOCKS_PER_SEC<<" s\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Dangerous Syscalls
Test #1:
score: 0
Dangerous Syscalls
input:
99 4 739880851158065302 19206582949872932 883064254701115295 222072661880779376 7 148399819461615003 209088712310207988 53191076581680214 445068618251612752 230505279594622109 115754892157516718 804173775829453588 2 77979357045500669 41693388829622019 3 341612949433488278 609808714829036935 19994167...
output:
result:
Subtask #2:
score: 0
Dangerous Syscalls
Test #16:
score: 0
Dangerous Syscalls
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
Dangerous Syscalls
Test #34:
score: 0
Dangerous Syscalls
input:
100000 5 846784256447769304 457696478728961702 128469521648960690 597630796847754190 104256763714529164 5 658897822238868978 472135077337628566 399538027669313322 622703684108675696 425723088635325654 5 917704960887390986 140817562615382054 877934664521057998 782212806618666818 616380973421914538 8 ...
output:
result:
Subtask #4:
score: 0
Dangerous Syscalls
Test #46:
score: 0
Dangerous Syscalls
input:
100 211957 911918942087402387 344230223346742784 16289402153237664 528890583619159010 886281719684850237 865484734102017297 321851390502278959 754268375474197153 237414161302130571 135637002716682378 824412491959977735 162505521049217610 246319278060116103 666703181591704279 650875500699154233 96397...