oj.uz

Submission #196856

# Submission time Handle Problem Language Result Execution time Memory
196856 2020-01-17T09:59:23 Z dantoh000 Ball Machine (BOI13_ballmachine) C++14
66.7277 / 100
 344 ms 22036 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][17];
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 < 17; 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;
    }
    if (lo + 1 == hi){
        if (sum(lo) != lo) hi = lo;
        else lo = hi;
    }
    up(lo,1);
    ///print();
    return id[lo];
}
int rem(int x){
    int ans = 0;
    for (int k = 16; 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;
        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:83: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:85: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:93: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
23.0769230769 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2808 KB Output is correct
2 Correct 134 ms 10104 KB Output is correct
3 Correct 76 ms 10108 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 5 ms 2808 KB Output is correct
7 Correct 6 ms 2808 KB Output is correct
8 Correct 6 ms 2780 KB Output is correct
9 Correct 11 ms 3192 KB Output is correct
10 Correct 34 ms 4620 KB Output is correct
11 Correct 163 ms 10104 KB Output is correct
12 Correct 75 ms 10108 KB Output is correct
13 Incorrect 137 ms 9912 KB Output isn't correct

Subtask #2
21.4285714286 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 6356 KB Output is correct
2 Correct 329 ms 17296 KB Output is correct
3 Correct 86 ms 13428 KB Output is correct
4 Incorrect 122 ms 7468 KB Output isn't correct
5 Incorrect 132 ms 7152 KB Output isn't correct
6 Correct 102 ms 7160 KB Output is correct
7 Incorrect 125 ms 6432 KB Output isn't correct
8 Correct 54 ms 6492 KB Output is correct
9 Incorrect 215 ms 17580 KB Output isn't correct
10 Correct 300 ms 17332 KB Output is correct
11 Correct 296 ms 16960 KB Output is correct
12 Correct 286 ms 15444 KB Output is correct
13 Correct 187 ms 19448 KB Output is correct
14 Correct 117 ms 13300 KB Output is correct

Subtask #3
20.0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 104 ms 10300 KB Output isn't correct
2 Incorrect 344 ms 15876 KB Output isn't correct
3 Correct 244 ms 18040 KB Output is correct
4 Incorrect 189 ms 14888 KB Output isn't correct
5 Correct 162 ms 14448 KB Output is correct
6 Correct 172 ms 14420 KB Output is correct
7 Incorrect 174 ms 13176 KB Output isn't correct
8 Correct 185 ms 18040 KB Output is correct
9 Incorrect 228 ms 18140 KB Output isn't correct
10 Correct 258 ms 17656 KB Output is correct
11 Correct 266 ms 17596 KB Output is correct
12 Incorrect 312 ms 15964 KB Output isn't correct
13 Correct 283 ms 22036 KB Output is correct
14 Incorrect 154 ms 13768 KB Output isn't correct

Subtask #4
2.22222222222 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 247 ms 17884 KB Output isn't correct
2 Incorrect 252 ms 15864 KB Output isn't correct
3 Correct 153 ms 21496 KB Output is correct
4 Incorrect 256 ms 18032 KB Output isn't correct
5 Correct 257 ms 17400 KB Output is correct
6 Incorrect 218 ms 17160 KB Output isn't correct
7 Incorrect 248 ms 15900 KB Output isn't correct
8 Correct 154 ms 21496 KB Output is correct
9 Correct 101 ms 13336 KB Output is correct