oj.uz

Submission #348004

# Submission time Handle Problem Language Result Execution time Memory
348004 2021-01-14T03:10:54 Z beksultan04 Rectangles (IOI19_rect) C++14
37 / 100
 5000 ms 34060 KB 
#include "rect.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin()Ñ,s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
const int N = 3e5+12,INF=1e9+7;
vector <vector <int> > a;
bool is(int r1,int r2,int c1,int c2){
    int i,j;
    for (i=r1;i<=r2;++i){
        for (j=c1;j<=c2;++j){
            int mn = min(a[i][c1-1],min(a[i][c2+1],min(a[r1-1][j],a[r2+1][j])));
            if (mn <= a[i][j])ret 0;
        }
    }
    ret 1;
}


lol count_rectangles(vector<vector<int> > a) {
    ::a = a;
    int n=a.size(),m = a[0].size(),i,j,ans=0,r1,r2,c1,c2;
    for (r1=1;r1<n-1;++r1){
        for (r2=r1;r2<n-1;++r2){
            for (c1=1;c1<m-1;++c1){
                for (c2=c1;c2<m-1;++c2){

                    ans += is(r1,r2,c1,c2);

                }
            }
        }
    }


	return ans;
}
/*
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
*/

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:41:36: warning: unused variable 'i' [-Wunused-variable]
   41 |     int n=a.size(),m = a[0].size(),i,j,ans=0,r1,r2,c1,c2;
      |                                    ^
rect.cpp:41:38: warning: unused variable 'j' [-Wunused-variable]
   41 |     int n=a.size(),m = a[0].size(),i,j,ans=0,r1,r2,c1,c2;
      |                                      ^

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 96 ms 364 KB Output is correct
18 Correct 94 ms 492 KB Output is correct
19 Correct 106 ms 364 KB Output is correct
20 Correct 88 ms 492 KB Output is correct
21 Correct 98 ms 364 KB Output is correct
22 Correct 86 ms 364 KB Output is correct
23 Correct 88 ms 448 KB Output is correct
24 Correct 27 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 2 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 96 ms 364 KB Output is correct
18 Correct 94 ms 492 KB Output is correct
19 Correct 106 ms 364 KB Output is correct
20 Correct 88 ms 492 KB Output is correct
21 Correct 98 ms 364 KB Output is correct
22 Correct 86 ms 364 KB Output is correct
23 Correct 88 ms 448 KB Output is correct
24 Correct 27 ms 364 KB Output is correct
25 Correct 3811 ms 748 KB Output is correct
26 Correct 3834 ms 860 KB Output is correct
27 Correct 3707 ms 860 KB Output is correct
28 Correct 3279 ms 860 KB Output is correct
29 Correct 3528 ms 860 KB Output is correct
30 Correct 3542 ms 860 KB Output is correct
31 Correct 3493 ms 860 KB Output is correct
32 Correct 3397 ms 876 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 2 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 96 ms 364 KB Output is correct
18 Correct 94 ms 492 KB Output is correct
19 Correct 106 ms 364 KB Output is correct
20 Correct 88 ms 492 KB Output is correct
21 Correct 98 ms 364 KB Output is correct
22 Correct 86 ms 364 KB Output is correct
23 Correct 88 ms 448 KB Output is correct
24 Correct 27 ms 364 KB Output is correct
25 Correct 3811 ms 748 KB Output is correct
26 Correct 3834 ms 860 KB Output is correct
27 Correct 3707 ms 860 KB Output is correct
28 Correct 3279 ms 860 KB Output is correct
29 Correct 3528 ms 860 KB Output is correct
30 Correct 3542 ms 860 KB Output is correct
31 Correct 3493 ms 860 KB Output is correct
32 Correct 3397 ms 876 KB Output is correct
33 Execution timed out 5053 ms 6124 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 364 KB Output is correct
2 Correct 24 ms 364 KB Output is correct
3 Correct 25 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 29 ms 364 KB Output is correct
6 Correct 35 ms 364 KB Output is correct
7 Correct 29 ms 364 KB Output is correct
8 Correct 29 ms 364 KB Output is correct
9 Correct 28 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Execution timed out 5010 ms 34060 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 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 96 ms 364 KB Output is correct
18 Correct 94 ms 492 KB Output is correct
19 Correct 106 ms 364 KB Output is correct
20 Correct 88 ms 492 KB Output is correct
21 Correct 98 ms 364 KB Output is correct
22 Correct 86 ms 364 KB Output is correct
23 Correct 88 ms 448 KB Output is correct
24 Correct 27 ms 364 KB Output is correct
25 Correct 3811 ms 748 KB Output is correct
26 Correct 3834 ms 860 KB Output is correct
27 Correct 3707 ms 860 KB Output is correct
28 Correct 3279 ms 860 KB Output is correct
29 Correct 3528 ms 860 KB Output is correct
30 Correct 3542 ms 860 KB Output is correct
31 Correct 3493 ms 860 KB Output is correct
32 Correct 3397 ms 876 KB Output is correct
33 Execution timed out 5053 ms 6124 KB Time limit exceeded
34 Halted 0 ms 0 KB -