# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
484760 | imachug | Scales (IOI15_scales) | C++17 | 1 ms | 204 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;
void init(int T) {
/* ... */
}
void order3(int a, int b, int c, int* w) {
w[0] = getLightest(a, b, c);
w[1] = getMedian(a, b, c);
w[2] = a + b + c - w[0] - w[1];
}
void orderCoins() {
int max1 = getHeaviest(1, 2, 3);
// Is one of the halves strictly less than the other half?
if(getNextLightest(4, 5, 6, max1) == getLightest(4, 5, 6)) {
// Seems so. Order the two halves separately
int W[6];
order3(1, 2, 3, W);
order3(4, 5, 6, W + 3);
if(getLightest(W[0], W[1], W[3]) == W[3]) {
// The second half goes before the first half
swap(W[0], W[3]);
swap(W[1], W[4]);
swap(W[2], W[5]);
}
answer(W);
return;
}
int max2 = getHeaviest(4, 5, 6);
int max3 = max1 == 1 ? 2 : 1;
int max = getHeaviest(max1, max2, max3);
int W[] = {1, 2, 3, 4, 5, 6};
swap(W[5], W[max - 1]);
stable_sort(W, W + 5, [&](int i, int j) {
return getLightest(i, j, max) == i;
});
answer(W);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |