Submission #1310187

#TimeUsernameProblemLanguageResultExecution timeMemory
1310187LuvidiScales (IOI15_scales)C++20
55.56 / 100
2 ms352 KiB
#include "scales.h"
#include <bits/stdc++.h>
using namespace std;

void init(int T) {
    
}

void orderCoins() {
    int a[]={1,2,3,4,5,6};
    {
        int x=getLightest(1,2,3),y=getHeaviest(1,2,3);
        a[0]=x;
        a[2]=y;
        a[1]=6-x-y;
    }
    {
        int x=getLightest(4,5,6),y=getHeaviest(4,5,6);
        a[3]=x;
        a[5]=y;
        a[4]=15-x-y;
    }
    if(getHeaviest(a[1],a[2],a[5])==a[5]){
        swap(a[0],a[3]);
        swap(a[1],a[4]);
        swap(a[2],a[5]);
    }
    vector<int> v[3];
    for(int i=3;i<6;i++){
        int t=getNextLightest(a[0],a[1],a[2],a[i]);
        if(t==a[0])v[0].push_back(a[i]);
        if(t==a[1])v[1].push_back(a[i]);
        if(t==a[2])v[2].push_back(a[i]);
    }
    int b[6],id=0;
    for(int i=0;i<3;i++){
        for(int j:v[i])b[id++]=j;
        b[id++]=a[i];
    }
    answer(b);
}
#Verdict Execution timeMemoryGrader output
Fetching results...