#include <bits/stdc++.h>
#include "scales.h"
using namespace std;
void init(int T) {
/*
//cout << T<<'\n';
while(T--){
orderCoins();
}*/
}
void orderCoins() {
int W[] = {0,0,0,0,0,0};
int light = 1;
for(int i=2;i<6;i++){
if(light != i)
light = getLightest(light,i,i+1);
}
W[0] = light;
set<int> left = {1,2,3,4,5,6};
left.erase(light);
for(int i=1;i<4;i++){
for(auto a:left)for(auto b:left){
if(a == b)continue;
for(auto c:left){
if(c == a || c == b)continue;
light = getNextLightest(a,b,c,W[i-1]);
}
}
W[i] = light;
left.erase(light);
}
int x = *(left.begin()),y = *(++left.begin());
W[4] = getMedian(W[3],x,y);
left.erase(W[4]);
W[5] = *(left.begin());
answer(W);
}
Compilation message
scales.cpp: In function 'void init(int)':
scales.cpp:4:15: warning: unused parameter 'T' [-Wunused-parameter]
4 | void init(int T) {
| ~~~~^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
364 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
15 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
16 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
17 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
18 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
19 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
20 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
21 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
22 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
23 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
24 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
25 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
26 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
27 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
28 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
29 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
30 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
31 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
32 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
33 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
34 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
35 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
36 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
37 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
38 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
39 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
40 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |