Submission #388892

# Submission time Handle Problem Language Result Execution time Memory
388892 2021-04-13T09:01:46 Z MeGustaElArroz23 Scales (IOI15_scales) C++14
45.4545 / 100
1 ms 208 KB
#include<bits/stdc++.h>
#include "scales.h"
using namespace std;

typedef vector<int> vi;


void init(int T){ return;}

void orderCoins(){
    vi a={1,2,3},b={4,5,6};
    vi sola(3),solb(3);

    sola[0]=getLightest(1,2,3);
    sola[1]=getMedian(1,2,3);
    if (sola[0]+sola[1]==4) sola[2]=2;
    else if (sola[0]+sola[1]==5) sola[2]=1;
    else sola[2]=3;

    solb[0]=getLightest(4,5,6);
    solb[1]=getMedian(4,5,6);
    if (solb[0]+solb[1]==9) solb[2]=6;
    else if (solb[0]+solb[1]==11) solb[2]=4;
    else solb[2]=5;

    int sol[6];

    int aux=sola[2];
    int i=0,j=0;
    while (i+j<4 and i<3 and j<3){
        sol[i+j]=getLightest(sola[i],solb[j],aux);
        if (sol[i+j]==sola[i]) i++;
        else j++;
        if (i==2) aux=solb[2];
    }
    if (i==3){
        while (j<3){
            sol[i+j]=solb[j];
            j++;
        }
    }
    else if (j==3){
        while (i<3){
            sol[i+j]=sola[i];
            i++;
        }
    }
    else{
        sol[5]=getHeaviest(sola[0],sola[2],solb[2]);
        if (sol[5]==sola[2]) sol[4]=solb[2];
        else sol[4]=sola[2];
    }
    answer(sol);
    return;
}

Compilation message

scales.cpp: In function 'void init(int)':
scales.cpp:8:15: warning: unused parameter 'T' [-Wunused-parameter]
    8 | void init(int T){ return;}
      |           ~~~~^
# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Partially correct 0 ms 204 KB Output is partially correct
3 Partially correct 1 ms 204 KB Output is partially correct
4 Partially correct 1 ms 204 KB Output is partially correct
5 Partially correct 1 ms 204 KB Output is partially correct
6 Partially correct 1 ms 204 KB Output is partially correct
7 Partially correct 0 ms 204 KB Output is partially correct
8 Partially correct 1 ms 204 KB Output is partially correct
9 Partially correct 1 ms 204 KB Output is partially correct
10 Partially correct 0 ms 204 KB Output is partially correct
11 Partially correct 1 ms 204 KB Output is partially correct
12 Partially correct 1 ms 204 KB Output is partially correct
13 Partially correct 1 ms 204 KB Output is partially correct
14 Partially correct 1 ms 204 KB Output is partially correct
15 Partially correct 0 ms 204 KB Output is partially correct
16 Partially correct 0 ms 204 KB Output is partially correct
17 Partially correct 0 ms 204 KB Output is partially correct
18 Partially correct 0 ms 204 KB Output is partially correct
19 Partially correct 0 ms 204 KB Output is partially correct
20 Partially correct 1 ms 204 KB Output is partially correct
21 Partially correct 0 ms 204 KB Output is partially correct
22 Partially correct 1 ms 204 KB Output is partially correct
23 Partially correct 1 ms 204 KB Output is partially correct
24 Partially correct 1 ms 204 KB Output is partially correct
25 Partially correct 0 ms 204 KB Output is partially correct
26 Partially correct 1 ms 204 KB Output is partially correct
27 Partially correct 0 ms 204 KB Output is partially correct
28 Partially correct 0 ms 204 KB Output is partially correct
29 Partially correct 0 ms 204 KB Output is partially correct
30 Partially correct 0 ms 204 KB Output is partially correct
31 Partially correct 0 ms 208 KB Output is partially correct
32 Partially correct 0 ms 204 KB Output is partially correct
33 Partially correct 1 ms 204 KB Output is partially correct
34 Partially correct 1 ms 204 KB Output is partially correct
35 Partially correct 0 ms 204 KB Output is partially correct
36 Partially correct 0 ms 204 KB Output is partially correct
37 Partially correct 0 ms 204 KB Output is partially correct
38 Partially correct 0 ms 204 KB Output is partially correct
39 Partially correct 0 ms 204 KB Output is partially correct
40 Partially correct 1 ms 204 KB Output is partially correct