oj.uz

답안 #926480

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
926480 2024-02-13T05:37:30 Z math_rabbit_1028 Pyramid Base (IOI08_pyramid_base) C++14
45 / 100
 5000 ms 116192 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 tree[1<<21], lazy[1<<21];
    void prop(int v, int st, int ed) {
        tree[v] += lazy[v];
        if (st != ed) {
            lazy[2*v] += lazy[v];
            lazy[2*v+1] += lazy[v];
        }
        lazy[v] = 0;
    }
    void update(int v, int st, int ed, int lt, int rt, int val) {
        prop(v, st, ed);
        if (lt > ed || st > rt) return;
        if (lt <= st && ed <= rt) {
            lazy[v] = val;
            prop(v, st, ed);
            return;
        }
        int mid = (st+ed)/2;
        update(2*v, st, mid, lt, rt, val);
        update(2*v+1, mid+1, ed, lt, rt, val);
        tree[v] = min(tree[2*v], tree[2*v+1]);
    }
    int get(int v, int st, int ed, int lt, int rt) {
        prop(v, st, ed);
        if (lt > ed || st > rt) return 1e9;
        if (lt <= st && ed <= rt) return tree[v];
        int mid = (st+ed)/2;
        return min(get(2*v, st, mid, lt, rt), get(2*v+1, mid+1, ed, lt, rt));
    }
} seg;

vector<pii> add[1010101], rem[1010101];
bool solve(int L) {
    for (int i = 0; i <= M-L; i++) add[i].clear();
    for (int i = 0; i <= M-L; i++) rem[i].clear();
    for (int i = 0; i < (1<<21); i++) seg.tree[i] = seg.lazy[i] = 0;
    
    for (int i = 1; i <= P; i++) {
        if (arr[i][0]-L < 0) seg.update(1, 0, N-L, arr[i][1]-L, arr[i][3]-1, +1);
        else add[arr[i][0]-L].push_back({arr[i][1]-L, arr[i][3]-1});
        rem[arr[i][2]].push_back({arr[i][1]-L, arr[i][3]-1});
    }
    
    for (int i = 0; i <= M-L; i++) {
        for (auto &[l, r] : add[i]) seg.update(1, 0, N-L, l, r, +1);
        for (auto &[l, r] : rem[i]) seg.update(1, 0, N-L, l, r, -1);
        if (seg.get(1, 0, N-L, 0, N-L) == 0) return true;
    }
    return false;
}

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];
    }

    int st = 0, ed = min(M, N);
    while (st < ed) {
        int mid = (st+ed+1)/2;
        if (solve(mid)) st = mid;
        else ed = mid-1;
    }
    cout << st << "\n";

    return 0;
}

Compilation message

pyramid_base.cpp: In function 'bool solve(int)':
pyramid_base.cpp:57:20: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   57 |         for (auto &[l, r] : add[i]) seg.update(1, 0, N-L, l, r, +1);
      |                    ^
pyramid_base.cpp:58:20: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   58 |         for (auto &[l, r] : rem[i]) seg.update(1, 0, N-L, l, r, -1);
      |                    ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 66136 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 66140 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 66140 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 66392 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 66452 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 66576 KB Output is correct
2 Correct 208 ms 66688 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 212 ms 66644 KB Output is correct
2 Correct 81 ms 66392 KB Output is correct

Subtask #8
0 / 7.0

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

Subtask #9
0 / 7.0

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

Subtask #10
0 / 7.0

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

Subtask #11
0 / 7.0

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

Subtask #12
0 / 7.0

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

Subtask #13
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4427 ms 105936 KB Output is correct
2 Correct 781 ms 99668 KB Output is correct

Subtask #14
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5029 ms 111636 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #15
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5061 ms 116192 KB Time limit exceeded
2 Halted 0 ms 0 KB -