oj.uz

답안 #847063

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
847063 2023-09-09T05:36:55 Z eltu0815 Ants and Sugar (JOI22_sugar) C++14
100 / 100
 1477 ms 153184 KB 
#include <bits/stdc++.h>
#define MAX 500005
#define MOD 998244353
#define INF (ll)(1e18)
#define inf (1987654321)

using namespace std;    
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef complex<long double> cpx;
constexpr long double PI = acos(-1);

int q, L;
int chk[MAX];
pair<int, pii> query[MAX];

struct Node {
    ll v, sum = 0;
    ll dp[2][2];
    ll lz1, lz2;
    Node() {
        v = sum = 0;
        dp[0][0] = dp[1][0] = dp[0][1] = dp[1][1] = -INF;
        lz1 = lz2 = 0;
    }
};

Node Merge(Node l, Node r) {
    Node ret = Node(); ret.v = r.v; ret.sum = l.sum + r.sum + l.v;
    for(int i = 0; i <= 1; ++i) for(int j = 0; j <= 1; ++j) {
        if(i == 0) ret.dp[i][j] = max(ret.dp[i][j], max(r.dp[0][j], r.dp[1][j]));
        if(j == 0) ret.dp[i][j] = max(ret.dp[i][j], max(l.dp[i][0], l.dp[i][1]));
        
        // dp[0][0] of leaf nodes means INF - (lazy updates of lz1), which indicates the number of sugar in the i-th coordinate
        // we have to merge sets that satisfy |S| > 0, but we can also merge the set |S| == 0 and the set |S| > 0 together
        // note that the set whose |S| is 0 always 
        // when there's no ant in the left node, we can make dp[1][i] = -(the number of sugar) + r.dp[1][i] = -l.dp[0][0] + INF + r.dp[1][i];
        if(i == 1) ret.dp[i][j] = max(ret.dp[i][j], l.sum + r.dp[1][j] + l.v);
        if(j == 1) ret.dp[i][j] = max(ret.dp[i][j], l.dp[i][1] + r.sum + l.v);
    
        for(int a = 0; a <= 1; ++a) for(int b = 0; b <= 1; ++b) {
            ret.dp[i][j] = max(ret.dp[i][j], l.dp[i][a] + r.dp[b][j] + (a & b) * l.v);
        }
    }
    return ret;
}

Node seg[MAX << 2];
void init(int str, int ed, int node) {
    if(str == ed) return;
    int mid = str + ed >> 1;
    init(str, mid, node << 1);
    init(mid + 1, ed, node << 1 | 1);
    seg[node] = Merge(seg[node << 1], seg[node << 1 | 1]);
}

void lazyProp(int str, int ed, int node) {
    if(seg[node].lz1) {
        seg[node].sum += seg[node].lz1;
        for(int i = 0; i <= 1; ++i) for(int j = 0; j <= 1; ++j) seg[node].dp[i][j] += seg[node].lz1;
        if(str != ed) {
            seg[node << 1].lz1 += seg[node].lz1;
            seg[node << 1 | 1].lz1 += seg[node].lz1;
        }
        seg[node].lz1 = 0;
    }
    
    if(seg[node].lz2) {
        seg[node].v += seg[node].lz2;
        if(str != ed) {
            seg[node << 1].lz2 += seg[node].lz2;
            seg[node << 1 | 1].lz2 += seg[node].lz2;
        }
        seg[node].lz2 = 0;
    }
}

void update1(int str, int ed, int left, int right, ll val, int node) {
    lazyProp(str, ed, node);
    if(str > right || ed < left) return;
    if(left <= str && ed <= right) {
        seg[node].lz1 = val;
        lazyProp(str, ed, node);
        return;
    }
    int mid = str + ed >> 1;
    update1(str, mid, left, right, val, node << 1);
    update1(mid + 1, ed, left, right, val, node << 1 | 1);
    seg[node] = Merge(seg[node << 1], seg[node << 1 | 1]);
}

void update2(int str, int ed, int left, int right, ll val, int node) {
    lazyProp(str, ed, node);
    if(str > right || ed < left) return;
    if(left <= str && ed <= right) {
        seg[node].lz2 = val;
        lazyProp(str, ed, node);
        return;
    }
    int mid = str + ed >> 1;
    update2(str, mid, left, right, val, node << 1);
    update2(mid + 1, ed, left, right, val, node << 1 | 1);
    seg[node] = Merge(seg[node << 1], seg[node << 1 | 1]);
}

void update3(int str, int ed, int idx, ll val, int node) {
    lazyProp(str, ed, node);
    if(str > idx || ed < idx) return;
    if(str == ed) {
        seg[node].dp[1][1] += val;
        return;
    }
    int mid = str + ed >> 1;
    update3(str, mid, idx, val, node << 1);
    update3(mid + 1, ed, idx, val, node << 1 | 1);
    seg[node] = Merge(seg[node << 1], seg[node << 1 | 1]);
}

ll max_query(int str, int ed, int node) {
    lazyProp(str, ed, node);
    return max(0ll, max(max(seg[1].dp[0][0], seg[1].dp[1][1]), max(seg[1].dp[0][1], seg[1].dp[1][0])));
}

void print(int str, int ed, int node) {
    lazyProp(str, ed, node);
    cout << str << ' ' << ed << " : " << seg[node].v << ' ' << seg[node].dp[0][0] << ' ' << seg[node].dp[1][0] << ' ' << seg[node].dp[0][1] << ' ' << seg[node].dp[1][1] <<
          ' ' << seg[node].lz1 << ' ' << seg[node].lz2 << endl;
    if(str == ed) return;
    int mid = str + ed >> 1;
    print(str, mid, node << 1);
    print(mid + 1, ed, node << 1 | 1);
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    
    cin >> q >> L;
    for(int i = 1; i <= q; ++i) cin >> query[i].first >> query[i].second.first >> query[i].second.second;
    //for(int i = 1; i <= q; ++i) query[i].first = (i + 1) % 2 + 1, query[i].second.first = rand(), query[i].second.second = rand() + 1;
    //random_shuffle(query + 1, query + q + 1);
    
    vector<int> tmp; tmp.push_back(-1000000005); tmp.push_back(2000000005);
    for(int i = 1; i <= q; ++i) if(query[i].first == 1) tmp.push_back(query[i].second.first);
    sort(tmp.begin(), tmp.end()); tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());
    
    int n = tmp.size() - 1;
    init(0, n, 1); ll A = 0, B = 0;
    for(int i = 1; i <= q; ++i) {
        if(query[i].first == 1) {
            int idx = lower_bound(tmp.begin(), tmp.end(), query[i].second.first) - tmp.begin();
            A += query[i].second.second;
            if(chk[idx] == 0) chk[idx] = 1, update3(0, n, idx, 1ll * query[i].second.second + INF, 1);
            else update3(0, n, idx, query[i].second.second, 1);
        }
        else {
            int l = lower_bound(tmp.begin(), tmp.end(), query[i].second.first - L) - tmp.begin();
            int r = upper_bound(tmp.begin(), tmp.end(), query[i].second.first + L) - tmp.begin() - 1;
            //if(l <= r) cout <<"WOW" << l << ' ' << r << ' ' << query[i].second.first - L << ' ' << query[i].second.first + L << ' ' << tmp[l] << ' ' << tmp[r] << endl;
            B += query[i].second.second;
            if(l <= r) update1(0, n, l, r, -query[i].second.second, 1);
            if(l < r) update2(0, n, l, r - 1, query[i].second.second, 1);
        }
//        cout << B << ' ';
        cout << A - max_query(0, n, 1) << '\n';
//        if(i == 10) print(0, n, 1);
    }
    return 0;
}

Compilation message

sugar.cpp: In function 'void init(int, int, int)':
sugar.cpp:52:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   52 |     int mid = str + ed >> 1;
      |               ~~~~^~~~
sugar.cpp: In function 'void update1(int, int, int, int, ll, int)':
sugar.cpp:87:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   87 |     int mid = str + ed >> 1;
      |               ~~~~^~~~
sugar.cpp: In function 'void update2(int, int, int, int, ll, int)':
sugar.cpp:101:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  101 |     int mid = str + ed >> 1;
      |               ~~~~^~~~
sugar.cpp: In function 'void update3(int, int, int, ll, int)':
sugar.cpp:114:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  114 |     int mid = str + ed >> 1;
      |               ~~~~^~~~
sugar.cpp: In function 'void print(int, int, int)':
sugar.cpp:130:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  130 |     int mid = str + ed >> 1;
      |               ~~~~^~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 125776 KB Output is correct
2 Correct 17 ms 125772 KB Output is correct
3 Correct 18 ms 125580 KB Output is correct
4 Correct 17 ms 126040 KB Output is correct
5 Correct 19 ms 125732 KB Output is correct
6 Correct 19 ms 125788 KB Output is correct
7 Correct 20 ms 125788 KB Output is correct
8 Correct 18 ms 125788 KB Output is correct
9 Correct 18 ms 125724 KB Output is correct
10 Correct 20 ms 125788 KB Output is correct
11 Correct 20 ms 125848 KB Output is correct
12 Correct 21 ms 125788 KB Output is correct
13 Correct 21 ms 125872 KB Output is correct
14 Correct 20 ms 125812 KB Output is correct
15 Correct 18 ms 125784 KB Output is correct
16 Correct 22 ms 126020 KB Output is correct
17 Correct 21 ms 125788 KB Output is correct
18 Correct 20 ms 125784 KB Output is correct
19 Correct 20 ms 125788 KB Output is correct
20 Correct 20 ms 125788 KB Output is correct
21 Correct 23 ms 125860 KB Output is correct
22 Correct 21 ms 125788 KB Output is correct
23 Correct 22 ms 125792 KB Output is correct
24 Correct 20 ms 125784 KB Output is correct
25 Correct 22 ms 125788 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 125788 KB Output is correct
2 Correct 17 ms 125612 KB Output is correct
3 Correct 18 ms 125784 KB Output is correct
4 Correct 571 ms 138116 KB Output is correct
5 Correct 376 ms 134608 KB Output is correct
6 Correct 668 ms 139176 KB Output is correct
7 Correct 394 ms 134584 KB Output is correct
8 Correct 819 ms 140492 KB Output is correct
9 Correct 805 ms 141672 KB Output is correct
10 Correct 827 ms 140728 KB Output is correct
11 Correct 805 ms 141300 KB Output is correct
12 Correct 354 ms 132680 KB Output is correct
13 Correct 497 ms 133840 KB Output is correct
14 Correct 810 ms 137880 KB Output is correct
15 Correct 805 ms 137964 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 125788 KB Output is correct
2 Correct 351 ms 132596 KB Output is correct
3 Correct 497 ms 133908 KB Output is correct
4 Correct 804 ms 138012 KB Output is correct
5 Correct 796 ms 137980 KB Output is correct
6 Correct 579 ms 136420 KB Output is correct
7 Correct 43 ms 128072 KB Output is correct
8 Correct 293 ms 132336 KB Output is correct
9 Correct 537 ms 133652 KB Output is correct
10 Correct 840 ms 137680 KB Output is correct
11 Correct 978 ms 137812 KB Output is correct
12 Correct 855 ms 137696 KB Output is correct
13 Correct 760 ms 137748 KB Output is correct
14 Correct 862 ms 137932 KB Output is correct
15 Correct 526 ms 137416 KB Output is correct
16 Correct 699 ms 137736 KB Output is correct
17 Correct 1150 ms 137788 KB Output is correct
18 Correct 1289 ms 137940 KB Output is correct
19 Correct 1276 ms 137844 KB Output is correct
20 Correct 1269 ms 137952 KB Output is correct
21 Correct 1402 ms 137936 KB Output is correct
22 Correct 1477 ms 137976 KB Output is correct
23 Correct 1477 ms 138184 KB Output is correct
24 Correct 1307 ms 138032 KB Output is correct
25 Correct 1375 ms 137988 KB Output is correct

Subtask #4
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 125776 KB Output is correct
2 Correct 17 ms 125772 KB Output is correct
3 Correct 18 ms 125580 KB Output is correct
4 Correct 17 ms 126040 KB Output is correct
5 Correct 19 ms 125732 KB Output is correct
6 Correct 19 ms 125788 KB Output is correct
7 Correct 20 ms 125788 KB Output is correct
8 Correct 18 ms 125788 KB Output is correct
9 Correct 18 ms 125724 KB Output is correct
10 Correct 20 ms 125788 KB Output is correct
11 Correct 20 ms 125848 KB Output is correct
12 Correct 21 ms 125788 KB Output is correct
13 Correct 21 ms 125872 KB Output is correct
14 Correct 20 ms 125812 KB Output is correct
15 Correct 18 ms 125784 KB Output is correct
16 Correct 22 ms 126020 KB Output is correct
17 Correct 21 ms 125788 KB Output is correct
18 Correct 20 ms 125784 KB Output is correct
19 Correct 20 ms 125788 KB Output is correct
20 Correct 20 ms 125788 KB Output is correct
21 Correct 23 ms 125860 KB Output is correct
22 Correct 21 ms 125788 KB Output is correct
23 Correct 22 ms 125792 KB Output is correct
24 Correct 20 ms 125784 KB Output is correct
25 Correct 22 ms 125788 KB Output is correct
26 Correct 17 ms 125788 KB Output is correct
27 Correct 17 ms 125612 KB Output is correct
28 Correct 18 ms 125784 KB Output is correct
29 Correct 571 ms 138116 KB Output is correct
30 Correct 376 ms 134608 KB Output is correct
31 Correct 668 ms 139176 KB Output is correct
32 Correct 394 ms 134584 KB Output is correct
33 Correct 819 ms 140492 KB Output is correct
34 Correct 805 ms 141672 KB Output is correct
35 Correct 827 ms 140728 KB Output is correct
36 Correct 805 ms 141300 KB Output is correct
37 Correct 354 ms 132680 KB Output is correct
38 Correct 497 ms 133840 KB Output is correct
39 Correct 810 ms 137880 KB Output is correct
40 Correct 805 ms 137964 KB Output is correct
41 Correct 17 ms 125788 KB Output is correct
42 Correct 351 ms 132596 KB Output is correct
43 Correct 497 ms 133908 KB Output is correct
44 Correct 804 ms 138012 KB Output is correct
45 Correct 796 ms 137980 KB Output is correct
46 Correct 579 ms 136420 KB Output is correct
47 Correct 43 ms 128072 KB Output is correct
48 Correct 293 ms 132336 KB Output is correct
49 Correct 537 ms 133652 KB Output is correct
50 Correct 840 ms 137680 KB Output is correct
51 Correct 978 ms 137812 KB Output is correct
52 Correct 855 ms 137696 KB Output is correct
53 Correct 760 ms 137748 KB Output is correct
54 Correct 862 ms 137932 KB Output is correct
55 Correct 526 ms 137416 KB Output is correct
56 Correct 699 ms 137736 KB Output is correct
57 Correct 1150 ms 137788 KB Output is correct
58 Correct 1289 ms 137940 KB Output is correct
59 Correct 1276 ms 137844 KB Output is correct
60 Correct 1269 ms 137952 KB Output is correct
61 Correct 1402 ms 137936 KB Output is correct
62 Correct 1477 ms 137976 KB Output is correct
63 Correct 1477 ms 138184 KB Output is correct
64 Correct 1307 ms 138032 KB Output is correct
65 Correct 1375 ms 137988 KB Output is correct
66 Correct 399 ms 140236 KB Output is correct
67 Correct 557 ms 142324 KB Output is correct
68 Correct 755 ms 146572 KB Output is correct
69 Correct 704 ms 145240 KB Output is correct
70 Correct 602 ms 151260 KB Output is correct
71 Correct 747 ms 151388 KB Output is correct
72 Correct 848 ms 151496 KB Output is correct
73 Correct 963 ms 151716 KB Output is correct
74 Correct 139 ms 143444 KB Output is correct
75 Correct 216 ms 149200 KB Output is correct
76 Correct 867 ms 152776 KB Output is correct
77 Correct 850 ms 147396 KB Output is correct
78 Correct 846 ms 147400 KB Output is correct
79 Correct 994 ms 151620 KB Output is correct
80 Correct 862 ms 147140 KB Output is correct
81 Correct 938 ms 151592 KB Output is correct
82 Correct 850 ms 147500 KB Output is correct
83 Correct 1317 ms 151952 KB Output is correct
84 Correct 844 ms 147148 KB Output is correct
85 Correct 1419 ms 152012 KB Output is correct
86 Correct 859 ms 147204 KB Output is correct
87 Correct 1453 ms 151932 KB Output is correct
88 Correct 870 ms 147256 KB Output is correct
89 Correct 1229 ms 153184 KB Output is correct