#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
int n;
int niz[5005];
int simuliraj(int a, int b, int c){
return max(max(a,b), c) - min(min(a,b), c);
}
void solve(int N){
n = N;
int poz1 = 0;
int l = 1;
int r = n;
while(l < r){
int mid = (l + r + 1) / 2;
int pom = query(mid, n);
if(pom == n - 1){
l = mid;
}
else
r = mid - 1;
}
poz1 = l;
//cout << poz1 << endl;
/*for(int i=n; i>=1; i--){
if(query(i,n) == n-1){
poz1 = i;
break;
}
}*/
niz[poz1] = 1;
if(poz1>1){
niz[poz1 - 1] = 1 + query(poz1 - 1, poz1);
}
niz[poz1 + 1] = 1 + query(poz1, poz1 + 1);
for(int i=poz1 - 2; i >= 1; i--){
int val1 = query(i,i+1);
int val2 = query(i,i+2);
int prvi = niz[i + 1] - val1;
int drugi = niz[i + 1] + val1;
if(prvi <= 0 || drugi > n){
if(prvi <= 0)niz[i] = drugi;
else niz[i] = prvi;
continue;
}
int tmp1 = simuliraj(niz[i + 1], niz[i + 2], prvi);
int tmp2 = simuliraj(niz[i + 1], niz[i + 2], drugi);
if(tmp1 == val2)niz[i] = prvi;
else niz[i] = drugi;
}
for(int i=poz1+2; i<=n; i++){
int val1 = query(i-1,i);
int val2 = query(i-2,i);
int prvi = niz[i - 1] - val1;
int drugi = niz[i - 1] + val1;
if(prvi <= 0 || drugi > n){
if(prvi <= 0)niz[i] = drugi;
else niz[i] = prvi;
continue;
}
int tmp1 = simuliraj(niz[i - 1], niz[i - 2], prvi);
int tmp2 = simuliraj(niz[i - 1], niz[i - 2], drugi);
if(tmp1 == val2)niz[i] = prvi;
else niz[i] = drugi;
}
for(int i=1; i<=n; i++)answer(i, niz[i]);
}
Compilation message
xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:50:13: warning: unused variable 'tmp2' [-Wunused-variable]
int tmp2 = simuliraj(niz[i + 1], niz[i + 2], drugi);
^~~~
xylophone.cpp:65:13: warning: unused variable 'tmp2' [-Wunused-variable]
int tmp2 = simuliraj(niz[i - 1], niz[i - 2], drugi);
^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Output is correct |
2 |
Correct |
2 ms |
248 KB |
Output is correct |
3 |
Correct |
2 ms |
248 KB |
Output is correct |
4 |
Correct |
4 ms |
376 KB |
Output is correct |
5 |
Correct |
4 ms |
376 KB |
Output is correct |
6 |
Correct |
3 ms |
248 KB |
Output is correct |
7 |
Correct |
4 ms |
376 KB |
Output is correct |
8 |
Correct |
4 ms |
376 KB |
Output is correct |
9 |
Correct |
4 ms |
376 KB |
Output is correct |
10 |
Correct |
3 ms |
376 KB |
Output is correct |
11 |
Correct |
4 ms |
376 KB |
Output is correct |
12 |
Correct |
4 ms |
248 KB |
Output is correct |
13 |
Correct |
4 ms |
376 KB |
Output is correct |
14 |
Correct |
5 ms |
248 KB |
Output is correct |
15 |
Correct |
4 ms |
252 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Output is correct |
2 |
Correct |
2 ms |
248 KB |
Output is correct |
3 |
Correct |
2 ms |
248 KB |
Output is correct |
4 |
Correct |
4 ms |
376 KB |
Output is correct |
5 |
Correct |
4 ms |
376 KB |
Output is correct |
6 |
Correct |
3 ms |
248 KB |
Output is correct |
7 |
Correct |
4 ms |
376 KB |
Output is correct |
8 |
Correct |
4 ms |
376 KB |
Output is correct |
9 |
Correct |
4 ms |
376 KB |
Output is correct |
10 |
Correct |
3 ms |
376 KB |
Output is correct |
11 |
Correct |
4 ms |
376 KB |
Output is correct |
12 |
Correct |
4 ms |
248 KB |
Output is correct |
13 |
Correct |
4 ms |
376 KB |
Output is correct |
14 |
Correct |
5 ms |
248 KB |
Output is correct |
15 |
Correct |
4 ms |
252 KB |
Output is correct |
16 |
Correct |
7 ms |
248 KB |
Output is correct |
17 |
Correct |
7 ms |
328 KB |
Output is correct |
18 |
Correct |
19 ms |
248 KB |
Output is correct |
19 |
Correct |
24 ms |
248 KB |
Output is correct |
20 |
Correct |
26 ms |
248 KB |
Output is correct |
21 |
Correct |
27 ms |
380 KB |
Output is correct |
22 |
Correct |
21 ms |
252 KB |
Output is correct |
23 |
Correct |
21 ms |
252 KB |
Output is correct |
24 |
Correct |
21 ms |
376 KB |
Output is correct |
25 |
Correct |
22 ms |
316 KB |
Output is correct |
26 |
Correct |
26 ms |
248 KB |
Output is correct |
27 |
Correct |
26 ms |
248 KB |
Output is correct |
28 |
Correct |
27 ms |
320 KB |
Output is correct |
29 |
Correct |
26 ms |
408 KB |
Output is correct |
30 |
Correct |
26 ms |
276 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Output is correct |
2 |
Correct |
2 ms |
248 KB |
Output is correct |
3 |
Correct |
2 ms |
248 KB |
Output is correct |
4 |
Correct |
4 ms |
376 KB |
Output is correct |
5 |
Correct |
4 ms |
376 KB |
Output is correct |
6 |
Correct |
3 ms |
248 KB |
Output is correct |
7 |
Correct |
4 ms |
376 KB |
Output is correct |
8 |
Correct |
4 ms |
376 KB |
Output is correct |
9 |
Correct |
4 ms |
376 KB |
Output is correct |
10 |
Correct |
3 ms |
376 KB |
Output is correct |
11 |
Correct |
4 ms |
376 KB |
Output is correct |
12 |
Correct |
4 ms |
248 KB |
Output is correct |
13 |
Correct |
4 ms |
376 KB |
Output is correct |
14 |
Correct |
5 ms |
248 KB |
Output is correct |
15 |
Correct |
4 ms |
252 KB |
Output is correct |
16 |
Correct |
7 ms |
248 KB |
Output is correct |
17 |
Correct |
7 ms |
328 KB |
Output is correct |
18 |
Correct |
19 ms |
248 KB |
Output is correct |
19 |
Correct |
24 ms |
248 KB |
Output is correct |
20 |
Correct |
26 ms |
248 KB |
Output is correct |
21 |
Correct |
27 ms |
380 KB |
Output is correct |
22 |
Correct |
21 ms |
252 KB |
Output is correct |
23 |
Correct |
21 ms |
252 KB |
Output is correct |
24 |
Correct |
21 ms |
376 KB |
Output is correct |
25 |
Correct |
22 ms |
316 KB |
Output is correct |
26 |
Correct |
26 ms |
248 KB |
Output is correct |
27 |
Correct |
26 ms |
248 KB |
Output is correct |
28 |
Correct |
27 ms |
320 KB |
Output is correct |
29 |
Correct |
26 ms |
408 KB |
Output is correct |
30 |
Correct |
26 ms |
276 KB |
Output is correct |
31 |
Correct |
51 ms |
320 KB |
Output is correct |
32 |
Correct |
61 ms |
248 KB |
Output is correct |
33 |
Correct |
102 ms |
336 KB |
Output is correct |
34 |
Incorrect |
98 ms |
424 KB |
Wrong Answer [2] |
35 |
Halted |
0 ms |
0 KB |
- |