oj.uz

Submission #441985

# Submission time Handle Problem Language Result Execution time Memory
441985 2021-07-06T16:13:17 Z peijar Rectangles (IOI19_rect) C++17
100 / 100
 4293 ms 973224 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;

template <class T> class Fenwick {
public:
  int lim;
  vector<T> bit;

  Fenwick(int n) : lim(n + 1), bit(lim) {}

  void upd(int pos, T val) {
    for (pos++; pos < lim; pos += pos & -pos)
      bit[pos] += val;
  }

  T sum(int r) { // < r
    T ret = 0;
    for (; r; r -= r & -r)
      ret += bit[r];
    return ret;
  }

  T sum(int l, int r) { // [l, r)
    return sum(r) - sum(l);
  }
};

const int MAXN = 2500;
int nbLig, nbCol;

struct goodPair {
  int fst, snd, len;
  goodPair(int l, int r) : fst(l), snd(r), len(1) {}
  goodPair(int l, int r, int le) : fst(l), snd(r), len(le) {}

  bool operator<(goodPair other) const {
    if (fst == other.fst)
      return snd < other.snd;
    return fst < other.fst;
  }
};

vector<goodPair> pairsLig[MAXN], pairsCol[MAXN];
vector<pair<int, int>> columns[MAXN][MAXN], lines[MAXN][MAXN];
vector<vector<signed>> height;

void precompute() {
  for (int iLig = 1; iLig < nbLig - 1; ++iLig) {
    vector<int> good;
    for (int iCol = 0; iCol < nbCol; ++iCol) {
      while (!good.empty() and height[iLig][good.back()] < height[iLig][iCol]) {
        if (good.back() + 1 < iCol)
          pairsLig[iLig].emplace_back(good.back() + 1, iCol - 1);
        good.pop_back();
      }
      if (!good.empty()) {
        if (good.back() + 1 < iCol)
          pairsLig[iLig].emplace_back(good.back() + 1, iCol - 1);
        if (height[iLig][good.back()] == height[iLig][iCol])
          good.pop_back();
      }
      good.push_back(iCol);
    }
    sort(pairsLig[iLig].begin(), pairsLig[iLig].end());
  }

  for (int iCol = 1; iCol < nbCol - 1; ++iCol) {
    vector<int> good;
    for (int iLig = 0; iLig < nbLig; ++iLig) {
      while (!good.empty() and height[good.back()][iCol] < height[iLig][iCol]) {
        if (good.back() + 1 < iLig)
          pairsCol[iCol].emplace_back(good.back() + 1, iLig - 1);
        good.pop_back();
      }
      if (!good.empty()) {
        if (good.back() + 1 < iLig)
          pairsCol[iCol].emplace_back(good.back() + 1, iLig - 1);
        if (height[good.back()][iCol] == height[iLig][iCol])
          good.pop_back();
      }
      good.push_back(iLig);
    }
    sort(pairsCol[iCol].begin(), pairsCol[iCol].end());
  }
  for (int iLig = nbLig - 2; iLig >= 0; --iLig)
    for (auto &[fst, snd, len] : pairsLig[iLig]) {
      int id = lower_bound(pairsLig[iLig + 1].begin(), pairsLig[iLig + 1].end(),
                           goodPair{fst, snd, 0}) -
               pairsLig[iLig + 1].begin();
      if (id < (int)pairsLig[iLig + 1].size() and
          pairsLig[iLig + 1][id].fst == fst and
          pairsLig[iLig + 1][id].snd == snd)
        len = 1 + pairsLig[iLig + 1][id].len;
    }
  for (int iCol = nbCol - 2; iCol >= 0; --iCol)
    for (auto &[fst, snd, len] : pairsCol[iCol]) {
      int id = lower_bound(pairsCol[iCol + 1].begin(), pairsCol[iCol + 1].end(),
                           goodPair{fst, snd, 0}) -
               pairsCol[iCol + 1].begin();
      if (id < (int)pairsCol[iCol + 1].size() and
          pairsCol[iCol + 1][id].fst == fst and
          pairsCol[iCol + 1][id].snd == snd)
        len = 1 + pairsCol[iCol + 1][id].len;
    }

  for (int iLig = 0; iLig < nbLig; ++iLig)
    for (auto [fst, snd, len] : pairsLig[iLig])
      lines[iLig][fst].emplace_back(snd - fst + 1, len);
  for (int iCol = 0; iCol < nbCol; ++iCol)
    for (auto [fst, snd, len] : pairsCol[iCol])
      columns[fst][iCol].emplace_back(snd - fst + 1, len);
}

long long count_rectangles(vector<vector<signed>> a) {
  height = a;
  nbLig = a.size(), nbCol = a[0].size();

  precompute();

  int sol = 0;
  Fenwick<int> fen(MAXN + 1);
  for (int iLig = 0; iLig < nbLig; ++iLig)
    for (int iCol = 0; iCol < nbCol; ++iCol) {
      sort(columns[iLig][iCol].begin(), columns[iLig][iCol].end(),
           [](pair<int, int> lft, pair<int, int> rgt) {
             return lft.second < rgt.second;
           });
      sort(lines[iLig][iCol].begin(), lines[iLig][iCol].end());
      int curCol = (int)columns[iLig][iCol].size() - 1;
      for (int idLig = (int)lines[iLig][iCol].size() - 1; idLig >= 0; --idLig) {
        while (curCol >= 0 and columns[iLig][iCol][curCol].second >=
                                   lines[iLig][iCol][idLig].first)
          fen.upd(columns[iLig][iCol][curCol--].first, 1);
        sol += fen.sum(1 + lines[iLig][iCol][idLig].second);
      }

      while (curCol + 1 < (int)columns[iLig][iCol].size()) {
        fen.upd(columns[iLig][iCol][++curCol].first, -1);
      }

      /*for (auto [a, b] : lines[iLig][iCol])
        for (auto [c, d] : columns[iLig][iCol])
          sol += a <= d and c <= b;*/
    }
  return sol;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 293840 KB Output is correct
2 Correct 170 ms 293968 KB Output is correct
3 Correct 171 ms 293964 KB Output is correct
4 Correct 170 ms 293916 KB Output is correct
5 Correct 176 ms 293956 KB Output is correct
6 Correct 174 ms 293992 KB Output is correct
7 Correct 178 ms 293952 KB Output is correct
8 Correct 172 ms 293876 KB Output is correct
9 Correct 177 ms 294084 KB Output is correct
10 Correct 176 ms 293940 KB Output is correct
11 Correct 174 ms 293956 KB Output is correct
12 Correct 181 ms 293868 KB Output is correct
13 Correct 176 ms 293824 KB Output is correct
14 Correct 175 ms 293848 KB Output is correct
15 Correct 175 ms 293940 KB Output is correct
16 Correct 176 ms 294028 KB Output is correct
17 Correct 173 ms 293892 KB Output is correct
18 Correct 178 ms 293836 KB Output is correct
19 Correct 173 ms 293852 KB Output is correct
20 Correct 172 ms 293840 KB Output is correct
21 Correct 171 ms 293868 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 293840 KB Output is correct
2 Correct 170 ms 293968 KB Output is correct
3 Correct 171 ms 293964 KB Output is correct
4 Correct 170 ms 293916 KB Output is correct
5 Correct 176 ms 293956 KB Output is correct
6 Correct 174 ms 293992 KB Output is correct
7 Correct 178 ms 293952 KB Output is correct
8 Correct 172 ms 293876 KB Output is correct
9 Correct 177 ms 294084 KB Output is correct
10 Correct 176 ms 293940 KB Output is correct
11 Correct 174 ms 293956 KB Output is correct
12 Correct 181 ms 293868 KB Output is correct
13 Correct 176 ms 293824 KB Output is correct
14 Correct 175 ms 293848 KB Output is correct
15 Correct 175 ms 293940 KB Output is correct
16 Correct 176 ms 294028 KB Output is correct
17 Correct 173 ms 293892 KB Output is correct
18 Correct 178 ms 293836 KB Output is correct
19 Correct 173 ms 293852 KB Output is correct
20 Correct 172 ms 293840 KB Output is correct
21 Correct 171 ms 293868 KB Output is correct
22 Correct 175 ms 294552 KB Output is correct
23 Correct 179 ms 294724 KB Output is correct
24 Correct 175 ms 294536 KB Output is correct
25 Correct 176 ms 294216 KB Output is correct
26 Correct 177 ms 294476 KB Output is correct
27 Correct 179 ms 294468 KB Output is correct
28 Correct 177 ms 294428 KB Output is correct
29 Correct 174 ms 294084 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 293840 KB Output is correct
2 Correct 170 ms 293968 KB Output is correct
3 Correct 171 ms 293964 KB Output is correct
4 Correct 170 ms 293916 KB Output is correct
5 Correct 176 ms 293956 KB Output is correct
6 Correct 174 ms 293992 KB Output is correct
7 Correct 178 ms 293952 KB Output is correct
8 Correct 172 ms 293876 KB Output is correct
9 Correct 177 ms 294084 KB Output is correct
10 Correct 176 ms 293940 KB Output is correct
11 Correct 174 ms 293956 KB Output is correct
12 Correct 181 ms 293868 KB Output is correct
13 Correct 176 ms 293824 KB Output is correct
14 Correct 175 ms 293848 KB Output is correct
15 Correct 175 ms 293940 KB Output is correct
16 Correct 176 ms 294028 KB Output is correct
17 Correct 175 ms 294552 KB Output is correct
18 Correct 179 ms 294724 KB Output is correct
19 Correct 175 ms 294536 KB Output is correct
20 Correct 176 ms 294216 KB Output is correct
21 Correct 177 ms 294476 KB Output is correct
22 Correct 179 ms 294468 KB Output is correct
23 Correct 177 ms 294428 KB Output is correct
24 Correct 174 ms 294084 KB Output is correct
25 Correct 173 ms 293892 KB Output is correct
26 Correct 178 ms 293836 KB Output is correct
27 Correct 173 ms 293852 KB Output is correct
28 Correct 172 ms 293840 KB Output is correct
29 Correct 171 ms 293868 KB Output is correct
30 Correct 190 ms 298136 KB Output is correct
31 Correct 190 ms 298092 KB Output is correct
32 Correct 188 ms 298052 KB Output is correct
33 Correct 184 ms 295812 KB Output is correct
34 Correct 190 ms 297004 KB Output is correct
35 Correct 194 ms 297156 KB Output is correct
36 Correct 191 ms 296924 KB Output is correct
37 Correct 194 ms 296900 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 293840 KB Output is correct
2 Correct 170 ms 293968 KB Output is correct
3 Correct 171 ms 293964 KB Output is correct
4 Correct 170 ms 293916 KB Output is correct
5 Correct 176 ms 293956 KB Output is correct
6 Correct 174 ms 293992 KB Output is correct
7 Correct 178 ms 293952 KB Output is correct
8 Correct 172 ms 293876 KB Output is correct
9 Correct 177 ms 294084 KB Output is correct
10 Correct 176 ms 293940 KB Output is correct
11 Correct 174 ms 293956 KB Output is correct
12 Correct 181 ms 293868 KB Output is correct
13 Correct 176 ms 293824 KB Output is correct
14 Correct 175 ms 293848 KB Output is correct
15 Correct 175 ms 293940 KB Output is correct
16 Correct 176 ms 294028 KB Output is correct
17 Correct 175 ms 294552 KB Output is correct
18 Correct 179 ms 294724 KB Output is correct
19 Correct 175 ms 294536 KB Output is correct
20 Correct 176 ms 294216 KB Output is correct
21 Correct 177 ms 294476 KB Output is correct
22 Correct 179 ms 294468 KB Output is correct
23 Correct 177 ms 294428 KB Output is correct
24 Correct 174 ms 294084 KB Output is correct
25 Correct 190 ms 298136 KB Output is correct
26 Correct 190 ms 298092 KB Output is correct
27 Correct 188 ms 298052 KB Output is correct
28 Correct 184 ms 295812 KB Output is correct
29 Correct 190 ms 297004 KB Output is correct
30 Correct 194 ms 297156 KB Output is correct
31 Correct 191 ms 296924 KB Output is correct
32 Correct 194 ms 296900 KB Output is correct
33 Correct 173 ms 293892 KB Output is correct
34 Correct 178 ms 293836 KB Output is correct
35 Correct 173 ms 293852 KB Output is correct
36 Correct 172 ms 293840 KB Output is correct
37 Correct 171 ms 293868 KB Output is correct
38 Correct 277 ms 323264 KB Output is correct
39 Correct 263 ms 318788 KB Output is correct
40 Correct 260 ms 318188 KB Output is correct
41 Correct 246 ms 314012 KB Output is correct
42 Correct 377 ms 346980 KB Output is correct
43 Correct 384 ms 347144 KB Output is correct
44 Correct 370 ms 347056 KB Output is correct
45 Correct 375 ms 343864 KB Output is correct
46 Correct 253 ms 311616 KB Output is correct
47 Correct 286 ms 318316 KB Output is correct
48 Correct 429 ms 334396 KB Output is correct
49 Correct 435 ms 334588 KB Output is correct
50 Correct 307 ms 314432 KB Output is correct
51 Correct 298 ms 314128 KB Output is correct
52 Correct 422 ms 332124 KB Output is correct
53 Correct 431 ms 332276 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 294180 KB Output is correct
2 Correct 173 ms 294188 KB Output is correct
3 Correct 173 ms 293988 KB Output is correct
4 Correct 171 ms 293828 KB Output is correct
5 Correct 175 ms 294084 KB Output is correct
6 Correct 180 ms 294172 KB Output is correct
7 Correct 190 ms 294084 KB Output is correct
8 Correct 191 ms 294144 KB Output is correct
9 Correct 195 ms 294060 KB Output is correct
10 Correct 184 ms 293956 KB Output is correct
11 Correct 179 ms 293948 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 293892 KB Output is correct
2 Correct 178 ms 293836 KB Output is correct
3 Correct 173 ms 293852 KB Output is correct
4 Correct 172 ms 293840 KB Output is correct
5 Correct 171 ms 293868 KB Output is correct
6 Correct 176 ms 293944 KB Output is correct
7 Correct 767 ms 399720 KB Output is correct
8 Correct 1514 ms 520688 KB Output is correct
9 Correct 1515 ms 522052 KB Output is correct
10 Correct 1538 ms 522000 KB Output is correct
11 Correct 305 ms 330264 KB Output is correct
12 Correct 435 ms 362960 KB Output is correct
13 Correct 457 ms 367680 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 293840 KB Output is correct
2 Correct 170 ms 293968 KB Output is correct
3 Correct 171 ms 293964 KB Output is correct
4 Correct 170 ms 293916 KB Output is correct
5 Correct 176 ms 293956 KB Output is correct
6 Correct 174 ms 293992 KB Output is correct
7 Correct 178 ms 293952 KB Output is correct
8 Correct 172 ms 293876 KB Output is correct
9 Correct 177 ms 294084 KB Output is correct
10 Correct 176 ms 293940 KB Output is correct
11 Correct 174 ms 293956 KB Output is correct
12 Correct 181 ms 293868 KB Output is correct
13 Correct 176 ms 293824 KB Output is correct
14 Correct 175 ms 293848 KB Output is correct
15 Correct 175 ms 293940 KB Output is correct
16 Correct 176 ms 294028 KB Output is correct
17 Correct 175 ms 294552 KB Output is correct
18 Correct 179 ms 294724 KB Output is correct
19 Correct 175 ms 294536 KB Output is correct
20 Correct 176 ms 294216 KB Output is correct
21 Correct 177 ms 294476 KB Output is correct
22 Correct 179 ms 294468 KB Output is correct
23 Correct 177 ms 294428 KB Output is correct
24 Correct 174 ms 294084 KB Output is correct
25 Correct 190 ms 298136 KB Output is correct
26 Correct 190 ms 298092 KB Output is correct
27 Correct 188 ms 298052 KB Output is correct
28 Correct 184 ms 295812 KB Output is correct
29 Correct 190 ms 297004 KB Output is correct
30 Correct 194 ms 297156 KB Output is correct
31 Correct 191 ms 296924 KB Output is correct
32 Correct 194 ms 296900 KB Output is correct
33 Correct 277 ms 323264 KB Output is correct
34 Correct 263 ms 318788 KB Output is correct
35 Correct 260 ms 318188 KB Output is correct
36 Correct 246 ms 314012 KB Output is correct
37 Correct 377 ms 346980 KB Output is correct
38 Correct 384 ms 347144 KB Output is correct
39 Correct 370 ms 347056 KB Output is correct
40 Correct 375 ms 343864 KB Output is correct
41 Correct 253 ms 311616 KB Output is correct
42 Correct 286 ms 318316 KB Output is correct
43 Correct 429 ms 334396 KB Output is correct
44 Correct 435 ms 334588 KB Output is correct
45 Correct 307 ms 314432 KB Output is correct
46 Correct 298 ms 314128 KB Output is correct
47 Correct 422 ms 332124 KB Output is correct
48 Correct 431 ms 332276 KB Output is correct
49 Correct 172 ms 294180 KB Output is correct
50 Correct 173 ms 294188 KB Output is correct
51 Correct 173 ms 293988 KB Output is correct
52 Correct 171 ms 293828 KB Output is correct
53 Correct 175 ms 294084 KB Output is correct
54 Correct 180 ms 294172 KB Output is correct
55 Correct 190 ms 294084 KB Output is correct
56 Correct 191 ms 294144 KB Output is correct
57 Correct 195 ms 294060 KB Output is correct
58 Correct 184 ms 293956 KB Output is correct
59 Correct 179 ms 293948 KB Output is correct
60 Correct 176 ms 293944 KB Output is correct
61 Correct 767 ms 399720 KB Output is correct
62 Correct 1514 ms 520688 KB Output is correct
63 Correct 1515 ms 522052 KB Output is correct
64 Correct 1538 ms 522000 KB Output is correct
65 Correct 305 ms 330264 KB Output is correct
66 Correct 435 ms 362960 KB Output is correct
67 Correct 457 ms 367680 KB Output is correct
68 Correct 173 ms 293892 KB Output is correct
69 Correct 178 ms 293836 KB Output is correct
70 Correct 173 ms 293852 KB Output is correct
71 Correct 172 ms 293840 KB Output is correct
72 Correct 171 ms 293868 KB Output is correct
73 Correct 2011 ms 651024 KB Output is correct
74 Correct 1766 ms 583884 KB Output is correct
75 Correct 1384 ms 583452 KB Output is correct
76 Correct 1173 ms 516696 KB Output is correct
77 Correct 4201 ms 973052 KB Output is correct
78 Correct 2422 ms 592092 KB Output is correct
79 Correct 2591 ms 617432 KB Output is correct
80 Correct 4003 ms 784912 KB Output is correct
81 Correct 2501 ms 609680 KB Output is correct
82 Correct 3227 ms 703848 KB Output is correct
83 Correct 4088 ms 814356 KB Output is correct
84 Correct 2320 ms 584868 KB Output is correct
85 Correct 3952 ms 787620 KB Output is correct
86 Correct 3836 ms 772788 KB Output is correct
87 Correct 2464 ms 705500 KB Output is correct
88 Correct 4293 ms 972376 KB Output is correct
89 Correct 4194 ms 973196 KB Output is correct
90 Correct 4155 ms 973224 KB Output is correct