Submission #485576

#	Time	Username	Problem	Language	Result	Execution time	Memory
485576		Mazaalai	Wall (IOI14_wall)	C++14	61 / 100	572 ms	67036 KiB

wall

#include "wall.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int N1 = 2e6 + 5;
const int M = 4 * N;
struct Node {
    int mini, maxi, lazy;
    Node() {
        mini = maxi = 0;
        lazy = -1;
    }
    void setMinMax(int a, int b) {
        mini = a, maxi = b;
    }
};
vector <int> ans(N1);
vector <int> idx(N1);
vector <Node> node(M);
void propagate(int head) {
    if (node[head].lazy == -1) return;
    int val = node[head].lazy;
    node[head].lazy = -1;
    node[head*2+1].setMinMax(val, val);
    node[head*2+2].setMinMax(val, val);
    node[head*2+1].lazy = val;
    node[head*2+2].lazy = val;
}
void update(int l, int r, int L, int R, int val, bool type, int head) {
    if ((l > R) || 
        (L > r) ||
        (type && node[head].mini >= val) ||
        (!type && node[head].maxi <= val)
    ) return;
    if (L <= l && r <= R && node[head].mini == node[head].maxi) {
        node[head].setMinMax(val, val);
        node[head].lazy = val;
        return;
    }
    propagate(head);

    int mid = (l+r)>>1;
    update(l, mid, L, R, val, type, head*2+1);
    update(mid+1, r, L, R, val, type, head*2+2);
    node[head].setMinMax(
        min(node[head*2+1].mini, node[head*2+2].mini),
        max(node[head*2+1].maxi, node[head*2+2].maxi)
    );

}
void dfs(int l, int r, int head) {
    if (l == r) {
        ans[l] = node[head].mini;
        return;
    }
    propagate(head);
    int mid = (l+r)>>1;
    dfs(l, mid, head*2+1);
    dfs(mid+1, r, head*2+2);
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
    
    // compress left right, 
    for (int i = 0; i < k; i++) {
        idx[left[i]] = idx[right[i]] = 1;
    }
    int curId = 0;
    for (int i = 0; i < n; i++) {
        if (idx[i] == 1) {
            idx[i] = curId++;
            continue;
        }
        int j = i;
        while(j + 1 < n && idx[j+1]==0) j++;
        for (int k = i; k <= j; k++) idx[k] = curId;
        i = j;
        curId++;
    }
    //  update
    for (int i = 0; i < k; i++) {
        update(0, n-1, idx[left[i]], idx[right[i]], height[i], (op[i]==1?1:0), 0);
    }
    dfs(0, n-1, 0);
    for (int i = 0; i < n; i++) finalHeight[i] = ans[idx[i]];
    return;
}

• Subtask 1: 8 / 8
• Subtask 2: 24 / 24
• Subtask 3: 29 / 29
• Subtask 4: 0 / 39