Submission #472001

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
472001	2021-09-12T07:45:58 Z	nicholask	Scales (IOI15_scales)	C++14	71.4286 / 100	1 ms	204 KB

scales

#include "scales.h"
#include <bits/stdc++.h>
using namespace std;
void init(int T){}
int r1,r2,r3;
void orderCoins() {
	vector <int> ans;
	r1=getMedian(1,2,3);
	r2=getNextLightest(1,2,3,4);
	int n1=(r1==1?2:1);
	int n2=6-r1-n1;
	if (r1==r2){
		r3=getLightest(1,2,3);
		if (r3==n1){
			ans.push_back(n1);
			ans.push_back(4);
			ans.push_back(r1);
			ans.push_back(n2);
		} else {
			ans.push_back(n2);
			ans.push_back(4);
			ans.push_back(r1);
			ans.push_back(n1);
		}
	} else if (r2==n1){
		r3=getMedian(4,n1,r1);
		if (r3==4){
			ans.push_back(n2);
			ans.push_back(r1);
			ans.push_back(4);
			ans.push_back(n1);
		} else if (r3==n1){
			ans.push_back(4);
			ans.push_back(n1);
			ans.push_back(r1);
			ans.push_back(n2);
		} else {
			ans.push_back(n1);
			ans.push_back(r1);
			ans.push_back(n2);
			ans.push_back(4);
		}
	} else {
		r3=getMedian(4,n1,n2);
		if (r3==4){
			ans.push_back(n1);
			ans.push_back(r1);
			ans.push_back(4);
			ans.push_back(n2);
		} else if (r3==n1){
			ans.push_back(n2);
			ans.push_back(r1);
			ans.push_back(n1);
			ans.push_back(4);
		} else {
			ans.push_back(4);
			ans.push_back(n2);
			ans.push_back(r1);
			ans.push_back(n1);
		}
	}
	r1=getNextLightest(ans[0],ans[2],ans[3],5);
	if (r1==ans[0]){
		r1=getLightest(5,ans[0],ans[1]);
		if (r1==5) ans.insert(ans.begin(),5);
		else ans.push_back(5);
	} else if (r1==ans[2]){
		r1=getLightest(5,ans[1],ans[2]);
		if (r1==5) ans.insert(ans.begin()+1,5);
		else ans.insert(ans.begin()+2,5);
	} else {
		ans.insert(ans.begin()+3,5);
	}
	r1=getNextLightest(ans[0],ans[2],ans[4],6);
	if (r1==ans[0]){
		r1=getLightest(6,ans[0],ans[1]);
		if (r1==6) ans.insert(ans.begin(),6);
		else ans.push_back(6);
	} else if (r1==ans[2]){
		r1=getLightest(6,ans[1],ans[2]);
		if (r1==6) ans.insert(ans.begin()+1,6);
		else ans.insert(ans.begin()+2,6);
	} else {
		r1=getLightest(6,ans[3],ans[4]);
		if (r1==6) ans.insert(ans.begin()+3,6);
		else ans.insert(ans.begin()+4,6);
	}
	int W[6];
	for (int i=0; i<6; i++) W[i]=ans[i];
	answer(W);
}

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

71.428571 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	0 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	0 ms	204 KB	Output is partially correct
5	Partially correct	1 ms	204 KB	Output is partially correct
6	Partially correct	0 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	0 ms	204 KB	Output is partially correct
11	Partially correct	0 ms	204 KB	Output is partially correct
12	Partially correct	0 ms	204 KB	Output is partially correct
13	Partially correct	0 ms	204 KB	Output is partially correct
14	Partially correct	0 ms	204 KB	Output is partially correct
15	Partially correct	1 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	1 ms	204 KB	Output is partially correct
19	Partially correct	1 ms	204 KB	Output is partially correct
20	Partially correct	0 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	1 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	1 ms	204 KB	Output is partially correct
30	Partially correct	0 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	0 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	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