# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1017187 | huutuan | Scales (IOI15_scales) | C++14 | 1 ms | 600 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> v1, v2;
v1.push_back(getLightest(1, 2, 3));
v1.push_back(getMedian(1, 2, 3));
v1.push_back(6-v1[0]-v1[1]);
v2.push_back(getLightest(4, 5, 6));
v2.push_back(getMedian(4, 5, 6));
v2.push_back(15-v2[0]-v2[1]);
int id=0;
while (v1.size() && v2.size()){
int t1=v1[0], t2=v2[0], tt=1;
if (id==0){
if (t1==1) tt=2;
int t=getLightest(t1, t2, tt);
ans[id++]=t;
if (t==t1) v1.erase(v1.begin());
else v2.erase(v2.begin());
}else{
int t=getMedian(t1, t2, ans[0]);
ans[id++]=t;
if (t==t1) v1.erase(v1.begin());
else v2.erase(v2.begin());
}
}
while (v1.size()) ans[id++]=v1[0], v1.erase(v1.begin());
while (v2.size()) ans[id++]=v2[0], v2.erase(v2.begin());
answer(ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |