#include "scales.h"
#include<bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define ll long long
#define pii pair<int, int>
using namespace std;
int i, a[10], k;
void init(int T) {
/* ... */
}
void orderCoins() {
a[0] = getLightest(1, 2, 3);
a[1] = getMedian(1, 2, 3);
for(i = 1; i <= 3; i++)
if(i != a[0] && i != a[1]) a[2] = i;
k = getNextLightest(1, 2, 3, 4);
if(k == a[1]) a[3] = a[2], a[2] = a[1], a[1] = 4;
else if(k == a[2]) a[3] = a[2], a[2] = 4;
else
{
k = getLightest(a[0], a[1], 4);
if(k == 4) a[3] = a[2], a[2] = a[1], a[1] = a[0], a[0] = 4;
else a[3] = 4;
}
k = getNextLightest(a[0], a[1], a[2], 5);
if(k == a[1]) a[4] = a[3], a[3] = a[2], a[2] = a[1], a[1] = 5;
else if(k == a[2]) a[4] = a[3], a[3] = a[2], a[2] = 5;
else
{
k = getMedian(a[0], a[3], 5);
if(k == a[0]) a[4] = a[3], a[3] = a[2], a[2] = a[1], a[1] = a[0], a[0] = 5;
else if(k == a[3]) a[4] = 5;
else a[4] = a[3], a[3] = 5;
}
k = getNextLightest(a[0], a[2], a[4], 6);
if(k == a[2])
{
k = getLightest(a[1], a[2], 6);
if(k == a[1]) a[5] = a[4], a[4] = a[3], a[3] = a[2], a[2] = 6;
else a[5] = a[4], a[4] = a[3], a[3] = a[2], a[2] = a[1], a[1] = 6;
}
else if(k == a[4])
{
k = getLightest(a[3], a[4], 6);
if(k == a[3]) a[5] = a[4], a[4] = 6;
else a[5] = a[4], a[4] = a[3], a[3] = 6;
}
else
{
k = getLightest(a[0], a[4], 6);
if(k == a[0]) a[5] = 6;
else a[5] = a[4], a[4] = a[3], a[3] = a[2], a[2] = a[1], a[1] = a[0], a[0] = 6;
}
int W[] = {a[0], a[1], a[2], a[3], a[4], a[5]};
answer(W);
}
Compilation message
scales.cpp: In function 'void init(int)':
scales.cpp:12:15: warning: unused parameter 'T' [-Wunused-parameter]
12 | void init(int T) {
| ~~~~^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
2 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
3 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
4 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
5 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
6 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
7 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
8 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
9 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
10 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
11 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
12 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
13 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
14 |
Partially correct |
1 ms |
212 KB |
Output is partially correct |
15 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
16 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
17 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
18 |
Partially correct |
1 ms |
212 KB |
Output is partially correct |
19 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
20 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
21 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
22 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
23 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
24 |
Partially correct |
1 ms |
212 KB |
Output is partially correct |
25 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
26 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
27 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
28 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
29 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
30 |
Partially correct |
1 ms |
212 KB |
Output is partially correct |
31 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
32 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
33 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
34 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
35 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
36 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
37 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
38 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
39 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
40 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |