#include "scales.h"
#include<vector>
#include<iostream>
using namespace std;
#define PB push_back
#define forn(i, n) for(int i=0; i<(int)n; ++i)
vector<int> place3(vector<int> v, int x){
vector<int> ret;
int val=getNextLightest(v[0], v[1], v[2], x);
forn(i, v.size()){
if(v[i]==val) ret.PB(x);
ret.PB(v[i]);
}
return ret;
}
vector<int> reorder(vector<int> v){
vector<int> ret = {v[0], v[1], v[2]};
int pos=0, value = getHeaviest(v[0], v[1], v[2]);
while(v[pos]!=value) ++pos;
swap(ret[2], ret[pos]);
return ret;
}
vector<int> ins5(vector<int> v, int x){
int value = getNextLightest(v[0], v[2], v[3], x);
if(value==v[3]){
return {v[0], v[1], v[2], x, v[3], v[4]};
}
else if(value==v[0]){
if(getHeaviest(v[0], v[3], x)==x){
return {v[0], v[1], v[2], v[3], x, v[4]};
}
else{
return {x, v[0], v[1], v[2], v[3], v[4]};
}
}
else{
if(getHeaviest(v[0], v[1], x)==x){
return {v[0], v[1], x, v[2], v[3], v[4]};
}
else{
return {v[0], x, v[1], v[2], v[3], v[4]};
}
}
}
void init(int T) {
/* ... */
}
void orderCoins() {
/* ... */
vector<int> v1 = reorder({1, 2, 3}), v2 = reorder({4, 5, 6});
if(getHeaviest(v1[1], v1[2], v2[2])==v1[2]) swap(v1, v2);
vector<int> res = ins5(place3(place3({v1[1], v1[2], v2[2]}, v2[1]), v1[0]), v2[0]);
int W[6];
forn(i, 6) W[i]=res[i];
answer(W);
}
Compilation message
scales.cpp: In function 'void init(int)':
scales.cpp:50:15: warning: unused parameter 'T' [-Wunused-parameter]
50 | void init(int T) {
| ~~~~^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
1 ms |
212 KB |
Output is partially correct |
2 |
Partially correct |
1 ms |
212 KB |
Output is partially correct |
3 |
Partially correct |
1 ms |
212 KB |
Output is partially correct |
4 |
Partially correct |
1 ms |
212 KB |
Output is partially correct |
5 |
Partially correct |
1 ms |
212 KB |
Output is partially correct |
6 |
Partially correct |
1 ms |
212 KB |
Output is partially correct |
7 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
8 |
Partially correct |
1 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 |
1 ms |
212 KB |
Output is partially correct |
12 |
Partially correct |
1 ms |
212 KB |
Output is partially correct |
13 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
14 |
Partially correct |
0 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 |
0 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 |
1 ms |
212 KB |
Output is partially correct |
23 |
Partially correct |
0 ms |
212 KB |
Output is partially correct |
24 |
Partially correct |
0 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 |
1 ms |
212 KB |
Output is partially correct |
30 |
Partially correct |
0 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 |
1 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 |