| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 485393 | MohamedFaresNebili | Scales (IOI15_scales) | C++14 | 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">
using namespace std;
#define pb push_back
void init(int T) {
}
void orderCoins(void) {
vector<int>res, curr; int W[6], i = 0;
W[0] = getLightest(getLightest(1, 2, 3), getLightest(4, 5, 6), 6);
for(int l = 1; l <= 6; l++) {
if(l == W[0]) continue;
curr.pb(l);
}
W[1] = getLightest(getLightest(curr[0], curr[1], curr[2]), getLightest(curr[2], curr[3], curr[4]), curr[2]);
curr.clear();
for(int l = 1; l <= 6; l++) {
if(l == W[0] || l == W[1]) continue;
curr.pb(l);
}
W[2] = getLightest(getLightest(curr[0], curr[1], curr[2]), getLightest(curr[1], curr[2], curr[3]), curr[0]);
curr.clear();
for(int l = 1; l <= 6; l++) {
if(l == W[0] || l == W[1] || l == W[2]) continue;
curr.pb(l);
}
W[3] = getLightest(curr[0], curr[1], curr[2]);
curr.clear();
for(int l = 1; l <= 6; l++) {
if(l == W[0] || l == W[1] || l == W[2] || l == W[3]) continue;
curr.pb(l);
}
W[4] = getLightest(curr[0], curr[1], curr[0]);
for(int l = 1; l <= 6; l++) {
if(l == W[0] || l == W[1] || l == W[2] || l == W[3] || l == W[4]) continue;
W[5] = l;
}
answer(W);
}