oj.uz

Submission #1015708

# Submission time Handle Problem Language Result Execution time Memory
1015708 2024-07-06T16:48:00 Z dpsaveslives Wall (IOI14_wall) C++17
100 / 100
 358 ms 59224 KB 
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;

const int MAXN = 1<<22;
pair<int,int> segtree[MAXN];
const int INF = 2e9+20;
int N;
void build(int l = 0, int r = N-1, int p = 1){
    if(l == 0 && r == N-1){
        segtree[p].f = segtree[p].s = 0;
    }
    else{
        segtree[p].f = -INF; segtree[p].s = INF;
    }
    if(l == r){
        return;
    }
    int mid = (l+r)>>1;
    build(l,mid,p<<1); build(mid+1,r,(p<<1)|1);
}
void push(int p, pair<int,int> newval){
    if(newval.s < segtree[p].f){
        segtree[p] = {newval.s,newval.s};
        return;
    }
    if(segtree[p].s < newval.f){
        segtree[p] = {newval.f,newval.f};
        return;
    }
    segtree[p] = {max(newval.f,segtree[p].f),min(newval.s,segtree[p].s)};
}
void upd(int tarl, int tarr, pair<int,int> val, int l = 0, int r = N-1, int p = 1){
    if(r < tarl || l > tarr) return;
    if(tarl <= l && r <= tarr){
        push(p,val);
        return;
    }
    int mid = (l+r)>>1;
    if(l != r){
        if(segtree[p].f != -INF || segtree[p].s != INF){
            push((p<<1),segtree[p]); push((p<<1)|1,segtree[p]);
            segtree[p].f = -INF; segtree[p].s = INF;
        }
    }
    upd(tarl,tarr,val,l,mid,p<<1); upd(tarl,tarr,val,mid+1,r,(p<<1)|1);
}
void query(int* ans, int l = 0, int r = N-1, int p = 1){
    if(l == r){
        ans[l] = segtree[p].f;
        return;
    }
    else if(segtree[p].f != -INF || segtree[p].s != INF){
        push((p<<1),segtree[p]); push((p<<1)|1,segtree[p]);
        segtree[p].f = -INF; segtree[p].s = INF;
    }
    int mid = (l+r)>>1;
    query(ans,l,mid,p<<1); query(ans,mid+1,r,(p<<1)|1);

}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
    N = n;
    build();
    for(int i = 0;i<k;++i){
        if(op[i] == 1){
            pair<int,int> val; val.s = INF; val.f = height[i];
            upd(left[i],right[i],val);
        }
        else{
            pair<int,int> val; val.f = -INF; val.s = height[i];
            upd(left[i],right[i],val);
        }
    }
    query(finalHeight);
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 4 ms 872 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 3 ms 860 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 81 ms 8088 KB Output is correct
3 Correct 102 ms 4180 KB Output is correct
4 Correct 261 ms 10832 KB Output is correct
5 Correct 135 ms 11344 KB Output is correct
6 Correct 121 ms 11164 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 70 ms 8276 KB Output is correct
9 Correct 87 ms 4196 KB Output is correct
10 Correct 253 ms 10836 KB Output is correct
11 Correct 126 ms 11344 KB Output is correct
12 Correct 122 ms 11344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 72 ms 8124 KB Output is correct
15 Correct 21 ms 1372 KB Output is correct
16 Correct 340 ms 11052 KB Output is correct
17 Correct 129 ms 11096 KB Output is correct
18 Correct 125 ms 10948 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 2 ms 812 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 67 ms 8224 KB Output is correct
9 Correct 97 ms 4176 KB Output is correct
10 Correct 250 ms 10664 KB Output is correct
11 Correct 122 ms 11348 KB Output is correct
12 Correct 143 ms 11344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 80 ms 8020 KB Output is correct
15 Correct 21 ms 1368 KB Output is correct
16 Correct 334 ms 11052 KB Output is correct
17 Correct 154 ms 11036 KB Output is correct
18 Correct 165 ms 11092 KB Output is correct
19 Correct 350 ms 59220 KB Output is correct
20 Correct 345 ms 56712 KB Output is correct
21 Correct 324 ms 59216 KB Output is correct
22 Correct 331 ms 56716 KB Output is correct
23 Correct 349 ms 56628 KB Output is correct
24 Correct 321 ms 56664 KB Output is correct
25 Correct 326 ms 56656 KB Output is correct
26 Correct 358 ms 59020 KB Output is correct
27 Correct 352 ms 59224 KB Output is correct
28 Correct 320 ms 56660 KB Output is correct
29 Correct 298 ms 56656 KB Output is correct
30 Correct 343 ms 56716 KB Output is correct