oj.uz

Submission #396340

# Submission time Handle Problem Language Result Execution time Memory
396340 2021-04-29T19:19:01 Z MarcoMeijer Pyramid Base (IOI08_pyramid_base) C++14
100 / 100
 3324 ms 80344 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef unsigned int ui;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF (3e9+10)
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 5e5;
const int N = (1<<20);

int n, m, p; ui b;
int c[MX], X1[MX], X2[MX], Y1[MX], Y2[MX];

// segment tree
ui SEG[N*2], LAZ[N*2];
void addSeg(int i, int j, ui v, ui lazy=0, int l=0, int r=N-1, int p=1) {
    SEG[p] += lazy;
    LAZ[p] += lazy;
    if(j < l || i > r) return;
    if(i <= l && j >= r) {
        SEG[p] += v;
        LAZ[p] += v;
        return;
    }
    int m=(l+r)/2;
    addSeg(i,j,v,LAZ[p],l  ,m,p*2  );
    addSeg(i,j,v,LAZ[p],m+1,r,p*2+1);
    LAZ[p] = 0;
    SEG[p] = min(SEG[p*2], SEG[p*2+1]);
}
ui getSeg(int i, int j, ui lazy=0, int l=0, int r=N-1, int p=1) {
    SEG[p] += lazy;
    LAZ[p] += lazy;
    if(j < l || i > r) return INF;
    if(i <= l && j >= r) return SEG[p];
    int m=(l+r)/2;
    ui a=getSeg(i,j,LAZ[p],l  ,m,p*2  );
    ui b=getSeg(i,j,LAZ[p],m+1,r,p*2+1);
    LAZ[p] = 0;
    return min(a,b);
}

typedef tuple<int, int, int, int> iiii;
typedef vector<iiii> viiii;

bool possible(int w) {
    RE(i,p) X1[i] -= w-1;
    RE(i,p) Y1[i] -= w-1;

    // fill pq
    viiii pq;
    RE(i,p) {
        pq.pb({max(0,X1[i]  ),-c[i],max(0,Y1[i]),Y2[i]});
        pq.pb({max(0,X2[i]+1), c[i],max(0,Y1[i]),Y2[i]});
    }
    sort(all(pq));
    
    // clear segment tree
    RE(i,N*2) SEG[i]=LAZ[i]=0;

    int cx, lbY, ubY, cost, nextX, _;
    tie(cx, cost, lbY, ubY) = pq[0];
    if(cx > 0) {
        RE(i,p) X1[i] += w-1;
        RE(i,p) Y1[i] += w-1;
        return 0;
    }

    // sweep line
    RE(i,pq.size()) {
        tie(cx, cost, lbY, ubY) = pq[i];
        cost = -cost;
        if(i != pq.size()-1)
            tie(nextX, _, _, _) = pq[i+1];
        addSeg(lbY, ubY, cost);

        if((i == pq.size()-1 || nextX != 0) && cx <= m-w) {
            if(getSeg(0,n-w) <= b) {
                RE(i,p) X1[i] += w-1;
                RE(i,p) Y1[i] += w-1;
                return true;
            }
        }
    }

    RE(i,p) X1[i] += w-1;
    RE(i,p) Y1[i] += w-1;
    return false;
}

// other segment tree
int LEN[N*2], MIN[N*2], MAX[N*2], PREMIN[N*2], SUFMIN[N*2], PRELEN[N*2], SUFLEN[N*2], LAZY[N*2];
void buildSeg2(int l=0, int r=N-1, int p=1) {
    LAZY  [p] = 0;
    if(l == r) {
        LEN[p] = PREMIN[p] = PRELEN[p] = SUFMIN[p] = SUFLEN[p] = MIN[p] = MAX[p] = 1;
        return;
    }

    int m=(l+r)/2;
    buildSeg2(l  ,m,p*2  );
    buildSeg2(m+1,r,p*2+1);

    MIN   [p] = min(MIN[p*2], MIN[p*2+1]);
    MAX   [p] = max(MAX[p*2], MAX[p*2+1]);
    if(MIN[p*2] == MIN[p*2+1]) LEN[p] = max(LEN[p*2], LEN[p*2+1]);
    else LEN[p] = MIN[p*2] < MIN[p*2+1] ? LEN[p*2] : LEN[p*2+1];
    if(SUFMIN[p*2] == MIN[p] && PREMIN[p*2+1] == MIN[p]) LEN[p] = max(LEN[p], SUFLEN[p*2]+PRELEN[p*2+1]);

    // prefix
    PREMIN[p] = PREMIN[p*2];
    PRELEN[p] = PRELEN[p*2];
    if(MAX[p*2] == PREMIN[p*2] && PREMIN[p*2] == PREMIN[p*2+1]) PRELEN[p] = PRELEN[p*2] + PRELEN[p*2+1];

    // suffix
    SUFMIN[p] = SUFMIN[p*2+1];
    SUFLEN[p] = SUFLEN[p*2+1];
    if(MAX[p*2+1] == SUFMIN[p*2+1] && SUFMIN[p*2+1] == SUFMIN[p*2]) SUFLEN[p] = SUFLEN[p*2] + SUFLEN[p*2+1];
}
void addSeg2(int i, int j, int v, int lazy=0, int l=0, int r=N-1, int p=1) {
    PREMIN[p] += lazy;
    SUFMIN[p] += lazy;
    MIN   [p] += lazy;
    MAX   [p] += lazy;
    LAZY  [p] += lazy;
    if(j < l || i > r) return;
    if(i <= l && j >= r) {
        PREMIN[p] += v;
        SUFMIN[p] += v;
        MIN   [p] += v;
        MAX   [p] += v;
        LAZY  [p] += v;
        return;
    }
    int m=(l+r)/2;
    addSeg2(i,j,v,LAZY[p],l  ,m,p*2  );
    addSeg2(i,j,v,LAZY[p],m+1,r,p*2+1);
    LAZY  [p] = 0;

    MIN   [p] = min(MIN[p*2], MIN[p*2+1]);
    MAX   [p] = max(MAX[p*2], MAX[p*2+1]);
    if(MIN[p*2] == MIN[p*2+1]) LEN[p] = max(LEN[p*2], LEN[p*2+1]);
    else LEN[p] = MIN[p*2] < MIN[p*2+1] ? LEN[p*2] : LEN[p*2+1];
    if(SUFMIN[p*2] == MIN[p] && PREMIN[p*2+1] == MIN[p]) LEN[p] = max(LEN[p], SUFLEN[p*2]+PRELEN[p*2+1]);

    // prefix
    PREMIN[p] = PREMIN[p*2];
    PRELEN[p] = PRELEN[p*2];
    if(MAX[p*2] == PREMIN[p*2] && PREMIN[p*2] == PREMIN[p*2+1]) PRELEN[p] = PRELEN[p*2] + PRELEN[p*2+1];

    // suffix
    SUFMIN[p] = SUFMIN[p*2+1];
    SUFLEN[p] = SUFLEN[p*2+1];
    if(MAX[p*2+1] == SUFMIN[p*2+1] && SUFMIN[p*2+1] == SUFMIN[p*2]) SUFLEN[p] = SUFLEN[p*2] + SUFLEN[p*2+1];
}

int solveZero() {
    buildSeg2();
    addSeg2(0,n-1,-1);

    priority_queue<ii,vii,greater<ii>> pqCreate, pqDestroy;
    RE(i,p) {
        pqCreate .push({X1[i],i});
        pqDestroy.push({X2[i],i});
    }

    int res=0;
    int r=0;
    while(!pqCreate.empty()) {
        ii p = pqCreate.top();
        if(p.fi > r) break;
        pqCreate.pop();
        addSeg2(Y1[p.se], Y2[p.se], 1);
    }
    RE(l,m) {
        while(!pqDestroy.empty()) {
            ii p = pqDestroy.top();
            if(p.fi >= l) break;
            pqDestroy.pop();
            addSeg2(Y1[p.se], Y2[p.se], -1);
        }

        while(r < l || (r!=m-1 && MIN[1] == 0 && LEN[1] >= r-l+1)) {
            if(MIN[1] == 0 && LEN[1] >= r-l+1)
                res = max(res, r-l+1);
            r++;
            while(!pqCreate.empty()) {
                ii p = pqCreate.top();
                if(p.fi > r) break;
                pqCreate.pop();
                addSeg2(Y1[p.se], Y2[p.se], 1);
            }
        }
        if(MIN[1] == 0)
            res = max(res, min(r-l+1, LEN[1]));
    }

    return res;
}

void program() {
    IN(m,n,b,p);
    RE(i,p) IN(X1[i],Y1[i],X2[i],Y2[i],c[i]);
    RE(i,p) X1[i]--, Y1[i]--, X2[i]--, Y2[i]--;

    if(b == 0) {
        OUTL(solveZero());
    } else {
        int lb=0, ub=min(n,m);
        while(lb != ub) {
            int mid=(lb+ub+1)/2;
            if(possible(mid)) lb=mid;
            else ub=mid-1;
        }
        OUTL(lb);
    }
}

Compilation message

pyramid_base.cpp: In function 'bool possible(int)':
pyramid_base.cpp:128:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |         if(i != pq.size()-1)
      |            ~~^~~~~~~~~~~~~~
pyramid_base.cpp:132:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |         if((i == pq.size()-1 || nextX != 0) && cx <= m-w) {
      |             ~~^~~~~~~~~~~~~~
pyramid_base.cpp:132:30: warning: 'nextX' may be used uninitialized in this function [-Wmaybe-uninitialized]
  132 |         if((i == pq.size()-1 || nextX != 0) && cx <= m-w) {
      |            ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 65980 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 65908 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 65964 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 66076 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 66084 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 65940 KB Output is correct
2 Correct 100 ms 66044 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 66008 KB Output is correct
2 Correct 108 ms 66020 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 17300 KB Output is correct
2 Correct 162 ms 17304 KB Output is correct
3 Correct 152 ms 17312 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 400 ms 18052 KB Output is correct
2 Correct 623 ms 18112 KB Output is correct
3 Correct 586 ms 18040 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 586 ms 18888 KB Output is correct
2 Correct 103 ms 18888 KB Output is correct
3 Correct 235 ms 18816 KB Output is correct
4 Correct 834 ms 18868 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 915 ms 19536 KB Output is correct
2 Correct 1403 ms 19320 KB Output is correct
3 Correct 708 ms 19200 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 999 ms 19476 KB Output is correct
2 Correct 1799 ms 19384 KB Output is correct
3 Correct 1724 ms 19312 KB Output is correct
4 Correct 1866 ms 19508 KB Output is correct
5 Correct 1851 ms 19376 KB Output is correct
6 Correct 806 ms 19632 KB Output is correct

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1550 ms 73280 KB Output is correct
2 Correct 813 ms 73376 KB Output is correct

Subtask #14
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2064 ms 78204 KB Output is correct
2 Correct 2124 ms 78264 KB Output is correct
3 Correct 1342 ms 78236 KB Output is correct

Subtask #15
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2625 ms 80264 KB Output is correct
2 Correct 3180 ms 80216 KB Output is correct
3 Correct 3324 ms 80344 KB Output is correct
4 Correct 2818 ms 80264 KB Output is correct
5 Correct 1797 ms 80272 KB Output is correct