oj.uz

답안 #502439

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
502439 2022-01-06T02:31:59 Z cig32 푸드 코트 (JOI21_foodcourt) C++17
28 / 100
 932 ms 214844 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long

const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
    int u = uniform_int_distribution<int>(x, y)(rng);
    return u;
}
int bm(int b, int p) { // bigmod
    if(p==0) return 1;
    int r = bm(b, p/2);
    if(p&1) return (((r*r) % MOD) * b) % MOD;
    return (r*r) % MOD;
}
int N, M, Q;

struct segtree_beats {
    bool cmp(__int128 x, __int128 y) { return x > y; }
    int stok;
    const __int128 extr = 2e18;
    struct node {
        __int128 max1, max2, maxc;
        __int128 min1, min2, minc;
        __int128 lazy, sum;
        __int128 l, r;
    };
    vector<node> a;
    void pushtag_max(int idx, __int128 val) {
        if(val >= a[idx].max1) return;
        a[idx].sum -= (a[idx].max1 - val) * a[idx].maxc;
        a[idx].max1 = val;
        if(a[idx].l == a[idx].r) {
            a[idx].min1 = val;
        }
        else {
            if(a[idx].min1 >= val) {
                a[idx].min1 = val;
                a[idx].min2 = extr;
                a[idx].minc = a[idx].r - a[idx].l + 1;
            }
            else if(a[idx].min2 > val && a[idx].min2 != extr) {
                a[idx].min2 = val;
            }
        }
    }
    void pushtag_min(int idx, __int128 val) {
        if(val <= a[idx].min1) return;
        a[idx].sum += (val - a[idx].min1) * a[idx].minc;
        a[idx].min1 = val;
        if(a[idx].l == a[idx].r) {
            a[idx].max1 = val;
        }
        else {
            if(a[idx].max1 <= val) {
                a[idx].max1 = val;
                a[idx].max2 = -extr;
                a[idx].maxc = a[idx].r - a[idx].l + 1;
            }
            else if(a[idx].max2 < val && a[idx].max2 != -extr) {
                a[idx].max2 = val;
            }
        }
    }
    void pushtag_add(int idx, __int128 val) {
        a[idx].max1 += val;
        if(a[idx].max2 != -extr) a[idx].max2 += val;
        a[idx].min1 += val;
        if(a[idx].min2 != extr) a[idx].min2 += val;
        a[idx].lazy += val;
        a[idx].sum += val * (a[idx].r - a[idx].l + 1);
    }
    void pushdown(int idx) {
        pushtag_add(2*idx+1, a[idx].lazy);
        pushtag_add(2*idx+2, a[idx].lazy);
        a[idx].lazy = 0;
        pushtag_max(2*idx+1, a[idx].max1);
        pushtag_max(2*idx+2, a[idx].max1);
        pushtag_min(2*idx+1, a[idx].min1);
        pushtag_min(2*idx+2, a[idx].min1);
    }
    void pushup(int idx) {
        __int128 max1, max2, maxc;
        __int128 min1, min2, minc;
        __int128 lazy, sum;
        __int128 l, r;
        a[idx].max1 = max(a[2*idx+1].max1, a[2*idx+2].max1);
        a[idx].max2 = (a[2*idx+1].max1 == a[2*idx+2].max1 ?
                       max(a[2*idx+1].max2, a[2*idx+2].max2) :
                       (a[2*idx+1].max1 < a[2*idx+2].max1 ?
                        max(a[2*idx+1].max1, a[2*idx+2].max2) : 
                        max(a[2*idx+1].max2, a[2*idx+2].max1)
                        ));
        a[idx].maxc = (a[2*idx+1].max1 == a[2*idx+2].max1 ? 
                       a[2*idx+1].maxc + a[2*idx+2].maxc :
                       (a[2*idx+1].max1 < a[2*idx+2].max1 ? 
                        a[2*idx+2].maxc :
                        a[2*idx+1].maxc)
                       );
        a[idx].min1 = min(a[2*idx+1].min1, a[2*idx+2].min1);
        a[idx].min2 = (a[2*idx+1].min1 == a[2*idx+2].min1 ?
                       min(a[2*idx+1].min2, a[2*idx+2].min2) :
                       (a[2*idx+1].min1 > a[2*idx+2].min1 ?
                        min(a[2*idx+1].min1, a[2*idx+2].min2) : 
                        min(a[2*idx+1].min2, a[2*idx+2].min1)
                        ));
        a[idx].minc = (a[2*idx+1].min1 == a[2*idx+2].min1 ? 
                       a[2*idx+1].minc + a[2*idx+2].minc :
                       (a[2*idx+1].min1 > a[2*idx+2].min1 ? 
                        a[2*idx+2].minc :
                        a[2*idx+1].minc)
                       );
        a[idx].sum = a[2*idx+1].sum + a[2*idx+2].sum;
    }
    void init1(int l, int r, int idx, __int128 val) {
        a[idx].l = l, a[idx].r = r;
        if(l == r) {
            a[idx].max1 = a[idx].min1 = val;
            a[idx].max2 = -extr;
            a[idx].min2 = extr;
            a[idx].maxc = a[idx].minc = 1;
            a[idx].lazy = 0;
            a[idx].sum = val;
            return;
        }
        int mid = (l+r) >> 1;
        init1(l, mid, 2*idx+1, val);
        init1(mid+1, r, 2*idx+2, val);
        pushup(idx);
    }
    void u1(int l, int r, int constl, int constr, int idx, __int128 v) {
        if(v >= a[idx].max1) return;
        if(l<=constl && constr<=r && v>a[idx].max2) {
            pushtag_max(idx, v);
            return;
        }
        pushdown(idx);
        int mid = (constl+constr) >> 1;
        if(mid < l || r < constl) u1(l, r, mid+1, constr, 2*idx+2, v);
        else if(constr < l || r < mid+1) u1(l, r, constl, mid, 2*idx+1, v);
        else {
            u1(l, r, constl, mid, 2*idx+1, v);
            u1(l, r, mid+1, constr, 2*idx+2, v);
        }
        pushup(idx);
    }
    void u2(int l, int r, int constl, int constr, int idx, __int128 v) {
        if(v <= a[idx].min1) return;
        if(l<=constl && constr<=r && v<a[idx].min2) {
            pushtag_min(idx, v);
            return;
        }
        pushdown(idx);
        int mid = (constl+constr) >> 1;
        if(mid < l || r < constl) u2(l, r, mid+1, constr, 2*idx+2, v);
        else if(constr < l || r < mid+1) u2(l, r, constl, mid, 2*idx+1, v);
        else {
            u2(l, r, constl, mid, 2*idx+1, v);
            u2(l, r, mid+1, constr, 2*idx+2, v);
        }
        pushup(idx);
    }
    void u3(int l, int r, int constl, int constr, int idx, __int128 v) {
        if(l <= constl && constr <= r) {
            pushtag_add(idx, v);
            return;
        }
        pushdown(idx);
        int mid = (constl+constr) >> 1;
        if(mid < l || r < constl) u3(l, r, mid+1, constr, 2*idx+2, v);
        else if(constr < l || r < mid+1) u3(l, r, constl, mid, 2*idx+1, v);
        else {
            u3(l, r, constl, mid, 2*idx+1, v);
            u3(l, r, mid+1, constr, 2*idx+2, v);
        }
        pushup(idx);
    }
    __int128 qu(int l, int r, int constl, int constr, int idx) {
        if(l <= constl && constr <= r) {
            return a[idx].sum;
        }
        pushdown(idx);
        int mid = (constl+constr) >> 1;
        if(mid < l || r < constl) return qu(l, r, mid+1, constr, 2*idx+2);
        else if(constr < l || r < mid+1) return qu(l, r, constl, mid, 2*idx+1);
        else {
            return qu(l, r, constl, mid, 2*idx+1) + qu(l, r, mid+1, constr, 2*idx+2);
        }
    }
    public:
    void resize(int k) {
        stok = k;
        a.resize(4*k + 10);
    }
    void init(__int128 v) { // Initialize everything to v
        init1(0, stok, 0, v);
    }
    void min_with(int l, int r, __int128 v) {
        u1(l, r, 0, stok, 0, v);
    }
    void max_with(int l, int r, __int128 v) {
        u2(l, r, 0, stok, 0, v);
    }
    void range_add(int l, int r, __int128 v) {
        u3(l, r, 0, stok, 0, v);
    }
    long long query_sum(int l, int r) {
        return (long long)qu(l, r, 0, stok, 0);
    }
};

segtree_beats a;
void join(int l, int r, int c, int k) {
    a.range_add(l, r, k);
}
void leave(int l, int r, int k) {
    a.range_add(l, r, -k);
    a.max_with(l, r, 0);
}
int service(int shop, int b) {
    return (a.query_sum(shop, shop) >= b ? 1 : 0);
}
struct easy {
    deque<pair<int, int> > ok[MAXN];
    public:
    void join(int l, int r, int c, int k) {
        for(int i=l; i<=r; i++) ok[i].push_back({c, k});
    }
    void leave(int l, int r, int k) {
        for(int i=l; i<=r; i++) {
            int m = k;
            while(ok[i].size() && m > 0) {
                pair<int, int> f = ok[i].front();
                if(m >= f.second) {
                    m -= f.second;
                    ok[i].pop_front();
                }
                else {
                    f.second -= m;
                    ok[i].pop_front();
                    ok[i].push_front(f);
                    break;
                }
            }
        }
    }
    int service(int a, int b) {
        stack<pair<int, int> > st;
        int ans = 0;
        while(ok[a].size()) {
            pair<int, int> f = ok[a].front();
            if(b <= f.second) {
                ans = f.first;
                break;
            }
            else b -= f.second;
            st.push(f);
            ok[a].pop_front();
        }
        while(st.size()) {
            ok[a].push_front(st.top());
            st.pop();
        }
        return ans;
    }
};
void solve_easy() {
    easy ono;
    while(Q--) {
        int t;
        cin >> t;
        if(t == 1) {
            int l, r, c, k;
            cin >> l >> r >> c >> k;
            ono.join(l, r, c, k);
        }
        else if(t == 2) {
            int l, r, k;
            cin >> l >> r >> k;
            ono.leave(l, r, k);
        }
        else {
            int a, b;
            cin >> a >> b;
            cout << ono.service(a, b) << "\n";
        }
    }
}
void solve(int tc) {
    cin >> N >> M >> Q;
    if(N <= 2000 && Q <= 2000) {
        solve_easy();
        return;
    }
    a.resize(N);
    a.init(0);
    while(Q--) {
        int t;
        cin >> t;
        if(t == 1) {
            int l, r, c, k;
            cin >> l >> r >> c >> k;
            join(l, r, c, k);
        }
        else if(t == 2) {
            int l, r, k;
            cin >> l >> r >> k;
            leave(l, r, k);
        }
        else {
            int a, b;
            cin >> a >> b;
            cout << service(a, b) << "\n";
        }
    }
}
int32_t main(){
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1; //cin >> t;
    for(int i=1; i<=t; i++) {
        solve(i);
    }
}

Compilation message

foodcourt.cpp: In member function 'void segtree_beats::pushup(long long int)':
foodcourt.cpp:86:18: warning: unused variable 'max1' [-Wunused-variable]
   86 |         __int128 max1, max2, maxc;
      |                  ^~~~
foodcourt.cpp:86:24: warning: unused variable 'max2' [-Wunused-variable]
   86 |         __int128 max1, max2, maxc;
      |                        ^~~~
foodcourt.cpp:86:30: warning: unused variable 'maxc' [-Wunused-variable]
   86 |         __int128 max1, max2, maxc;
      |                              ^~~~
foodcourt.cpp:87:18: warning: unused variable 'min1' [-Wunused-variable]
   87 |         __int128 min1, min2, minc;
      |                  ^~~~
foodcourt.cpp:87:24: warning: unused variable 'min2' [-Wunused-variable]
   87 |         __int128 min1, min2, minc;
      |                        ^~~~
foodcourt.cpp:87:30: warning: unused variable 'minc' [-Wunused-variable]
   87 |         __int128 min1, min2, minc;
      |                              ^~~~
foodcourt.cpp:88:18: warning: unused variable 'lazy' [-Wunused-variable]
   88 |         __int128 lazy, sum;
      |                  ^~~~
foodcourt.cpp:88:24: warning: unused variable 'sum' [-Wunused-variable]
   88 |         __int128 lazy, sum;
      |                        ^~~
foodcourt.cpp:89:18: warning: unused variable 'l' [-Wunused-variable]
   89 |         __int128 l, r;
      |                  ^
foodcourt.cpp:89:21: warning: unused variable 'r' [-Wunused-variable]
   89 |         __int128 l, r;
      |                     ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 202620 KB Output is correct
2 Correct 130 ms 203104 KB Output is correct
3 Correct 134 ms 209596 KB Output is correct
4 Correct 155 ms 213280 KB Output is correct
5 Correct 115 ms 202180 KB Output is correct
6 Correct 113 ms 202248 KB Output is correct
7 Correct 144 ms 214844 KB Output is correct
8 Correct 143 ms 210504 KB Output is correct
9 Correct 137 ms 203108 KB Output is correct
10 Correct 151 ms 209848 KB Output is correct
11 Correct 137 ms 207040 KB Output is correct
12 Correct 135 ms 203108 KB Output is correct
13 Correct 131 ms 203216 KB Output is correct
14 Correct 137 ms 204296 KB Output is correct
15 Correct 133 ms 205228 KB Output is correct
16 Correct 136 ms 204260 KB Output is correct
17 Correct 133 ms 202612 KB Output is correct
18 Correct 134 ms 202712 KB Output is correct
19 Correct 112 ms 202184 KB Output is correct
20 Correct 112 ms 202336 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 202620 KB Output is correct
2 Correct 130 ms 203104 KB Output is correct
3 Correct 134 ms 209596 KB Output is correct
4 Correct 155 ms 213280 KB Output is correct
5 Correct 115 ms 202180 KB Output is correct
6 Correct 113 ms 202248 KB Output is correct
7 Correct 144 ms 214844 KB Output is correct
8 Correct 143 ms 210504 KB Output is correct
9 Correct 137 ms 203108 KB Output is correct
10 Correct 151 ms 209848 KB Output is correct
11 Correct 137 ms 207040 KB Output is correct
12 Correct 135 ms 203108 KB Output is correct
13 Correct 131 ms 203216 KB Output is correct
14 Correct 137 ms 204296 KB Output is correct
15 Correct 133 ms 205228 KB Output is correct
16 Correct 136 ms 204260 KB Output is correct
17 Correct 133 ms 202612 KB Output is correct
18 Correct 134 ms 202712 KB Output is correct
19 Correct 112 ms 202184 KB Output is correct
20 Correct 112 ms 202336 KB Output is correct
21 Correct 134 ms 203068 KB Output is correct
22 Correct 134 ms 203136 KB Output is correct
23 Correct 135 ms 209600 KB Output is correct
24 Correct 143 ms 213396 KB Output is correct
25 Correct 117 ms 202172 KB Output is correct
26 Correct 131 ms 202276 KB Output is correct
27 Correct 145 ms 214212 KB Output is correct
28 Correct 148 ms 211204 KB Output is correct
29 Correct 142 ms 205012 KB Output is correct
30 Correct 163 ms 209520 KB Output is correct
31 Correct 143 ms 206848 KB Output is correct
32 Correct 135 ms 203080 KB Output is correct
33 Correct 141 ms 203104 KB Output is correct
34 Correct 145 ms 205392 KB Output is correct
35 Correct 138 ms 203752 KB Output is correct
36 Correct 149 ms 204312 KB Output is correct
37 Correct 125 ms 202252 KB Output is correct
38 Correct 111 ms 202192 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 197 ms 41052 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 824 ms 140964 KB Output is correct
2 Correct 687 ms 122208 KB Output is correct
3 Correct 787 ms 157016 KB Output is correct
4 Correct 573 ms 155696 KB Output is correct
5 Correct 530 ms 117704 KB Output is correct
6 Correct 765 ms 157000 KB Output is correct
7 Correct 78 ms 352 KB Output is correct
8 Correct 79 ms 372 KB Output is correct
9 Correct 699 ms 157152 KB Output is correct
10 Correct 640 ms 156996 KB Output is correct
11 Correct 775 ms 156924 KB Output is correct
12 Correct 736 ms 156996 KB Output is correct
13 Correct 734 ms 157152 KB Output is correct
14 Correct 837 ms 156928 KB Output is correct
15 Correct 926 ms 157020 KB Output is correct
16 Correct 903 ms 156904 KB Output is correct
17 Correct 882 ms 157000 KB Output is correct
18 Correct 815 ms 156928 KB Output is correct
19 Correct 853 ms 157068 KB Output is correct
20 Correct 932 ms 157028 KB Output is correct
21 Correct 870 ms 156980 KB Output is correct
22 Correct 892 ms 157092 KB Output is correct
23 Correct 842 ms 156932 KB Output is correct
24 Correct 874 ms 157060 KB Output is correct
25 Correct 530 ms 121272 KB Output is correct
26 Correct 548 ms 156912 KB Output is correct
27 Correct 712 ms 156888 KB Output is correct

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 202620 KB Output is correct
2 Correct 130 ms 203104 KB Output is correct
3 Correct 134 ms 209596 KB Output is correct
4 Correct 155 ms 213280 KB Output is correct
5 Correct 115 ms 202180 KB Output is correct
6 Correct 113 ms 202248 KB Output is correct
7 Correct 144 ms 214844 KB Output is correct
8 Correct 143 ms 210504 KB Output is correct
9 Correct 137 ms 203108 KB Output is correct
10 Correct 151 ms 209848 KB Output is correct
11 Correct 137 ms 207040 KB Output is correct
12 Correct 135 ms 203108 KB Output is correct
13 Correct 131 ms 203216 KB Output is correct
14 Correct 137 ms 204296 KB Output is correct
15 Correct 133 ms 205228 KB Output is correct
16 Correct 136 ms 204260 KB Output is correct
17 Correct 133 ms 202612 KB Output is correct
18 Correct 134 ms 202712 KB Output is correct
19 Correct 112 ms 202184 KB Output is correct
20 Correct 112 ms 202336 KB Output is correct
21 Incorrect 197 ms 41052 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 154 ms 39584 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 202620 KB Output is correct
2 Correct 130 ms 203104 KB Output is correct
3 Correct 134 ms 209596 KB Output is correct
4 Correct 155 ms 213280 KB Output is correct
5 Correct 115 ms 202180 KB Output is correct
6 Correct 113 ms 202248 KB Output is correct
7 Correct 144 ms 214844 KB Output is correct
8 Correct 143 ms 210504 KB Output is correct
9 Correct 137 ms 203108 KB Output is correct
10 Correct 151 ms 209848 KB Output is correct
11 Correct 137 ms 207040 KB Output is correct
12 Correct 135 ms 203108 KB Output is correct
13 Correct 131 ms 203216 KB Output is correct
14 Correct 137 ms 204296 KB Output is correct
15 Correct 133 ms 205228 KB Output is correct
16 Correct 136 ms 204260 KB Output is correct
17 Correct 133 ms 202612 KB Output is correct
18 Correct 134 ms 202712 KB Output is correct
19 Correct 112 ms 202184 KB Output is correct
20 Correct 112 ms 202336 KB Output is correct
21 Correct 134 ms 203068 KB Output is correct
22 Correct 134 ms 203136 KB Output is correct
23 Correct 135 ms 209600 KB Output is correct
24 Correct 143 ms 213396 KB Output is correct
25 Correct 117 ms 202172 KB Output is correct
26 Correct 131 ms 202276 KB Output is correct
27 Correct 145 ms 214212 KB Output is correct
28 Correct 148 ms 211204 KB Output is correct
29 Correct 142 ms 205012 KB Output is correct
30 Correct 163 ms 209520 KB Output is correct
31 Correct 143 ms 206848 KB Output is correct
32 Correct 135 ms 203080 KB Output is correct
33 Correct 141 ms 203104 KB Output is correct
34 Correct 145 ms 205392 KB Output is correct
35 Correct 138 ms 203752 KB Output is correct
36 Correct 149 ms 204312 KB Output is correct
37 Correct 125 ms 202252 KB Output is correct
38 Correct 111 ms 202192 KB Output is correct
39 Incorrect 197 ms 41052 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 202620 KB Output is correct
2 Correct 130 ms 203104 KB Output is correct
3 Correct 134 ms 209596 KB Output is correct
4 Correct 155 ms 213280 KB Output is correct
5 Correct 115 ms 202180 KB Output is correct
6 Correct 113 ms 202248 KB Output is correct
7 Correct 144 ms 214844 KB Output is correct
8 Correct 143 ms 210504 KB Output is correct
9 Correct 137 ms 203108 KB Output is correct
10 Correct 151 ms 209848 KB Output is correct
11 Correct 137 ms 207040 KB Output is correct
12 Correct 135 ms 203108 KB Output is correct
13 Correct 131 ms 203216 KB Output is correct
14 Correct 137 ms 204296 KB Output is correct
15 Correct 133 ms 205228 KB Output is correct
16 Correct 136 ms 204260 KB Output is correct
17 Correct 133 ms 202612 KB Output is correct
18 Correct 134 ms 202712 KB Output is correct
19 Correct 112 ms 202184 KB Output is correct
20 Correct 112 ms 202336 KB Output is correct
21 Correct 134 ms 203068 KB Output is correct
22 Correct 134 ms 203136 KB Output is correct
23 Correct 135 ms 209600 KB Output is correct
24 Correct 143 ms 213396 KB Output is correct
25 Correct 117 ms 202172 KB Output is correct
26 Correct 131 ms 202276 KB Output is correct
27 Correct 145 ms 214212 KB Output is correct
28 Correct 148 ms 211204 KB Output is correct
29 Correct 142 ms 205012 KB Output is correct
30 Correct 163 ms 209520 KB Output is correct
31 Correct 143 ms 206848 KB Output is correct
32 Correct 135 ms 203080 KB Output is correct
33 Correct 141 ms 203104 KB Output is correct
34 Correct 145 ms 205392 KB Output is correct
35 Correct 138 ms 203752 KB Output is correct
36 Correct 149 ms 204312 KB Output is correct
37 Correct 125 ms 202252 KB Output is correct
38 Correct 111 ms 202192 KB Output is correct
39 Incorrect 197 ms 41052 KB Output isn't correct
40 Halted 0 ms 0 KB -