oj.uz

답안 #146612

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
146612 2019-08-24T18:05:41 Z Blagojce Rectangles (IOI19_rect) C++14
37 / 100
 2719 ms 1048576 KB 
#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
ll const inf = 1e9;
ll const mod = 1e9 + 7;
ld const eps = 1e-9;
#include "rect.h"

long long count_rectangles(std::vector<std::vector<int> > a) {

        int n = a.size();
        int m = a[0].size();
        cin >> n >> m;
        /*a.resize(n);
        fr(i, 0, n){
                a[i].resize(m);
                fr(j, 0, m)cin >>a[i][j];
        }*/
        int MAXr[n][m][m];
        fr(i, 0, n){
                fr(j, 0, m){
                        int MAX = 0;
                        fr(o, j, m){
                                MAX = max(MAX, a[i][o]);
                                MAXr[i][j][o] = MAX;
                        }
                }
        }
        int MAXc[m][n][n];
        fr(i, 0, m){
                fr(j, 0 ,n){
                        int MAX = 0;
                        fr(o, j, n){
                                MAX = max(MAX, a[o][i]);
                                MAXc[i][j][o] = MAX;
                        }
                }
        }

        bool ok = true;
        int CNT = 0;
        fr(i, 1, n){
                fr(j, 1, m){
                        fr(ri, i, n - 1){
                                fr(cj, j, m - 1){
                                        ok = true;
                                        fr(o, i, ri + 1){
                                                if(MAXr[o][j][cj] >= min(a[o][cj + 1], a[o][j - 1])){
                                                        ok = false;;
                                                        break;
                                                }
                                        }
                                        if(!ok) continue;
                                        fr(o, j, cj + 1){
                                                if(MAXc[o][i][ri] >= min(a[i - 1][o], a[ri + 1][o])){
                                                        ok = false;
                                                        break;
                                                }
                                        }
                                        if(ok)CNT ++;

                                }
                        }
                }
        }
        //cout << CNT << endl;
        return CNT;

}
/*
int main()
{
        count_rectangles({{1}});
        return 0;
}*/
/*
6 5
4 8 7 5 6
7 4 10 3 5
9 7 20 14 2
9 14 7 3 6
5 7 5 2 7
4 5 13 5 6
*/

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 3 ms 484 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 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 256 KB Output is correct
19 Correct 3 ms 504 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 3 ms 484 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 68 ms 4344 KB Output is correct
18 Correct 67 ms 4512 KB Output is correct
19 Correct 67 ms 4344 KB Output is correct
20 Correct 47 ms 4344 KB Output is correct
21 Correct 46 ms 4344 KB Output is correct
22 Correct 47 ms 4344 KB Output is correct
23 Correct 48 ms 4472 KB Output is correct
24 Correct 14 ms 1916 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 3 ms 504 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 3 ms 484 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 68 ms 4344 KB Output is correct
18 Correct 67 ms 4512 KB Output is correct
19 Correct 67 ms 4344 KB Output is correct
20 Correct 47 ms 4344 KB Output is correct
21 Correct 46 ms 4344 KB Output is correct
22 Correct 47 ms 4344 KB Output is correct
23 Correct 48 ms 4472 KB Output is correct
24 Correct 14 ms 1916 KB Output is correct
25 Correct 2682 ms 63532 KB Output is correct
26 Correct 2719 ms 63608 KB Output is correct
27 Correct 2694 ms 63604 KB Output is correct
28 Correct 1638 ms 63480 KB Output is correct
29 Correct 1655 ms 63480 KB Output is correct
30 Correct 1663 ms 63608 KB Output is correct
31 Correct 1696 ms 63736 KB Output is correct
32 Correct 1631 ms 62328 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 2 ms 256 KB Output is correct
35 Correct 3 ms 504 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 3 ms 484 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 68 ms 4344 KB Output is correct
18 Correct 67 ms 4512 KB Output is correct
19 Correct 67 ms 4344 KB Output is correct
20 Correct 47 ms 4344 KB Output is correct
21 Correct 46 ms 4344 KB Output is correct
22 Correct 47 ms 4344 KB Output is correct
23 Correct 48 ms 4472 KB Output is correct
24 Correct 14 ms 1916 KB Output is correct
25 Correct 2682 ms 63532 KB Output is correct
26 Correct 2719 ms 63608 KB Output is correct
27 Correct 2694 ms 63604 KB Output is correct
28 Correct 1638 ms 63480 KB Output is correct
29 Correct 1655 ms 63480 KB Output is correct
30 Correct 1663 ms 63608 KB Output is correct
31 Correct 1696 ms 63736 KB Output is correct
32 Correct 1631 ms 62328 KB Output is correct
33 Runtime error 901 ms 1048576 KB Execution killed with signal 9 (could be triggered by violating memory limits)
34 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 61152 KB Output is correct
2 Correct 56 ms 46332 KB Output is correct
3 Correct 70 ms 61176 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 70 ms 61048 KB Output is correct
6 Correct 76 ms 61176 KB Output is correct
7 Correct 69 ms 61048 KB Output is correct
8 Correct 69 ms 61176 KB Output is correct
9 Correct 70 ms 61176 KB Output is correct
10 Correct 20 ms 20488 KB Output is correct
11 Correct 39 ms 40828 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 388 KB Output is correct
2 Runtime error 79 ms 51664 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 3 ms 484 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 68 ms 4344 KB Output is correct
18 Correct 67 ms 4512 KB Output is correct
19 Correct 67 ms 4344 KB Output is correct
20 Correct 47 ms 4344 KB Output is correct
21 Correct 46 ms 4344 KB Output is correct
22 Correct 47 ms 4344 KB Output is correct
23 Correct 48 ms 4472 KB Output is correct
24 Correct 14 ms 1916 KB Output is correct
25 Correct 2682 ms 63532 KB Output is correct
26 Correct 2719 ms 63608 KB Output is correct
27 Correct 2694 ms 63604 KB Output is correct
28 Correct 1638 ms 63480 KB Output is correct
29 Correct 1655 ms 63480 KB Output is correct
30 Correct 1663 ms 63608 KB Output is correct
31 Correct 1696 ms 63736 KB Output is correct
32 Correct 1631 ms 62328 KB Output is correct
33 Runtime error 901 ms 1048576 KB Execution killed with signal 9 (could be triggered by violating memory limits)
34 Halted 0 ms 0 KB -