oj.uz

답안 #930125

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930125 2024-02-18T15:34:30 Z GrindMachine 벽 (IOI14_wall) C++17
100 / 100
 1600 ms 75816 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://codeforces.com/blog/entry/13442?#comment-184202

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "wall.h"

template<typename T>
struct lazysegtree {
    /*=======================================================*/

    struct data {
        int a;
    };

    struct lazy {
        int mn,mx;
    };

    data d_neutral = {0};
    lazy l_neutral = {inf1,-inf1};

    void merge(data &curr, data &left, data &right) {
        curr.a = left.a+right.a;
    }

    void create(int x, int lx, int rx, T v) {

    }

    void modify(int x, int lx, int rx, T v) {
        if(v.ff == 1){
            lz[x].mx = v.ss;
        }
        else{
            lz[x].mn = v.ss;
        }
    }

    void merge_lazy(lazy &l1, lazy &l2){
        amin(l1.mn,l2.mn);
        amax(l1.mn,l2.mx);
        amax(l1.mx,l2.mx);
        amin(l1.mx,l2.mn);
    }

    void propagate(int x, int lx, int rx) {
        auto [mn,mx] = lz[x];
        amin(tr[x].a,mn);
        amax(tr[x].a,mx);

        if(rx-lx > 1){
            merge_lazy(lz[2*x+1],lz[x]);
            merge_lazy(lz[2*x+2],lz[x]);
        }

        lz[x] = l_neutral;
    }

    /*=======================================================*/

    int siz = 1;
    vector<data> tr;
    vector<lazy> lz;

    lazysegtree() {

    }

    lazysegtree(int n) {
        while (siz < n) siz *= 2;
        tr.assign(2 * siz, d_neutral);
        lz.assign(2 * siz, l_neutral);
    }

    void build(vector<T> &a, int n, int x, int lx, int rx) {
        if (rx - lx == 1) {
            if (lx < n) {
                create(x, lx, rx, a[lx]);
            }

            return;
        }

        int mid = (lx + rx) / 2;

        build(a, n, 2 * x + 1, lx, mid);
        build(a, n, 2 * x + 2, mid, rx);

        merge(tr[x], tr[2 * x + 1], tr[2 * x + 2]);
    }

    void build(vector<T> &a, int n) {
        build(a, n, 0, 0, siz);
    }

    void rupd(int l, int r, T v, int x, int lx, int rx) {
        propagate(x, lx, rx);

        if (lx >= r or rx <= l) return;
        if (lx >= l and rx <= r) {
            modify(x, lx, rx, v);
            propagate(x, lx, rx);
            return;
        }

        int mid = (lx + rx) / 2;

        rupd(l, r, v, 2 * x + 1, lx, mid);
        rupd(l, r, v, 2 * x + 2, mid, rx);

        merge(tr[x], tr[2 * x + 1], tr[2 * x + 2]);
    }

    void rupd(int l, int r, T v) {
        rupd(l, r + 1, v, 0, 0, siz);
    }

    data query(int l, int r, int x, int lx, int rx) {
        propagate(x, lx, rx);

        if (lx >= r or rx <= l) return d_neutral;
        if (lx >= l and rx <= r) return tr[x];

        int mid = (lx + rx) / 2;

        data curr;
        data left = query(l, r, 2 * x + 1, lx, mid);
        data right = query(l, r, 2 * x + 2, mid, rx);

        merge(curr, left, right);
        return curr;
    }

    data query(int l, int r) {
        return query(l, r + 1, 0, 0, siz);
    }
};

void buildWall(int n, int m, int op[], int left[], int right[], int height[], int finalHeight[]){
    lazysegtree<pii> st(n);
    rep(i,m){
        int t = op[i], l = left[i], r = right[i], h = height[i];
        st.rupd(l,r,{t,h});
    }

    rep(i,n){
        finalHeight[i] = st.query(i,i).a;
    }
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 10 ms 1036 KB Output is correct
5 Correct 10 ms 860 KB Output is correct
6 Correct 9 ms 860 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 98 ms 13908 KB Output is correct
3 Correct 197 ms 5264 KB Output is correct
4 Correct 570 ms 21276 KB Output is correct
5 Correct 346 ms 21756 KB Output is correct
6 Correct 335 ms 20308 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 9 ms 892 KB Output is correct
5 Correct 7 ms 892 KB Output is correct
6 Correct 7 ms 856 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 99 ms 13860 KB Output is correct
9 Correct 217 ms 8292 KB Output is correct
10 Correct 603 ms 21228 KB Output is correct
11 Correct 348 ms 21876 KB Output is correct
12 Correct 351 ms 20180 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 99 ms 14064 KB Output is correct
15 Correct 35 ms 2140 KB Output is correct
16 Correct 589 ms 21332 KB Output is correct
17 Correct 370 ms 20796 KB Output is correct
18 Correct 340 ms 20560 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 10 ms 860 KB Output is correct
5 Correct 8 ms 856 KB Output is correct
6 Correct 8 ms 1112 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 100 ms 13996 KB Output is correct
9 Correct 201 ms 8300 KB Output is correct
10 Correct 567 ms 21088 KB Output is correct
11 Correct 353 ms 21752 KB Output is correct
12 Correct 354 ms 20304 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 111 ms 13884 KB Output is correct
15 Correct 40 ms 2268 KB Output is correct
16 Correct 621 ms 21208 KB Output is correct
17 Correct 353 ms 20632 KB Output is correct
18 Correct 362 ms 20644 KB Output is correct
19 Correct 1546 ms 75816 KB Output is correct
20 Correct 1600 ms 75660 KB Output is correct
21 Correct 1534 ms 75556 KB Output is correct
22 Correct 1560 ms 75628 KB Output is correct
23 Correct 1545 ms 75660 KB Output is correct
24 Correct 1538 ms 75676 KB Output is correct
25 Correct 1532 ms 75528 KB Output is correct
26 Correct 1594 ms 75760 KB Output is correct
27 Correct 1591 ms 75724 KB Output is correct
28 Correct 1562 ms 75604 KB Output is correct
29 Correct 1539 ms 75636 KB Output is correct
30 Correct 1545 ms 75600 KB Output is correct