Submission #669839

#	Time	Username	Problem	Language	Result	Execution time	Memory
669839		TS_2392	Wall (IOI14_wall)	C++14	Compilation error	0 ms	0 KiB

wall

#include <bits/stdc++.h>
#define fileIO(name) if(fopen(name".inp", "r")) {freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
#define SPEED ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0)

#define rall(x) (x).rbegin(), (x).rend()
#define all(x) (x).begin(), (x).end()
#define sqr(x) (x) * (x)

#define eb emplace_back
#define epl emplace

#define lwb lower_bound
#define upb upper_bound

#define mp make_pair
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef long double ldb;
typedef unsigned int uint;
typedef unsigned long long ull;

typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef pair<int, int> pii;
typedef pair<ldb, ldb> pld;
typedef pair<double, double> pdd;

template<class T1, class T2> bool minimize(T1 &a, T2 &b){
    if(a > b){a = b; return true;} return false;
}
template<class T1, class T2> bool maximize(T1 &a, T2 &b){
    if(a < b){a = b; return true;} return false;
}
const int N = 2e6 + 3;
int n, k, res[N];
struct Node{
    int Add = 0, Remove = N;
} st[N << 2];
void propag(int id, int v1, int v2){
    maximize(st[id].Add, v1);
    maximize(st[id].Remove, v1);
    minimize(st[id].Add, v2);
    minimize(st[id].Remove, v2);
}
void update(int id, int L, int R, int type, int Lq, int Rq, int h){
    if(R < Lq || Rq < L) return;
    if(Lq <= L && R <= Rq){
        if(type == 1){
            maximize(st[id].Add, h);
            maximize(st[id].Remove, h);
            cout << st[id].Add << ' ' << st[id].Remove << '\n';
        }
        else{
            minimize(st[id].Add, h);
            minimize(st[id].Remove, h);
            //cout << st[id].Add << ' ' << st[id].Remove << '\n';
        }
        return;
    }
    int mid = L + R >> 1;
    propag(id << 1, st[id].Add, st[id].Remove);
    propag(id << 1 | 1, st[id].Add, st[id].Remove);
    st[id].Add = 0; st[id].Remove = N;
    update(id << 1, L, mid, type, Lq, Rq, h);
    update(id << 1 | 1, mid + 1, R, type, Lq, Rq, h);
}
void Get(int id, int L, int R){
    if(L == R){
        res[L] = st[id].Add;
        //cout << st[id].Add;
        return;
    }
    propag(id << 1, st[id].Add, st[id].Remove);
    propag(id << 1 | 1, st[id].Add, st[id].Remove);
    int mid = L + R >> 1;
    Get(id << 1, L, mid);
    Get(id << 1 | 1, mid + 1, R);
}
int main(){
    SPEED;
    cin >> n >> k;
    while(k--){
        int l, r, h, type;
        cin >> type >> l >> r >> h;
        update(1, 0, n - 1, type, l, r, h);
    }
    Get(1, 0, n - 1);
    for(int i = 0; i < n; ++i) cout << res[i] << '\n';
    return 0;
}

Compilation message (stderr)

Compilation timeout while compiling wall