oj.uz

Submission #926849

# Submission time Handle Problem Language Result Execution time Memory
926849 2024-02-14T00:18:01 Z math_rabbit_1028 Pyramid Base (IOI08_pyramid_base) C++14
65 / 100
 1256 ms 124740 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;

int M, N, P;
array<int, 5> arr[404040];
ll B;

struct segtree {
    int cnt[1<<21], mx[1<<21], l[1<<21], r[1<<21], sz[1<<21];
    void init(int v, int st, int ed) {
        if (st == ed) {
            cnt[v] = 0;
            mx[v] = l[v] = r[v] = 1;
            sz[v] = 1;
            return;
        }
        int mid = (st+ed)/2;
        init(2*v, st, mid);
        init(2*v+1, mid+1, ed);
        cnt[v] = 0;
        mx[v] = l[v] = r[v] = ed-st+1;
        sz[v] = ed-st+1;
    }
    void update(int v, int st, int ed, int lt, int rt, int val) {
        if (lt > ed || st > rt) return;
        if (lt <= st && ed <= rt) {
            cnt[v] += val;
            if (cnt[v] > 0) mx[v] = l[v] = r[v] = 0;
            else if (st == ed) mx[v] = l[v] = r[v] = 1;
            else {
                if (mx[2*v] == sz[2*v]) l[v] = l[2*v+1] + sz[2*v];
                else l[v] = l[2*v];
                if (mx[2*v+1] == sz[2*v+1]) r[v] = r[2*v] + sz[2*v+1];
                else r[v] = r[2*v+1];
                mx[v] = max(mx[2*v], mx[2*v+1]);
                mx[v] = max(mx[v], r[2*v]+l[2*v+1]);
            }
            return;
        }
        int mid = (st+ed)/2;
        update(2*v, st, mid, lt, rt, val);
        update(2*v+1, mid+1, ed, lt, rt, val);
        if (cnt[v] > 0) mx[v] = l[v] = r[v] = 0;
        else {
            if (mx[2*v] == sz[2*v]) l[v] = l[2*v+1] + sz[2*v];
            else l[v] = l[2*v];
            if (mx[2*v+1] == sz[2*v+1]) r[v] = r[2*v] + sz[2*v+1];
            else r[v] = r[2*v+1];
            mx[v] = max(mx[2*v], mx[2*v+1]);
            mx[v] = max(mx[v], r[2*v]+l[2*v+1]);
        }
    }
} seg;

vector<array<int, 3>> add[1010101], rem[1010101];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> M >> N;
    cin >> B >> P;
    for (int i = 1; i <= P; i++) {
        cin >> arr[i][0] >> arr[i][1] >> arr[i][2] >> arr[i][3] >> arr[i][4];
    }
    
    seg.init(1, 1, N);
    
    for (int i = 1; i <= P; i++) {
        add[arr[i][0]].push_back({arr[i][1], arr[i][3], +1});
        rem[arr[i][2]+1].push_back({arr[i][1], arr[i][3], -1});
    }
    
    int p = 1, q = 0, ans = 0;
    while (q <= M) {
        if (seg.mx[1] >= q-p+1) {
            ans = max(ans, q-p+1);
            q++;
            for (auto &[l, r, w] : add[q]) seg.update(1, 1, N, l, r, w);
        }
        else {
            ans = max(ans, seg.mx[1]);
            p++;
            for (auto &[l, r, w] : rem[p]) seg.update(1, 1, N, l, r, w);
        }
    }

    cout << ans << "\n";

    return 0;
}

Compilation message

pyramid_base.cpp: In function 'int main()':
pyramid_base.cpp:82:24: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   82 |             for (auto &[l, r, w] : add[q]) seg.update(1, 1, N, l, r, w);
      |                        ^
pyramid_base.cpp:87:24: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   87 |             for (auto &[l, r, w] : rem[p]) seg.update(1, 1, N, l, r, w);
      |                        ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 59996 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 60248 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 59996 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 59996 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 59992 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 90972 KB Output is correct
2 Correct 33 ms 90872 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 90900 KB Output is correct
2 Correct 33 ms 90972 KB Output is correct

Subtask #8
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 60404 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 60764 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 71 ms 91984 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 85 ms 92500 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 98 ms 92756 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 464 ms 104376 KB Output is correct
2 Correct 736 ms 73648 KB Output is correct

Subtask #14
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 627 ms 111444 KB Output is correct
2 Correct 606 ms 116928 KB Output is correct
3 Correct 407 ms 114280 KB Output is correct

Subtask #15
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 755 ms 117708 KB Output is correct
2 Correct 1256 ms 124740 KB Output is correct
3 Correct 1020 ms 124604 KB Output is correct
4 Correct 758 ms 122932 KB Output is correct
5 Correct 1058 ms 120588 KB Output is correct