Submission #154247

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
154247	2019-09-19T14:11:05 Z	popovicirobert	Scales (IOI15_scales)	C++14	55.5556 / 100	8 ms	376 KB

scales

#include "scales.h"
#include <bits/stdc++.h>

using namespace std;

void init(int T) {

}

void orderCoins() {
    vector <int> a, b;
    int z = getHeaviest(1, 2, 3), x = getLightest(1, 2, 3);
    int y = 6 - x - z;
    a = {x, y, z};

    z = getHeaviest(4, 5, 6), x = getLightest(4, 5, 6);
    y = 15 - x - z;
    b = {x, y, z};

    int mx = getHeaviest(a[0], a[2], b[2]);
    int sol[6], i;

    if(mx == a[2]) {
        vector <int> pos(3);
        for(i = 0; i < 3; i++) {
            pos[i] = getNextLightest(a[0], a[1], a[2], b[i]);
        }
        int p = 0, sz = 0;
        for(i = 0; i < 3; i++) {
            while(p < 3 && pos[p] == a[i]) {
                sol[sz++] = b[p++];
            }
            sol[sz++] = a[i];
        }
    }
    else {
        vector <int> pos(3);
        for(i = 0; i < 3; i++) {
            pos[i] = getNextLightest(b[0], b[1], b[2], a[i]);
        }
        int p = 0, sz = 0;
        for(i = 0; i < 3; i++) {
            while(p < 3 && pos[p] == b[i]) {
                sol[sz++] = a[p++];
            }
            sol[sz++] = b[i];
        }
    }

    answer(sol);
}

Compilation message

scales.cpp: In function 'void init(int)':
scales.cpp:6: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	256 KB	Output is partially correct
2	Partially correct	2 ms	376 KB	Output is partially correct
3	Partially correct	2 ms	376 KB	Output is partially correct
4	Partially correct	2 ms	292 KB	Output is partially correct
5	Partially correct	2 ms	256 KB	Output is partially correct
6	Partially correct	2 ms	256 KB	Output is partially correct
7	Partially correct	2 ms	256 KB	Output is partially correct
8	Partially correct	2 ms	348 KB	Output is partially correct
9	Partially correct	2 ms	256 KB	Output is partially correct
10	Partially correct	2 ms	256 KB	Output is partially correct
11	Partially correct	2 ms	376 KB	Output is partially correct
12	Partially correct	2 ms	376 KB	Output is partially correct
13	Partially correct	2 ms	256 KB	Output is partially correct
14	Partially correct	2 ms	256 KB	Output is partially correct
15	Partially correct	2 ms	256 KB	Output is partially correct
16	Partially correct	2 ms	256 KB	Output is partially correct
17	Partially correct	2 ms	256 KB	Output is partially correct
18	Partially correct	2 ms	256 KB	Output is partially correct
19	Partially correct	2 ms	256 KB	Output is partially correct
20	Partially correct	2 ms	256 KB	Output is partially correct
21	Partially correct	2 ms	256 KB	Output is partially correct
22	Partially correct	2 ms	256 KB	Output is partially correct
23	Partially correct	8 ms	376 KB	Output is partially correct
24	Partially correct	2 ms	256 KB	Output is partially correct
25	Partially correct	0 ms	376 KB	Output is partially correct
26	Partially correct	2 ms	376 KB	Output is partially correct
27	Partially correct	2 ms	376 KB	Output is partially correct
28	Partially correct	2 ms	376 KB	Output is partially correct
29	Partially correct	2 ms	252 KB	Output is partially correct
30	Partially correct	2 ms	376 KB	Output is partially correct
31	Partially correct	2 ms	256 KB	Output is partially correct
32	Partially correct	2 ms	376 KB	Output is partially correct
33	Partially correct	2 ms	376 KB	Output is partially correct
34	Partially correct	3 ms	376 KB	Output is partially correct
35	Partially correct	2 ms	256 KB	Output is partially correct
36	Partially correct	2 ms	376 KB	Output is partially correct
37	Partially correct	2 ms	256 KB	Output is partially correct
38	Partially correct	2 ms	256 KB	Output is partially correct
39	Partially correct	0 ms	256 KB	Output is partially correct
40	Partially correct	2 ms	376 KB	Output is partially correct