제출 #1045680

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1045680		Uasoni	Pyramid Base (IOI08_pyramid_base)	C++14	0 / 100	126 ms	19288 KiB

pyramid_base

#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx", "bmi", "bmi2", "lzcnt", "popcnt")

#include<bits/stdc++.h>
using namespace std;

const int maxn = 4e5+5, maxp = 1e6+5, inf = 1e9;
int n, m, p, b;
struct R {
    int x1, y1, x2, y2, c;
    R() { x1 = y1 = x2 = y2 = c = 0; }
} obs[maxn];

struct N {
    int v, l;
} stree[4*maxp];
void push(int i) {
    if(stree[i].l != 0) {
        stree[i<<1].v += stree[i].l; stree[i<<1|1].v += stree[i].l;
        stree[i<<1].l += stree[i].l; stree[i<<1|1].l += stree[i].l;
        stree[i].l = 0;
    }
}
void update(int lq, int rq, int val, int i = 1, int l = 1, int r = maxp) {
    if(lq <= l && r <= rq) {
        stree[i].v += val, stree[i].l += val;
        return;
    }
    push(i);
    int mid = (l+r)/2;
    if(lq <= mid) update(lq, rq, val, i<<1, l, mid);
    if(rq >= mid+1) update(lq, rq, val, i<<1|1, mid+1, r);
    stree[i].v = min(stree[i<<1].v, stree[i<<1|1].v);
}
int query(int lq, int rq, int i = 1, int l = 1, int r = maxp) {
    if(lq <= l && r <= rq) return stree[i].v;
    push(i);
    int mid = (l+r)/2, ret = inf;
    if(lq <= mid) ret = min(ret, query(lq, rq, i<<1, l, mid));
    if(rq >= mid+1) ret = min(ret, query(lq, rq, i<<1|1, mid+1, r));
    return ret;
}

struct E {
    int t, val, l, r;
    bool operator<(const E &o) const {
        return t < o.t;
    }
}; vector<E> evs;

bool check(int x) {
    bool ret = false;
    evs.clear();
    for(int i = 1; i <= p; i++) {
        evs.push_back({max(1, obs[i].x1-x+1), obs[i].c, max(1, obs[i].y1-x+1), obs[i].y2});
        evs.push_back({obs[i].x2+1, -obs[i].c, max(1, obs[i].y1-x+1), obs[i].y2});
    }
    sort(evs.begin(), evs.end());
    for(int i = 0; i < evs.size(); i++) {
        update(evs[i].l, evs[i].r, evs[i].val);
        if(i >= evs.size()-1 || evs[i].t != evs[i+1].t) {
            if(evs[i].t+x-1 <= m) ret |= (query(1, n-x+1) <= b);
        }
    }
    return ret;
}

int bsearch(int l, int r) {
    int ret = 0;
    while(l <= r) {
        int mid = (l+r)/2;
        if(check(mid)) l = mid+1, ret = mid;
        else r = mid-1;
    }
    return ret;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int red = min(m, n);
    cin >> m >> n >> b >> p; // m columns, n rows
    for(int i = 1; i <= p; i++) {
        cin >> obs[i].x1 >> obs[i].y1 >> obs[i].x2 >> obs[i].y2 >> obs[i].c;
        if(b == 0) red = min(red, max({obs[i].x1-1, obs[i].y1-1, m-obs[i].x2, n-obs[i].y2}));
    }
    cout << bsearch(1, red) << "\n";
}

컴파일 시 표준 에러 (stderr) 메시지

pyramid_base.cpp: In function 'bool check(int)':
pyramid_base.cpp:59:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<E>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |     for(int i = 0; i < evs.size(); i++) {
      |                    ~~^~~~~~~~~~~~
pyramid_base.cpp:61:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<E>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |         if(i >= evs.size()-1 || evs[i].t != evs[i+1].t) {
      |            ~~^~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 7
• Subtask 9: 0 / 7
• Subtask 10: 0 / 7
• Subtask 11: 0 / 7
• Subtask 12: 0 / 7
• Subtask 13: 0 / 10
• Subtask 14: 0 / 10
• Subtask 15: 0 / 10