oj.uz

Submission #396304

# Submission time Handle Problem Language Result Execution time Memory
396304 2021-04-29T17:32:30 Z MarcoMeijer Pyramid Base (IOI08_pyramid_base) C++14
70 / 100
 5000 ms 53552 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;
}

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

    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 19 ms 16716 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 16780 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 16788 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 16744 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 16964 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 16856 KB Output is correct
2 Correct 117 ms 16844 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 16844 KB Output is correct
2 Correct 85 ms 16856 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 17276 KB Output is correct
2 Correct 157 ms 17300 KB Output is correct
3 Correct 143 ms 17304 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 393 ms 18044 KB Output is correct
2 Correct 622 ms 18128 KB Output is correct
3 Correct 556 ms 18164 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 578 ms 18804 KB Output is correct
2 Correct 102 ms 18780 KB Output is correct
3 Correct 248 ms 18800 KB Output is correct
4 Correct 765 ms 18968 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 905 ms 19128 KB Output is correct
2 Correct 1485 ms 19428 KB Output is correct
3 Correct 702 ms 19488 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1012 ms 19416 KB Output is correct
2 Correct 1860 ms 19432 KB Output is correct
3 Correct 1765 ms 19476 KB Output is correct
4 Correct 1898 ms 19448 KB Output is correct
5 Correct 1840 ms 19368 KB Output is correct
6 Correct 793 ms 19308 KB Output is correct

Subtask #13
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5098 ms 35156 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #14
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5101 ms 48476 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #15
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5090 ms 53552 KB Time limit exceeded
2 Halted 0 ms 0 KB -