# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
604308 | cheissmart | Scales (IOI15_scales) | C++14 | 1 ms | 232 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 F first
#define S second
#define V vector
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;
const int INF = 1e9 + 7;
void init(int T) {
}
void orderCoins() {
vi ans(6); iota(ALL(ans), 1);
auto go = [&] (int x, int y, int z) {
int a = ans[x], b = ans[y], c = ans[z];
int mx = getHeaviest(a, b, c);
int mn = getLightest(a, b, c);
int md = a ^ b ^ c ^ mx ^ mn;
ans[x] = mn, ans[y] = md, ans[z] = mx;
};
for(int i = 0; i < 4; i++)
go(i, i + 1, i + 2);
for(int i = 3; i >= 0; i--)
go(i, i + 1, i + 2);
int W[] = {ans[0], ans[1], ans[2], ans[3], ans[4], ans[5]};
answer(W);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |