oj.uz

Submission #205738

# Submission time Handle Problem Language Result Execution time Memory
205738 2020-02-29T15:52:24 Z ADJA Rectangles (IOI19_rect) C++14
100 / 100
 3477 ms 396416 KB 
#include "rect.h"
 
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstring>
 
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
 
using namespace std;

const int MAXN = 2550;

class Fenwick {
private:
  vector <long long> f;
public:
  void init(int n) {
    f.assign(n, 0);
  }
  void update(int pos, int delta) {
    for (; pos < sz(f); pos = (pos | (pos + 1))) {
      f[pos] += delta;
    }
  }
  long long sum(int pos) {
    long long res = 0;
    for (; pos >= 0; pos = (pos & (pos + 1)) - 1) {
      res += f[pos];
    }
    return res;
  }
  long long sum(int l, int r) {
    return sum(r) - sum(l - 1);
  }
};

struct Segment {
  int r, from, to, len;
};

int cnt[MAXN];

void sortByFrom(vector<Segment> &v) {
  memset(cnt, 0, sizeof(cnt));
  for (auto &s : v) {
    cnt[s.from]++;
  }
  for (int i = 1; i < MAXN; i++) {
    cnt[i] += cnt[i - 1];
  }
  vector<Segment> res = v;
  for (int i = sz(v) - 1; i >= 0; i--) {
    auto &s = v[i];
    res[cnt[s.from] - 1] = s;
    cnt[s.from]--;
  }
  v = res;
}

void sortByTo(vector<Segment> &v) {
  memset(cnt, 0, sizeof(cnt));
  for (auto &s : v) {
    cnt[s.to]++;
  }
  for (int i = 1; i < MAXN; i++) {
    cnt[i] += cnt[i - 1];
  }
  vector<Segment> res = v;
  for (int i = sz(v) - 1; i >= 0; i--) {
    auto &s = v[i];
    res[cnt[s.to] - 1] = s;
    cnt[s.to]--;
  }
  v = res;
}

void sortByR(vector<Segment> &v) {
  memset(cnt, 0, sizeof(cnt));
  for (auto &s : v) {
    cnt[s.r]++;
  }
  for (int i = 1; i < MAXN; i++) {
    cnt[i] += cnt[i - 1];
  }
  vector<Segment> res = v;
  for (int i = sz(v) - 1; i >= 0; i--) {
    auto &s = v[i];
    res[cnt[s.r] - 1] = s;
    cnt[s.r]--;
  }
  v = res;
}

void sortByLen(vector<Segment> &v) {
  memset(cnt, 0, sizeof(cnt));
  for (auto &s : v) {
    cnt[s.len]++;
  }
  for (int i = 1; i < MAXN; i++) {
    cnt[i] += cnt[i - 1];
  }
  vector<Segment> res = v;
  for (int i = sz(v) - 1; i >= 0; i--) {
    auto &s = v[i];
    res[cnt[s.len] - 1] = s;
    cnt[s.len]--;
  }
  v = res;
}

bool cmpFromToR(Segment &a, Segment &b) {
  // pair<pair<int, int>, int> ap = {{a.from, a.to}, a.r};
  // pair<pair<int, int>, int> bp = {{b.from, b.to}, b.r};
  // return ap < bp;
  if (a.from != b.from) {
    return a.from < b.from;
  }
  if (a.to != b.to) {
    return a.to < b.to;
  }
  return a.r < b.r;
}

bool cmpRToLen(Segment &a, Segment &b) {
  // pair<pair<int, int>, int> ap = {{a.r, a.to}, a.len};
  // pair<pair<int, int>, int> bp = {{b.r, b.to}, b.len};
  // return ap < bp;
  if (a.r != b.r) {
    return a.r < b.r;
  }
  if (a.to != b.to) {
    return a.to < b.to;
  }
  return a.len < b.len;
}

bool cmpToRFrom(Segment &a, Segment &b) {
  // pair<pair<int, int>, int> ap = {{a.to, a.r}, -a.from};
  // pair<pair<int, int>, int> bp = {{b.to, b.r}, -b.from};
  // return ap < bp;
  if (a.to != b.to) {
    return a.to < b.to;
  }
  if (a.r != b.r) {
    return a.r < b.r;
  }
  return -a.from < -b.from;
}

int n, m;
int a[MAXN][MAXN];
vector<Segment> rows, cols;
Fenwick f;

void initRowsAndCols() {
  for (int i = 1; i + 1 < n; i++) {
    stack <int> st;
    for (int j = 0; j < m; j++) {
      while (!st.empty() && a[i][st.top()] < a[i][j]) {
        st.pop();
      }
      if (!st.empty() && st.top() + 1 < j) {
        rows.push_back({i, st.top(), j, 1});
      }
      st.push(j);
    }
    while (!st.empty()) {
      st.pop();
    }
    for (int j = m - 1; j >= 0; j--) {
      while (!st.empty() && a[i][st.top()] < a[i][j]) {
        st.pop();
      }
      if (!st.empty() && a[i][st.top()] != a[i][j] && j + 1 < st.top()) {
        rows.push_back({i, j, st.top(), 1});
      }
      st.push(j);
    }
  }

  for (int j = 1; j + 1 < m; j++) {
    stack <int> st;
    for (int i = 0; i < n; i++) {
      while (!st.empty() && a[st.top()][j] < a[i][j]) {
        st.pop();
      }
      if (!st.empty() && st.top() + 1 < i) {
        cols.push_back({j, st.top(), i, 1});
      }
      st.push(i);
    }
    while (!st.empty()) {
      st.pop();
    }
    for (int i = n - 1; i >= 0; i--) {
      while (!st.empty() && a[st.top()][j] < a[i][j]) {
        st.pop();
      }
      if (!st.empty() && a[st.top()][j] != a[i][j] && i + 1 < st.top()) {
        cols.push_back({j, i, st.top(), 1});
      }
      st.push(i);
    }
  }
}

void calcLen() {
  // sort(all(rows), cmpFromToR);
  sortByR(rows); sortByTo(rows); sortByFrom(rows);

  for (int i = 0; i < sz(rows); i++) {
    if (i > 0 && rows[i - 1].from == rows[i].from && rows[i - 1].to == rows[i].to 
        && rows[i - 1].r + 1 == rows[i].r) {
      rows[i].len = rows[i - 1].len + 1;
    }
  }

  // sort(all(cols), cmpFromToR);
  sortByR(cols); sortByTo(cols); sortByFrom(cols);
  for (int i = 0; i < sz(cols); i++) {
    if (i > 0 && cols[i - 1].from == cols[i].from && cols[i - 1].to == cols[i].to 
        && cols[i - 1].r + 1 == cols[i].r) {
      cols[i].len = cols[i - 1].len + 1;
    }
  }
}

void printSegment(Segment &a) {
  cerr << a.r << " " << a.from << " " << a.to << " " << a.len << endl;
}

long long count_rectangles(std::vector<std::vector<int> > A) {
  n = sz(A); m = sz(A[0]);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      a[i][j] = A[i][j];
    }
  }

  initRowsAndCols();
  calcLen();

  f.init(m);

  // sort(all(rows), cmpRToLen);
  sortByLen(rows); sortByTo(rows); sortByR(rows);
  // sort(all(cols), cmpToRFrom);
  sortByFrom(cols); reverse(all(cols));
  sortByR(cols); sortByTo(cols);

  // for (int i = 0; i < sz(rows); i++) {
  //   printSegment(rows[i]);
  // }
  // cerr << "Cols:" << endl;
  // for (int i = 0; i < sz(cols); i++) {
  //   printSegment(cols[i]);
  // }
  // cerr << endl; 

  long long ans = 0;

  vector<int> curRows;
  vector<int> curCols;
  int pRows = 0, pCols = 0;
  for (int i = 1; i + 1 < n; i++) {
    for (int j = 1; j + 1 < m; j++) {
      while (pRows < sz(rows) && rows[pRows].r == i && rows[pRows].to == j + 1) {
        curRows.push_back(pRows);
        pRows++;
      }
      while (pCols < sz(cols) && cols[pCols].to == i + 1 && cols[pCols].r == j) {
        curCols.push_back(pCols);
        pCols++;
      }

      // cerr << i << " " << j << " " << sz(curRows) << " " << sz(curCols) << endl;

      int curColsP = 0;
      for (auto &row : curRows) {
        while (curColsP < sz(curCols) && cols[curCols[curColsP]].from >= i - rows[row].len) {
          f.update(j - cols[curCols[curColsP]].len + 1, 1);
          curColsP++;
        }
        ans += f.sum(0, rows[row].from + 1);
      }

      for (int k = 0; k < curColsP; k++) {
        f.update(j - cols[curCols[k]].len + 1, -1);
      }
      curRows.clear();
      curCols.clear();
    }
  }

  return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 6 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 424 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 504 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 6 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 424 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 7 ms 1016 KB Output is correct
18 Correct 7 ms 1016 KB Output is correct
19 Correct 7 ms 1016 KB Output is correct
20 Correct 6 ms 892 KB Output is correct
21 Correct 7 ms 1020 KB Output is correct
22 Correct 7 ms 1016 KB Output is correct
23 Correct 7 ms 1016 KB Output is correct
24 Correct 6 ms 888 KB Output is correct
25 Correct 6 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 504 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 6 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 424 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 7 ms 1016 KB Output is correct
18 Correct 7 ms 1016 KB Output is correct
19 Correct 7 ms 1016 KB Output is correct
20 Correct 6 ms 892 KB Output is correct
21 Correct 7 ms 1020 KB Output is correct
22 Correct 7 ms 1016 KB Output is correct
23 Correct 7 ms 1016 KB Output is correct
24 Correct 6 ms 888 KB Output is correct
25 Correct 18 ms 3696 KB Output is correct
26 Correct 18 ms 3692 KB Output is correct
27 Correct 19 ms 3692 KB Output is correct
28 Correct 13 ms 2452 KB Output is correct
29 Correct 21 ms 3692 KB Output is correct
30 Correct 22 ms 3696 KB Output is correct
31 Correct 22 ms 3696 KB Output is correct
32 Correct 21 ms 3688 KB Output is correct
33 Correct 6 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 504 KB Output is correct
36 Correct 5 ms 376 KB Output is correct
37 Correct 5 ms 376 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 6 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 424 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 7 ms 1016 KB Output is correct
18 Correct 7 ms 1016 KB Output is correct
19 Correct 7 ms 1016 KB Output is correct
20 Correct 6 ms 892 KB Output is correct
21 Correct 7 ms 1020 KB Output is correct
22 Correct 7 ms 1016 KB Output is correct
23 Correct 7 ms 1016 KB Output is correct
24 Correct 6 ms 888 KB Output is correct
25 Correct 18 ms 3696 KB Output is correct
26 Correct 18 ms 3692 KB Output is correct
27 Correct 19 ms 3692 KB Output is correct
28 Correct 13 ms 2452 KB Output is correct
29 Correct 21 ms 3692 KB Output is correct
30 Correct 22 ms 3696 KB Output is correct
31 Correct 22 ms 3696 KB Output is correct
32 Correct 21 ms 3688 KB Output is correct
33 Correct 108 ms 20560 KB Output is correct
34 Correct 107 ms 20568 KB Output is correct
35 Correct 105 ms 20452 KB Output is correct
36 Correct 108 ms 20568 KB Output is correct
37 Correct 183 ms 31936 KB Output is correct
38 Correct 177 ms 31940 KB Output is correct
39 Correct 182 ms 31944 KB Output is correct
40 Correct 175 ms 29900 KB Output is correct
41 Correct 81 ms 14816 KB Output is correct
42 Correct 109 ms 18012 KB Output is correct
43 Correct 219 ms 31308 KB Output is correct
44 Correct 225 ms 31552 KB Output is correct
45 Correct 109 ms 17256 KB Output is correct
46 Correct 113 ms 15956 KB Output is correct
47 Correct 216 ms 29760 KB Output is correct
48 Correct 213 ms 29760 KB Output is correct
49 Correct 6 ms 376 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 504 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 5 ms 376 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 504 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 6 ms 504 KB Output is correct
6 Correct 6 ms 632 KB Output is correct
7 Correct 6 ms 508 KB Output is correct
8 Correct 6 ms 632 KB Output is correct
9 Correct 6 ms 504 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 6 ms 376 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 487 ms 70976 KB Output is correct
3 Correct 1075 ms 147604 KB Output is correct
4 Correct 1060 ms 148120 KB Output is correct
5 Correct 1095 ms 147988 KB Output is correct
6 Correct 141 ms 36856 KB Output is correct
7 Correct 314 ms 71416 KB Output is correct
8 Correct 357 ms 74616 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 6 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 424 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 7 ms 1016 KB Output is correct
18 Correct 7 ms 1016 KB Output is correct
19 Correct 7 ms 1016 KB Output is correct
20 Correct 6 ms 892 KB Output is correct
21 Correct 7 ms 1020 KB Output is correct
22 Correct 7 ms 1016 KB Output is correct
23 Correct 7 ms 1016 KB Output is correct
24 Correct 6 ms 888 KB Output is correct
25 Correct 18 ms 3696 KB Output is correct
26 Correct 18 ms 3692 KB Output is correct
27 Correct 19 ms 3692 KB Output is correct
28 Correct 13 ms 2452 KB Output is correct
29 Correct 21 ms 3692 KB Output is correct
30 Correct 22 ms 3696 KB Output is correct
31 Correct 22 ms 3696 KB Output is correct
32 Correct 21 ms 3688 KB Output is correct
33 Correct 108 ms 20560 KB Output is correct
34 Correct 107 ms 20568 KB Output is correct
35 Correct 105 ms 20452 KB Output is correct
36 Correct 108 ms 20568 KB Output is correct
37 Correct 183 ms 31936 KB Output is correct
38 Correct 177 ms 31940 KB Output is correct
39 Correct 182 ms 31944 KB Output is correct
40 Correct 175 ms 29900 KB Output is correct
41 Correct 81 ms 14816 KB Output is correct
42 Correct 109 ms 18012 KB Output is correct
43 Correct 219 ms 31308 KB Output is correct
44 Correct 225 ms 31552 KB Output is correct
45 Correct 109 ms 17256 KB Output is correct
46 Correct 113 ms 15956 KB Output is correct
47 Correct 216 ms 29760 KB Output is correct
48 Correct 213 ms 29760 KB Output is correct
49 Correct 6 ms 504 KB Output is correct
50 Correct 6 ms 504 KB Output is correct
51 Correct 5 ms 376 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 6 ms 504 KB Output is correct
54 Correct 6 ms 632 KB Output is correct
55 Correct 6 ms 508 KB Output is correct
56 Correct 6 ms 632 KB Output is correct
57 Correct 6 ms 504 KB Output is correct
58 Correct 5 ms 376 KB Output is correct
59 Correct 6 ms 376 KB Output is correct
60 Correct 5 ms 376 KB Output is correct
61 Correct 487 ms 70976 KB Output is correct
62 Correct 1075 ms 147604 KB Output is correct
63 Correct 1060 ms 148120 KB Output is correct
64 Correct 1095 ms 147988 KB Output is correct
65 Correct 141 ms 36856 KB Output is correct
66 Correct 314 ms 71416 KB Output is correct
67 Correct 357 ms 74616 KB Output is correct
68 Correct 1771 ms 221360 KB Output is correct
69 Correct 1755 ms 221256 KB Output is correct
70 Correct 1705 ms 221352 KB Output is correct
71 Correct 1735 ms 221628 KB Output is correct
72 Correct 3072 ms 367896 KB Output is correct
73 Correct 1988 ms 217152 KB Output is correct
74 Correct 2214 ms 240396 KB Output is correct
75 Correct 3346 ms 362180 KB Output is correct
76 Correct 2146 ms 248572 KB Output is correct
77 Correct 2940 ms 333756 KB Output is correct
78 Correct 3477 ms 395188 KB Output is correct
79 Correct 2008 ms 227708 KB Output is correct
80 Correct 3333 ms 374680 KB Output is correct
81 Correct 3223 ms 363364 KB Output is correct
82 Correct 1960 ms 259320 KB Output is correct
83 Correct 3424 ms 395860 KB Output is correct
84 Correct 3167 ms 396416 KB Output is correct
85 Correct 3145 ms 396404 KB Output is correct
86 Correct 6 ms 376 KB Output is correct
87 Correct 5 ms 376 KB Output is correct
88 Correct 5 ms 504 KB Output is correct
89 Correct 5 ms 376 KB Output is correct
90 Correct 5 ms 376 KB Output is correct