oj.uz

Submission #204412

# Submission time Handle Problem Language Result Execution time Memory
204412 2020-02-25T17:02:45 Z ADJA Rectangles (IOI19_rect) C++14
40 / 100
 5000 ms 122940 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>
 
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
 
using namespace std;

const int MAXN = 2500;

int n, m;
int a[MAXN][MAXN];
int ok[MAXN][MAXN];
int mxc[MAXN];

int one[MAXN][MAXN], zero[MAXN][MAXN];

long long solveSix() {
  for (int j = m - 1; j >= 0; j--) {
    for (int i = 0; i < n; i++) {
      if (a[i][j] == 0) {
        one[i][j] = 0;
        zero[i][j] = 1 + zero[i][j + 1];
      } else {
        zero[i][j] = 0;
        one[i][j] = 1 + one[i][j + 1];
      }
    }
  }

  long long ans = 0;
  for (int j = 0; j + 1 < m; j++) {
    int prevOne = -1, mnZero = 123123, mxZero = -1;
    for (int i = 0; i < n; i++) {
      if (a[i][j] == 1 && one[i][j + 1] == 0) {
        mxZero = max(mxZero, zero[i][j + 1]);
        mnZero = min(mnZero, zero[i][j + 1]);
      } else {
        int curOne = one[i][j + 1];
        if (prevOne != -1 && mxZero != -1 && mxZero == mnZero) {
          int zeroLen = mnZero;
          if (j + zeroLen + 1 < m && prevOne >= zeroLen && curOne >= zeroLen) {
            ans++;
            // cerr << i << " " << j << endl;
          }
        }
        prevOne = curOne;
        mnZero = 123123, mxZero = -1;
      }
    }
  }

  return ans;
}

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];
    }
  }

  bool isSix = true;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (a[i][j] > 1) {
        isSix = false;
      }
    }
  }
  if (isSix) {
    return solveSix();
  }

  long long ans = 0;
  vector<int> cols;
  for (int i = 0; i < m; i++) {
    cols.push_back(i);
  }
  random_shuffle(all(cols));

  for (int coli = 0; coli < min(400, m); coli++) {
    int col = cols[coli];
    if (col == m - 1) {
      continue;
    }
    for (int i = 0; i < n; i++) {
      for (int j = col; j < m; j++) {
        ok[i][j] = 0;
      }
    }
    for (int i = 0; i < n; i++) {
      int mx = -1;
      for (int j = col + 1; j < m; j++) {
        if (a[i][col] > mx && a[i][j] > mx) {
          ok[i][j] = 1;
        }
        if (a[i][j] > mx) {
          mx = a[i][j];
        }
      }
    }
    for (int i = 0; i < n; i++) {
      for (int j = col + 1; j < m; j++) {
        if (ok[i][j]) {
          ok[i][j] = 1 + ok[i - 1][j];
        }
      }
    }

    for (int row = 0; row + 1 < n; row++) {
      for (int j = col + 1; j < m; j++) {
        mxc[j] = -1;
      }
      for (int row2 = row + 1; row2 < n; row2++) {
        bool good = true;
        for (int col2 = col + 1; col2 + 1 < m; col2++) {
          if (!(a[row][col2] > mxc[col2] && a[row2][col2] > mxc[col2])) {
            good = false;
          }
          if (good && row2 - 1 > row && ok[row2 - 1][col2 + 1] >= row2 - row - 1) {
            ans++;
          }
          if (a[row2][col2] > mxc[col2]) {
            mxc[col2] = a[row2][col2];
          }
        }
      }
    }
  }

  return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 5 ms 632 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 6 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 6 ms 636 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 380 KB Output is correct
19 Correct 5 ms 632 KB Output is correct
20 Correct 5 ms 632 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 380 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 5 ms 632 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 6 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 6 ms 636 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 27 ms 1016 KB Output is correct
18 Correct 28 ms 1016 KB Output is correct
19 Correct 33 ms 1144 KB Output is correct
20 Correct 32 ms 1120 KB Output is correct
21 Correct 41 ms 1016 KB Output is correct
22 Correct 40 ms 1016 KB Output is correct
23 Correct 38 ms 1020 KB Output is correct
24 Correct 14 ms 1016 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 380 KB Output is correct
27 Correct 5 ms 632 KB Output is correct
28 Correct 5 ms 632 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 380 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 5 ms 632 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 6 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 6 ms 636 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 27 ms 1016 KB Output is correct
18 Correct 28 ms 1016 KB Output is correct
19 Correct 33 ms 1144 KB Output is correct
20 Correct 32 ms 1120 KB Output is correct
21 Correct 41 ms 1016 KB Output is correct
22 Correct 40 ms 1016 KB Output is correct
23 Correct 38 ms 1020 KB Output is correct
24 Correct 14 ms 1016 KB Output is correct
25 Correct 817 ms 2552 KB Output is correct
26 Correct 814 ms 2552 KB Output is correct
27 Correct 811 ms 2552 KB Output is correct
28 Correct 919 ms 2808 KB Output is correct
29 Correct 1126 ms 2808 KB Output is correct
30 Correct 1124 ms 2808 KB Output is correct
31 Correct 1038 ms 2680 KB Output is correct
32 Correct 987 ms 2552 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 380 KB Output is correct
35 Correct 5 ms 632 KB Output is correct
36 Correct 5 ms 632 KB Output is correct
37 Correct 5 ms 376 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 5 ms 632 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 6 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 6 ms 636 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 27 ms 1016 KB Output is correct
18 Correct 28 ms 1016 KB Output is correct
19 Correct 33 ms 1144 KB Output is correct
20 Correct 32 ms 1120 KB Output is correct
21 Correct 41 ms 1016 KB Output is correct
22 Correct 40 ms 1016 KB Output is correct
23 Correct 38 ms 1020 KB Output is correct
24 Correct 14 ms 1016 KB Output is correct
25 Correct 817 ms 2552 KB Output is correct
26 Correct 814 ms 2552 KB Output is correct
27 Correct 811 ms 2552 KB Output is correct
28 Correct 919 ms 2808 KB Output is correct
29 Correct 1126 ms 2808 KB Output is correct
30 Correct 1124 ms 2808 KB Output is correct
31 Correct 1038 ms 2680 KB Output is correct
32 Correct 987 ms 2552 KB Output is correct
33 Execution timed out 5055 ms 13792 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

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

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 292 ms 59104 KB Output is correct
3 Correct 658 ms 122252 KB Output is correct
4 Correct 660 ms 122744 KB Output is correct
5 Correct 655 ms 122828 KB Output is correct
6 Correct 284 ms 60916 KB Output is correct
7 Correct 555 ms 119716 KB Output is correct
8 Correct 592 ms 122940 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 380 KB Output is correct
11 Correct 5 ms 632 KB Output is correct
12 Correct 5 ms 632 KB Output is correct
13 Correct 5 ms 376 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 5 ms 632 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 6 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 6 ms 636 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 27 ms 1016 KB Output is correct
18 Correct 28 ms 1016 KB Output is correct
19 Correct 33 ms 1144 KB Output is correct
20 Correct 32 ms 1120 KB Output is correct
21 Correct 41 ms 1016 KB Output is correct
22 Correct 40 ms 1016 KB Output is correct
23 Correct 38 ms 1020 KB Output is correct
24 Correct 14 ms 1016 KB Output is correct
25 Correct 817 ms 2552 KB Output is correct
26 Correct 814 ms 2552 KB Output is correct
27 Correct 811 ms 2552 KB Output is correct
28 Correct 919 ms 2808 KB Output is correct
29 Correct 1126 ms 2808 KB Output is correct
30 Correct 1124 ms 2808 KB Output is correct
31 Correct 1038 ms 2680 KB Output is correct
32 Correct 987 ms 2552 KB Output is correct
33 Execution timed out 5055 ms 13792 KB Time limit exceeded
34 Halted 0 ms 0 KB -