Submission #579074

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
579074	2022-06-18T11:13:25 Z	CSQ31	Scales (IOI15_scales)	C++17	55.5556 / 100	1 ms	304 KB

scales

#include "scales.h"
#include <bits/stdc++.h>
using namespace std;
void init(int T) {
    /* ... */
}
void orderCoins(){
	int W[6] = {0,0,0,0,0,0};
	int x = getLightest(1,2,3);
	int y = getLightest(4,5,6);
	W[0] = getLightest(x,y,(y==6?5:6));
	vector<int>c;
	for(int i=1;i<=6;i++){
		if(i!=x && i!=y)c.push_back(i);
	}
	y = getHeaviest(c[0],c[1],c[2]);
	W[5] = getHeaviest(x,y,c[3]);
	
	vector<int>v;
	for(int i=1;i<=6;i++){
		if(i!=W[0] && i!=W[5])v.push_back(i);
	}
	
	x = getMedian(v[0],v[1],v[2]);
	if(v[2] == x)swap(v[1],v[2]);
	if(v[0] == x)swap(v[1],v[0]);
	y = getNextLightest(v[0],v[2],v[3],v[1]);
	if(y == v[3]){
		//a b c d
		//(b,d) = 2,3
		W[2] = v[1];
		W[3] = v[3];
		W[1] = getLightest(v[0],v[2],W[5]);
		if(W[1] == v[2])swap(v[0],v[2]);
		W[4] = v[2];
	}else{
		if(y==v[0])swap(v[0],v[2]);
		//a b c d
		//a d b c
		//d a b c
		x = getNextLightest(v[0],v[1],W[5],v[3]);
		if(x==W[5]){
			W[1] = v[0];
			W[2] = v[1];
			W[3] = v[2];
			W[4] = v[3];
			
		}else if(x==v[1]){
			W[1] = v[0];
			W[2] = v[3];
			W[3] = v[1];
			W[4] = v[2];
			
		}else{
		    W[1] = v[3];
			W[2] = v[0];
			W[3] = v[1];
			W[4] = v[2];
		}
	}
	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

55.555556 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	1 ms	212 KB	Output is partially correct
2	Partially correct	1 ms	212 KB	Output is partially correct
3	Partially correct	1 ms	212 KB	Output is partially correct
4	Partially correct	1 ms	212 KB	Output is partially correct
5	Partially correct	1 ms	300 KB	Output is partially correct
6	Partially correct	1 ms	300 KB	Output is partially correct
7	Partially correct	1 ms	212 KB	Output is partially correct
8	Partially correct	1 ms	212 KB	Output is partially correct
9	Partially correct	1 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	1 ms	212 KB	Output is partially correct
13	Partially correct	1 ms	300 KB	Output is partially correct
14	Partially correct	1 ms	212 KB	Output is partially correct
15	Partially correct	1 ms	212 KB	Output is partially correct
16	Partially correct	1 ms	212 KB	Output is partially correct
17	Partially correct	1 ms	212 KB	Output is partially correct
18	Partially correct	1 ms	296 KB	Output is partially correct
19	Partially correct	1 ms	212 KB	Output is partially correct
20	Partially correct	1 ms	212 KB	Output is partially correct
21	Partially correct	1 ms	212 KB	Output is partially correct
22	Partially correct	1 ms	212 KB	Output is partially correct
23	Partially correct	1 ms	212 KB	Output is partially correct
24	Partially correct	1 ms	292 KB	Output is partially correct
25	Partially correct	1 ms	296 KB	Output is partially correct
26	Partially correct	1 ms	272 KB	Output is partially correct
27	Partially correct	1 ms	212 KB	Output is partially correct
28	Partially correct	1 ms	212 KB	Output is partially correct
29	Partially correct	1 ms	212 KB	Output is partially correct
30	Partially correct	1 ms	212 KB	Output is partially correct
31	Partially correct	1 ms	296 KB	Output is partially correct
32	Partially correct	1 ms	212 KB	Output is partially correct
33	Partially correct	1 ms	212 KB	Output is partially correct
34	Partially correct	1 ms	304 KB	Output is partially correct
35	Partially correct	1 ms	212 KB	Output is partially correct
36	Partially correct	1 ms	300 KB	Output is partially correct
37	Partially correct	1 ms	212 KB	Output is partially correct
38	Partially correct	1 ms	212 KB	Output is partially correct
39	Partially correct	1 ms	212 KB	Output is partially correct
40	Partially correct	1 ms	212 KB	Output is partially correct