oj.uz

Submission #503145

# Submission time Handle Problem Language Result Execution time Memory
503145 2022-01-07T11:32:45 Z 600Mihnea Pyramid Base (IOI08_pyramid_base) C++17
35 / 100
 5000 ms 131172 KB 
#include <bits/stdc++.h>

using namespace std;

struct Rect {
  int x1;
  int y1;
  int x2;
  int y2;
  int cost;
};

const int N = (int) 4e5 + 7;
const int L = (int) 1e6 + 7;
int dimx;
int dimy;
int budget;
int n;
Rect rects[N];

struct Node {
  int mn;
  int len;
  int sol;
  int pref;
  int suf;
};

Node tree[4 * L];
int lazy[4 * L];

Node operator + (Node a, Node b) {
  int mn = min(a.mn, b.mn);
  int len = a.len + b.len;
  int sol;
  int pref;
  int suf;
  if (a.mn == b.mn) {
    sol = max(a.suf + b.pref, max(a.sol, b.sol));
    pref = a.pref + b.pref * (a.pref == a.len);
    suf = b.suf + a.suf * (b.suf == b.len);
  } else {
    if (a.mn < b.mn) {
      sol = a.sol;
      pref = a.pref;
      suf = 0;
    } else {
      sol = b.sol;
      pref = 0;
      suf = b.suf;
    }
  }
  return {mn, len, sol, pref, suf};
}

void build(int v, int tl, int tr) {
  lazy[v] = 0;
  if (tl == tr) {
    tree[v].mn = 0;
    tree[v].len = 1;
    tree[v].sol = 1;
    tree[v].pref = 1;
    tree[v].suf = 1;
    return;
  }
  int tm = (tl + tr) / 2;
  build(2 * v, tl, tm);
  build(2 * v + 1, tm + 1, tr);
  tree[v] = tree[2 * v] + tree[2 * v + 1];
}

void push(int v, int tl, int tr) {
  if (lazy[v]) {
    tree[v].mn += lazy[v];
    if (tl < tr) {
      lazy[2 * v] += lazy[v];
      lazy[2 * v + 1] += lazy[v];
    }
    lazy[v] = 0;
  }
}

void add(int v, int tl, int tr, int l, int r, int x) {
  push(v, tl, tr);
  if (tr < l || r < tl) {
    return;
  }
  if (l <= tl && tr <= r) {
    lazy[v] += x;
    push(v, tl, tr);
    return;
  }
  int tm = (tl + tr) / 2;
  add(2 * v, tl, tm, l, r, x);
  add(2 * v + 1, tm + 1, tr, l, r, x);
  tree[v] = tree[2 * v] + tree[2 * v + 1];
}

void build() {
  build(1, 1, dimy);
}

void add(int l, int r, int x) {
  add(1, 1, dimy, l, r, x);
}

int get() {
  /// cout << tree[1].mn << " " << tree[1].len << " ---> " << tree[1].sol << "\n";
  if (tree[1].mn == 0) {
    return tree[1].sol;
  } else {
    return 0;
  }
}

vector<int> out[L];
vector<int> in[L];

signed main() {
  ios::sync_with_stdio(0); cin.tie(0);

 /// freopen ("input", "r", stdin);

  cin >> dimx >> dimy >> budget >> n;
  for (int i = 1; i <= n; i++) {
    cin >> rects[i].x1 >> rects[i].y1 >> rects[i].x2 >> rects[i].y2 >> rects[i].cost;
    in[rects[i].x1].push_back(i);
    out[rects[i].x2].push_back(i);
  }

  build();

  if (budget) {
    cout << "I will think later about how to solve this subtask\n";
    exit(0);
  }

  int missed = 0;


  int x2 = 0, sol = 0;
  for (int x1 = 1; x1 <= dimx; x1++) {
   /// assert(x2 - x1 + 1 <= get());
    if (x2 >= x1 - 1) {
      for (auto &i : out[x1 - 1]) {
        add(rects[i].y1, rects[i].y2, -1);
        ///cout << "                              - " << i << "\n";
      }
    }
    x2 = max(x2, x1 - 1);
    /*if (x1 % 10000 == 0) {
      cout << "= " << x1 << " " << missed << " : "  << sol << "\n";
    }*/
   /// cout << tree[1].mn << " ----> ";
    while (x2 + 1 <= dimx && x2 - x1 + 1 <= get()) {
      x2++;
      for (auto &i : in[x2]) {
        add(rects[i].y1, rects[i].y2, +1);
      }
      /*if (x1 == 6 && x2 == 5) {
        cout << x2 - x1 + 1 << " vs " << get() << "\n";
        exit(0);
      }*/
      if (x2 - x1 + 1 > get()) {

        if (x1 == x2) {
          break;
        }
        for (auto &i : in[x2]) {
          add(rects[i].y1, rects[i].y2, -1);
        }
        missed++;
        x2--;
        break;
      }
      /**for (auto &i : in[x2]) {
        cout << "                              + " << i << "\n";
      }**/
    }
    if (x2 - x1 + 1 > get()) {
      assert(x1 == x2);
    //  cout << x1 << " " << x2 << " : " << get() << "\n";
    } else {
      sol = max(sol, x2 - x1 + 1);
    }
  }
  cout << sol << "\n";



  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 47280 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47220 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 47368 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 48088 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 53580 KB Output is correct

Subtask #6
0 / 5.0

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

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 556 ms 96652 KB Output is correct
2 Execution timed out 5067 ms 96580 KB Time limit exceeded

Subtask #8
0 / 7.0

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

Subtask #9
0 / 7.0

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

Subtask #10
0 / 7.0

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

Subtask #11
0 / 7.0

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

Subtask #12
0 / 7.0

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

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1587 ms 112300 KB Output is correct
2 Correct 673 ms 64080 KB Output is correct

Subtask #14
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1894 ms 119140 KB Output is correct
2 Execution timed out 5091 ms 115160 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #15
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2213 ms 125508 KB Output is correct
2 Correct 1467 ms 123064 KB Output is correct
3 Correct 1500 ms 123052 KB Output is correct
4 Execution timed out 5103 ms 131172 KB Time limit exceeded
5 Halted 0 ms 0 KB -