oj.uz

Submission #560599

# Submission time Handle Problem Language Result Execution time Memory
560599 2022-05-11T17:37:54 Z SSRS Pyramid Base (IOI08_pyramid_base) C++14
37 / 100
 5000 ms 62608 KB 
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000;
struct segment_tree{
  int N;
  vector<long long> sum, left;
  segment_tree(int N2){
    N = 1;
    while (N < N2){
      N *= 2;
    }
    sum = vector<long long>(N * 2 - 1, INF);
    left = vector<long long>(N * 2 - 1, INF);
    for (int i = 0; i < N2; i++){
      sum[N - 1 + i] = 0;
      left[N - 1 + i] = 0;
    }
    for (int i = N - 2; i >= 0; i--){
      sum[i] = sum[i * 2 + 1] + sum[i * 2 + 2];
      left[i] = 0;
    }
  }
  void add(int i, long long x){
    i += N - 1;
    sum[i] += x;
    left[i] = sum[i];
    while (i > 0){
      i = (i - 1) / 2;
      sum[i] = sum[i * 2 + 1] + sum[i * 2 + 2];
      left[i] = min(left[i * 2 + 1], sum[i * 2 + 1] + min(left[i * 2 + 2], (long long) 0));
    }
  }
  long long get(){
    return left[0];
  }
};
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int M, N;
  cin >> M >> N;
  int B;
  cin >> B;
  int P;
  cin >> P;
  vector<int> X1(P), Y1(P), X2(P), Y2(P), C(P);
  for (int i = 0; i < P; i++){
    cin >> X1[i] >> Y1[i] >> X2[i] >> Y2[i] >> C[i];
    X1[i]--;
    Y1[i]--;
  }
  int tv = 0, fv = min(M, N) + 1;
  while (fv - tv > 1){
    int mid = (tv + fv) / 2;
    vector<tuple<int, int, int>> T;
    for (int i = 0; i < P; i++){
      T.push_back(make_tuple(max(Y1[i] - mid + 1, 0), i, 0));
      if (Y2[i] < N - mid + 1){
        T.push_back(make_tuple(Y2[i], i, 1));
      }
    }
    sort(T.begin(), T.end());
    int cnt = T.size();
    segment_tree ST(M - mid + 1);
    bool ok = false;
    for (int i = 0; i < cnt; i++){
      int j = get<1>(T[i]);
      int t = get<2>(T[i]);
      if (t == 0){
        ST.add(max(X1[j] - mid + 1, 0), C[j]);
        if (X2[j] < M - mid + 1){
          ST.add(X2[j], -C[j]);
        }
      }
      if (t == 1){
        ST.add(max(X1[j] - mid + 1, 0), -C[j]);
        if (X2[j] < M - mid + 1){
          ST.add(X2[j], C[j]);
        }
      }
      if (i < cnt - 1){
        if (get<0>(T[i]) != get<0>(T[i + 1])){
          if (ST.get() <= B){
            ok = true;
          }
        }
      }
    }
    if (ok){
      tv = mid;
    } else {
      fv = mid;
    }
  }
  cout << tv << endl;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 4536 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 16700 KB Output is correct
2 Correct 346 ms 33324 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 400 ms 33296 KB Output is correct
2 Correct 183 ms 16848 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 852 KB Output is correct
2 Correct 36 ms 1220 KB Output is correct
3 Correct 38 ms 1244 KB Output is correct

Subtask #9
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 5444 KB Output is correct
2 Incorrect 200 ms 5556 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 518 ms 17840 KB Output is correct
2 Incorrect 225 ms 34344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #11
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 602 ms 34940 KB Output is correct
2 Correct 932 ms 34988 KB Output is correct
3 Incorrect 410 ms 17992 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #12
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 618 ms 18592 KB Output is correct
2 Incorrect 1008 ms 35396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #13
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5051 ms 48036 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 5087 ms 58368 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 5008 ms 62608 KB Time limit exceeded
2 Halted 0 ms 0 KB -