Submission #356670

# Submission time Handle Problem Language Result Execution time Memory
356670 2021-01-23T13:55:12 Z leinad2 Scales (IOI15_scales) C++17
33.631 / 100
1 ms 364 KB
#include "scales.h"
#include<bits/stdc++.h>
using namespace std;
void init(int T)
{
}
void orderCoins()
{
    int ans[7]={}, i;
    int x=getHeaviest(1, 2, 3);
    int y=getLightest(1, 2, 3);
    for(i=1;i<=3;i++)if(i!=x&&i!=y)break;
    ans[0]=x;
    ans[1]=i;
    ans[2]=y;

        int z=getNextLightest(ans[0], ans[1], ans[2], 4);
        if(z==ans[0])
        {
            ans[3]=ans[2];
            ans[2]=ans[1];
            ans[1]=4;
        }
        if(z==ans[1])
        {
            ans[3]=ans[2];
            ans[2]=4;
        }
        if(z==ans[2])
        {int w=getHeaviest(x, i, 4);
    if(w==4)
    {
        ans[3]=y;
        ans[2]=i;
        ans[1]=x;
        ans[0]=4;
    }
    else
            ans[3]=4;
        }
    int xx=getHeaviest(ans[0], ans[1], 5);
    if(xx==5)
    {
        ans[4]=ans[3];ans[3]=ans[2];ans[2]=ans[1];ans[1]=ans[0];ans[0]=5;
    }
    else
    {

            int xxxx=getNextLightest(ans[1], ans[2], ans[3], 5);
            if(xxxx==ans[1])
            {
                ans[4]=ans[3];ans[3]=ans[2];ans[2]=5;
            }
            if(xxxx==ans[2])
            {
                ans[4]=ans[3];ans[3]=5;
            }
            if(xxxx==ans[3])
            {
                int xxx=getHeaviest(ans[1], ans[2], 5);
        if(xxx==5)
        {
            ans[4]=ans[3];ans[3]=ans[2];ans[2]=ans[1];ans[1]=5;
        }
                else ans[4]=5;
            }
    }
    int xxxxx=getHeaviest(ans[0], ans[1], 6);
    if(xxxxx==6)
    {
        ans[5]=ans[4];ans[4]=ans[3];ans[3]=ans[2];ans[2]=ans[1];ans[1]=ans[0];ans[0]=6;
    }
    else
    {
        int xxxxxx=getHeaviest(ans[1], ans[2], 6);
        if(xxxxxx==6)
        {
            ans[5]=ans[4];ans[4]=ans[3];ans[3]=ans[2];ans[2]=ans[1];ans[1]=6;
        }
        else
        {
            int xxxxxxx=getHeaviest(ans[2], ans[3], 6);
            if(xxxxxxx==6)
            {
                ans[5]=ans[4];ans[4]=ans[3];ans[3]=ans[2];ans[2]=6;
            }
            else
            {
                int xxxxxxxx=getNextLightest(ans[2], ans[3], ans[4], 6);
                if(xxxxxxxx==ans[2])
                {
                    ans[5]=ans[4];ans[4]=ans[3];ans[3]=6;
                }
                if(xxxxxxxx==ans[3])
                {
                    ans[5]=ans[4];ans[4]=6;
                }
                if(xxxxxxxx==ans[4])
                {
                    ans[5]=6;
                }
            }
        }
    }
    int ans2[6];
    for(i=0;i<6;i++)ans2[i]=ans[5-i];
    answer(ans2);
    return;
}

Compilation message

scales.cpp: In function 'void init(int)':
scales.cpp:4:15: warning: unused parameter 'T' [-Wunused-parameter]
    4 | void init(int T)
      |           ~~~~^
# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 364 KB Output is partially correct
2 Partially correct 1 ms 364 KB Output is partially correct
3 Partially correct 1 ms 364 KB Output is partially correct
4 Partially correct 1 ms 364 KB Output is partially correct
5 Partially correct 1 ms 364 KB Output is partially correct
6 Partially correct 1 ms 364 KB Output is partially correct
7 Partially correct 1 ms 364 KB Output is partially correct
8 Partially correct 1 ms 364 KB Output is partially correct
9 Partially correct 1 ms 364 KB Output is partially correct
10 Partially correct 1 ms 364 KB Output is partially correct
11 Partially correct 1 ms 364 KB Output is partially correct
12 Partially correct 1 ms 364 KB Output is partially correct
13 Partially correct 1 ms 364 KB Output is partially correct
14 Partially correct 1 ms 364 KB Output is partially correct
15 Partially correct 1 ms 364 KB Output is partially correct
16 Partially correct 1 ms 364 KB Output is partially correct
17 Partially correct 1 ms 364 KB Output is partially correct
18 Partially correct 1 ms 364 KB Output is partially correct
19 Partially correct 1 ms 364 KB Output is partially correct
20 Partially correct 1 ms 364 KB Output is partially correct
21 Partially correct 1 ms 364 KB Output is partially correct
22 Partially correct 1 ms 364 KB Output is partially correct
23 Partially correct 1 ms 364 KB Output is partially correct
24 Partially correct 1 ms 364 KB Output is partially correct
25 Partially correct 1 ms 364 KB Output is partially correct
26 Partially correct 1 ms 364 KB Output is partially correct
27 Partially correct 1 ms 364 KB Output is partially correct
28 Partially correct 1 ms 364 KB Output is partially correct
29 Partially correct 1 ms 364 KB Output is partially correct
30 Partially correct 1 ms 364 KB Output is partially correct
31 Partially correct 1 ms 364 KB Output is partially correct
32 Partially correct 1 ms 364 KB Output is partially correct
33 Partially correct 0 ms 364 KB Output is partially correct
34 Partially correct 1 ms 364 KB Output is partially correct
35 Partially correct 1 ms 364 KB Output is partially correct
36 Partially correct 1 ms 364 KB Output is partially correct
37 Partially correct 1 ms 364 KB Output is partially correct
38 Partially correct 1 ms 364 KB Output is partially correct
39 Partially correct 1 ms 364 KB Output is partially correct
40 Partially correct 1 ms 364 KB Output is partially correct