Submission #358042

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
358042	2021-01-25T05:27:51 Z	tengiz05	Scales (IOI15_scales)	C++17	55.5556 / 100	1 ms	512 KB

scales

#include "scales.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
void init(int T){
}
void print(int a[]){
	for(int i=1;i<=6;i++)cout << a[i] << ' ';
	cout << '\n';
	return;
}
void orderCoins(){
	int a[10] = {0,0,0,0,0,0,0,0,0,0};
	int ans[6] = {1,2,3,4,5,6};
	vector<int> remain = {1,2,3,4,5,6};
	a[7] = getLightest(1,2,3);
	a[8] = getLightest(4,5,6);
	int t = getLightest(a[7], a[8], (a[7]==1)?2:1);
	a[1] = t;
	remain.erase(find(remain.begin(),remain.end(),a[1]));
	if(a[1] <= 3){
		a[2] = getLightest(remain[0],remain[1],a[8]);
	}else {
		a[2] = getLightest(remain[3],remain[4],a[7]);
	}remain.erase(find(remain.begin(),remain.end(),a[2]));
	//~ print(a);
	a[3] = getHeaviest(remain[0],remain[1],remain[2]);
	a[6] = getHeaviest(remain[3],a[1],a[3]);
	remain.erase(find(remain.begin(),remain.end(),a[6]));
	a[5] = getHeaviest(remain[0],remain[1],remain[2]);
	remain.erase(find(remain.begin(),remain.end(),a[5]));
	a[3] = getLightest(remain[0],remain[1],a[6]);
	remain.erase(find(remain.begin(),remain.end(),a[3]));
	assert(remain.size() == 1);
	a[4] = remain[0];
	//~ print(a);
	for(int i=0;i<6;i++)ans[i] = a[i+1];
	answer(ans);
	return;
}

Compilation message

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

Subtask #1

55.555556 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	1 ms	364 KB	Output is partially correct
2	Partially correct	1 ms	364 KB	Output is partially correct
3	Partially correct	1 ms	364 KB	Output is partially correct
4	Partially correct	1 ms	364 KB	Output is partially correct
5	Partially correct	1 ms	364 KB	Output is partially correct
6	Partially correct	1 ms	512 KB	Output is partially correct
7	Partially correct	1 ms	364 KB	Output is partially correct
8	Partially correct	1 ms	364 KB	Output is partially correct
9	Partially correct	1 ms	364 KB	Output is partially correct
10	Partially correct	1 ms	364 KB	Output is partially correct
11	Partially correct	0 ms	364 KB	Output is partially correct
12	Partially correct	1 ms	364 KB	Output is partially correct
13	Partially correct	1 ms	364 KB	Output is partially correct
14	Partially correct	1 ms	364 KB	Output is partially correct
15	Partially correct	1 ms	364 KB	Output is partially correct
16	Partially correct	1 ms	384 KB	Output is partially correct
17	Partially correct	1 ms	364 KB	Output is partially correct
18	Partially correct	1 ms	364 KB	Output is partially correct
19	Partially correct	0 ms	364 KB	Output is partially correct
20	Partially correct	1 ms	364 KB	Output is partially correct
21	Partially correct	1 ms	364 KB	Output is partially correct
22	Partially correct	1 ms	364 KB	Output is partially correct
23	Partially correct	1 ms	364 KB	Output is partially correct
24	Partially correct	1 ms	492 KB	Output is partially correct
25	Partially correct	0 ms	364 KB	Output is partially correct
26	Partially correct	1 ms	364 KB	Output is partially correct
27	Partially correct	1 ms	364 KB	Output is partially correct
28	Partially correct	1 ms	364 KB	Output is partially correct
29	Partially correct	1 ms	364 KB	Output is partially correct
30	Partially correct	1 ms	364 KB	Output is partially correct
31	Partially correct	1 ms	364 KB	Output is partially correct
32	Partially correct	1 ms	364 KB	Output is partially correct
33	Partially correct	1 ms	384 KB	Output is partially correct
34	Partially correct	1 ms	364 KB	Output is partially correct
35	Partially correct	1 ms	364 KB	Output is partially correct
36	Partially correct	1 ms	364 KB	Output is partially correct
37	Partially correct	1 ms	364 KB	Output is partially correct
38	Partially correct	1 ms	364 KB	Output is partially correct
39	Partially correct	1 ms	364 KB	Output is partially correct
40	Partially correct	1 ms	364 KB	Output is partially correct