oj.uz

Submission #384662

# Submission time Handle Problem Language Result Execution time Memory
384662 2021-04-02T03:46:27 Z qpwoeirut Scales (IOI15_scales) C++17
45.4545 / 100
 1 ms 364 KB 
#include "scales.h"
#include <bits/stdc++.h>

using namespace std;

void init(int T) {

}

void orderCoins() {
    int W[] = {1, 2, 3, 4, 5, 6};
    int mn1 = getLightest(1, 2, 3);
    int mn2 = getLightest(4, 5, 6);
    int other = 1;
    for (; other<=6 && (mn1 == other || mn2 == other); ++other);
    assert(mn1 != other && mn2 != other);
    W[0] = getLightest(mn1, mn2, other);

    vector<int> coins;
    for (int i=1; i<=6; ++i) if (i != W[0]) coins.push_back(i);
    assert(coins.size() == 5);

    mn1 = getLightest(coins[0], coins[1], coins[2]);
    W[1] = getLightest(coins[3], coins[4], mn1);
    coins.erase(find(coins.begin(), coins.end(), W[1]));

    mn1 = getLightest(coins[0], coins[1], coins[2]);
    W[2] = getLightest(coins[3], mn1, coins[0] == mn1 ? coins[1] : coins[0]);
    coins.erase(find(coins.begin(), coins.end(), W[2]));

    assert(coins.size() == 3);
    W[3] = getLightest(coins[0], coins[1], coins[2]);
    W[4] = getMedian(coins[0], coins[1], coins[2]);
    for (int i=0; i<3; ++i) {
        if (coins[i] != W[3] && coins[i] != W[4]) W[5] = coins[i];
    }

    answer(W);
}

Compilation message

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

Subtask #1
45.454545 / 100.0

# 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 1 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