#include <bits/stdc++.h>
#include "scales.h"
#pragma GCC optimize("O3")
using namespace std;
void init(int T){
}
void orderCoins(){
int v[3] = {1, 2, 3}, w[3] = {4, 5, 6}, a, r[6];
a = getHeaviest(v[0], v[1], v[2]);
if(a == v[0]) swap(v[0], v[2]);
else if(a == v[1]) swap(v[1], v[2]);
a = getLightest(v[0], v[1], v[2]);
if(a == v[1]) swap(v[0], v[1]);
a = getHeaviest(w[0], w[1], w[2]);
if(a == w[0]) swap(w[0], w[2]);
else if(a == w[1]) swap(w[1], w[2]);
a = getLightest(w[0], w[1], w[2]);
if(a == w[1]) swap(w[0], w[1]);
int p = 0, q = 0, i = 0;
while(p < 3 && q < 3){
if(p > q) swap(v, w), swap(p, q);
if(p == 2 && q == 2){
a = getHeaviest(r[0], v[p], w[q]);
if(a == v[p]) r[i++] = w[q++];
else r[i++] = v[p++];
}
else{
a = getMedian(v[p], v[p+1], w[q]);
if(a == v[p]) r[i++] = w[q++];
else if(a == v[p+1]) r[i++] = v[p++], r[i++] = v[p++];
else r[i++] = v[p++], r[i++] = w[q++];
}
}
while(p < 3) r[i++] = v[p++];
while(q < 3) r[i++] = w[q++];
answer(r);
}
Compilation message
scales.cpp: In function 'void init(int)':
scales.cpp:8:15: warning: unused parameter 'T' [-Wunused-parameter]
8 | void init(int T){
| ~~~~^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 2 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 3 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 4 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 5 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 6 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 7 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 8 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 9 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 10 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 11 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 12 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 13 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 14 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 15 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 16 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 17 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 18 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 19 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 20 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 21 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 22 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 23 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 24 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 25 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 26 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 27 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 28 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 29 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 30 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 31 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 32 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 33 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 34 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 35 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 36 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
| 37 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 38 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 39 |
Partially correct |
1 ms |
256 KB |
Output is partially correct |
| 40 |
Partially correct |
0 ms |
256 KB |
Output is partially correct |
