oj.uz

Submission #248812

# Submission time Handle Problem Language Result Execution time Memory
248812 2020-07-13T13:00:51 Z alexandra_udristoiu Jousting tournament (IOI12_tournament) C++14
0 / 100
 21 ms 1792 KB 
#include<iostream>
#define DIM 100005
using namespace std;
static int aib[DIM], nxt[DIM], sum[DIM], pmax[DIM];
static int N;
void update(int x, int val){
    x++;
    for(; x <= N; x += (x & -x) ){
        aib[x] += val;
    }
}
int query(int val){
    int p, x = 0, sum = 0;
    for(p = 17; p >= 0; p--){
        if( x + (1 << p) <= N && sum + aib[ x + (1 << p) ] < val){
            sum += aib[ x + (1 << p) ];
            x += (1 << p);
        }
    }
    return x;
}
int GetBestPosition(int n, int q, int r, int *v, int *s, int *e) {
    int i, j, p, u;
    N = n;
    for(i = 0; i < n; i++){
        nxt[i] = i + 1;
        update(i, 1);
    }
    pmax[n + 1] = n + 1;
    for(i = n; i >= 1; i--){
        pmax[i] = pmax[i + 1];
        if(v[i] > r){
            pmax[i] = i;
        }
    }
    for(i = 0; i < q; i++){
        p = u = query(s[i] + 1);
        for(j = 1; j <= e[i] - s[i] + 1; j++){
            u = nxt[u];
        }
        for(j = nxt[p]; j != u; j = nxt[j]){
            nxt[j] = u;
            update(j, -1);
        }
        nxt[p] = u;
        if(pmax[p] >= u - 1){
            sum[p]++;
            sum[u]--;
        }
    }
    p = 0;
    for(i = 1; i < n; i++){
        sum[i] += sum[i - 1];
        if(sum[p] < sum[i]){
            p = i;
        }
    }
    return p;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Incorrect 1 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 1792 KB Output isn't correct
2 Halted 0 ms 0 KB -