oj.uz

Submission #163158

# Submission time Handle Problem Language Result Execution time Memory
163158 2019-11-11T15:09:17 Z mat_v Xylophone (JOI18_xylophone) C++14
47 / 100
 95 ms 504 KB 
#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 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 val2 = query(i,i+2);
        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 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 val2 = query(i-2,i);
        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);
             ^~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 248 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 4 ms 248 KB Output is correct
6 Correct 4 ms 248 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 4 ms 296 KB Output is correct
11 Correct 3 ms 248 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 396 KB Output is correct
14 Correct 3 ms 248 KB Output is correct
15 Correct 4 ms 248 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 248 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 4 ms 248 KB Output is correct
6 Correct 4 ms 248 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 4 ms 296 KB Output is correct
11 Correct 3 ms 248 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 396 KB Output is correct
14 Correct 3 ms 248 KB Output is correct
15 Correct 4 ms 248 KB Output is correct
16 Correct 4 ms 320 KB Output is correct
17 Correct 17 ms 448 KB Output is correct
18 Correct 16 ms 376 KB Output is correct
19 Correct 12 ms 324 KB Output is correct
20 Correct 14 ms 316 KB Output is correct
21 Correct 19 ms 380 KB Output is correct
22 Correct 11 ms 316 KB Output is correct
23 Correct 22 ms 376 KB Output is correct
24 Correct 17 ms 376 KB Output is correct
25 Correct 15 ms 376 KB Output is correct
26 Correct 26 ms 376 KB Output is correct
27 Correct 21 ms 248 KB Output is correct
28 Correct 19 ms 248 KB Output is correct
29 Correct 17 ms 248 KB Output is correct
30 Correct 19 ms 248 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 248 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 4 ms 248 KB Output is correct
6 Correct 4 ms 248 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 4 ms 296 KB Output is correct
11 Correct 3 ms 248 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 396 KB Output is correct
14 Correct 3 ms 248 KB Output is correct
15 Correct 4 ms 248 KB Output is correct
16 Correct 4 ms 320 KB Output is correct
17 Correct 17 ms 448 KB Output is correct
18 Correct 16 ms 376 KB Output is correct
19 Correct 12 ms 324 KB Output is correct
20 Correct 14 ms 316 KB Output is correct
21 Correct 19 ms 380 KB Output is correct
22 Correct 11 ms 316 KB Output is correct
23 Correct 22 ms 376 KB Output is correct
24 Correct 17 ms 376 KB Output is correct
25 Correct 15 ms 376 KB Output is correct
26 Correct 26 ms 376 KB Output is correct
27 Correct 21 ms 248 KB Output is correct
28 Correct 19 ms 248 KB Output is correct
29 Correct 17 ms 248 KB Output is correct
30 Correct 19 ms 248 KB Output is correct
31 Correct 23 ms 404 KB Output is correct
32 Correct 53 ms 332 KB Output is correct
33 Correct 71 ms 504 KB Output is correct
34 Correct 80 ms 408 KB Output is correct
35 Correct 69 ms 444 KB Output is correct
36 Incorrect 95 ms 376 KB Wrong Answer [2]
37 Halted 0 ms 0 KB -