# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1017170 | huutuan | Scales (IOI15_scales) | C++14 | 1 ms | 604 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) {
}
int ans[6];
void orderCoins() {
vector<int> v{1, 2, 3, 4, 5, 6}, v2;
{
int t=getLightest(v[0], v[1], v[2]);
t=getLightest(t, v[3], v[4]);
t=getLightest(t, v[4]^v[3]^t, v[5]);
v2.push_back(t);
ans[t-1]=1;
v.erase(find(v.begin(), v.end(), t));
}
{
int t=getLightest(v[0], v[1], v[2]);
t=getLightest(t, v[3], v[4]);
v2.push_back(t);
ans[t-1]=2;
v.erase(find(v.begin(), v.end(), t));
}
{
int t=getLightest(v[0], v[1], v[2]);
t=getLightest(t, v[2]^v[1]^t, v[3]);
v2.push_back(t);
ans[t-1]=3;
v.erase(find(v.begin(), v.end(), t));
}
{
int t=getLightest(v[0], v[1], v[2]);
v2.push_back(t);
ans[t-1]=4;
v.erase(find(v.begin(), v.end(), t));
}
{
int t=getMedian(v[0], v[1], v2[0]);
ans[t-1]=5;
ans[(v[0]^v[1]^t)-1]=6;
}
answer(ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |