Submission #299022

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
299022	2020-09-14T12:17:12 Z	BlancaHM	Scales (IOI15_scales)	C++14	0 / 100	1 ms	400 KB

scales

#include <iostream>
#include <fstream>
#include <cfloat>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstring>
#include <cmath>
#include <climits>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include "scales.h"
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<string> vs;
#define fir first
#define sec second
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define mp make_pair
#define len(v) ((int)v.size())
#define all(v) v.begin(), v.end()

void init(int T) {
	return;
}

void orderCoins() {
	int W[6];
	int heavy1 = getHeaviest(1, 2, 3);
	int heavy2 = getHeaviest(4, 5, 6);
	int light1 = getLightest(1, 2, 3);
	int light2 = getLightest(4, 5, 6);
	int median1 = 6 - (heavy1+light1);
	int median2 = 15 - (heavy2+light2);
	int q1 = getMedian(heavy1, heavy2, median1);
	if (q1 == heavy1) {
		W[0] = heavy2;
		// heavy2 > heavy1 > median1 > light1
		int q2 = getMedian(median1, median2, heavy1);
		int q3 = getLightest(light1, light2, median1);
		if (q2 == median1) {
			// heavy2 > heavy1 > median1 > median2
			W[1] = heavy1;
			W[2] = median1;
			W[3] = median2;
		} else if (q2 == heavy1) {
			// heavy2 > median2 > heavy1 > median1
			W[1] = median2;
			W[2] = heavy1;
			W[3] = median1;
		} else {
			// heavy2 > heavy1 > median2 > median1
			W[1] = heavy1;
			W[2] = median2;
			W[3] = median1;
		}
		if (q3 == light1) {
			W[4] = light2;
			W[5] = light1;
		} else {
			W[4] = light1;
			W[5] = light2;
		}
	} else if (q1 == heavy2) {
		W[0] = heavy1;
		W[1] = heavy2;
		// heavy1 > heavy2 > median1 > light1
		int q2 = getMedian(median1, median2, light1);
		if (q2 == median1) {
			// heavy1 > heavy2 > median2 > median1 > light1
			W[2] = median2;
			W[3] = median1;
			// find lightest of light1 and light2
			int q3 = getLightest(light1, light2, median1);
			if (q3 == light1) {
				W[4] = light2;
				W[5] = light1;
			} else {
				W[4] = light1;
				W[5] = light2;
			}
		} else if (q2 == light1) {
			// heavy1 > heavy2 > median1 > light1 > median2 > light2
			W[2] = median1;
			W[3] = light1;
			W[4] = median2;
			W[5] = light2;
		} else {
			W[2] = median1;
			W[3] = median2;
			// find lightest of light1/2
			int q3 = getLightest(light1, light2, median1);
			if (q3 == light1) {
				W[4] = light2;
				W[5] = light1;
			} else {
				W[4] = light1;
				W[5] = light2;
			}
		}
	} else {
		// heavy1 > median1 > heavy2 > median2 > light2
		W[0] = heavy1;
		W[1] = median1;
		int q2 = getNextLightest(heavy2, median2, light2, light1);
		if (q2 == median2) {
			W[2] = heavy2;
			W[3] = median2;
			W[4] = light1;
			W[5] = light2;
		} else if (q2 == heavy2) {
			W[2] = heavy2;
			W[3] = light1;
			W[4] = median2;
			W[5] = light2;
		} else {
			// either > H2 or < L2
			int q3 = getMedian(heavy2, light2, light1);
			if (q3 == heavy2) {
				W[2] = light1;
				W[3] = heavy2;
				W[4] = median2;
				W[5] = light2;
			} else {
				W[2] = heavy2;
				W[3] = median2;
				W[4] = light2;
				W[5] = light1;
			}
		}
	}
	answer(W);
}

Compilation message

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

Subtask #1

0.0 / 100.0

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