oj.uz

Submission #154134

# Submission time Handle Problem Language Result Execution time Memory
154134 2019-09-18T14:10:36 Z 79brue Rectangles (IOI19_rect) C++14
15 / 100
 5000 ms 41312 KB 
#include <bits/stdc++.h>
#include "rect.h"

using namespace std;
typedef long long ll;

int n, m;
int board[2502][2502];
int maxVal1[82][82][82]; /// ----
int maxVal2[82][82][82]; /// ||||

ll count_rectangles(vector<vector<int> > _var) {
    n = (int)_var.size();
    m = (int)_var[0].size();
    ll ans = 0;
    bool pos;

    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            board[i][j] = _var[i-1][j-1];
        }
    }

    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            for(int k=j; k<=m; k++){
                for(int l=j; l<=k; l++){
                    maxVal1[i][j][k] = max(maxVal1[i][j][k], board[i][l]);
                }
            }
        }
    }

    for(int i=1; i<=m; i++){
        for(int j=1; j<=n; j++){
            for(int k=j; k<=n; k++){
                for(int l=j; l<=k; l++){
                    maxVal2[i][j][k] = max(maxVal2[i][j][k], board[l][i]);
                }
            }
        }
    }

    for(int i=2; i<n; i++){
        for(int j=2; j<m; j++){
            for(int k=i; k<n; k++){
                for(int l=j; l<m; l++){
                    pos = 1;
                    for(int x=i; x<=k; x++){
                        if(maxVal1[x][j][l] >= min(board[x][j-1], board[x][l+1])){
                            pos = 0;
                            break;
                        }
                    }
                    for(int y=j; y<=l; y++){
                        if(maxVal2[y][i][k] >= min(board[i-1][y], board[k+1][y])){
                            pos = 0;
                            break;
                        }
                    }
                    if(pos) ans++;
                }
            }
        }
    }

    return ans;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 5 ms 1272 KB Output is correct
3 Correct 6 ms 1276 KB Output is correct
4 Correct 6 ms 1272 KB Output is correct
5 Correct 5 ms 1272 KB Output is correct
6 Correct 5 ms 1272 KB Output is correct
7 Correct 4 ms 888 KB Output is correct
8 Correct 4 ms 888 KB Output is correct
9 Correct 4 ms 1272 KB Output is correct
10 Correct 5 ms 1272 KB Output is correct
11 Correct 4 ms 1272 KB Output is correct
12 Correct 5 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 91 ms 5020 KB Output is correct
18 Correct 91 ms 5036 KB Output is correct
19 Correct 93 ms 5084 KB Output is correct
20 Correct 71 ms 4984 KB Output is correct
21 Correct 71 ms 4976 KB Output is correct
22 Correct 74 ms 4988 KB Output is correct
23 Correct 72 ms 4984 KB Output is correct
24 Correct 23 ms 3156 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 4 ms 1272 KB Output is correct
28 Correct 3 ms 888 KB Output is correct
29 Correct 2 ms 476 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 5 ms 1272 KB Output is correct
3 Correct 6 ms 1276 KB Output is correct
4 Correct 6 ms 1272 KB Output is correct
5 Correct 5 ms 1272 KB Output is correct
6 Correct 5 ms 1272 KB Output is correct
7 Correct 4 ms 888 KB Output is correct
8 Correct 4 ms 888 KB Output is correct
9 Correct 4 ms 1272 KB Output is correct
10 Correct 5 ms 1272 KB Output is correct
11 Correct 4 ms 1272 KB Output is correct
12 Correct 5 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 91 ms 5020 KB Output is correct
18 Correct 91 ms 5036 KB Output is correct
19 Correct 93 ms 5084 KB Output is correct
20 Correct 71 ms 4984 KB Output is correct
21 Correct 71 ms 4976 KB Output is correct
22 Correct 74 ms 4988 KB Output is correct
23 Correct 72 ms 4984 KB Output is correct
24 Correct 23 ms 3156 KB Output is correct
25 Execution timed out 5030 ms 8344 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 5 ms 1272 KB Output is correct
3 Correct 6 ms 1276 KB Output is correct
4 Correct 6 ms 1272 KB Output is correct
5 Correct 5 ms 1272 KB Output is correct
6 Correct 5 ms 1272 KB Output is correct
7 Correct 4 ms 888 KB Output is correct
8 Correct 4 ms 888 KB Output is correct
9 Correct 4 ms 1272 KB Output is correct
10 Correct 5 ms 1272 KB Output is correct
11 Correct 4 ms 1272 KB Output is correct
12 Correct 5 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 91 ms 5020 KB Output is correct
18 Correct 91 ms 5036 KB Output is correct
19 Correct 93 ms 5084 KB Output is correct
20 Correct 71 ms 4984 KB Output is correct
21 Correct 71 ms 4976 KB Output is correct
22 Correct 74 ms 4988 KB Output is correct
23 Correct 72 ms 4984 KB Output is correct
24 Correct 23 ms 3156 KB Output is correct
25 Execution timed out 5030 ms 8344 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5020 ms 1488 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 5 ms 1272 KB Output is correct
3 Correct 6 ms 1276 KB Output is correct
4 Correct 6 ms 1272 KB Output is correct
5 Correct 5 ms 1272 KB Output is correct
6 Correct 5 ms 1272 KB Output is correct
7 Correct 4 ms 888 KB Output is correct
8 Correct 4 ms 888 KB Output is correct
9 Correct 4 ms 1272 KB Output is correct
10 Correct 5 ms 1272 KB Output is correct
11 Correct 4 ms 1272 KB Output is correct
12 Correct 5 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 91 ms 5020 KB Output is correct
18 Correct 91 ms 5036 KB Output is correct
19 Correct 93 ms 5084 KB Output is correct
20 Correct 71 ms 4984 KB Output is correct
21 Correct 71 ms 4976 KB Output is correct
22 Correct 74 ms 4988 KB Output is correct
23 Correct 72 ms 4984 KB Output is correct
24 Correct 23 ms 3156 KB Output is correct
25 Execution timed out 5030 ms 8344 KB Time limit exceeded
26 Halted 0 ms 0 KB -