oj.uz

Submission #1006196

# Submission time Handle Problem Language Result Execution time Memory
1006196 2024-06-23T14:20:05 Z huutuan Pyramid Base (IOI08_pyramid_base) C++14
80 / 100
 5000 ms 80332 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>

using namespace std;

struct Node{
   long long val, lazy;
   Node (int _val=0){
      val=_val, lazy=0;
   }
};

struct SegmentTree{
   vector<Node> t;
   int n, h;
   void init(int _n){
      n=_n;
      h=32-__builtin_clz(n);
      t.assign(2*n+1, Node());
   }
   void apply(int k, int val){
      t[k].val+=val;
      if (k<n) t[k].lazy+=val;
   }
   void build(int k){
      while (k>1) k>>=1, t[k].val=min(t[k<<1].val, t[k<<1|1].val)+t[k].lazy;
   }
   void push(int k){
      for (int s=h; s>0; --s){
         int i=k>>s;
         if (t[i].lazy){
            apply(i<<1, t[i].lazy);
            apply(i<<1|1, t[i].lazy);
            t[i].lazy=0;
         }
      }
   }
   void update(int l, int r, int val){
      --l;
      l+=n; r+=n;
      int l0=l, r0=r;
      for (; l<r; l>>=1, r>>=1){
         if (l&1) apply(l++, val);
         if (r&1) apply(--r, val);
      }
      build(l0);
      build(r0-1);
   }
   long long get(int l, int r){
      --l;
      l+=n; r+=n;
      push(l); push(r-1);
      long long ans=1e18;
      for (; l<r; l>>=1, r>>=1){
         if (l&1) ans=min(ans, t[l++].val);
         if (r&1) ans=min(ans, t[--r].val);
      }
      return ans;
   }
} st;

struct Rect{
   int x1, y1, x2, y2, z;
   Rect(){ x1=0, y1=0, x2=0, y2=0, z=0; }
};

const int N=5e5+10;
int m, n, p, q;
Rect a[N], b[N];

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> p >> q >> m >> n;
   st.init(q);
   for (int i=1; i<=n; ++i) cin >> a[i].x1 >> a[i].y1 >> a[i].x2 >> a[i].y2 >> a[i].z;
   int l=1, r=min(p, q);
   while (l<=r){
      int mid=(l+r)>>1;
      vector<pair<pair<int, int>, pair<int, int>>> events;
      for (int i=1; i<=n; ++i){
         events.push_back({{max(1, a[i].x1-mid+1), a[i].z}, {max(1, a[i].y1-mid+1), a[i].y2}});
         events.push_back({{a[i].x2+1, -a[i].z}, {max(1, a[i].y1-mid+1), a[i].y2}});
      }
      sort(events.begin(), events.end());
      bool check=0;
      for (int i=0; i<(int)events.size(); ++i){
         st.update(events[i].second.first, events[i].second.second, events[i].first.second);
         if (i==(int)events.size()-1 || events[i].first.first!=events[i+1].first.first){
            if (events[i].first.first+mid-1<=p){
               check|=st.get(1, q-mid+1)<=m;
            }
         }
      }
      if (check) l=mid+1;
      else r=mid-1;
   }
   cout << r << '\n';
   return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19800 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19800 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 20056 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 20316 KB Output is correct

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 51292 KB Output is correct
2 Correct 25 ms 51288 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 51288 KB Output is correct
2 Correct 22 ms 51292 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 20744 KB Output is correct
2 Correct 45 ms 20772 KB Output is correct
3 Correct 46 ms 20788 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 24140 KB Output is correct
2 Correct 193 ms 24076 KB Output is correct
3 Correct 179 ms 24144 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 362 ms 52984 KB Output is correct
2 Correct 67 ms 21624 KB Output is correct
3 Correct 146 ms 52828 KB Output is correct
4 Correct 454 ms 52980 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 465 ms 53252 KB Output is correct
2 Correct 495 ms 53144 KB Output is correct
3 Correct 414 ms 53128 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 563 ms 53280 KB Output is correct
2 Correct 626 ms 53288 KB Output is correct
3 Correct 608 ms 53304 KB Output is correct
4 Correct 627 ms 53540 KB Output is correct
5 Correct 561 ms 53308 KB Output is correct
6 Correct 423 ms 53284 KB Output is correct

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3761 ms 67152 KB Output is correct
2 Correct 2226 ms 38540 KB Output is correct

Subtask #14
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5068 ms 77716 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 5039 ms 80332 KB Time limit exceeded
2 Halted 0 ms 0 KB -