oj.uz

Submission #1055243

# Submission time Handle Problem Language Result Execution time Memory
1055243 2024-08-12T15:50:32 Z RecursiveCo Rectangles (IOI19_rect) C++17
50 / 100
 814 ms 122964 KB 
#include <bits/stdc++.h>

using namespace std;

vector<vector<int>> pref;

int query(int r1, int c1, int r2, int c2) {
    int val = pref[r2][c2];
    val -= (c1? pref[r2][c1 - 1]: 0);
    val -= (r1? pref[r1 - 1][c2]: 0);
    val += (c1 && r1? pref[r1 - 1][c1 - 1]: 0);
    return val;
}

long long count_rectangles(vector<vector<int>> grid) {
    int n = grid.size();
    int m = grid[0].size();
    int maxi = -1;
    for (int i = 0; i < n; i++) maxi = max(maxi, *max_element(grid[i].begin(), grid[i].end()));
    if (maxi <= 1) {
        // Subtask 6
        pref.resize(n, vector<int>(m, 0));
        for (int i = 0; i < n; i++) {
            int prefhere = 0;
            for (int j = 0; j < m; j++) {
                prefhere += grid[i][j];
                pref[i][j] = (i? pref[i - 1][j]: 0) + prefhere;
            }
        }
        vector<vector<int>> left(n, vector<int>(m, -1));
        vector<vector<int>> above(n, vector<int>(m, -1));
        for (int i = 0; i < n; i++) {
            int here = -1;
            for (int j = 0; j < m; j++) {
                if (grid[i][j]) here = j;
                left[i][j] = here;
            }
        }
        for (int j = 0; j < m; j++) {
            int here = -1;
            for (int i = 0; i < n; i++) {
                if (grid[i][j]) here = i;
                above[i][j] = here;
            }
        }
        long long ans = 0;
        for (int i = 1; i < n - 1; i++) {
            for (int j = 1; j < m - 1; j++) {
                if (!grid[i][j] && grid[i + 1][j] && grid[i][j + 1] && left[i][j] != -1 && above[i][j] != -1) {
                    int l = left[i][j];
                    int t = above[i][j];
                    int bottom = query(i + 1, l + 1, i + 1, j);
                    int top = query(t, l + 1, t, j);
                    int leftside = query(t + 1, l, i, l);
                    int rightside = query(t + 1, j + 1, i, j + 1);
                    int inside = query(t + 1, l + 1, i, j);
                    if (bottom == j - l && top == j - l && leftside == i - t && rightside == i - t && !inside) ans++;
                }
            }
        }
        return ans;
    } else if (n == 3) {
        long long ans = 0;
        for (int j = 1; j < m - 1; j++) {
            int maxi = -1;
            for (int k = j; k < m - 1; k++) {
                if (grid[1][k] >= min(grid[0][k], grid[2][k])) break;
                maxi = max(maxi, grid[1][k]);
                if (maxi < min(grid[1][j - 1], grid[1][k + 1])) ans++;
            }
        }
        return ans;
    } else if (max(n, m) <= 200) {
        long long ans = 0;
        for (int j = 1; j < m - 1; j++) {
            for (int k = j; k < m - 1; k++) {
                for (int i = 1; i < n - 1; i++) {
                    vector<int> maxi(k - j + 1, -1);
                    for (int r = i; r < n - 1; r++) {
                        bool here = true;
                        for (int l = j; l <= k; l++) {
                            if (grid[r][l] >= min(grid[r][j - 1], grid[r][k + 1])) here = false;
                            maxi[l - j] = max(maxi[l - j], grid[r][l]);
                        }
                        if (!here) break;
                        for (int l = j; l <= k; l++) {
                            if (maxi[l - j] >= min(grid[i - 1][l], grid[r + 1][l])) here = false;
                        }
                        if (here) ans++;
                    }
                }
            }
        }
        return ans;
    }
    return 0; // for subtasks I'm not solving. (or n is 1 or 2)
}

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 408 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 22 ms 348 KB Output is correct
23 Correct 22 ms 480 KB Output is correct
24 Correct 21 ms 348 KB Output is correct
25 Correct 8 ms 484 KB Output is correct
26 Correct 9 ms 348 KB Output is correct
27 Correct 8 ms 488 KB Output is correct
28 Correct 9 ms 348 KB Output is correct
29 Correct 2 ms 460 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 408 KB Output is correct
17 Correct 22 ms 348 KB Output is correct
18 Correct 22 ms 480 KB Output is correct
19 Correct 21 ms 348 KB Output is correct
20 Correct 8 ms 484 KB Output is correct
21 Correct 9 ms 348 KB Output is correct
22 Correct 8 ms 488 KB Output is correct
23 Correct 9 ms 348 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 814 ms 752 KB Output is correct
31 Correct 800 ms 976 KB Output is correct
32 Correct 812 ms 1056 KB Output is correct
33 Correct 268 ms 832 KB Output is correct
34 Correct 266 ms 856 KB Output is correct
35 Correct 281 ms 860 KB Output is correct
36 Correct 281 ms 1016 KB Output is correct
37 Correct 270 ms 860 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 408 KB Output is correct
17 Correct 22 ms 348 KB Output is correct
18 Correct 22 ms 480 KB Output is correct
19 Correct 21 ms 348 KB Output is correct
20 Correct 8 ms 484 KB Output is correct
21 Correct 9 ms 348 KB Output is correct
22 Correct 8 ms 488 KB Output is correct
23 Correct 9 ms 348 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 814 ms 752 KB Output is correct
26 Correct 800 ms 976 KB Output is correct
27 Correct 812 ms 1056 KB Output is correct
28 Correct 268 ms 832 KB Output is correct
29 Correct 266 ms 856 KB Output is correct
30 Correct 281 ms 860 KB Output is correct
31 Correct 281 ms 1016 KB Output is correct
32 Correct 270 ms 860 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Incorrect 12 ms 7348 KB Output isn't correct
39 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

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

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 77 ms 56660 KB Output is correct
8 Correct 169 ms 122704 KB Output is correct
9 Correct 167 ms 122960 KB Output is correct
10 Correct 192 ms 122964 KB Output is correct
11 Correct 65 ms 61008 KB Output is correct
12 Correct 125 ms 115452 KB Output is correct
13 Correct 129 ms 122964 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 408 KB Output is correct
17 Correct 22 ms 348 KB Output is correct
18 Correct 22 ms 480 KB Output is correct
19 Correct 21 ms 348 KB Output is correct
20 Correct 8 ms 484 KB Output is correct
21 Correct 9 ms 348 KB Output is correct
22 Correct 8 ms 488 KB Output is correct
23 Correct 9 ms 348 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 814 ms 752 KB Output is correct
26 Correct 800 ms 976 KB Output is correct
27 Correct 812 ms 1056 KB Output is correct
28 Correct 268 ms 832 KB Output is correct
29 Correct 266 ms 856 KB Output is correct
30 Correct 281 ms 860 KB Output is correct
31 Correct 281 ms 1016 KB Output is correct
32 Correct 270 ms 860 KB Output is correct
33 Incorrect 12 ms 7348 KB Output isn't correct
34 Halted 0 ms 0 KB -