oj.uz

Submission #1113651

# Submission time Handle Problem Language Result Execution time Memory
1113651 2024-11-16T23:48:28 Z sunboi Wall (IOI14_wall) C++17
0 / 100
 129 ms 24552 KB 
#include <bits/stdc++.h>
using namespace std;
 
 
const int N = 2e5 + 1000;
vector<int> a(N);
vector<pair<long long, long long>> t(4 * N);
vector<int>lazy(4 * N);
 
void push(int v, int vl, int vr){
    
    if (lazy[v] == 1){
        t[2 * v].first = max(t[2 * v].first, t[v].first);
        t[2 * v].second = max(t[2 * v].second, t[v].second);
        t[2 * v + 1].first = max(t[2 * v + 1].first, t[v].first);
        t[2 * v + 1].second = max(t[2 * v + 1].second, t[v].second);
        lazy[2 * v] = lazy[2 * v + 1] = 1;
        lazy[v] = 0;
    }else if (lazy[v] == 2){
        t[2 * v].first = min(t[2 * v].first, t[v].first);
        t[2 * v].second = min(t[2 * v].second, t[v].second);
        t[2 * v + 1].first = min(t[2 * v + 1].first, t[v].first);
        t[2 * v + 1].second = min(t[2 * v + 1].second, t[v].second);
        lazy[2 * v] = lazy[2 * v + 1] = 2;
        lazy[v] = 0;
    }
    
 
    t[2 * v + 1].first = min(max(t[2 * v + 1].first, t[v].first), t[v].second);
    
    t[2 * v + 1].second = max(min(t[2 * v + 1].second, t[v].second), t[v].first);
}
 
 
void build(int v, int vl, int vr) {
    if (vl == vr) {
        t[v] = {0, 0};
        return;
    }
    int vm = (vl + vr) / 2;
    
    build(2 * v, vl, vm);
    build(2 * v + 1, vm + 1, vr);
    
    t[v] = {max(t[2 * v].first, t[2 * v + 1].first), min(t[2 * v].second, t[2 * v + 1].second)};
}
 
void update(int v, int vl, int vr, int l, int r, long long x){
    if (vl > r || vr < l) return;
    
    if (vl >= l && vr <= r){
        t[v] = {max(t[v].first, x), max(t[v].second, x)};
        lazy[v] = 1;
        return;
    }
    push(v, vl ,vr);
    t[v] = {0, 1e9};
    int vm = (vl + vr) / 2;
    
    update(2 * v, vl, vm, l, r, x);
    update(2 * v + 1, vm + 1, vr, l, r, x);
 
    t[v] = {max(t[2 * v].first, t[2 * v + 1].first), min(t[2 * v].second, t[2 * v + 1].second)};
}
 
void update2(int v, int vl, int vr, int l, int r, long long x){
    if (vl > r || vr < l) return;
    if (vl >= l && vr <= r){
        
        t[v] = {min(t[v].first, x), min(t[v].second, x)};
        lazy[v] = 2;
        
        return;
    }
    push(v, vl ,vr);
    t[v] = {0, 1e9};
    int vm = (vl + vr) / 2;
    
    update2(2 * v, vl, vm, l, r, x);
    update2(2 * v + 1, vm + 1, vr, l, r, x);
 
    t[v] = {max(t[2 * v].first, t[2 * v + 1].first), min(t[2 * v].second, t[2 * v + 1].second)};
}
 
int get(int v, int vl, int vr, int x){
    if (vl > x || vr < x) return 0;
    
    if (vr <= x && x <= vl){
        return t[v].first;
    }
    push(v, vl ,vr);
    t[v] = {0, 1e9};
    int vm = (vl + vr) / 2;
    
    return max(get(2 * v, vl, vm, x), get(2 * v + 1, vm + 1, vr, x));
    
}
 
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
 
    for (int i = 0; i < n; i++){
        a[i] = 0;
    }
    build(1, 0, n - 1);
    for (int i = 0; i < k; i++){
        if (op[i] == 1){
            update(1, 0, n - 1, left[i], right[i], height[i]);
        }else update2(1, 0, n - 1, left[i], right[i], height[i]);
        
    }
    for (int i = 0; i < n; i++){
        
        finalHeight[i] = get(1, 0, n - 1, i);
    }
 
    return;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16720 KB Output is correct
2 Correct 6 ms 16976 KB Output is correct
3 Incorrect 5 ms 16976 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16720 KB Output is correct
2 Correct 83 ms 24552 KB Output is correct
3 Incorrect 129 ms 20296 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16720 KB Output is correct
2 Correct 5 ms 16988 KB Output is correct
3 Incorrect 4 ms 16984 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16720 KB Output is correct
2 Correct 4 ms 16976 KB Output is correct
3 Incorrect 4 ms 17228 KB Output isn't correct
4 Halted 0 ms 0 KB -