oj.uz

Submission #1113634

# Submission time Handle Problem Language Result Execution time Memory
1113634 2024-11-16T21:22:40 Z sunboi Wall (IOI14_wall) C++17
0 / 100
 143 ms 27416 KB 
#include <bits/stdc++.h>
#include "wall.h"
using namespace std;


const int N = 2e5 + 10;
vector<int> a(N);
vector<pair<int, int>> t(4 * N);
vector<pair<int, int>> lazy(4 * N);

void push(int v, int vl, int vr){
    if (lazy[v].second == 1){
            int x = lazy[v].first;
            t[v * 2] = {min(t[v * 2].first, x), min(t[v * 2].second, x)};
            t[v * 2 + 1] = {min(t[v * 2 + 1].first, x), min(t[v * 2 + 1].second, x)};
            
            
            if (lazy[v * 2].second == 0) lazy[v * 2] = {x, 0};
            else lazy[v * 2] = {min(lazy[v * 2].first, x), 0};
            
            
            if (lazy[v * 2 + 1].second == 0) lazy[v * 2 + 1] = {x, 0};
            else lazy[v * 2 + 1] = {min(lazy[v * 2 + 1].first, x), 0};
            
            
            lazy[v] = {0, 0};   
    }else{
           int x = lazy[v].first;
            t[v * 2] = {max(t[v * 2].first, x), max(t[v * 2].second, x)};
            t[v * 2 + 1] = {max(t[v * 2 + 1].first, x), max(t[v * 2 + 1].second, x)};
            
            
            if (lazy[v * 2].second == 1) lazy[v * 2] = {x, 0};
            else lazy[v * 2] = {max(lazy[v * 2].first, x), 0};
            
            
            if (lazy[v * 2 + 1].second == 1) lazy[v * 2 + 1] = {x, 0};
            else lazy[v * 2 + 1] = {max(lazy[v * 2 + 1].first, x), 0};
            
            
            lazy[v] = {0, 0};   
    }
}


void build(int v, int vl, int vr) {
    if (vl == vr) {
        t[v] = {a[vl], a[vl]};
        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, int x){
    if (vl > r || vr < l) return;
    if (vl >= l && vr <= r){
        t[v] = {max(t[v].first, x), max(t[v].second, x)};
        
        if (lazy[v].second == 1) lazy[v] = {x, 0};
        else lazy[v] = {max(lazy[v].first, x), 0};
        
        return;
    }
    push(v, vl ,vr);
    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, int x){
    if (vl > r || vr < l) return;
    if (vl >= l && vr <= r){
        t[v] = {min(t[v].first, x), min(t[v].second, x)};
        
        if (lazy[v].second == 0) lazy[v] = {x, 1};
        else lazy[v] = {min(lazy[v].first, x), 0};
        
        return;
    }
    push(v, vl ,vr);
    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);
    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 8 ms 13648 KB Output is correct
2 Correct 10 ms 13648 KB Output is correct
3 Incorrect 9 ms 13648 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 13648 KB Output is correct
2 Correct 101 ms 27416 KB Output is correct
3 Incorrect 143 ms 20808 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 13648 KB Output is correct
2 Correct 11 ms 13648 KB Output is correct
3 Incorrect 10 ms 13788 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 13648 KB Output is correct
2 Correct 10 ms 13816 KB Output is correct
3 Incorrect 9 ms 13648 KB Output isn't correct
4 Halted 0 ms 0 KB -