oj.uz

Submission #1040101

# Submission time Handle Problem Language Result Execution time Memory
1040101 2024-07-31T16:17:25 Z LaMatematica14 Rectangles (IOI19_rect) C++17
0 / 100
 5000 ms 62464 KB 
#include <bits/stdc++.h>
using namespace std;

long long count_rectangles(vector<vector<int>> a) {
    int n = a.size();
    int m = a[0].size();
    if (n < 3 || m < 3) return 0;
    long long tot = 0;
    for (int i = 1; i < n-1; i++) {
        for (int j = 1; j < m-1; j++) {
            vector<vector<int>> r(n, vector<int> (m));
            vector<vector<int>> col(n, vector<int> (m));
            for (int b = i; b < n-1; b++) {
                for (int c = j; c < m-1; c++) {
                    r[b][c] = max(r[b][c-1], a[b][c]);
                    col[b][c] = max(col[b-1][c], a[b][c]);
                }
            }
            vector<vector<int>> f(n, vector<int> (m, 0));
            for (int t = 0; t < m; t++) f[i-1][t] = 1;
            for (int b = i; b < n-1; b++) {
                for (int c = j; c < m-1; c++) {
                    if (a[i-1][c] <= col[b][c]) break;
                    if (a[b][j-1] <= r[b][c]) break;
                    if (a[b][c+1] <= r[b][c]) continue;
                    f[b][c] = 1;
                    if (a[b+1][c] <= col[b][c]) break;
                    if (!f[b-1][c]) continue;
                    tot++;
                }
            }
        }
    }
    return tot;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Incorrect 2 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Incorrect 2 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Incorrect 2 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Incorrect 2 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 600 KB Output is correct
2 Correct 18 ms 604 KB Output is correct
3 Correct 9 ms 448 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 9 ms 652 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 5076 ms 62464 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Incorrect 2 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -