oj.uz

Submission #1006176

# Submission time Handle Problem Language Result Execution time Memory
1006176 2024-06-23T14:00:57 Z huutuan Pyramid Base (IOI08_pyramid_base) C++14
80 / 100
 5000 ms 81996 KB 
#include<bits/stdc++.h>

using namespace std;

// #define int long long

struct Node{
   int val, lazy;
   Node (int _val=0){
      val=_val, lazy=0;
   }
   void merge(const Node &tl, const Node &tr){
      val=min(tl.val, tr.val);
   }
};

struct SegmentTree{
   vector<Node> t;
   int n;
   void init(int _n){
      n=_n;
      t.assign(4*n+1, Node());
   }
   void apply(int k, int val){
      t[k].val+=val;
      t[k].lazy+=val;
   }
   void push(int k){
      if (t[k].lazy){
         apply(k<<1, t[k].lazy);
         apply(k<<1|1, t[k].lazy);
         t[k].lazy=0;
      }
   }
   void update(int k, int l, int r, int L, int R, int val){
      if (r<L || R<l) return;
      if (L<=l && r<=R){
         apply(k, val);
         return;
      }
      push(k);
      int mid=(l+r)>>1;
      update(k<<1, l, mid, L, R, val);
      update(k<<1|1, mid+1, r, L, R, val);
      t[k].merge(t[k<<1], t[k<<1|1]);
   }
   int get(int k, int l, int r, int L, int R){
      if (r<L || R<l) return 1e18;
      if (L<=l && r<=R) return t[k].val;
      push(k);
      int mid=(l+r)>>1;
      return min(get(k<<1, l, mid, L, R), get(k<<1|1, mid+1, r, L, R));
   }
} 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(1, 1, q, 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, 1, q, 1, q-mid+1)<=m;
            }
         }
      }
      if (check) l=mid+1;
      else r=mid-1;
   }
   cout << r << '\n';
   return 0;
}

Compilation message

pyramid_base.cpp: In member function 'int SegmentTree::get(int, int, int, int, int)':
pyramid_base.cpp:48:30: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   48 |       if (r<L || R<l) return 1e18;
      |                              ^~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 20312 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23132 KB Output is correct

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 51292 KB Output is correct
2 Correct 20 ms 51292 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 20772 KB Output is correct
2 Correct 50 ms 20740 KB Output is correct
3 Correct 45 ms 20768 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 24144 KB Output is correct
2 Correct 265 ms 24140 KB Output is correct
3 Correct 210 ms 24068 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 390 ms 52980 KB Output is correct
2 Correct 50 ms 21632 KB Output is correct
3 Correct 165 ms 52884 KB Output is correct
4 Correct 488 ms 52988 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 510 ms 53132 KB Output is correct
2 Correct 481 ms 53140 KB Output is correct
3 Correct 338 ms 53388 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 489 ms 53284 KB Output is correct
2 Correct 669 ms 53296 KB Output is correct
3 Correct 650 ms 53508 KB Output is correct
4 Correct 674 ms 53284 KB Output is correct
5 Correct 732 ms 53292 KB Output is correct
6 Correct 411 ms 53300 KB Output is correct

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4798 ms 67560 KB Output is correct
2 Correct 1627 ms 38656 KB Output is correct

Subtask #14
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5036 ms 78336 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 5037 ms 81996 KB Time limit exceeded
2 Halted 0 ms 0 KB -