oj.uz

답안 #751307

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
751307 2023-05-31T11:15:15 Z sofija6 Index (COCI21_index) C++14
60 / 110
 2500 ms 48616 KB 
#include <bits/stdc++.h>
#define ll int
#define MAXN 200002
#define MAXV 4000010
using namespace std;
ll p[MAXN],root[MAXV],l[MAXV],r[MAXV],val[MAXV],ind=1;
void Init(ll node,ll lx,ll rx)
{
    if (lx==rx)
        return;
    l[node]=ind++;
    r[node]=ind++;
    ll mid=(lx+rx)/2;
    Init(l[node],lx,mid);
    Init(r[node],mid+1,rx);
}
void Update(ll node,ll pnode,ll lx,ll rx,ll pos,ll vall)
{
    if (lx==rx)
    {
        val[node]=val[pnode]+vall;
        return;
    }
    ll mid=(lx+rx)/2;
    if (pos<=mid)
    {
        l[node]=ind++;
        r[node]=r[pnode];
        Update(l[node],l[pnode],lx,mid,pos,vall);
    }
    else
    {
        l[node]=l[pnode];
        r[node]=ind++;
        Update(r[node],r[pnode],mid+1,rx,pos,vall);
    }
    val[node]=val[l[node]]+val[r[node]];
}
ll Calc(ll node,ll lx,ll rx,ll L,ll R)
{
    if (lx>R || rx<L)
        return 0;
    if (lx>=L && rx<=R)
        return val[node];
    ll mid=(lx+rx)/2;
    return Calc(l[node],lx,mid,L,R)+Calc(r[node],mid+1,rx,L,R);
}
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,q,L,R;
    cin >> n >> q;
    for (ll i=1;i<=n;i++)
        cin >> p[i];
    root[0]=ind++;
    Init(root[0],1,MAXN);
    for (ll i=1;i<=n;i++)
    {
        root[i]=ind++;
        Update(root[i],root[i-1],1,MAXN,p[i],1);
    }
    while (q--)
    {
        cin >> L >> R;
        ll l=1,r=R-L+1,mid,ans;
        while (l<=r)
        {
            mid=(l+r)/2;
            if (Calc(root[R],1,MAXN,mid,MAXN)-Calc(root[L-1],1,MAXN,mid,MAXN)>=mid)
            {
                ans=mid;
                l=mid+1;
            }
            else
                r=mid-1;
        }
        cout << ans << "\n";
    }
    return 0;
}

Compilation message

index.cpp: In function 'int main()':
index.cpp:77:24: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   77 |         cout << ans << "\n";
      |                        ^~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3668 KB Output is correct
2 Correct 6 ms 3668 KB Output is correct
3 Correct 5 ms 3732 KB Output is correct
4 Correct 6 ms 3796 KB Output is correct
5 Correct 5 ms 3732 KB Output is correct
6 Correct 5 ms 3668 KB Output is correct
7 Correct 5 ms 3668 KB Output is correct
8 Correct 5 ms 3668 KB Output is correct
9 Correct 6 ms 3668 KB Output is correct
10 Correct 5 ms 3668 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3668 KB Output is correct
2 Correct 6 ms 3668 KB Output is correct
3 Correct 5 ms 3732 KB Output is correct
4 Correct 6 ms 3796 KB Output is correct
5 Correct 5 ms 3732 KB Output is correct
6 Correct 5 ms 3668 KB Output is correct
7 Correct 5 ms 3668 KB Output is correct
8 Correct 5 ms 3668 KB Output is correct
9 Correct 6 ms 3668 KB Output is correct
10 Correct 5 ms 3668 KB Output is correct
11 Correct 288 ms 15092 KB Output is correct
12 Correct 301 ms 15192 KB Output is correct
13 Correct 303 ms 15224 KB Output is correct
14 Correct 294 ms 15132 KB Output is correct
15 Correct 303 ms 15200 KB Output is correct
16 Correct 320 ms 15104 KB Output is correct
17 Correct 338 ms 15156 KB Output is correct
18 Correct 315 ms 15140 KB Output is correct
19 Correct 339 ms 15272 KB Output is correct
20 Correct 283 ms 15132 KB Output is correct

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3668 KB Output is correct
2 Correct 6 ms 3668 KB Output is correct
3 Correct 5 ms 3732 KB Output is correct
4 Correct 6 ms 3796 KB Output is correct
5 Correct 5 ms 3732 KB Output is correct
6 Correct 5 ms 3668 KB Output is correct
7 Correct 5 ms 3668 KB Output is correct
8 Correct 5 ms 3668 KB Output is correct
9 Correct 6 ms 3668 KB Output is correct
10 Correct 5 ms 3668 KB Output is correct
11 Correct 288 ms 15092 KB Output is correct
12 Correct 301 ms 15192 KB Output is correct
13 Correct 303 ms 15224 KB Output is correct
14 Correct 294 ms 15132 KB Output is correct
15 Correct 303 ms 15200 KB Output is correct
16 Correct 320 ms 15104 KB Output is correct
17 Correct 338 ms 15156 KB Output is correct
18 Correct 315 ms 15140 KB Output is correct
19 Correct 339 ms 15272 KB Output is correct
20 Correct 283 ms 15132 KB Output is correct
21 Execution timed out 2539 ms 48616 KB Time limit exceeded
22 Halted 0 ms 0 KB -