Submission #619281

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
619281	2022-08-02T10:54:47 Z	A_D	Scales (IOI15_scales)	C++14	45.4545 / 100	1 ms	288 KB

scales

#include "scales.h"

#include <bits/stdc++.h>

using namespace std;
void init(int T) {
    /* ... */
}

void orderCoins() {

    set<int> meeee;
    for(int i=1;i<=6;i++)meeee.insert(i);
    int W[] = {6, 6, 6, 6, 6, 6};

    int cnt=0;

    int u=getLightest(1,2,3);
    int v=getLightest(4,5,6);
    set<int> st;
    st.insert(1);st.insert(2);st.insert(3);st.insert(4);st.insert(5);st.insert(6);
    st.erase(u);st.erase(v);
    int c=getLightest(u,v,*st.begin());
    int he=c;
    W[cnt++]=c;

    if(meeee.find(c)==meeee.end()){
   //     answer(W);
     //   return;
    }
    meeee.erase(c);
    vector<int> vec;
    for(auto x:meeee)vec.push_back(x);

    u=getLightest(vec[0],vec[1],vec[2]);
    c=getLightest(vec[3],vec[4],u);
    W[cnt++]=c;
    meeee.erase(c);
    if(meeee.find(c)==meeee.end()){
  //      answer(W);
   //     return;
    }

    vec.clear();
    for(auto x:meeee)vec.push_back(x);
    int vv=vec[0];
    u=getLightest(vec[0],vec[1],vec[2]);
    if(vv==u)vv=vec[1];
    c=getLightest(vec[3],vv,u);

    W[cnt++]=c;
    if(meeee.find(c)==meeee.end()){
  //      answer(W);
//        return;
    }
    meeee.erase(c);


    vec.clear();
    for(auto x:meeee)vec.push_back(x);

    c=getLightest(vec[0],vec[1],vec[2]);


    W[cnt++]=c;
    if(meeee.find(c)==meeee.end()){
    //    answer(W);
      //  return;
    }
    meeee.erase(c);


    vec.clear();
    for(auto x:meeee)vec.push_back(x);


    u=getMedian(vec[0],vec[1],he);

    W[cnt++]=u;
    if(meeee.find(u)==meeee.end()){
//        answer(W);
  //      return;
    }
    meeee.erase(u);

    W[cnt]=*meeee.begin();

    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	0 ms	212 KB	Output is partially correct
2	Partially correct	0 ms	212 KB	Output is partially correct
3	Partially correct	0 ms	212 KB	Output is partially correct
4	Partially correct	0 ms	212 KB	Output is partially correct
5	Partially correct	0 ms	212 KB	Output is partially correct
6	Partially correct	1 ms	212 KB	Output is partially correct
7	Partially correct	0 ms	212 KB	Output is partially correct
8	Partially correct	1 ms	212 KB	Output is partially correct
9	Partially correct	0 ms	212 KB	Output is partially correct
10	Partially correct	1 ms	212 KB	Output is partially correct
11	Partially correct	1 ms	212 KB	Output is partially correct
12	Partially correct	0 ms	212 KB	Output is partially correct
13	Partially correct	1 ms	212 KB	Output is partially correct
14	Partially correct	0 ms	212 KB	Output is partially correct
15	Partially correct	0 ms	212 KB	Output is partially correct
16	Partially correct	0 ms	212 KB	Output is partially correct
17	Partially correct	0 ms	212 KB	Output is partially correct
18	Partially correct	0 ms	212 KB	Output is partially correct
19	Partially correct	0 ms	212 KB	Output is partially correct
20	Partially correct	0 ms	212 KB	Output is partially correct
21	Partially correct	0 ms	212 KB	Output is partially correct
22	Partially correct	1 ms	212 KB	Output is partially correct
23	Partially correct	0 ms	212 KB	Output is partially correct
24	Partially correct	0 ms	212 KB	Output is partially correct
25	Partially correct	1 ms	212 KB	Output is partially correct
26	Partially correct	0 ms	212 KB	Output is partially correct
27	Partially correct	0 ms	212 KB	Output is partially correct
28	Partially correct	1 ms	212 KB	Output is partially correct
29	Partially correct	0 ms	212 KB	Output is partially correct
30	Partially correct	0 ms	212 KB	Output is partially correct
31	Partially correct	0 ms	212 KB	Output is partially correct
32	Partially correct	1 ms	212 KB	Output is partially correct
33	Partially correct	0 ms	212 KB	Output is partially correct
34	Partially correct	0 ms	212 KB	Output is partially correct
35	Partially correct	0 ms	212 KB	Output is partially correct
36	Partially correct	0 ms	212 KB	Output is partially correct
37	Partially correct	0 ms	288 KB	Output is partially correct
38	Partially correct	0 ms	212 KB	Output is partially correct
39	Partially correct	0 ms	212 KB	Output is partially correct
40	Partially correct	0 ms	212 KB	Output is partially correct