oj.uz

Submission #767097

# Submission time Handle Problem Language Result Execution time Memory
767097 2023-06-26T11:38:31 Z Ahmed57 Jousting tournament (IOI12_tournament) C++17
100 / 100
 143 ms 16352 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>

int bit[100001];
void add(int e,int v){
    e++;
    while(e<=1e5){
        bit[e]+=v;
        e+=e&-e;
    }
}
long long sum(int e){
    e++;
    long long res = 0;
    while(e>=1){
        res+=bit[e];
        e -= e&-e;
    }
    return res;
}
int GetBestPosition(int N, int C, int R, int *K, int *S, int *E){
    set<int> bst;
    for(int i = 0;i<N-1;i++){
        if(K[i]>R){
            bst.insert(i);
        }
    }
    ordered_set s;
    for(int i = 0;i<=N;i++){
        s.insert(i);
    }
    int ans[N] = {0};
    set<int> rem;
    for(int i = 0;i<N;i++)rem.insert(i);
    for(int i = 0;i<C;i++){
        int l = *s.find_by_order(S[i]) , r = *s.find_by_order(E[i]+1) - 1;
        if(l==r)continue;
        while(*s.upper_bound(l)<=r){
            s.erase(s.upper_bound(l));
        }
        auto it = bst.lower_bound(l);
        if(it!=bst.end()&&*it<=r-1){
            auto it2 = rem.lower_bound(l);
            while(it2!=rem.end()&&(*it2)<=r){
                ans[(*it2)] = sum((*it2));
                rem.erase(it2);
                it2 = rem.lower_bound(l);
            }
        }else{
            add(l,1);
            add(r+1,-1);
        }
    }
    for(auto i:rem){
        ans[i] = sum(i);
    }
    int lol = -1 , ind = 0;
    for(int i = 0;i<N;i++){
        if(lol<ans[i]){
            lol = ans[i];
            ind = i;
        }
    }
    return ind;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 4 ms 1112 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 4 ms 980 KB Output is correct
5 Correct 4 ms 964 KB Output is correct
6 Correct 4 ms 852 KB Output is correct
7 Correct 4 ms 980 KB Output is correct
8 Correct 4 ms 1028 KB Output is correct
9 Correct 3 ms 980 KB Output is correct
10 Correct 6 ms 960 KB Output is correct

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 6604 KB Output is correct
2 Correct 143 ms 16352 KB Output is correct
3 Correct 96 ms 11224 KB Output is correct
4 Correct 141 ms 15776 KB Output is correct
5 Correct 132 ms 14924 KB Output is correct
6 Correct 141 ms 12620 KB Output is correct
7 Correct 140 ms 15416 KB Output is correct
8 Correct 138 ms 16108 KB Output is correct
9 Correct 107 ms 15180 KB Output is correct
10 Correct 109 ms 13580 KB Output is correct