Submission #1188202

#	Time	Username	Problem	Language	Result	Execution time	Memory
1188202		simona1230	저울 (IOI15_scales)	C++20	55.56 / 100	0 ms	328 KiB

scales

#include "scales.h"
#include <bits/stdc++.h>
using namespace std;

void init(int T) {}

int w[6];
void orderCoins()
{
    vector<int> v1,v2;
    int x=getHeaviest(4,2,3);
    int xx=getLightest(4,2,3);
    v1= {xx,9-x-xx,x};
    x=getHeaviest(1,5,6);
    xx=getLightest(1,5,6);
    v2= {xx,12-x-xx,x};
    swap(v1,v2);

    pair<int,int> p[6];
    p[3]= {1,-1};
    p[4]= {2,-1};
    p[5]= {3,-1};

    int l=0;
    for(int i=0; i<3; i++)
    {
        if(l==3)
        {
            p[i]= {l,i};
            continue;
        }

        if(l==0)
        {
            int x=getMedian(v1[0],v1[2],v2[i]);
            if(x==v1[2])p[i]={3,i};
            else if(x==v1[0])p[i]={0,i};
            else
            {
                x=getLightest(v2[i],v1[1],v1[2]);
                if(x==v2[i])p[i]={1,i};
                else p[i]={2,i};
            }
        }


        if(l==1)
        {
            int x=getMedian(v1[1],v1[2],v2[i]);
            if(x==v1[1])p[i]={1,i};
            else if(x==v1[2])p[i]={3,i};
            else p[i]={2,i};
        }

        if(l==2)
        {
            int x=getHeaviest(v1[1],v1[2],v2[i]);
            if(x==v2[i])p[i]={3,i};
            else p[i]={2,i};
        }

        l=p[i].first;
    }
    sort(p,p+6);
    for(int i=0; i<6; i++)
    {
        if(p[i].second==-1)
            w[i]=v1[p[i].first-1];
        else w[i]=v2[p[i].second];
    }

    answer(w);
}

• Subtask 1: 55.5556 / 100