oj.uz

Submission #31256

# Submission time Handle Problem Language Result Execution time Memory
31256 2017-08-16T13:54:58 Z top34051 Scales (IOI15_scales) C++14
38.7019 / 100
 0 ms 2024 KB 
#include "scales.h"
#include<bits/stdc++.h>
using namespace std;

int A[5], B[5], p[5];

void init(int T) {
}

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

    A[0] = getLightest(1,2,3);
    A[1] = getMedian(1,2,3);
    for(x=1;x<=3;x++) if(x!=A[0] && x!=A[1]) A[2] = x;

    B[0] = getLightest(4,5,6);
    B[1] = getMedian(4,5,6);
    for(x=4;x<=6;x++) if(x!=B[0] && x!=B[1]) B[2] = x;

    for(i=0;i<3;i++) {
        if(i && p[i-1]==-1) {
            p[i] = -1;
            continue;
        }
        p[i] = getNextLightest(A[0],A[1],A[2],B[i]);
        if(p[i]==A[0] && getLightest(A[0],A[1],B[i])!=B[i]) p[i] = -1;
    }

    pos = 0;
    for(i=j=0;i<3;i++) {
        while(j<3 && p[j]==A[i]) W[pos++] = B[j++];
        W[pos++] = A[i];
    }
    while(j<3) W[pos++] = B[j++];

//    for(i=0;i<6;i++) cerr << W[i] << " ";
//    cerr << endl;

    answer(W);
}

Compilation message

scales.cpp:7:15: warning: unused parameter 'T' [-Wunused-parameter]
 void init(int T) {
               ^

Subtask #1
38.701923 / 100.0

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