Submission #415204

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
415204	2021-05-31T16:40:00 Z	victoriad	Scales (IOI15_scales)	C++14	45.4545 / 100	2 ms	204 KB

scales

#include "scales.h"
#include <vector>
using namespace std;
void init(int T) {
    /* ... */
}

void orderCoins() {
    vector<bool>co(7,false);
    int ANS[6];
    int g1[3];
    int a=getLightest(1,2,3);
    g1[0]=a;
    co[a]=true;
    a=getMedian(1,2,3);
    g1[1]=a;
    co[a]=true;
    for(int i=1;i<4;i++)if(!co[i])g1[2]=i;
    int g2[3];
     a=getLightest(4,5,6);
    g2[0]=a;
    co[a]=true;
    a=getMedian(4,5,6);
    g2[1]=a;
    co[a]=true;
    for(int i=4;i<7;i++)if(!co[i])g2[2]=i;
    int x1=0,x2=0;
    while(x1<3 && x2<3){
    if(x1!=2){
    int l=getLightest(g1[x1],g1[x1+1],g2[x2]);
    ANS[x1+x2]=l;
    if(l<=3)x1++;
    else x2++;
    }
    else if(x2!=2){
        int l=getLightest(g1[x1],g2[x2+1],g2[x2]);
        ANS[x1+x2]=l;
        if(l<=3)x1++;
        else x2++;
    }
    else{
        int l=getHeaviest(g1[2],g2[2],g1[0]);
        ANS[5]=l;
        if(l==g1[2])ANS[4]=g2[2];
        else ANS[4]=g1[2];
        x1++;
        x2++;
    }
    
    }
    if(x1!=3){
        for(int i=x1;i<3;i++){
            ANS[i+3]=g1[i];
        }
    }
    if(x2!=3){
        for(int i=x2;i<3;i++){
            ANS[i+3]=g2[i];
        }
    }
    answer(ANS);
    
}

Compilation message

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

Subtask #1

45.454545 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	1 ms	204 KB	Output is partially correct
2	Partially correct	1 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	2 ms	204 KB	Output is partially correct
7	Partially correct	1 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	1 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	1 ms	204 KB	Output is partially correct
16	Partially correct	1 ms	204 KB	Output is partially correct
17	Partially correct	1 ms	204 KB	Output is partially correct
18	Partially correct	1 ms	204 KB	Output is partially correct
19	Partially correct	1 ms	204 KB	Output is partially correct
20	Partially correct	1 ms	204 KB	Output is partially correct
21	Partially correct	1 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	1 ms	204 KB	Output is partially correct
26	Partially correct	1 ms	204 KB	Output is partially correct
27	Partially correct	1 ms	204 KB	Output is partially correct
28	Partially correct	1 ms	204 KB	Output is partially correct
29	Partially correct	1 ms	204 KB	Output is partially correct
30	Partially correct	1 ms	204 KB	Output is partially correct
31	Partially correct	1 ms	204 KB	Output is partially correct
32	Partially correct	1 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	1 ms	204 KB	Output is partially correct
36	Partially correct	1 ms	204 KB	Output is partially correct
37	Partially correct	1 ms	204 KB	Output is partially correct
38	Partially correct	1 ms	204 KB	Output is partially correct
39	Partially correct	1 ms	204 KB	Output is partially correct
40	Partially correct	1 ms	204 KB	Output is partially correct