# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
261448 | amiratou | Scales (IOI15_scales) | C++14 | 1 ms | 256 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>
using namespace std;
#define pb push_back
void init(int T) {
}
void orderCoins() {
vector<int> ans;
ans.pb(getLightest(1,2,3));
ans.pb(getMedian(1,2,3));
for (int i = 1; i <= 3; ++i)
if(ans[0]!=i && ans[1]!=i)ans.pb(i);
int a=getNextLightest(ans[0],ans[1],ans[2],4),b;
if(a==ans[1])ans.insert(ans.begin()+1,4);
else if(a==ans[2])ans.insert(ans.begin()+2,4);
else if(getMedian(ans[1],ans[2],4)==ans[1])ans.insert(ans.begin(),4);
else ans.pb(4);
a=getNextLightest(ans[0],ans[1],ans[2],5);
if(a==ans[1])ans.insert(ans.begin()+1,5);
else if(a==ans[2])ans.insert(ans.begin()+2,5);
else{
b=getMedian(ans[2],ans[3],5);
if(b==5)ans.insert(ans.begin()+3,5);
else if(b==ans[3])ans.pb(5);
else ans.insert(ans.begin(),5);
}
a=getNextLightest(ans[0],ans[2],ans[4],6);
if(a==ans[2]){
b=getMedian(6,ans[1],ans[2]);
if(b==6)ans.insert(ans.begin()+2,6);
else ans.insert(ans.begin()+1,6);
}
else if(a==ans[4]){
b=getMedian(6,ans[3],ans[4]);
if(b==6)ans.insert(ans.begin()+4,6);
else ans.insert(ans.begin()+3,6);
}
else{
b=getLightest(6,ans[0],ans[1]);
if(b==6)ans.insert(ans.begin(),6);
else ans.pb(6);
}
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... |