# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
780613 | vjudge1 | Scales (IOI15_scales) | C++17 | 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 "scales.h"
#include<bits/stdc++.h>
using namespace std;
void init(int T) {
int bruh;
}
void orderCoins() {
/* ... */
vector<int> a(6), vis(6);
a[0]= getLightest(1, 2, 3);
a[2]= getHeaviest(1, 2, 3);
a[1]=(6-a[0]-a[2]);
a[3]=getLightest(4, 5, 6);
a[5]=getHeaviest(4, 5, 6);
a[4]=15-a[3]-a[5];
vector<int> ans;
int x= getMedian(a[0], a[1], a[3]);
if(x==a[0]){
ans.push_back(a[3]);
ans.push_back(a[0]);
int x=getMedian(a[1], a[2], a[4]);
if(x==a[1]){
ans.push_back(a[4]);
ans.push_back(a[1]);
int x=getHeaviest(a[0], a[3], a[5]);
if(x==a[3]){
ans.push_back(a[5]);
ans.push_back(a[3]);
}
else{
ans.push_back(a[3]);
ans.push_back(a[5]);
}
}
else if(x==a[2]){
ans.push_back(a[1]);
ans.push_back(a[2]);
int x=getHeaviest(a[0], a[4], a[5]);
if(x==a[4]){
ans.push_back(a[5]);
ans.push_back(a[4]);
}
else{
ans.push_back(a[4]);
ans.push_back(a[5]);
}
}
else if(x==a[4]){
ans.push_back(a[1]);
ans.push_back(a[4]);
int x=getHeaviest(a[0], a[2], a[5]);
if(x==a[2]){
ans.push_back(a[5]);
ans.push_back(a[2]);
}
else{
ans.push_back(a[2]);
ans.push_back(a[5]);
}
}
}
else if(x==a[1]){
ans.push_back(a[0]);
ans.push_back(a[1]);
vis[0]=vis[1]=1;
int x= getMedian(a[2], a[3], a[4]);
if(x==a[2]){
ans.push_back(a[3]);
ans.push_back(a[2]);
x= getHeaviest(a[0], a[4], a[5]);
if(x==a[4]){
ans.push_back(a[5]);
ans.push_back(a[4]);
}
else{
ans.push_back(a[4]);
ans.push_back(a[5]);
}
}
else if(x==a[3]){
ans.push_back(a[2]);
ans.push_back(a[3]);
x= Heaviest(a[0], a[4], a[5]);
if(x==a[4]){
ans.push_back(a[5]);
ans.push_back(a[4]);
}
else{
ans.push_back(a[4]);
ans.push_back(a[5]);
}
}
else{
ans.push_back(a[3]);
ans.push_back(a[4]);
x=getHeaviest(a[0], a[2], a[5]);
if(x==a[2]){
ans.push_back(a[5]);
ans.push_back(a[2]);
}
else{
ans.push_back(a[2]);
ans.push_back(a[5]);
}
}
}
else{
ans.push_back(a[0]);
ans.push_back(a[3]);
vis[3]=vis[0]=1;
int x=getMedian(a[1], a[2], a[4]);
if(x==a[1]){
ans.push_back(a[4]);
ans.push_back(a[1]);
int x=getHeaviest(a[0], a[3], a[5]);
if(x==a[3]){
ans.push_back(a[5]);
ans.push_back(a[3]);
}
else{
ans.push_back(a[3]);
ans.push_back(a[5]);
}
}
else if(x==a[2]){
ans.push_back(a[1]);
ans.push_back(a[2]);
int x=getHeaviest(a[0], a[4], a[5]);
if(x==a[4]){
ans.push_back(a[5]);
ans.push_back(a[4]);
}
else{
ans.push_back(a[4]);
ans.push_back(a[5]);
}
}
else if(x==a[4]){
ans.push_back(a[1]);
ans.push_back(a[4]);
int x=getHeaviest(a[0], a[2], a[5]);
if(x==a[2]){
ans.push_back(a[5]);
ans.push_back(a[2]);
}
else{
ans.push_back(a[2]);
ans.push_back(a[5]);
}
}
}
int W[6];
for(int i=0; i<6; i++) W[i]=ans[i];
answer(W); return;
}