oj.uz

Submission #949654

# Submission time Handle Problem Language Result Execution time Memory
949654 2024-03-19T14:47:08 Z Hanksburger Jousting tournament (IOI12_tournament) C++17
100 / 100
 99 ms 9076 KB 
#include <bits/stdc++.h>
using namespace std;
int bit[100005], bit2[100005], b[100005];
set<int> s;
void upd(int x, int y)
{
    for (int i=x; i<=100000; i+=i&(-i))
        bit[i]+=y;
}
void upd2(int x, int y)
{
    for (int i=x; i<=100000; i+=i&(-i))
        bit2[i]+=y;
}
int qry(int x)
{
    int res=0;
    for (int i=x; i; i-=i&(-i))
        res+=bit[i];
    return res;
}
int qry2(int x)
{
    int res=0;
    for (int i=x; i; i-=i&(-i))
        res+=bit2[i];
    return res;
}
void fix(int x, int y)
{
    upd(x, y-(qry(x)-qry(x-1)));
}
int f(int x)
{
    int l=0, r=99999;
    while (l<r)
    {
        int mid=(l+r)/2;
        if (qry(mid+1)<x)
            l=mid+1;
        else
            r=mid;
    }
    return l;
}
int GetBestPosition(int n, int m, int k, int *a, int *l, int *r)
{
    for (int i=0; i<n-1; i++)
        upd2(i+1, a[i]>k);
    for (int i=0; i<n; i++)
        upd(i+1, 2), s.insert(i);
    for (int i=0; i<m; i++)
    {
        int L=f(l[i]*2+1), R=f(r[i]*2+2);
        if (qry2(L)==qry2(R))
            b[L]++, b[R]--;
        fix(L+1, 1), fix(R+1, 1);
        vector<int> v;
        for (auto it=s.lower_bound(L+1); it!=s.end(); it++)
        {
            if (*it>=R)
                break;
            fix(*it+1, 0), v.push_back(*it);
        }
        for (int x:v)
            s.erase(s.find(x));
    }
    int ind=0, mx=b[0];
    for (int i=1; i<n; i++)
        if (mx<(b[i]+=b[i-1]))
            mx=b[i], ind=i;
    return ind;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
32.0 / 32.0

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

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 3888 KB Output is correct
2 Correct 98 ms 7508 KB Output is correct
3 Correct 39 ms 7516 KB Output is correct
4 Correct 95 ms 9040 KB Output is correct
5 Correct 93 ms 8780 KB Output is correct
6 Correct 93 ms 8284 KB Output is correct
7 Correct 97 ms 9076 KB Output is correct
8 Correct 99 ms 8960 KB Output is correct
9 Correct 32 ms 7384 KB Output is correct
10 Correct 43 ms 7252 KB Output is correct