# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1121094 | epicci23 | Scales (IOI15_scales) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
#include "scales.h"
//#define int long long
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int go[10];
void init(int T){
vector<int> perm(6,0);
iota(all(perm),0);
shuffle(all(perm),rng);
for(int i = 1 ; i <= n ; i++) go[i] = perm[i - 1] + 1;
}
void orderCoins(){
vector<int> cur;
int med = getMedian(go[1],go[2],go[3]);
int D = getNextLightest(go[1],go[2],go[3],go[4]);
vector<int> kal;
for(int i = 1 ; i <= 3 ; i++) kal.push_back(go[i]);
for(int i=0;i<3;i++){
if(kal[i] == med){
kal.erase(kal.begin() + i);
break;
}
}
if(D == med){
int lol = getLightest(kal[0],kal[1],go[4]);
if(lol == kal[0]){
cur.push_back(kal[0]);
cur.push_back(go[4]);
cur.push_back(med);
cur.push_back(kal[1]);
}
else{
cur.push_back(kal[1]);
cur.push_back(go[4]);
cur.push_back(med);
cur.push_back(kal[0]);
}
}
else{
int mini = getLightest(kal[0], kal[1], go[4]);
if(mini == go[4]){
cur.push_back(go[4]);
cur.push_back(D);
cur.push_back(med);
if(kal[0] == D) cur.push_back(kal[1]);
else cur.push_back(kal[0]);
}
else if(mini == D){
cur.push_back(mini);
cur.push_back(med);
if(kal[0] == D) cur.push_back(kal[1]);
else cur.push_back(kal[0]);
cur.push_back(go[4]);
}
else{
cur.push_back(mini);
cur.push_back(med);
cur.push_back(go[4]);
if(kal[0] == mini) cur.push_back(kal[1]);
else cur.push_back(kal[0]);
}
}
// 5 ekle
int u = getMedian(cur[0], go[5], cur[3]);
if(u == cur[0]) cur.insert(cur.begin(),go[5]);
else if(u == cur[3]) cur.push_back(go[5]);
else{
int u2 = getMedian(cur[1],go[5],cur[2]);
if(u2 == cur[1]) cur.insert(cur.begin()+1,go[5]);
else if(u2 == go[5]) cur.insert(cur.begin()+2,go[5]);
else cur.insert(cur.begin()+3,go[5]);
}
// 6 ekle
u = getMedian(cur[0],go[6],cur[3]);
if(u == cur[0]) cur.insert(cur.begin(),go[6]);
else if(u == cur[3]){
int u2 = getMedian(cur[3],go[6],cur[4]);
if(u2 == cur[4]) cur.push_back(go[6]);
else cur.insert(cur.begin()+4,go[6]);
}
else{
int u2 = getMedian(cur[1],go[6],cur[2]);
if(u2 == go[6]) cur.insert(cur.begin()+2,go[6]);
else if(u2 == cur[1]) cur.insert(cur.begin() + 1, go[6]);
else cur.insert(cur.begin() + 3 , go[6]);
}
int W[6];
for(int i = 0 ; i < 6 ; i++) W[i] = cur[i];
answer(W);
}