oj.uz

Submission #163616

# Submission time Handle Problem Language Result Execution time Memory
163616 2019-11-14T10:49:21 Z shenxy Scales (IOI15_scales) C++11
55.5556 / 100
 3 ms 508 KB 
#include "scales.h"
#include <cstdio>
#include <algorithm>
#include <deque>
using namespace std;
void init(int T) {

}
void orderCoins() {
	int W[6] = {1, 2, 3, 4, 5, 6};
	int x = getLightest(1, 2, 3);
	W[0] = x;
	x = getHeaviest(1, 2, 3);
	W[2] = x;
	for (int i = 1; i <= 3; ++i) {
		if (W[0] != i && W[2] != i) W[1] = i;
	}
	x = getLightest(4, 5, 6);
	W[3] = x;
	x = getHeaviest(4, 5, 6);
	W[5] = x;
	for (int i = 4; i <= 6; ++i) {
		if (W[3] != i && W[5] != i) W[4] = i;
	}
	deque<int> ans;
	if (getHeaviest(W[0], W[2], W[5]) == W[2]) {
		swap(W[0], W[3]);
		swap(W[1], W[4]);
		swap(W[2], W[5]);
	}
	int ptr = 5;
	for (int i = 2; i >= 0; --i) {
		x = getNextLightest(W[3], W[4], W[5], W[i]);
		if (x == W[5]) {
			while (ptr > 4) ans.push_front(W[ptr--]);
		} else if (x == W[4]) {
			while (ptr > 3) ans.push_front(W[ptr--]);
		} else {
			while (ptr > 2) ans.push_front(W[ptr--]);
			for (; i >= 0; --i) ans.push_front(W[i]);
			for (int j = 0; j < 6; ++j) W[j] = ans[j];
			answer(W);
			return;
		}
		ans.push_front(W[i]);
	}
	while (ptr > 2) ans.push_front(W[ptr--]);
	for (int i = 0; i < 6; ++i) W[i] = ans[i];
	answer(W);
}

Compilation message

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

Subtask #1
55.555556 / 100.0

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