oj.uz

Submission #63276

# Submission time Handle Problem Language Result Execution time Memory
63276 2018-08-01T08:24:33 Z Kubalionzzale Scales (IOI15_scales) C++14
55.5556 / 100
 3 ms 680 KB 
#include "scales.h"
#include <vector>
#include <iostream>

int ans[] = {1, 2, 3, 4, 5, 6};
std::vector<int> vec;
int left[5], right[5];

void check4()
{
    int val = getNextLightest(left[0], left[1], 4, left[2]);

    if (val == 4)
    {
        int otherVal = getMedian(left[0], left[1], 4);

        if (otherVal == left[0])
        {
            vec.insert(vec.begin() + 0, 4);
        }
        else
        {
            vec.insert(vec.begin() + 3, 4);
        }
    }
    else
    {
        int otherVal = getMedian(left[0], left[1], 4);

        if (otherVal == 4)
        {
            vec.insert(vec.begin() + 1, 4);
        }
        else if (otherVal == vec[0])
        {
            vec.insert(vec.begin() + 0, 4);
        }
        else
        {
            vec.insert(vec.begin() + 2, 4);
        }
    }
}

void check5()
{
    int val = getNextLightest(vec[0], vec[1], 5, vec[2]);

    if (val == 5)
    {
        int otherVal = getMedian(vec[2], vec[3], 5);

        if (otherVal == vec[2])
        {
            vec.insert(vec.begin() + 0, 5);
        }
        else if (otherVal == vec[3])
        {
            vec.insert(vec.begin() + 4, 5);
        }
        else
        {
            vec.insert(vec.begin() + 3, 5);
        }
    }
    else
    {
        int otherVal = getMedian(vec[0], vec[1], 5);

        if (otherVal == 5)
        {
            vec.insert(vec.begin() + 1, 5);
        }
        else if (otherVal == vec[0])
        {
            vec.insert(vec.begin() + 0, 5);
        }
        else
        {
            vec.insert(vec.begin() + 2, 5);
        }
    }
}

void check6()
{
    int val = getMedian(vec[2], vec[3], 6);

    if (val == 6)
    {
        vec.insert(vec.begin() + 3, 6);
    }
    else if (val == vec[2])
    {
        int otherVal = getMedian(vec[0], vec[1], 6);

        if (otherVal == 6)
        {
            vec.insert(vec.begin() + 1, 6);
        }
        else if (otherVal == vec[0])
        {
            vec.insert(vec.begin() + 0, 6);
        }
        else
        {
            vec.insert(vec.begin() + 2, 6);
        }
    }
    else if (val == vec[3])
    {
        int otherVal = getMedian(vec[3], vec[4], 6);

        if (otherVal == 6)
        {
            vec.insert(vec.begin() + 4, 6);
        }
        else if (otherVal == vec[4])
        {
            vec.insert(vec.begin() + 5, 6);
        }
    }
}

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

void orderCoins() {
    vec.clear();
    int used[7] = { 0 };
    left[0] = getLightest(1, 2, 3);
    left[1] = getMedian(1, 2, 3);

    ++used[left[0]];
    ++used[left[1]];
    for (int i = 1; i <= 3; ++i)
    {
        if (!used[i])
            left[2] = i;
    }

    for (int i = 0; i < 3; ++i)
    {
        vec.push_back(left[i]);
    }

    check4();
    check5();
    check6();

    for (int i = 0; i < 6; ++i)
    {
        ans[i] = vec[i];
    }

    answer(ans);
}

Compilation message

In file included from grader.c:2:0:
graderlib.c: In function 'void answer(int*)':
graderlib.c:53:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
     if (_ghksjhdfkae19ga_ > 1) 
     ^~
graderlib.c:56:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  for (i = 0; i < 6; i++) {
  ^~~
scales.cpp: In function 'void init(int)':
scales.cpp:125:15: warning: unused parameter 'T' [-Wunused-parameter]
 void init(int T) {
               ^

Subtask #1
55.555556 / 100.0

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