oj.uz

답안 #440145

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
440145 2021-07-01T16:14:44 Z FatihSolak Index (COCI21_index) C++17
60 / 110
 2500 ms 134216 KB 
#include <bits/stdc++.h>
#define N 200005
using namespace std;
int arr[N];
int cnt[N];
struct Node{
    int sum=0;
    Node *lc=NULL,*rc=NULL;
    Node(int a){
        sum = a;
    }
    Node(Node *a, Node *b){
        if(a != NULL)sum += a->sum;
        if(b != NULL)sum += b->sum;
        lc = a;
        rc = b;
    }
};
Node* build(int l,int r){
    if(l == r){
        return new Node(cnt[l]);
    }
    int m = (l+r)/2;
    return new Node(build(l,m),build(m+1,r));
}
Node* upd(Node* v,int l,int r,int pos,int val){
    if(l == r){
        return new Node(v->sum + val);
    }
    int m = (l+r)/2;
    if(pos <=m){
        return new Node(upd(v->lc,l,m,pos,val),v->rc);
    }
    else return new Node(v->lc,upd(v->rc,m+1,r,pos,val));
}
int mt;
int get(Node* v1,Node* v2,int tl,int tr, int l){
    if(tr <  l){
        return 0;
    }
    if(l <= tl){
        return v1->sum - v2 -> sum;
    }
    mt  = (tl+tr)/2;
    return get(v1->lc,v2->lc,tl,mt,l) + get(v1->rc,v2->rc,mt+1,tr,l);
}
int get(Node* v,int tl,int tr, int l){
    if(tr <  l){
        return 0;
    }
    if(l <= tl){
        return v->sum;
    }
    mt = (tl+tr)/2;
    return get(v->lc,tl,mt,l) + get(v->rc,mt+1,tr,l);
}
Node* roots[N];
int main(){
    int n,q;
    scanf("%d%d",&n,&q);
    for(int i=0;i<n;i++){
        scanf("%d",&arr[i]);
        cnt[arr[i]]++;
    }
    roots[0] = build(1,N-1);
    for(int i=1;i<n;i++){
        roots[i] = upd(roots[i-1],1,N-1,arr[i-1],-1);
    }
    int ql,qr;
    int l,r,m,val;
    while(q--){
        scanf("%d%d",&ql,&qr);
        ql--,qr--;
        l = 1,r = qr-ql+1;
        while(l < r){
            m = (l+r+1)/2;
            if(qr +1 != n){
                val = get(roots[ql],roots[qr+1],1,N-1,m);
            }
            else val = get(roots[ql],1,N-1,m);
            if(val >= m){
                l = m;
            }
            else r = m-1;
        }
        printf("%d\n",l);
    }
}

Compilation message

index.cpp: In function 'int main()':
index.cpp:60:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |     scanf("%d%d",&n,&q);
      |     ~~~~~^~~~~~~~~~~~~~
index.cpp:62:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |         scanf("%d",&arr[i]);
      |         ~~~~~^~~~~~~~~~~~~~
index.cpp:72:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |         scanf("%d%d",&ql,&qr);
      |         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 13388 KB Output is correct
2 Correct 21 ms 13340 KB Output is correct
3 Correct 21 ms 13388 KB Output is correct
4 Correct 20 ms 13404 KB Output is correct
5 Correct 20 ms 13420 KB Output is correct
6 Correct 21 ms 13380 KB Output is correct
7 Correct 21 ms 13384 KB Output is correct
8 Correct 25 ms 13380 KB Output is correct
9 Correct 20 ms 13388 KB Output is correct
10 Correct 20 ms 13388 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 13388 KB Output is correct
2 Correct 21 ms 13340 KB Output is correct
3 Correct 21 ms 13388 KB Output is correct
4 Correct 20 ms 13404 KB Output is correct
5 Correct 20 ms 13420 KB Output is correct
6 Correct 21 ms 13380 KB Output is correct
7 Correct 21 ms 13384 KB Output is correct
8 Correct 25 ms 13380 KB Output is correct
9 Correct 20 ms 13388 KB Output is correct
10 Correct 20 ms 13388 KB Output is correct
11 Correct 319 ms 43092 KB Output is correct
12 Correct 341 ms 43044 KB Output is correct
13 Correct 337 ms 43316 KB Output is correct
14 Correct 428 ms 43300 KB Output is correct
15 Correct 330 ms 43160 KB Output is correct
16 Correct 336 ms 43076 KB Output is correct
17 Correct 390 ms 43112 KB Output is correct
18 Correct 348 ms 43096 KB Output is correct
19 Correct 351 ms 43052 KB Output is correct
20 Correct 353 ms 43080 KB Output is correct

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 13388 KB Output is correct
2 Correct 21 ms 13340 KB Output is correct
3 Correct 21 ms 13388 KB Output is correct
4 Correct 20 ms 13404 KB Output is correct
5 Correct 20 ms 13420 KB Output is correct
6 Correct 21 ms 13380 KB Output is correct
7 Correct 21 ms 13384 KB Output is correct
8 Correct 25 ms 13380 KB Output is correct
9 Correct 20 ms 13388 KB Output is correct
10 Correct 20 ms 13388 KB Output is correct
11 Correct 319 ms 43092 KB Output is correct
12 Correct 341 ms 43044 KB Output is correct
13 Correct 337 ms 43316 KB Output is correct
14 Correct 428 ms 43300 KB Output is correct
15 Correct 330 ms 43160 KB Output is correct
16 Correct 336 ms 43076 KB Output is correct
17 Correct 390 ms 43112 KB Output is correct
18 Correct 348 ms 43096 KB Output is correct
19 Correct 351 ms 43052 KB Output is correct
20 Correct 353 ms 43080 KB Output is correct
21 Correct 2327 ms 134216 KB Output is correct
22 Execution timed out 2551 ms 134092 KB Time limit exceeded
23 Halted 0 ms 0 KB -