제출 #1234218

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1234218		Zbyszek99	Jousting tournament (IOI12_tournament)	C++20	100 / 100	94 ms	6372 KiB

tournament

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

const int tree_siz = 1024*256-1;
int sum[tree_siz+1];

int get_kth(int akt, int p1, int p2, int k)
{
    if(k == 0) return -1;
    if(p1 == p2) return p1;
    if(sum[akt*2] >= k) return get_kth(akt*2,p1,(p1+p2)/2,k);
    return get_kth(akt*2+1,(p1+p2)/2+1,p2,k-sum[akt*2]); 
}

void upd(int v)
{
    sum[v] = sum[v*2] + sum[v*2+1];
    if(v != 1) upd(v/2);
}

void change(int ind, int x)
{
    sum[tree_siz/2+ind+1] = x;
    upd((tree_siz/2+1+ind)/2);
}

pii max_[tree_siz+1];
int oper[tree_siz+1];

void spych(int v)
{
    max_[v*2].ff += oper[v];
    max_[v*2+1].ff += oper[v];
    oper[v*2] += oper[v];
    oper[v*2+1] += oper[v];
    oper[v] = 0; 
}

void add_seg(int akt, int p1, int p2, int s1, int s2, int w)
{
    if(p2 < s1 || p1 > s2) return;
    if(p1 >= s1 && p2 <= s2)
    {
        max_[akt].ff+=w;
        oper[akt]+=w;
        return;
    }
    spych(akt);
    add_seg(akt*2,p1,(p1+p2)/2,s1,s2,w);
    add_seg(akt*2+1,(p1+p2)/2+1,p2,s1,s2,w);
    max_[akt] = max(max_[akt*2],max_[akt*2+1]);
}

pii get_max(int akt, int p1, int p2, int s1, int s2)
{
    if(p2 < s1 || p1 > s2) return {-1e9,0};
    if(p1 >= s1 && p2 <= s2) return max_[akt];
    spych(akt);
    return max(get_max(akt*2,p1,(p1+p2)/2,s1,s2),get_max(akt*2+1,(p1+p2)/2+1,p2,s1,s2));
}

int pref[100'001];

int GetBestPosition(int n, int C, int st, int *K, int *L, int *R) 
{
    rep2(i,tree_siz/2+1,tree_siz)
    {
        max_[i].ss = i - (tree_siz/2+1);
    }
    for(int i = tree_siz/2; i >= 1; i--) max_[i] = max(max_[i*2],max_[i*2+1]);
    rep(i,n) change(i,1);
    vector<pii> opers;
    rep(i,C)
    {
        int l = get_kth(1,0,tree_siz/2,L[i])+1;
        int r = get_kth(1,0,tree_siz/2,R[i]+1);
        opers.pb({l,r});
        rep(j,R[i]-L[i])
        {
            change(get_kth(1,0,tree_siz/2,L[i]+1),0);
        }
    }
    rep2(i,1,n-1)
    {
        pref[i] = pref[i-1] + (K[i-1] > st ? 1 : 0);
    }
    pii ans = {0,0};
    forall(it,opers)
    {
        if(pref[it.ss] - pref[it.ff] == 0)
        {
            add_seg(1,0,tree_siz/2,it.ff,it.ss,1);
        }
        else 
        {
            pii p = get_max(1,0,tree_siz/2,it.ff,it.ss);
            while(p.ff > 0)
            {
                ans = max(ans,{p.ff,-p.ss});
                add_seg(1,0,tree_siz/2,p.ss,p.ss,-1e9);
                p = get_max(1,0,tree_siz/2,it.ff,it.ss);
                
            }
        }
    }
    pii p = get_max(1,0,tree_siz/2,0,n-1);
    ans = max(ans,{p.ff,-p.ss});
    //cerr << ans.ff << " " << -ans.ss << " ans\n";
    return -ans.ss;
}

• Subtask 1: 17 / 17
• Subtask 2: 32 / 32
• Subtask 3: 51 / 51