oj.uz

Submission #160804

# Submission time Handle Problem Language Result Execution time Memory
160804 2019-10-30T02:23:25 Z Leonardo_Paes Xylophone (JOI18_xylophone) C++17
100 / 100
 82 ms 480 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
#pragma unroll

using namespace std;

const int maxn = 5e3+10;

int n, res[maxn], pos[maxn];

inline void find_1(){
    int ini=1, fim=n, meio, ans=-1;

    while(ini<=fim){
        meio = (ini+fim) >> 1;
        if(query(meio, n)>=(n-1)){
            ans = meio;
            ini = meio+1;
        }
        else{
            fim = meio-1;
        }
    }

    pos[1] = ans;
    res[ans] = 1;
}

inline void find_n(){
    int ini=pos[1]+1, fim=n, meio, ans=-1;

    while(ini<=fim){
        meio = (ini+fim) >> 1;
        if(query(pos[1], meio)>=(n-1)){
            ans = meio;
            fim = meio-1;
        }
        else{
            ini = meio+1;
        }
    }

    pos[n] = ans;
    res[ans] = n;
}

inline void solve_left(int j, int k){
    if(j<=1 or res[j-1]!=0) return;

    int i = j-1;
    int diff1 = query(i, j);

    if((res[j] + diff1) > n or pos[res[j] + diff1]!=0){
        res[i] = res[j] - diff1;
        pos[res[i]] = i;
    }
    else if((res[j] - diff1) < 1 or pos[res[j] - diff1]!=0){
        res[i] = res[j] + diff1;
        pos[res[i]] = i;
    }
    else{
        int diff2 = query(i, k);

        if(diff1 + abs(res[j]-res[k]) == diff2){
            if(res[k]<res[j]){
                res[i] = res[j] + diff1;
                pos[res[i]] = i;
            }
            else{
                res[i] = res[j] - diff1;
                pos[res[i]] = i;
            }
        }
        else{
            if(res[k]<res[j]){
                res[i] = res[j] - diff1;
                pos[res[i]] = i;
            }
            else{
                res[i] = res[j] + diff1;
                pos[res[i]] = i;
            }
        }

    }
    solve_left(i, j);
}

inline void solve_right(int j, int k){
    if(k>=n or res[k+1]!=0) return;

    int l = k+1;
    int diff1 = query(k, l);

    if((res[k] + diff1) > n or pos[res[k] + diff1]!=0){
        res[l] = res[k] - diff1;
        pos[res[l]] = l;
    }
    else if((res[k] - diff1) < 1 or pos[res[k] - diff1]!=0){
        res[l] = res[k] + diff1;
        pos[res[l]] = l;
    }
    else{
        int diff2 = query(j, l);

        if(diff1 + abs(res[j]-res[k]) == diff2){
            if(res[k]>res[j]){
                res[l] = res[k] + diff1;
                pos[res[l]] = l;
            }
            else{
                res[l] = res[k] - diff1;
                pos[res[l]] = l;
            }
        }
        else{
            if(res[k]>res[j]){
                res[l] = res[k] - diff1;
                pos[res[l]] = l;
            }
            else{
                res[l] = res[k] + diff1;
                pos[res[l]] = l;
            }
        }

    }
    solve_right(k, l);
}

void solve(int N){
    n = N;
    find_1();
    find_n();

    int diff;

    if(pos[1]+1 <= n and res[pos[1]+1] == 0){
        diff = query(pos[1], pos[1]+1);
        res[pos[1]+1] = 1 + diff;
        pos[1+diff] = pos[1]+1;
    }

    if(pos[1]-1 >= 1 and res[pos[1]-1] == 0){
        diff = query(pos[1]-1, pos[1]);
        res[pos[1]-1] = 1 + diff;
        pos[1+diff] = pos[1]-1;
    }

    if(pos[n]+1 <=n and res[pos[n]+1] == 0){
        diff = query(pos[n], pos[n]+1);
        res[pos[n]+1] = n - diff;
        pos[n-diff] = pos[n]+1;
    }

    if(pos[n]-1 >= 1 and res[pos[n]-1] == 0){
        diff = query(pos[n]-1, pos[n]);
        res[pos[n]-1] = n - diff;
        pos[n-diff] = pos[n] - 1;
    }

    solve_left(pos[1]-1, pos[1]);
    solve_left(pos[n]-1, pos[n]);
    solve_right(pos[n], pos[n]+1);

    for(int i=1; i<=n; i++){
        answer(i, res[i]);
    }
}

Compilation message

xylophone.cpp:3:0: warning: ignoring #pragma unroll  [-Wunknown-pragmas]
 #pragma unroll

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 320 KB Output is correct
3 Correct 2 ms 396 KB Output is correct
4 Correct 4 ms 248 KB Output is correct
5 Correct 3 ms 248 KB Output is correct
6 Correct 4 ms 380 KB Output is correct
7 Correct 3 ms 316 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 3 ms 396 KB Output is correct
12 Correct 4 ms 248 KB Output is correct
13 Correct 3 ms 404 KB Output is correct
14 Correct 3 ms 248 KB Output is correct
15 Correct 3 ms 248 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 8 ms 380 KB Output is correct
18 Correct 10 ms 248 KB Output is correct
19 Correct 17 ms 376 KB Output is correct
20 Correct 10 ms 316 KB Output is correct
21 Correct 14 ms 248 KB Output is correct
22 Correct 16 ms 380 KB Output is correct
23 Correct 15 ms 248 KB Output is correct
24 Correct 8 ms 312 KB Output is correct
25 Correct 14 ms 248 KB Output is correct
26 Correct 18 ms 376 KB Output is correct
27 Correct 13 ms 376 KB Output is correct
28 Correct 16 ms 376 KB Output is correct
29 Correct 11 ms 332 KB Output is correct
30 Correct 9 ms 312 KB Output is correct
31 Correct 36 ms 376 KB Output is correct
32 Correct 45 ms 376 KB Output is correct
33 Correct 59 ms 348 KB Output is correct
34 Correct 50 ms 376 KB Output is correct
35 Correct 43 ms 376 KB Output is correct
36 Correct 56 ms 248 KB Output is correct
37 Correct 55 ms 248 KB Output is correct
38 Correct 57 ms 244 KB Output is correct
39 Correct 55 ms 348 KB Output is correct
40 Correct 50 ms 424 KB Output is correct
41 Correct 35 ms 400 KB Output is correct
42 Correct 55 ms 248 KB Output is correct
43 Correct 78 ms 376 KB Output is correct
44 Correct 67 ms 248 KB Output is correct
45 Correct 80 ms 376 KB Output is correct
46 Correct 68 ms 340 KB Output is correct
47 Correct 72 ms 248 KB Output is correct
48 Correct 52 ms 428 KB Output is correct
49 Correct 69 ms 348 KB Output is correct
50 Correct 74 ms 472 KB Output is correct
51 Correct 63 ms 348 KB Output is correct
52 Correct 55 ms 376 KB Output is correct
53 Correct 49 ms 400 KB Output is correct
54 Correct 71 ms 248 KB Output is correct
55 Correct 78 ms 384 KB Output is correct
56 Correct 51 ms 428 KB Output is correct
57 Correct 45 ms 432 KB Output is correct
58 Correct 76 ms 248 KB Output is correct
59 Correct 80 ms 428 KB Output is correct
60 Correct 82 ms 480 KB Output is correct