# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
357956 | tengiz05 | 저울 (IOI15_scales) | C++17 | 1 ms | 384 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"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
void init(int T){
}
void print(int a[]){
for(int i=1;i<=6;i++)cout << a[i] << ' ';
cout << '\n';
return;
}
void orderCoins(){
int a[10] = {0,1,2,3,4,5,6,0,0,0};
int ans[6] = {1,2,3,4,5,6};
vector<int> remain = {1,2,3,4,5,6};
a[1] = getLightest(1,2,3);
a[4] = getLightest(4,5,6);
int t = getLightest(a[1], a[4], (a[1]==1)?2:1);
a[1] = t;
remain.erase(find(remain.begin(),remain.end(),a[1]));
a[3] = getHeaviest(remain[0],remain[1],remain[2]);
a[6] = getHeaviest(remain[3],remain[4],a[1]);
t = getHeaviest(a[3],a[6],a[1]);
a[6] = t;
remain.erase(find(remain.begin(),remain.end(),a[6]));
a[2] = getLightest(remain[0],remain[1],remain[2]);
t = getLightest(a[2],remain[3],a[6]);
a[2] = t;
remain.erase(find(remain.begin(),remain.end(),a[2]));
a[5] = getHeaviest(remain[0],remain[1],remain[2]);
remain.erase(find(remain.begin(),remain.end(),a[5]));
a[3] = getLightest(remain[0],remain[1],a[6]);
remain.erase(find(remain.begin(),remain.end(),a[3]));
a[4] = remain[0];
assert(remain.size() == 1);
//~ print(a);
for(int i=0;i<6;i++)ans[i] = a[i+1];
answer(ans);
return;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |