oj.uz

Submission #242218

# Submission time Handle Problem Language Result Execution time Memory
242218 2020-06-27T06:35:52 Z dwsc Jousting tournament (IOI12_tournament) C++14
100 / 100
 131 ms 13560 KB 
#include <bits/stdc++.h>
using namespace std;
int ft[100010];
int pos[100010];
int jump[100010];
int n;
void up(int x,int v){
    while (x <= n){
        ft[x] += v;
        x += (x&-x);
    }
}
int rsq(int b){
    int sum = 0;
    while (b){
        sum += ft[b];
        b -= b&-b;
    }
    return sum;
}
void uppos(int x,int v){
    while (x <= n){
        pos[x] += v;
        x += (x&-x);
    }
}
int rsqpos(int b){
    int sum = 0;
    while (b){
        sum += pos[b];
        b -= b&-b;
    }
    return sum;
}
struct node{
    int s,e,m,v;
    node *l,*r;
    node (int _s,int _e){
        s = _s;
        e = _e;
        m = (s+e)/2;
        v = 0;
        if (s != e){
            l = new node(s,m);
            r = new node(m+1,e);
        }
    }
    void up(int x,int v1){
        if (s == e) {v = v1;return;}
        if (x <= m) l->up(x,v1);
        else r->up(x,v1);
        v = max(l->v,r->v);
    }
    int rmq(int x,int y){
        if (s == x && e == y) return v;
        if (y <= m) return l->rmq(x,y);
        if (x > m) return r->rmq(x,y);
        return max(l->rmq(x,m),r->rmq(m+1,y));
    }
}*root;
int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
    n = N;
    for (int i = 1; i <= n; i++) uppos(i,1);
    for (int i = 1; i <= n; i++) jump[i] = i+1;
    root = new node(1,n-1);
    for (int i = 0; i < n-1; i++) root->up(i+1,K[i]);
    for (int i = 0; i < C; i++){
        //for (int j = 1; j <= n; j++) cout << rsqpos(j) << " ";
        //cout << "hi\n";
        int s = S[i]+1,e = E[i]+1;
        int lo1 = 0,hi1 = n+1;
        int leftpos = -1;
        while (lo1 != hi1){
            //cout << lo1 << " " << hi1 << "\n";
            int m = (lo1+hi1)/2;
            int position = rsqpos(m);
            if (position >= s){
                leftpos = m;
                hi1 = m;
            }
            else{
                lo1 = m+1;
            }
        }
        int lo2 = 0,hi2 = n+1;
        int rightpos = -1;
        while (lo2 != hi2){
            //cout << lo2 << " " << hi2 << "\n";
            int m = (lo2+hi2)/2;
            int position = rsqpos(m);
            if (position <= e){
                rightpos = m;
                lo2 = m+1;
            }
            else{
                hi2 = m;
            }
        }
        //cout << leftpos << " " << rightpos << "\n";
        int score = root->rmq(leftpos,rightpos-1);
        if (score < R){
            up(leftpos,1);
            up(rightpos+1,-1);
        }
        int start = leftpos;
        while (jump[start] != rightpos+1){
            uppos(jump[start],-1);
            start = jump[start];
        }
        jump[leftpos] = rightpos+1;
        //for (int j = 1; j <= n; j++) cout << rsqpos(j) << " ";
        //cout << "\n";
    }
    int ans = -1,maxi = -1;
    for (int i = 1; i <= n; i++){
        if (rsq(i) > maxi){
            maxi = rsq(i);
            ans = i;
        }
    }
    return ans-1;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct

Subtask #2
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 9 ms 896 KB Output is correct
3 Correct 7 ms 896 KB Output is correct
4 Correct 9 ms 896 KB Output is correct
5 Correct 9 ms 896 KB Output is correct
6 Correct 8 ms 896 KB Output is correct
7 Correct 10 ms 1024 KB Output is correct
8 Correct 9 ms 1024 KB Output is correct
9 Correct 7 ms 896 KB Output is correct
10 Correct 11 ms 1024 KB Output is correct

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 6136 KB Output is correct
2 Correct 131 ms 13552 KB Output is correct
3 Correct 50 ms 11640 KB Output is correct
4 Correct 125 ms 13560 KB Output is correct
5 Correct 118 ms 13052 KB Output is correct
6 Correct 123 ms 13052 KB Output is correct
7 Correct 120 ms 13560 KB Output is correct
8 Correct 131 ms 13432 KB Output is correct
9 Correct 43 ms 11520 KB Output is correct
10 Correct 50 ms 12024 KB Output is correct