# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99754 | Lawliet | Scales (IOI15_scales) | C++14 | 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 <bits/stdc++.h>
#define MAX 10
using namespace std;
int query[MAX];
bool marc[MAX];
vector<int> aux;
vector<int> ordered[2];
int getHeaviest(int A, int B, int C);
int getLightest(int A, int B, int C);
int getMedian(int A, int B, int C);
int getNextLightest(int A, int B, int C, int D);
void answer(int W[6]);
void orderCoins(void)
{
int W[6];
ordered[0].push_back(getLightest(1 , 2 , 3));
ordered[0].push_back(getMedian(1 , 2 , 3));
ordered[0].push_back(6 - ordered[0][0] - ordered[0][1]);
ordered[1].push_back(getLightest(4 , 5 , 6));
ordered[1].push_back(getMedian(4 , 5 , 6));
ordered[1].push_back(15 - ordered[1][0] - ordered[1][1]);
int mn = ordered[0][0];
for(int g = 0 ; g < 3 ; g++)
{
W[5 - g] = getHeaviest(ordered[0].back() , ordered[1].back() , mn);
if(W[5 - g] == ordered[0].back()) ordered[0].pop_back();
if(W[5 - g] == ordered[1].back()) ordered[1].pop_back();
if(ordered[0].size() == 1) mn = ordered[1][0];
}
if(ordered[0].size() == 3) for(int g = 0 ; g < 3 ; g++) W[g] = ordered[0][g];
else if(ordered[1].size() == 3) for(int g = 0 ; g < 3 ; g++) W[g] = ordered[1][g];
else
{
for(int g = 0 ; g < ordered[0].size() ; g++) aux.push_back(ordered[0][g]);
for(int g = 0 ; g < ordered[1].size() ; g++) aux.push_back(ordered[1][g]);
int med = getMedian(aux[0] , aux[1] , aux[2]);
W[1] = med;
if(ordered[1].size() == 1) swap(ordered[0] , ordered[1]);
if(med == ordered[0][0])
{
W[0] = ordered[1][0];
W[2] = ordered[1][1];
}
if(med == ordered[1][0])
{
W[2] = ordered[1][1];
W[0] = ordered[0][0];
}
if(med == ordered[1][1])
{
W[0] = ordered[1][0];
W[2] = ordered[0][0];
}
}
answer(W);
}
void init(int T)
{
for(int k = 1 ; k <= T ; k++)
{
orderCoins();
}
}