oj.uz

Submission #949651

# Submission time Handle Problem Language Result Execution time Memory
949651 2024-03-19T14:41:34 Z Hanksburger Jousting tournament (IOI12_tournament) C++17
49 / 100
 1000 ms 3884 KB 
#include <bits/stdc++.h>
using namespace std;
int bit[100005], bit2[100005], b[100005];
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);
    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);
        for (int j=L+1; j<R; j++)
            fix(j+1, 0);
    }
    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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 0 ms 440 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 176 ms 660 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 43 ms 604 KB Output is correct
5 Correct 85 ms 624 KB Output is correct
6 Correct 4 ms 600 KB Output is correct
7 Correct 122 ms 644 KB Output is correct
8 Correct 65 ms 632 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 5 ms 676 KB Output is correct

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 1884 KB Output is correct
2 Execution timed out 1044 ms 3884 KB Time limit exceeded
3 Halted 0 ms 0 KB -