# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
31257 |
2017-08-16T13:57:11 Z |
top34051 |
Scales (IOI15_scales) |
C++14 |
|
0 ms |
2024 KB |
#include "scales.h"
#include<bits/stdc++.h>
using namespace std;
int A[5], B[5], p[5];
void init(int T) {
}
void orderCoins() {
int i,j,x,pos;
int W[] = {1, 2, 3, 4, 5, 6};
A[0] = getLightest(1,2,3);
A[1] = getMedian(1,2,3);
for(x=1;x<=3;x++) if(x!=A[0] && x!=A[1]) A[2] = x;
B[0] = getLightest(4,5,6);
B[1] = getMedian(4,5,6);
for(x=4;x<=6;x++) if(x!=B[0] && x!=B[1]) B[2] = x;
for(i=0;i<3;i++) {
// if(i && p[i-1]==-1) {
// p[i] = -1;
// continue;
// }
p[i] = getNextLightest(A[0],A[1],A[2],B[i]);
// if(p[i]==A[0] && getLightest(A[0],A[1],B[i])!=B[i]) p[i] = -1;
}
pos = 0;
for(i=j=0;i<3;i++) {
while(j<3 && p[j]==A[i]) W[pos++] = B[j++];
W[pos++] = A[i];
}
while(j<3) W[pos++] = B[j++];
// for(i=0;i<6;i++) cerr << W[i] << " ";
// cerr << endl;
answer(W);
}
Compilation message
scales.cpp:7:15: warning: unused parameter 'T' [-Wunused-parameter]
void init(int T) {
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
11 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
12 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
13 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
14 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
15 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
16 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
17 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
18 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
19 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
20 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
21 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
22 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
23 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
24 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
25 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
26 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
27 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
28 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
29 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
30 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
31 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
32 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
33 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
34 |
Partially correct |
0 ms |
2024 KB |
Output is partially correct |
35 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
36 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
37 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
38 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
39 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |
40 |
Incorrect |
0 ms |
2024 KB |
Output isn't correct |