#include "xylophone.h"
void solve(int N) {
int idx = 1;
for( idx; idx <= N; idx ++ ){
if( query(1, idx) == N-1 )
break;
}
int ans[N+2] = {};
ans[idx] = N;
if( idx != 1 )
ans[idx-1] = N - query(idx-1, idx);
if( idx != N )
ans[idx+1] = N - query(idx, idx+1 );
for( int i = idx-2; i >= 1; i -- ){
int val1 = query(i, i+1);
int val2 = query(i, i+2);
if( ans[i+1] < ans[i+2] ){
if( ans[i+2]-ans[i+1] > val1 and val2 == ans[i+2] - ans[i+1]){
ans[i] = ans[i+1] + val1;
}
else if( val2 > val1 ){
ans[i] = ans[i+1] - val1;
}
else{
ans[i] = ans[i+1] + val1;
}
}else{
if( ans[i+1]-ans[i+2] > val1 and val2 == ans[i+1] - ans[i+2]){
ans[i] = ans[i+1] - val1;
}
else if( val2 > val1 ){
ans[i] = ans[i+1] + val1;
}
else{
ans[i] = ans[i+1] - val1;
}
}
}
for( int i = idx+2; i <= N; i ++ ){
int val1 = query(i-1, i);
int val2 = query(i-2, i);
if( ans[i-2] > ans[i-1] ){
if( ans[i-2] - ans[i-1] > val1 and val2 == ans[i-2] - ans[i-1]){
ans[i] = ans[i-1] + val1;
}
else if( val2 > val1 ){
ans[i] = ans[i-1] - val1;
}else{
ans[i] = ans[i-1] + val1;
}
}else{
if( ans[i-1]-ans[i-2] > val1 and val2 == ans[i-1] - ans[i-2] ){
ans[i] = ans[i-1] - val1;
}
else if( val2 > val1 ){
ans[i] = ans[i-1] + val1;
}else{
ans[i] = ans[i-1] - val1;
}
}
}/*
for( int i = 1; i <= N; i ++ ){
printf("%d ", ans[i]);
}printf("\n");
*/
for( int i = 1; i <= N; i ++ ){
answer(i, ans[i]);
}
}
Compilation message
xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:5:10: warning: statement has no effect [-Wunused-value]
for( idx; idx <= N; idx ++ ){
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
256 KB |
Output is correct |
| 2 |
Correct |
4 ms |
384 KB |
Output is correct |
| 3 |
Correct |
6 ms |
256 KB |
Output is correct |
| 4 |
Correct |
7 ms |
384 KB |
Output is correct |
| 5 |
Correct |
7 ms |
384 KB |
Output is correct |
| 6 |
Correct |
7 ms |
256 KB |
Output is correct |
| 7 |
Correct |
7 ms |
256 KB |
Output is correct |
| 8 |
Correct |
7 ms |
384 KB |
Output is correct |
| 9 |
Correct |
7 ms |
256 KB |
Output is correct |
| 10 |
Correct |
7 ms |
256 KB |
Output is correct |
| 11 |
Correct |
7 ms |
256 KB |
Output is correct |
| 12 |
Correct |
7 ms |
256 KB |
Output is correct |
| 13 |
Correct |
6 ms |
256 KB |
Output is correct |
| 14 |
Correct |
9 ms |
256 KB |
Output is correct |
| 15 |
Correct |
7 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
256 KB |
Output is correct |
| 2 |
Correct |
4 ms |
384 KB |
Output is correct |
| 3 |
Correct |
6 ms |
256 KB |
Output is correct |
| 4 |
Correct |
7 ms |
384 KB |
Output is correct |
| 5 |
Correct |
7 ms |
384 KB |
Output is correct |
| 6 |
Correct |
7 ms |
256 KB |
Output is correct |
| 7 |
Correct |
7 ms |
256 KB |
Output is correct |
| 8 |
Correct |
7 ms |
384 KB |
Output is correct |
| 9 |
Correct |
7 ms |
256 KB |
Output is correct |
| 10 |
Correct |
7 ms |
256 KB |
Output is correct |
| 11 |
Correct |
7 ms |
256 KB |
Output is correct |
| 12 |
Correct |
7 ms |
256 KB |
Output is correct |
| 13 |
Correct |
6 ms |
256 KB |
Output is correct |
| 14 |
Correct |
9 ms |
256 KB |
Output is correct |
| 15 |
Correct |
7 ms |
384 KB |
Output is correct |
| 16 |
Correct |
11 ms |
256 KB |
Output is correct |
| 17 |
Correct |
14 ms |
256 KB |
Output is correct |
| 18 |
Correct |
19 ms |
256 KB |
Output is correct |
| 19 |
Correct |
41 ms |
384 KB |
Output is correct |
| 20 |
Correct |
35 ms |
384 KB |
Output is correct |
| 21 |
Correct |
33 ms |
256 KB |
Output is correct |
| 22 |
Correct |
23 ms |
256 KB |
Output is correct |
| 23 |
Correct |
23 ms |
256 KB |
Output is correct |
| 24 |
Correct |
30 ms |
376 KB |
Output is correct |
| 25 |
Correct |
26 ms |
256 KB |
Output is correct |
| 26 |
Correct |
34 ms |
256 KB |
Output is correct |
| 27 |
Correct |
31 ms |
256 KB |
Output is correct |
| 28 |
Correct |
29 ms |
256 KB |
Output is correct |
| 29 |
Correct |
39 ms |
256 KB |
Output is correct |
| 30 |
Correct |
35 ms |
256 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
256 KB |
Output is correct |
| 2 |
Correct |
4 ms |
384 KB |
Output is correct |
| 3 |
Correct |
6 ms |
256 KB |
Output is correct |
| 4 |
Correct |
7 ms |
384 KB |
Output is correct |
| 5 |
Correct |
7 ms |
384 KB |
Output is correct |
| 6 |
Correct |
7 ms |
256 KB |
Output is correct |
| 7 |
Correct |
7 ms |
256 KB |
Output is correct |
| 8 |
Correct |
7 ms |
384 KB |
Output is correct |
| 9 |
Correct |
7 ms |
256 KB |
Output is correct |
| 10 |
Correct |
7 ms |
256 KB |
Output is correct |
| 11 |
Correct |
7 ms |
256 KB |
Output is correct |
| 12 |
Correct |
7 ms |
256 KB |
Output is correct |
| 13 |
Correct |
6 ms |
256 KB |
Output is correct |
| 14 |
Correct |
9 ms |
256 KB |
Output is correct |
| 15 |
Correct |
7 ms |
384 KB |
Output is correct |
| 16 |
Correct |
11 ms |
256 KB |
Output is correct |
| 17 |
Correct |
14 ms |
256 KB |
Output is correct |
| 18 |
Correct |
19 ms |
256 KB |
Output is correct |
| 19 |
Correct |
41 ms |
384 KB |
Output is correct |
| 20 |
Correct |
35 ms |
384 KB |
Output is correct |
| 21 |
Correct |
33 ms |
256 KB |
Output is correct |
| 22 |
Correct |
23 ms |
256 KB |
Output is correct |
| 23 |
Correct |
23 ms |
256 KB |
Output is correct |
| 24 |
Correct |
30 ms |
376 KB |
Output is correct |
| 25 |
Correct |
26 ms |
256 KB |
Output is correct |
| 26 |
Correct |
34 ms |
256 KB |
Output is correct |
| 27 |
Correct |
31 ms |
256 KB |
Output is correct |
| 28 |
Correct |
29 ms |
256 KB |
Output is correct |
| 29 |
Correct |
39 ms |
256 KB |
Output is correct |
| 30 |
Correct |
35 ms |
256 KB |
Output is correct |
| 31 |
Correct |
55 ms |
384 KB |
Output is correct |
| 32 |
Correct |
64 ms |
376 KB |
Output is correct |
| 33 |
Incorrect |
119 ms |
256 KB |
Wrong Answer [2] |
| 34 |
Halted |
0 ms |
0 KB |
- |
