oj.uz

답안 #196881

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
196881 2020-01-17T13:05:31 Z dantoh000 Ball Machine (BOI13_ballmachine) C++14
35.5006 / 100
 350 ms 24244 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n,q;
vector<int> adjlist[N];
int ct = 1;
int p[N][20];
int d[N], mn[N], l[N], r[N], pos[N];
int fw[N], id[N];
int root;
void up(int x, int v){
    while (x <= N){
        fw[x] += v;
        x += x&(-x);
    }
}
int sum(int x){
    int res = 0;
    while (x){
        res += fw[x];
        x -= x&(-x);
    }
    return res;
}
int sum(int s, int e){
    return sum(e)-sum(s-1);
}
void print(){ for (int i = 1; i <= n; i++) printf("%d ",sum(i,i)); printf("\n");}
void dfs(int u){
    mn[u] = u;
    for (auto v : adjlist[u]){
        d[v] = d[u]+1;
        for (int k = 1; k < 20; k++){
            p[v][k] = p[p[v][k-1]][k-1];
            if (p[v][k] == 0) break;
        }
        dfs(v);
        mn[u] = min(mn[u],mn[v]);
    }
    return;
}
void visit(int u){
    l[u] = ct;
    for (auto v : adjlist[u]){
        if (mn[v] == mn[u]) visit(v);
    }
    for (auto v : adjlist[u]){
        if (mn[v] != mn[u]) visit(v);
    }
    id[ct] = u;
    pos[u] = ct;
    r[u] = ct++;
}
int add(){
    int lo = 1, hi = n;
    while (lo + 1 < hi){
        int mid = (lo+hi)/2;
        if (sum(mid) != mid) hi = mid;
        else lo = mid;
    }
    up(lo+1,1);
    ///print();
    return id[lo+1];
}
int rem(int x){
    int ans = 0;
    for (int k = 19; k >= 0; k--){
        int P = p[x][k];
        if (P && sum(l[P],r[P]) == r[P]-l[P]+1){
            x = P;
            ans |= (1<<k);
        }
    }
    up(pos[x],-1);
    ///print();
    return ans;
}
int main(){
    scanf("%d%d",&n,&q);
    for (int i = 1; i <= n; i++){
        scanf("%d",&p[i][0]);
        if (p[i][0] == 0) root = i;
        else adjlist[p[i][0]].push_back(i);
    }
    dfs(root);
    visit(root);
    for (int i = 0; i < q; i++){
        int t,x;
        scanf("%d%d",&t,&x);
        if (t == 1){
            int last;
            while (x--){
                last = add();
                //printf("added %d %d\n",i,last);
            }
            printf("%d\n",last);
        }
        else {
            printf("%d\n",rem(x));
        }
    }
}

Compilation message

ballmachine.cpp: In function 'int main()':
ballmachine.cpp:79:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&q);
     ~~~~~^~~~~~~~~~~~~~
ballmachine.cpp:81:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&p[i][0]);
         ~~~~~^~~~~~~~~~~~~~~
ballmachine.cpp:89:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&t,&x);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
19.2307692308 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2808 KB Output is correct
2 Correct 133 ms 11572 KB Output is correct
3 Incorrect 83 ms 11584 KB Output isn't correct
4 Correct 3 ms 2808 KB Output is correct
5 Correct 4 ms 2812 KB Output is correct
6 Correct 5 ms 2936 KB Output is correct
7 Correct 5 ms 2936 KB Output is correct
8 Correct 5 ms 2812 KB Output is correct
9 Correct 11 ms 3320 KB Output is correct
10 Correct 28 ms 4984 KB Output is correct
11 Correct 129 ms 11512 KB Output is correct
12 Incorrect 73 ms 11532 KB Output isn't correct
13 Incorrect 115 ms 11228 KB Output isn't correct

Subtask #2
4.28571428571 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 48 ms 7108 KB Output isn't correct
2 Incorrect 232 ms 19052 KB Output isn't correct
3 Incorrect 87 ms 15260 KB Output isn't correct
4 Incorrect 108 ms 8360 KB Output isn't correct
5 Incorrect 123 ms 8184 KB Output isn't correct
6 Correct 116 ms 8156 KB Output is correct
7 Incorrect 119 ms 7492 KB Output isn't correct
8 Incorrect 48 ms 7164 KB Output isn't correct
9 Incorrect 260 ms 19412 KB Output isn't correct
10 Incorrect 299 ms 18968 KB Output isn't correct
11 Correct 234 ms 18876 KB Output is correct
12 Incorrect 230 ms 17144 KB Output isn't correct
13 Incorrect 197 ms 21116 KB Output isn't correct
14 Incorrect 107 ms 15348 KB Output isn't correct

Subtask #3
11.4285714286 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 130 ms 11720 KB Output isn't correct
2 Incorrect 292 ms 17916 KB Output isn't correct
3 Correct 175 ms 19704 KB Output is correct
4 Incorrect 185 ms 16632 KB Output isn't correct
5 Incorrect 205 ms 16060 KB Output isn't correct
6 Incorrect 168 ms 16164 KB Output isn't correct
7 Incorrect 164 ms 14936 KB Output isn't correct
8 Correct 179 ms 19816 KB Output is correct
9 Incorrect 231 ms 19960 KB Output isn't correct
10 Correct 260 ms 19752 KB Output is correct
11 Incorrect 259 ms 19504 KB Output isn't correct
12 Incorrect 256 ms 18040 KB Output isn't correct
13 Correct 278 ms 24244 KB Output is correct
14 Incorrect 133 ms 15732 KB Output isn't correct

Subtask #4
0.555555555556 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 247 ms 19704 KB Output isn't correct
2 Incorrect 236 ms 17840 KB Output isn't correct
3 Incorrect 218 ms 23412 KB Output isn't correct
4 Incorrect 247 ms 19448 KB Output isn't correct
5 Correct 350 ms 18992 KB Output is correct
6 Incorrect 276 ms 18620 KB Output isn't correct
7 Incorrect 242 ms 17400 KB Output isn't correct
8 Incorrect 154 ms 23160 KB Output isn't correct
9 Incorrect 84 ms 15092 KB Output isn't correct