oj.uz

답안 #1114658

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1114658 2024-11-19T10:26:34 Z Wansur Ants and Sugar (JOI22_sugar) C++17
22 / 100
 1538 ms 878208 KB 
#include <bits/stdc++.h>
#define ent '\n'
#define int long long

using namespace std;
typedef long long ll;

const int maxn = 5e5 + 12;
const int mod = 998244353;

int n, m, k;

struct asd {
    int dp[2][2];
    int rx, d;

    asd() {
        dp[0][0] = dp[1][0] = dp[0][1] = dp[1][1] = 0;
        rx = d = 0;
    }
};

asd merge(asd x, asd y) {
    asd ans;
    ans.rx = y.rx;
    ans.d = max(x.d, y.d);
    for(int i = 0; i < 2; i++) {
        for(int j = 0; j < 2; j++) {
            ans.dp[i][j] = min(x.dp[i][1] + y.dp[1][j] - x.rx, min(x.dp[i][0], x.dp[i][1]) + min(y.dp[0][j], y.dp[1][j]));
        }
    }
    return ans;
}


asd t[maxn * 10];
int L[maxn * 10], R[maxn * 10];
int p[maxn * 10], c[maxn * 10];
int rx[maxn * 10];
int nv = 1;

void pull(int v, int x) {
    p[v] += x;
    t[v].dp[0][0] = min(t[v].dp[0][0] + x, 0ll);
    t[v].dp[1][1] += x;
    t[v].dp[0][1] += x;
    t[v].dp[1][0] += x;
    t[v].d += x;
}

void dull(int v, int x) {
    rx[v] += x;
    t[v].rx += x;
}

void create(int v, int tl, int mid, int tr) {
    if(!L[v]) {
        L[v] = ++nv;
        if(tl == mid) {
            t[L[v]].dp[0][1] = t[L[v]].dp[1][0] = 1e18;
        }
    }
    if(!R[v]) {
        R[v] = ++nv;
        if(mid + 1 == tr) {
            t[R[v]].dp[0][1] = t[R[v]].dp[1][0] = 1e18;
        }
    }
}

void push(int v, int tl, int tr) {
    if(tl == tr) return;
    int mid = tl + tr >> 1;
    create(v, tl, mid, tr);
    pull(L[v], p[v]);
    pull(R[v], p[v]);
    dull(L[v], rx[v]);
    dull(R[v], rx[v]);
    p[v] = rx[v] = 0;
}

void upd(int v, int tl, int tr, int l, int r, int x) {
    if(tl > r || l > tr) return;
    if(tl >= l && tr <= r) {
        pull(v, x);
        return;
    }
    push(v, tl, tr);
    int mid = tl + tr >> 1;
    upd(L[v], tl, mid, l, r, x);
    upd(R[v], mid + 1, tr, l, r, x);
    t[v] = merge(t[L[v]], t[R[v]]);
}

void upd(int v, int tl, int tr, int pos, int x) {
    if(tl == tr) {
        c[v] += x;
        t[v].dp[0][0] = 0;
        t[v].dp[1][0] = t[v].dp[0][1] = 1e18;
        t[v].dp[1][1] = t[v].d - c[v];
        return;
    }
    push(v, tl, tr);
    int mid = tl + tr >> 1;
    if(pos <= mid) {
        upd(L[v], tl, mid, pos, x);
    }
    else {
        upd(R[v], mid + 1, tr, pos, x);
    }
    t[v] = merge(t[L[v]], t[R[v]]);
}

void updrx(int v, int tl, int tr, int l, int r, int x) {
    push(v, tl, tr);
    if(tl > r || l > tr) return;
    if(tl >= l && tr <= r) {
        dull(v, x);
        return;
    }
    int mid = tl + tr >> 1;
    updrx(L[v], tl, mid, l, r, x);
    updrx(R[v], mid + 1, tr, l, r, x);
    t[v] = merge(t[L[v]], t[R[v]]);
}

void solve() {
    cin >> n >> k;
    m = (1 << 30) - 1;
    int sum = 0;
    while(n--) {
        int tp, pos, x;
        cin >> tp >> pos >> x;
        if(tp == 1) {
            upd(1, 0, m, pos, x);
            sum += x;
        }
        else {
            upd(1, 0, m, pos - k, pos + k, x);
            updrx(1, 0, m, pos - k, pos + k - 1, x);
        }
        cout << sum + min({t[1].dp[0][0], t[1].dp[1][0], t[1].dp[0][1], t[1].dp[1][1]}) << ent;
    }
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
//    cin >> t;

    while(t--) {
        solve();
    }
}

Compilation message

sugar.cpp: In function 'void push(long long int, long long int, long long int)':
sugar.cpp:73:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   73 |     int mid = tl + tr >> 1;
      |               ~~~^~~~
sugar.cpp: In function 'void upd(long long int, long long int, long long int, long long int, long long int, long long int)':
sugar.cpp:89:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   89 |     int mid = tl + tr >> 1;
      |               ~~~^~~~
sugar.cpp: In function 'void upd(long long int, long long int, long long int, long long int, long long int)':
sugar.cpp:104:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  104 |     int mid = tl + tr >> 1;
      |               ~~~^~~~
sugar.cpp: In function 'void updrx(long long int, long long int, long long int, long long int, long long int, long long int)':
sugar.cpp:121:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  121 |     int mid = tl + tr >> 1;
      |               ~~~^~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 235848 KB Output is correct
2 Correct 72 ms 235852 KB Output is correct
3 Correct 107 ms 235848 KB Output is correct
4 Correct 77 ms 235864 KB Output is correct
5 Correct 93 ms 235840 KB Output is correct
6 Correct 95 ms 236016 KB Output is correct
7 Correct 85 ms 236112 KB Output is correct
8 Correct 95 ms 236096 KB Output is correct
9 Correct 85 ms 236104 KB Output is correct
10 Correct 97 ms 244900 KB Output is correct
11 Correct 108 ms 245580 KB Output is correct
12 Correct 106 ms 247624 KB Output is correct
13 Correct 103 ms 245628 KB Output is correct
14 Correct 107 ms 247820 KB Output is correct
15 Correct 109 ms 247880 KB Output is correct
16 Correct 103 ms 240456 KB Output is correct
17 Correct 95 ms 240200 KB Output is correct
18 Correct 90 ms 240200 KB Output is correct
19 Correct 97 ms 245584 KB Output is correct
20 Correct 92 ms 240140 KB Output is correct
21 Correct 106 ms 245064 KB Output is correct
22 Correct 103 ms 240200 KB Output is correct
23 Correct 102 ms 244876 KB Output is correct
24 Correct 95 ms 240200 KB Output is correct
25 Correct 92 ms 242168 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 235724 KB Output is correct
2 Correct 85 ms 235724 KB Output is correct
3 Correct 95 ms 235828 KB Output is correct
4 Correct 1129 ms 275784 KB Output is correct
5 Correct 548 ms 262424 KB Output is correct
6 Correct 1228 ms 282196 KB Output is correct
7 Correct 574 ms 263400 KB Output is correct
8 Correct 1538 ms 291276 KB Output is correct
9 Correct 1012 ms 292628 KB Output is correct
10 Correct 1470 ms 291708 KB Output is correct
11 Correct 1060 ms 292056 KB Output is correct
12 Correct 535 ms 259080 KB Output is correct
13 Correct 681 ms 267992 KB Output is correct
14 Correct 1060 ms 288600 KB Output is correct
15 Correct 1096 ms 289544 KB Output is correct

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 235756 KB Output is correct
2 Correct 531 ms 259144 KB Output is correct
3 Correct 682 ms 268048 KB Output is correct
4 Correct 1016 ms 289212 KB Output is correct
5 Correct 1026 ms 288464 KB Output is correct
6 Correct 1287 ms 283748 KB Output is correct
7 Correct 168 ms 250440 KB Output is correct
8 Correct 692 ms 274488 KB Output is correct
9 Correct 966 ms 278924 KB Output is correct
10 Runtime error 1135 ms 878208 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -

Subtask #4
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 235848 KB Output is correct
2 Correct 72 ms 235852 KB Output is correct
3 Correct 107 ms 235848 KB Output is correct
4 Correct 77 ms 235864 KB Output is correct
5 Correct 93 ms 235840 KB Output is correct
6 Correct 95 ms 236016 KB Output is correct
7 Correct 85 ms 236112 KB Output is correct
8 Correct 95 ms 236096 KB Output is correct
9 Correct 85 ms 236104 KB Output is correct
10 Correct 97 ms 244900 KB Output is correct
11 Correct 108 ms 245580 KB Output is correct
12 Correct 106 ms 247624 KB Output is correct
13 Correct 103 ms 245628 KB Output is correct
14 Correct 107 ms 247820 KB Output is correct
15 Correct 109 ms 247880 KB Output is correct
16 Correct 103 ms 240456 KB Output is correct
17 Correct 95 ms 240200 KB Output is correct
18 Correct 90 ms 240200 KB Output is correct
19 Correct 97 ms 245584 KB Output is correct
20 Correct 92 ms 240140 KB Output is correct
21 Correct 106 ms 245064 KB Output is correct
22 Correct 103 ms 240200 KB Output is correct
23 Correct 102 ms 244876 KB Output is correct
24 Correct 95 ms 240200 KB Output is correct
25 Correct 92 ms 242168 KB Output is correct
26 Correct 91 ms 235724 KB Output is correct
27 Correct 85 ms 235724 KB Output is correct
28 Correct 95 ms 235828 KB Output is correct
29 Correct 1129 ms 275784 KB Output is correct
30 Correct 548 ms 262424 KB Output is correct
31 Correct 1228 ms 282196 KB Output is correct
32 Correct 574 ms 263400 KB Output is correct
33 Correct 1538 ms 291276 KB Output is correct
34 Correct 1012 ms 292628 KB Output is correct
35 Correct 1470 ms 291708 KB Output is correct
36 Correct 1060 ms 292056 KB Output is correct
37 Correct 535 ms 259080 KB Output is correct
38 Correct 681 ms 267992 KB Output is correct
39 Correct 1060 ms 288600 KB Output is correct
40 Correct 1096 ms 289544 KB Output is correct
41 Correct 79 ms 235756 KB Output is correct
42 Correct 531 ms 259144 KB Output is correct
43 Correct 682 ms 268048 KB Output is correct
44 Correct 1016 ms 289212 KB Output is correct
45 Correct 1026 ms 288464 KB Output is correct
46 Correct 1287 ms 283748 KB Output is correct
47 Correct 168 ms 250440 KB Output is correct
48 Correct 692 ms 274488 KB Output is correct
49 Correct 966 ms 278924 KB Output is correct
50 Runtime error 1135 ms 878208 KB Execution killed with signal 11
51 Halted 0 ms 0 KB -