oj.uz

Submission #590108

# Submission time Handle Problem Language Result Execution time Memory
590108 2022-07-05T14:22:58 Z yutabi Scales (IOI15_scales) C++14
71.4286 / 100
 1 ms 340 KB 
#include "scales.h"


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


void init(int T)
{
    /* ... */
}


void aaa(int W[], int b)
{
    int res=getLightest(W[b],W[b-1],W[b-2]);

    if(W[b]==res)
    {
        swap(W[b],W[b-1]);
    }
    
    if(W[b-1]==res)
    {
        swap(W[b-2],W[b-1]);
    }
}


void orderCoins()
{
    int W[] = {5, 2, 3, 4, 6, 1};

    int res=getNextLightest(W[3],W[2],W[1],W[0]);

    if(W[3]==res)
    {
        swap(W[3],W[2]);
    }

    if(W[2]==res)
    {
        swap(W[2],W[1]);
    }

    res=getNextLightest(W[4],W[3],W[2],W[1]);


    if(W[4]==res)
    {
        swap(W[4],W[2]);

        res=getNextLightest(W[0],W[4],W[3],W[2]);

        if(W[4]==res)
        {
            swap(W[4],W[3]);
        }
    }

    else
    {
        if(W[3]==res)
        {
            swap(W[3],W[2]);
        }

        res=getNextLightest(W[0],W[1],W[3],W[4]);

        if(W[3]==res)
        {
            swap(W[3],W[4]);
        }

        else if(W[1]==res)
        {
            swap(W[3],W[4]);
            swap(W[3],W[2]);
            swap(W[1],W[2]);
        }

        else if(W[0]==res)
        {
            swap(W[3],W[4]);
            swap(W[3],W[2]);
            swap(W[1],W[2]);
            swap(W[1],W[0]);
        }
    }

    res=getLightest(W[2],W[3],W[4]);

    if(W[4]==res)
    {
        for(int i=0;i<4;i++)
        {
            swap(W[i],W[i+1]);
        }
    }
    
    if(W[3]==res)
    {
        for(int i=0;i<4;i++)
        {
            swap(W[i],W[i+1]);
        }
    }

    res=getLightest(W[2],W[1],W[0]);

    if(W[2]==res)
    {
        for(int i=0;i<4;i++)
        {
            swap(W[i],W[i+1]);
        }
    }
    
    if(W[1]==res)
    {
        for(int i=0;i<4;i++)
        {
            swap(W[i],W[i+1]);
        }
    }

    res=getNextLightest(W[0],W[1],W[4],W[5]);

    if(res==W[0])
    {
        if(getLightest(W[0],W[1],W[5])==W[5])
        {
            swap(W[5],W[4]);
            swap(W[3],W[4]);
            swap(W[3],W[2]);
            swap(W[1],W[2]);
            swap(W[1],W[0]);
        }
    }

    else if(res==W[1])
    {
        swap(W[5],W[4]);
        swap(W[3],W[4]);
        swap(W[3],W[2]);
        swap(W[1],W[2]);
    }

    else if(res==W[4])
    {
        res=getNextLightest(W[2],W[3],W[4],W[5]);

        int loc;

        for(int i=4;i>=2;i--)
        {
            if(res==W[i])
            {
                loc=i;
            }
        }

        swap(W[5],W[4]);

        if(loc<=3)
        {
            swap(W[4],W[3]);
        }

        if(loc<=2)
        {
            swap(W[3],W[2]);
        }
    }

    answer(W);
}

Compilation message

scales.cpp: In function 'void init(int)':
scales.cpp:8:15: warning: unused parameter 'T' [-Wunused-parameter]
    8 | void init(int T)
      |           ~~~~^

Subtask #1
71.428571 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 212 KB Output is partially correct
2 Partially correct 0 ms 212 KB Output is partially correct
3 Partially correct 0 ms 212 KB Output is partially correct
4 Partially correct 0 ms 212 KB Output is partially correct
5 Partially correct 1 ms 212 KB Output is partially correct
6 Partially correct 0 ms 212 KB Output is partially correct
7 Partially correct 0 ms 212 KB Output is partially correct
8 Partially correct 0 ms 212 KB Output is partially correct
9 Partially correct 0 ms 212 KB Output is partially correct
10 Partially correct 0 ms 304 KB Output is partially correct
11 Partially correct 0 ms 212 KB Output is partially correct
12 Partially correct 0 ms 212 KB Output is partially correct
13 Partially correct 0 ms 296 KB Output is partially correct
14 Partially correct 1 ms 212 KB Output is partially correct
15 Partially correct 0 ms 212 KB Output is partially correct
16 Partially correct 0 ms 212 KB Output is partially correct
17 Partially correct 1 ms 212 KB Output is partially correct
18 Partially correct 0 ms 300 KB Output is partially correct
19 Partially correct 1 ms 212 KB Output is partially correct
20 Partially correct 0 ms 304 KB Output is partially correct
21 Partially correct 0 ms 212 KB Output is partially correct
22 Partially correct 0 ms 340 KB Output is partially correct
23 Partially correct 0 ms 212 KB Output is partially correct
24 Partially correct 0 ms 300 KB Output is partially correct
25 Partially correct 0 ms 300 KB Output is partially correct
26 Partially correct 1 ms 212 KB Output is partially correct
27 Partially correct 0 ms 212 KB Output is partially correct
28 Partially correct 1 ms 212 KB Output is partially correct
29 Partially correct 0 ms 212 KB Output is partially correct
30 Partially correct 0 ms 212 KB Output is partially correct
31 Partially correct 0 ms 212 KB Output is partially correct
32 Partially correct 0 ms 212 KB Output is partially correct
33 Partially correct 0 ms 212 KB Output is partially correct
34 Partially correct 1 ms 300 KB Output is partially correct
35 Partially correct 0 ms 296 KB Output is partially correct
36 Partially correct 0 ms 212 KB Output is partially correct
37 Partially correct 0 ms 212 KB Output is partially correct
38 Partially correct 0 ms 212 KB Output is partially correct
39 Partially correct 0 ms 212 KB Output is partially correct
40 Partially correct 0 ms 212 KB Output is partially correct