Submission #623543

# Submission time Handle Problem Language Result Execution time Memory
623543 2022-08-05T19:38:21 Z AbdelmagedNour Rectangles (IOI19_rect) C++17
50 / 100
5000 ms 190848 KB
#include<bits/stdc++.h>
using namespace std;
#include "rect.h"
//#include"grader.cpp"
int nxt[2505][2505],prv[2505][2505];
long long count_rectangles(vector<vector<int>>a) {
	int n=a.size();
	int m=a[0].size();
	if(n<3||m<3)return 0;
	vector<vector<pair<int,int>>>v(n);
	for(int i=1;i<n-1;i++){
        vector<int>pos;
        for(int j=m-1;j>=0;j--){
            while(!pos.empty()&&a[i][pos.back()]<a[i][j]){
                v[i].push_back({j,pos.back()});
                pos.pop_back();
            }
            if(!pos.empty())v[i].push_back({j,pos.back()});
            nxt[i][j]=(pos.empty()?5000:pos.back());
            pos.push_back(j);
        }
        pos.clear();
        for(int j=0;j<m;j++){
            while(!pos.empty()&&a[i][pos.back()]<a[i][j])pos.pop_back();
            prv[i][j]=(pos.empty()?-1:pos.back());
            pos.push_back(j);
        }
	}
	long long res=0;
	for(int i=1;i<n-1;i++){
        for(auto[st,en]:v[i]){
            if(en-st==1){
                continue;
            }
            int mx[en-st+5]={};
            memset(mx,-1,sizeof(mx));
            for(int dep=0;i+dep<n-1;dep++){
                if(nxt[i+dep][st]<en||prv[i+dep][en]>st){
                    break;
                }
                int cnt=0,flag=1;
                for(int j=st+1;j<en&&flag;j++){
                    mx[j-st]=max(mx[j-st],a[i+dep][j]);
                    if(mx[j-st]>=a[i-1][j])flag=0;
                }
                if(!flag){
                    break;
                }
                for(int j=st+1;j<en;j++)cnt+=mx[j-st]>=a[i+dep+1][j];
                if(cnt==0)res++;
            }
        }
	}
	return res;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 556 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 556 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 22 ms 1228 KB Output is correct
23 Correct 21 ms 1236 KB Output is correct
24 Correct 22 ms 1236 KB Output is correct
25 Correct 1 ms 1084 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 2 ms 1212 KB Output is correct
28 Correct 1 ms 1108 KB Output is correct
29 Correct 1 ms 980 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 22 ms 1228 KB Output is correct
18 Correct 21 ms 1236 KB Output is correct
19 Correct 22 ms 1236 KB Output is correct
20 Correct 1 ms 1084 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 2 ms 1212 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 1 ms 980 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 556 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 749 ms 3564 KB Output is correct
31 Correct 708 ms 3544 KB Output is correct
32 Correct 713 ms 3628 KB Output is correct
33 Correct 4 ms 3412 KB Output is correct
34 Correct 6 ms 3496 KB Output is correct
35 Correct 6 ms 3540 KB Output is correct
36 Correct 6 ms 3540 KB Output is correct
37 Correct 6 ms 3540 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 22 ms 1228 KB Output is correct
18 Correct 21 ms 1236 KB Output is correct
19 Correct 22 ms 1236 KB Output is correct
20 Correct 1 ms 1084 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 2 ms 1212 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 1 ms 980 KB Output is correct
25 Correct 749 ms 3564 KB Output is correct
26 Correct 708 ms 3544 KB Output is correct
27 Correct 713 ms 3628 KB Output is correct
28 Correct 4 ms 3412 KB Output is correct
29 Correct 6 ms 3496 KB Output is correct
30 Correct 6 ms 3540 KB Output is correct
31 Correct 6 ms 3540 KB Output is correct
32 Correct 6 ms 3540 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 556 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 47 ms 24340 KB Output is correct
39 Correct 47 ms 24372 KB Output is correct
40 Correct 142 ms 24436 KB Output is correct
41 Correct 147 ms 24496 KB Output is correct
42 Execution timed out 5078 ms 27392 KB Time limit exceeded
43 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 7 ms 512 KB Output is correct
2 Correct 5 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 556 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 180 ms 91112 KB Output is correct
8 Correct 379 ms 189788 KB Output is correct
9 Correct 389 ms 190848 KB Output is correct
10 Correct 376 ms 190816 KB Output is correct
11 Correct 105 ms 83824 KB Output is correct
12 Correct 206 ms 162820 KB Output is correct
13 Correct 214 ms 169820 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 22 ms 1228 KB Output is correct
18 Correct 21 ms 1236 KB Output is correct
19 Correct 22 ms 1236 KB Output is correct
20 Correct 1 ms 1084 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 2 ms 1212 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 1 ms 980 KB Output is correct
25 Correct 749 ms 3564 KB Output is correct
26 Correct 708 ms 3544 KB Output is correct
27 Correct 713 ms 3628 KB Output is correct
28 Correct 4 ms 3412 KB Output is correct
29 Correct 6 ms 3496 KB Output is correct
30 Correct 6 ms 3540 KB Output is correct
31 Correct 6 ms 3540 KB Output is correct
32 Correct 6 ms 3540 KB Output is correct
33 Correct 47 ms 24340 KB Output is correct
34 Correct 47 ms 24372 KB Output is correct
35 Correct 142 ms 24436 KB Output is correct
36 Correct 147 ms 24496 KB Output is correct
37 Execution timed out 5078 ms 27392 KB Time limit exceeded
38 Halted 0 ms 0 KB -