# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
136797 | amiratou | 저울 (IOI15_scales) | C++14 | 3 ms | 508 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 "scales.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
void init(int T) {
}
void orderCoins() {
vector<int> ans;
int q1=getHeaviest(1,2,3);
int q2=getLightest(1,2,3);
ans.pb(q2);
for (int i = 1; i <=3 ; ++i)
if(i!=q1&&i!=q2)ans.pb(i);
ans.pb(q1);
for (int i = 4; i <=6 ; ++i)
{
int l=1,r=(int)ans.size()-1,idx=-1;
while(l<=r){
int med=(l+r)>>1;
if(getHeaviest(ans[med-1],ans[med],i)==i)
idx=med+1,l=med+1;
else
r=med-1;
}
if(idx==-1){
if(getMedian(ans[0],ans[1],i)==i)idx=1;
else idx=0;
}
ans.insert(ans.begin()+idx,i);
}
int W[6];
for (int i = 0; i < 6; ++i)
W[i]=ans[i];
answer(W);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |