Submission #68380

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
68380	2018-08-17T02:09:12 Z	AlphaRazra	Scales (IOI15_scales)	C++14	33.3333 / 100	4 ms	880 KB

scales

#include<bits/stdc++.h>
#include "scales.h"
using namespace std;

int jawab[7];
bool sudah[7];

void init(int T) {

}

void orderCoins() {
	memset(sudah, false, sizeof(sudah));
	int W[6];
	
	int a[3], b[3];

	a[0] = getLightest(1, 2, 3);
	a[1] = getMedian(1, 2, 3);
	a[2] = getHeaviest(1, 2, 3);
	b[0] = getLightest(4, 5, 6);
	b[1] = getMedian(4, 5, 6);
	b[2] = getHeaviest(4, 5, 6);

	int halo = getLightest(a[0], b[0], a[2]);
	int ringan;
	if(halo == a[0]){
		jawab[a[0]] = 1;
		ringan = a[0];
		sudah[a[0]] = true;
	}else if(halo == b[0]){
		jawab[b[0]] = 1;
		ringan = b[0];
		sudah[b[0]] = true;
	}

	int idx1 = 2, idx2 = 2;
	int haha = 6;
	while(true){
		int now = getHeaviest(a[idx1], b[idx2], ringan);
		if(now == a[idx1]){
			jawab[a[idx1]] = haha;
			sudah[a[idx1]] = true;
			haha--;
			idx1--;
			if(sudah[a[idx1]] || idx1 == -1){
				break;
			}
		}else if(now == b[idx2]){
			jawab[b[idx2]] = haha;
			sudah[b[idx2]] = true;
			haha--;
			idx2--;
			if(sudah[b[idx2]] || idx2 == -1){
				break;
			}
		}
	}
	if(sudah[a[idx1]] || idx1 == -1){
		while(!sudah[b[idx2]] && idx2 > -1){
			jawab[b[idx2]] = haha;
			sudah[b[idx2]] = true;
			haha--;
			idx2--;
		}
	}else{
		while(!sudah[a[idx1]] && idx1 > -1){
			jawab[a[idx1]] = haha;
			sudah[a[idx1]] = true;
			haha--;
			idx1--;
		}
	}

	for(int i = 1; i <= 6; i++){
		W[jawab[i] - 1] = i;
	}

	answer(W);
}

Compilation message

In file included from grader.c:2:0:
graderlib.c: In function 'void answer(int*)':
graderlib.c:53:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
     if (_ghksjhdfkae19ga_ > 1) 
     ^~
graderlib.c:56:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  for (i = 0; i < 6; i++) {
  ^~~
scales.cpp: In function 'void init(int)':
scales.cpp:8:15: warning: unused parameter 'T' [-Wunused-parameter]
 void init(int T) {
               ^
scales.cpp: In function 'void orderCoins()':
scales.cpp:40:49: warning: 'ringan' may be used uninitialized in this function [-Wmaybe-uninitialized]
   int now = getHeaviest(a[idx1], b[idx2], ringan);
                                                 ^

Subtask #1

33.333333 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	2 ms	376 KB	Output is partially correct
2	Partially correct	3 ms	376 KB	Output is partially correct
3	Partially correct	3 ms	480 KB	Output is partially correct
4	Partially correct	2 ms	500 KB	Output is partially correct
5	Partially correct	2 ms	552 KB	Output is partially correct
6	Partially correct	2 ms	552 KB	Output is partially correct
7	Partially correct	2 ms	608 KB	Output is partially correct
8	Partially correct	2 ms	684 KB	Output is partially correct
9	Partially correct	2 ms	684 KB	Output is partially correct
10	Partially correct	2 ms	684 KB	Output is partially correct
11	Partially correct	2 ms	684 KB	Output is partially correct
12	Partially correct	4 ms	684 KB	Output is partially correct
13	Partially correct	3 ms	684 KB	Output is partially correct
14	Partially correct	3 ms	684 KB	Output is partially correct
15	Partially correct	3 ms	684 KB	Output is partially correct
16	Partially correct	3 ms	684 KB	Output is partially correct
17	Partially correct	3 ms	684 KB	Output is partially correct
18	Partially correct	2 ms	684 KB	Output is partially correct
19	Partially correct	2 ms	800 KB	Output is partially correct
20	Partially correct	3 ms	800 KB	Output is partially correct
21	Partially correct	3 ms	800 KB	Output is partially correct
22	Partially correct	3 ms	800 KB	Output is partially correct
23	Partially correct	3 ms	800 KB	Output is partially correct
24	Partially correct	2 ms	832 KB	Output is partially correct
25	Partially correct	2 ms	832 KB	Output is partially correct
26	Partially correct	2 ms	832 KB	Output is partially correct
27	Partially correct	4 ms	832 KB	Output is partially correct
28	Partially correct	3 ms	840 KB	Output is partially correct
29	Partially correct	2 ms	840 KB	Output is partially correct
30	Partially correct	3 ms	840 KB	Output is partially correct
31	Partially correct	3 ms	840 KB	Output is partially correct
32	Partially correct	3 ms	840 KB	Output is partially correct
33	Partially correct	3 ms	840 KB	Output is partially correct
34	Partially correct	2 ms	880 KB	Output is partially correct
35	Partially correct	3 ms	880 KB	Output is partially correct
36	Partially correct	2 ms	880 KB	Output is partially correct
37	Partially correct	2 ms	880 KB	Output is partially correct
38	Partially correct	2 ms	880 KB	Output is partially correct
39	Partially correct	2 ms	880 KB	Output is partially correct
40	Partially correct	3 ms	880 KB	Output is partially correct