#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
const int NN = 5e3 + 7;
int d[NN];
int d1[NN];
int b[NN];
int get( int x , int y , int x1 , int y1 )
{
if( x1 > y1 ){
if( y == x1 - y1 )return x1 - x;
if( x == y )return x1 - x;
return x1 + x;
}else{
if( y == x + y1 - x1 )return x1 - x;
if( y == y1 - x1 )return x1 + x;
return x1 + x;
}
}
void solve(int n)
{
for( int i = 1; i <= n - 1; i++ ){
d[i] = query( i , i + 1 );
}
for( int i = 1; i <= n - 2; i++ ){
d1[i] = query( i , i + 2 );
}
for( int i = 1; i < n; i++ ){
bool f = true;
b[i] = 1;
if( i != 1 )b[i - 1] = d[i - 1] + 1;
b[i + 1] = d[i] + 1;
for( int j = i - 2; j >= 1; j-- ){
b[j] = get( d[j] , d1[j] , b[j + 1] , b[j + 2] );
}
for( int j = i + 2; j <= n; j++ ){
b[j] = get( d[j - 1] , d1[j - 2] , b[j - 1] , b[j - 2] );
}
set < int > s;
for( int j = 1; j <= n; j++ ){
s.insert(b[j]);
f &= (b[j] <= n && b[j] >= 1);
}
f &= ((int)s.size() == n);
for( int j = 1; j <= n - 1; j++ ){
f &= (d[j] == abs(b[j + 1] - b[j]));
}
for( int j = 1; j <= n - 2; j++ ){
f &= (d1[j] == abs(max({b[j] , b[j + 1] , b[j + 2]}) - min({b[j] , b[j + 1] , b[j + 2]})));
}
if( !f )continue;
for( int h = 1; h <= n; h++ ){
answer( h , b[h] );
}
return;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
256 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
6 ms |
384 KB |
Output is correct |
5 |
Correct |
7 ms |
256 KB |
Output is correct |
6 |
Correct |
6 ms |
384 KB |
Output is correct |
7 |
Correct |
7 ms |
384 KB |
Output is correct |
8 |
Correct |
7 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
404 KB |
Output is correct |
10 |
Correct |
6 ms |
384 KB |
Output is correct |
11 |
Correct |
6 ms |
384 KB |
Output is correct |
12 |
Correct |
7 ms |
384 KB |
Output is correct |
13 |
Correct |
7 ms |
384 KB |
Output is correct |
14 |
Correct |
6 ms |
476 KB |
Output is correct |
15 |
Correct |
7 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
256 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
6 ms |
384 KB |
Output is correct |
5 |
Correct |
7 ms |
256 KB |
Output is correct |
6 |
Correct |
6 ms |
384 KB |
Output is correct |
7 |
Correct |
7 ms |
384 KB |
Output is correct |
8 |
Correct |
7 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
404 KB |
Output is correct |
10 |
Correct |
6 ms |
384 KB |
Output is correct |
11 |
Correct |
6 ms |
384 KB |
Output is correct |
12 |
Correct |
7 ms |
384 KB |
Output is correct |
13 |
Correct |
7 ms |
384 KB |
Output is correct |
14 |
Correct |
6 ms |
476 KB |
Output is correct |
15 |
Correct |
7 ms |
384 KB |
Output is correct |
16 |
Correct |
8 ms |
384 KB |
Output is correct |
17 |
Correct |
18 ms |
384 KB |
Output is correct |
18 |
Correct |
22 ms |
384 KB |
Output is correct |
19 |
Correct |
48 ms |
384 KB |
Output is correct |
20 |
Correct |
55 ms |
376 KB |
Output is correct |
21 |
Correct |
93 ms |
504 KB |
Output is correct |
22 |
Correct |
59 ms |
376 KB |
Output is correct |
23 |
Correct |
23 ms |
376 KB |
Output is correct |
24 |
Correct |
117 ms |
376 KB |
Output is correct |
25 |
Correct |
20 ms |
384 KB |
Output is correct |
26 |
Correct |
73 ms |
384 KB |
Output is correct |
27 |
Correct |
103 ms |
384 KB |
Output is correct |
28 |
Correct |
48 ms |
428 KB |
Output is correct |
29 |
Correct |
48 ms |
460 KB |
Output is correct |
30 |
Correct |
58 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
256 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
6 ms |
384 KB |
Output is correct |
5 |
Correct |
7 ms |
256 KB |
Output is correct |
6 |
Correct |
6 ms |
384 KB |
Output is correct |
7 |
Correct |
7 ms |
384 KB |
Output is correct |
8 |
Correct |
7 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
404 KB |
Output is correct |
10 |
Correct |
6 ms |
384 KB |
Output is correct |
11 |
Correct |
6 ms |
384 KB |
Output is correct |
12 |
Correct |
7 ms |
384 KB |
Output is correct |
13 |
Correct |
7 ms |
384 KB |
Output is correct |
14 |
Correct |
6 ms |
476 KB |
Output is correct |
15 |
Correct |
7 ms |
384 KB |
Output is correct |
16 |
Correct |
8 ms |
384 KB |
Output is correct |
17 |
Correct |
18 ms |
384 KB |
Output is correct |
18 |
Correct |
22 ms |
384 KB |
Output is correct |
19 |
Correct |
48 ms |
384 KB |
Output is correct |
20 |
Correct |
55 ms |
376 KB |
Output is correct |
21 |
Correct |
93 ms |
504 KB |
Output is correct |
22 |
Correct |
59 ms |
376 KB |
Output is correct |
23 |
Correct |
23 ms |
376 KB |
Output is correct |
24 |
Correct |
117 ms |
376 KB |
Output is correct |
25 |
Correct |
20 ms |
384 KB |
Output is correct |
26 |
Correct |
73 ms |
384 KB |
Output is correct |
27 |
Correct |
103 ms |
384 KB |
Output is correct |
28 |
Correct |
48 ms |
428 KB |
Output is correct |
29 |
Correct |
48 ms |
460 KB |
Output is correct |
30 |
Correct |
58 ms |
376 KB |
Output is correct |
31 |
Correct |
264 ms |
608 KB |
Output is correct |
32 |
Correct |
617 ms |
504 KB |
Output is correct |
33 |
Correct |
1361 ms |
736 KB |
Output is correct |
34 |
Execution timed out |
2256 ms |
692 KB |
Time limit exceeded |
35 |
Halted |
0 ms |
0 KB |
- |