oj.uz

Submission #248837

# Submission time Handle Problem Language Result Execution time Memory
248837 2020-07-13T14:30:11 Z legend Rectangles (IOI19_rect) C++17
37 / 100
 5000 ms 488080 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;

int a[2501][2501];
long long count_rectangles(std::vector<std::vector<int> > A) {
    long long ans = 0;
    for(int i = 0;i<A.size();i++){
        for(int j = 0;j<A[i].size();j++) a[i][j] = A[i][j];
    }

    int n = A.size();
    int m = A[0].size();
    map<pair<pair<int,int>,pair<int,int> > ,bool > mp;
    for(int i = 1;i<n-1;i++){
        for(int j = 1;j<m-1;j++){
            for(int k = j;k<m-1;k++){
                    for(int ii = i;ii<n-1;ii++){
                        bool f = true;
                        for(int jj = j;jj<=k;jj++){
                            if(a[ii][jj]>=a[ii][j-1] || a[ii][jj]>=a[ii][k+1]){
                                f = false;
                                break;
                            }
                        }
                        if(!f) break;
                        pair<int,int> x = {i,j};
                        pair<int,int> y = {ii,k};
                        mp[{x,y}] = true;
                    }
            }
        }
    }
    for(int i = 1;i<n-1;i++){
        for(int j = 1;j<m-1;j++){
            for(int k = i;k<n-1;k++){
                for(int jj = j;jj<m-1;jj++){
                    bool f = true;
                    for(int ii = i;ii<=k;ii++){
                        if(a[ii][jj]>=a[i-1][jj] || a[ii][jj]>=a[k+1][jj]){
                            f = false;
                            break;
                        }
                    }
                    if(!f) break;
                    pair<int,int> x = {i,j};
                    pair<int,int> y = {k,jj};
                    if(mp[{x,y}]) ans++;
                }
            }
        }
    }
    return ans;
	//return 1;
}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:8:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i<A.size();i++){
                   ~^~~~~~~~~
rect.cpp:9:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0;j<A[i].size();j++) a[i][j] = A[i][j];
                       ~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 8 ms 1792 KB Output is correct
3 Correct 6 ms 1792 KB Output is correct
4 Correct 6 ms 1792 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 158 ms 30456 KB Output is correct
18 Correct 159 ms 30456 KB Output is correct
19 Correct 163 ms 30584 KB Output is correct
20 Correct 5 ms 1024 KB Output is correct
21 Correct 7 ms 1408 KB Output is correct
22 Correct 7 ms 1408 KB Output is correct
23 Correct 9 ms 1920 KB Output is correct
24 Correct 5 ms 1408 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 8 ms 1792 KB Output is correct
3 Correct 6 ms 1792 KB Output is correct
4 Correct 6 ms 1792 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 158 ms 30456 KB Output is correct
18 Correct 159 ms 30456 KB Output is correct
19 Correct 163 ms 30584 KB Output is correct
20 Correct 5 ms 1024 KB Output is correct
21 Correct 7 ms 1408 KB Output is correct
22 Correct 7 ms 1408 KB Output is correct
23 Correct 9 ms 1920 KB Output is correct
24 Correct 5 ms 1408 KB Output is correct
25 Correct 3952 ms 488080 KB Output is correct
26 Correct 3786 ms 487944 KB Output is correct
27 Correct 3824 ms 488048 KB Output is correct
28 Correct 61 ms 3576 KB Output is correct
29 Correct 84 ms 6648 KB Output is correct
30 Correct 82 ms 6776 KB Output is correct
31 Correct 133 ms 19448 KB Output is correct
32 Correct 110 ms 14456 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 512 KB Output is correct
36 Correct 0 ms 384 KB Output is correct
37 Correct 0 ms 384 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 8 ms 1792 KB Output is correct
3 Correct 6 ms 1792 KB Output is correct
4 Correct 6 ms 1792 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 158 ms 30456 KB Output is correct
18 Correct 159 ms 30456 KB Output is correct
19 Correct 163 ms 30584 KB Output is correct
20 Correct 5 ms 1024 KB Output is correct
21 Correct 7 ms 1408 KB Output is correct
22 Correct 7 ms 1408 KB Output is correct
23 Correct 9 ms 1920 KB Output is correct
24 Correct 5 ms 1408 KB Output is correct
25 Correct 3952 ms 488080 KB Output is correct
26 Correct 3786 ms 487944 KB Output is correct
27 Correct 3824 ms 488048 KB Output is correct
28 Correct 61 ms 3576 KB Output is correct
29 Correct 84 ms 6648 KB Output is correct
30 Correct 82 ms 6776 KB Output is correct
31 Correct 133 ms 19448 KB Output is correct
32 Correct 110 ms 14456 KB Output is correct
33 Execution timed out 5075 ms 20344 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 794 ms 195888 KB Output is correct
2 Correct 594 ms 141308 KB Output is correct
3 Correct 11 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 23 ms 640 KB Output is correct
6 Correct 23 ms 640 KB Output is correct
7 Correct 24 ms 632 KB Output is correct
8 Correct 22 ms 636 KB Output is correct
9 Correct 23 ms 632 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct

Subtask #6
0 / 13.0

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

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 8 ms 1792 KB Output is correct
3 Correct 6 ms 1792 KB Output is correct
4 Correct 6 ms 1792 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 158 ms 30456 KB Output is correct
18 Correct 159 ms 30456 KB Output is correct
19 Correct 163 ms 30584 KB Output is correct
20 Correct 5 ms 1024 KB Output is correct
21 Correct 7 ms 1408 KB Output is correct
22 Correct 7 ms 1408 KB Output is correct
23 Correct 9 ms 1920 KB Output is correct
24 Correct 5 ms 1408 KB Output is correct
25 Correct 3952 ms 488080 KB Output is correct
26 Correct 3786 ms 487944 KB Output is correct
27 Correct 3824 ms 488048 KB Output is correct
28 Correct 61 ms 3576 KB Output is correct
29 Correct 84 ms 6648 KB Output is correct
30 Correct 82 ms 6776 KB Output is correct
31 Correct 133 ms 19448 KB Output is correct
32 Correct 110 ms 14456 KB Output is correct
33 Execution timed out 5075 ms 20344 KB Time limit exceeded
34 Halted 0 ms 0 KB -