oj.uz

Submission #144081

# Submission time Handle Problem Language Result Execution time Memory
144081 2019-08-16T01:48:06 Z Lyestria Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 491852 KB 
#include "rect.h"
#include<bits/stdc++.h>
using namespace std;
const int mn=2510;
struct seg{
    int seg[mn*2];
    void up(int a,int b){
        seg[a+=mn]=b;
        for(a>>=1;a;a>>=1)seg[a]=min(seg[a<<1],seg[(a<<1)^1]);
    }
    int qu(int a,int b){
        int ans=0x3f3f3f3f;
        for(a+=mn,b+=mn;a<=b;a>>=1,b>>=1){
            if(a&1)ans=min(ans,seg[a++]);
            if(!(b&1))ans=min(ans,seg[b--]);
        }
        return ans;
    }
};
seg lef[mn],rig[mn],up[mn],dow[mn];
int elef[mn][mn],erig[mn][mn],eup[mn][mn],edow[mn][mn];
set<vector<int>>ss;
long long count_rectangles(std::vector<std::vector<int> > a) {
	int n=a.size(),m=a[0].size();
	int i,j;
	for(i=0;i<n;i++){
        stack<int>s;
        for(j=0;j<m;j++){
            while(s.size()&&a[i][s.top()]<=a[i][j])rig[s.top()].up(i,j),s.pop();
            s.push(j);
        }
        while(s.size())rig[s.top()].up(i,j),s.pop();
        for(j=m-1;j>=0;j--){
            while(s.size()&&a[i][s.top()]<=a[i][j])lef[s.top()].up(i,-j),s.pop();
            s.push(j);
        }
        while(s.size())lef[s.top()].up(i,-j),s.pop();
        for(j=0;j<m;j++){
            while(s.size()&&a[i][s.top()]<a[i][j])erig[i][s.top()]=j,s.pop();
            s.push(j);
        }
        while(s.size())erig[i][s.top()]=j,s.pop();
        for(j=m-1;j>=0;j--){
            while(s.size()&&a[i][s.top()]<a[i][j])elef[i][s.top()]=j,s.pop();
            s.push(j);
        }
        while(s.size())elef[i][s.top()]=j,s.pop();
	}
	for(i=0;i<m;i++){
        stack<int>s;
        for(j=0;j<n;j++){
            while(s.size()&&a[s.top()][i]<=a[j][i])dow[s.top()].up(i,j),s.pop();
            s.push(j);
        }
        while(s.size())dow[s.top()].up(i,j),s.pop();
        for(j=n-1;j>=0;j--){
            while(s.size()&&a[s.top()][i]<=a[j][i])up[s.top()].up(i,-j),s.pop();
            s.push(j);
        }
        while(s.size())up[s.top()].up(i,-j),s.pop();
        for(j=0;j<n;j++){
            while(s.size()&&a[s.top()][i]<a[j][i])edow[s.top()][i]=j,s.pop();
            s.push(j);
        }
        while(s.size())edow[s.top()][i]=j,s.pop();
        for(j=n-1;j>=0;j--){
            while(s.size()&&a[s.top()][i]<a[j][i])eup[s.top()][i]=j,s.pop();
            s.push(j);
        }
        while(s.size())eup[s.top()][i]=j,s.pop();
	}
	int ans=0;
	for(i=1;i<n-1;i++){
        for(j=1;j<m-1;j++){
            int d,u,l,r;
            d=edow[i][j];
            u=eup[i][j];
            l=elef[i][j];
            r=erig[i][j];
            if(l==-1||u==-1||r==m||d==n)continue;
            if(rig[l].qu(u+1,d-1)<r)continue;
            if(-lef[r].qu(u+1,d-1)>l)continue;
            if(dow[u].qu(l+1,r-1)<d)continue;
            if(-up[d].qu(l+1,r-1)>u)continue;
            ss.insert({d,u,l,r});
        }
	}
	return ss.size();
}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:72:6: warning: unused variable 'ans' [-Wunused-variable]
  int ans=0;
      ^~~

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 4 ms 2552 KB Output is correct
3 Correct 4 ms 2552 KB Output is correct
4 Correct 4 ms 2552 KB Output is correct
5 Correct 4 ms 2424 KB Output is correct
6 Correct 4 ms 2424 KB Output is correct
7 Correct 3 ms 2040 KB Output is correct
8 Correct 3 ms 1656 KB Output is correct
9 Correct 4 ms 2424 KB Output is correct
10 Correct 4 ms 2424 KB Output is correct
11 Correct 4 ms 2424 KB Output is correct
12 Correct 4 ms 2424 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 888 KB Output is correct
15 Correct 2 ms 1016 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 11 ms 6648 KB Output is correct
18 Correct 10 ms 6648 KB Output is correct
19 Correct 10 ms 6648 KB Output is correct
20 Correct 9 ms 6136 KB Output is correct
21 Correct 9 ms 6264 KB Output is correct
22 Correct 9 ms 6264 KB Output is correct
23 Correct 10 ms 6264 KB Output is correct
24 Correct 7 ms 4988 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 504 KB Output is correct
27 Correct 4 ms 2424 KB Output is correct
28 Correct 3 ms 2040 KB Output is correct
29 Correct 2 ms 760 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 4 ms 2552 KB Output is correct
3 Correct 4 ms 2552 KB Output is correct
4 Correct 4 ms 2552 KB Output is correct
5 Correct 4 ms 2424 KB Output is correct
6 Correct 4 ms 2424 KB Output is correct
7 Correct 3 ms 2040 KB Output is correct
8 Correct 3 ms 1656 KB Output is correct
9 Correct 4 ms 2424 KB Output is correct
10 Correct 4 ms 2424 KB Output is correct
11 Correct 4 ms 2424 KB Output is correct
12 Correct 4 ms 2424 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 888 KB Output is correct
15 Correct 2 ms 1016 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 11 ms 6648 KB Output is correct
18 Correct 10 ms 6648 KB Output is correct
19 Correct 10 ms 6648 KB Output is correct
20 Correct 9 ms 6136 KB Output is correct
21 Correct 9 ms 6264 KB Output is correct
22 Correct 9 ms 6264 KB Output is correct
23 Correct 10 ms 6264 KB Output is correct
24 Correct 7 ms 4988 KB Output is correct
25 Correct 53 ms 19448 KB Output is correct
26 Correct 52 ms 19448 KB Output is correct
27 Correct 53 ms 19488 KB Output is correct
28 Correct 35 ms 16120 KB Output is correct
29 Correct 39 ms 17016 KB Output is correct
30 Correct 40 ms 17084 KB Output is correct
31 Correct 41 ms 17020 KB Output is correct
32 Correct 40 ms 16932 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 504 KB Output is correct
35 Correct 4 ms 2424 KB Output is correct
36 Correct 3 ms 2040 KB Output is correct
37 Correct 2 ms 760 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 4 ms 2552 KB Output is correct
3 Correct 4 ms 2552 KB Output is correct
4 Correct 4 ms 2552 KB Output is correct
5 Correct 4 ms 2424 KB Output is correct
6 Correct 4 ms 2424 KB Output is correct
7 Correct 3 ms 2040 KB Output is correct
8 Correct 3 ms 1656 KB Output is correct
9 Correct 4 ms 2424 KB Output is correct
10 Correct 4 ms 2424 KB Output is correct
11 Correct 4 ms 2424 KB Output is correct
12 Correct 4 ms 2424 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 888 KB Output is correct
15 Correct 2 ms 1016 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 11 ms 6648 KB Output is correct
18 Correct 10 ms 6648 KB Output is correct
19 Correct 10 ms 6648 KB Output is correct
20 Correct 9 ms 6136 KB Output is correct
21 Correct 9 ms 6264 KB Output is correct
22 Correct 9 ms 6264 KB Output is correct
23 Correct 10 ms 6264 KB Output is correct
24 Correct 7 ms 4988 KB Output is correct
25 Correct 53 ms 19448 KB Output is correct
26 Correct 52 ms 19448 KB Output is correct
27 Correct 53 ms 19488 KB Output is correct
28 Correct 35 ms 16120 KB Output is correct
29 Correct 39 ms 17016 KB Output is correct
30 Correct 40 ms 17084 KB Output is correct
31 Correct 41 ms 17020 KB Output is correct
32 Correct 40 ms 16932 KB Output is correct
33 Correct 310 ms 69496 KB Output is correct
34 Correct 319 ms 69568 KB Output is correct
35 Correct 321 ms 69568 KB Output is correct
36 Correct 328 ms 69624 KB Output is correct
37 Correct 765 ms 115516 KB Output is correct
38 Correct 706 ms 115348 KB Output is correct
39 Correct 745 ms 115320 KB Output is correct
40 Correct 671 ms 109144 KB Output is correct
41 Correct 352 ms 71464 KB Output is correct
42 Correct 374 ms 73976 KB Output is correct
43 Correct 447 ms 85152 KB Output is correct
44 Correct 463 ms 85204 KB Output is correct
45 Correct 228 ms 57720 KB Output is correct
46 Correct 228 ms 52108 KB Output is correct
47 Correct 485 ms 85016 KB Output is correct
48 Correct 498 ms 85240 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 504 KB Output is correct
51 Correct 4 ms 2424 KB Output is correct
52 Correct 3 ms 2040 KB Output is correct
53 Correct 2 ms 760 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 65628 KB Output is correct
2 Correct 46 ms 55800 KB Output is correct
3 Correct 53 ms 65528 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 55 ms 65500 KB Output is correct
6 Correct 54 ms 65528 KB Output is correct
7 Correct 66 ms 65528 KB Output is correct
8 Correct 54 ms 65504 KB Output is correct
9 Correct 67 ms 65528 KB Output is correct
10 Correct 51 ms 65148 KB Output is correct
11 Correct 53 ms 65284 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1016 KB Output is correct
2 Correct 1994 ms 217584 KB Output is correct
3 Correct 4298 ms 366496 KB Output is correct
4 Correct 4383 ms 367980 KB Output is correct
5 Correct 4423 ms 368012 KB Output is correct
6 Correct 1846 ms 215032 KB Output is correct
7 Correct 3632 ms 335208 KB Output is correct
8 Correct 3887 ms 344184 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 4 ms 2424 KB Output is correct
12 Correct 3 ms 2040 KB Output is correct
13 Correct 2 ms 760 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 4 ms 2552 KB Output is correct
3 Correct 4 ms 2552 KB Output is correct
4 Correct 4 ms 2552 KB Output is correct
5 Correct 4 ms 2424 KB Output is correct
6 Correct 4 ms 2424 KB Output is correct
7 Correct 3 ms 2040 KB Output is correct
8 Correct 3 ms 1656 KB Output is correct
9 Correct 4 ms 2424 KB Output is correct
10 Correct 4 ms 2424 KB Output is correct
11 Correct 4 ms 2424 KB Output is correct
12 Correct 4 ms 2424 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 888 KB Output is correct
15 Correct 2 ms 1016 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 11 ms 6648 KB Output is correct
18 Correct 10 ms 6648 KB Output is correct
19 Correct 10 ms 6648 KB Output is correct
20 Correct 9 ms 6136 KB Output is correct
21 Correct 9 ms 6264 KB Output is correct
22 Correct 9 ms 6264 KB Output is correct
23 Correct 10 ms 6264 KB Output is correct
24 Correct 7 ms 4988 KB Output is correct
25 Correct 53 ms 19448 KB Output is correct
26 Correct 52 ms 19448 KB Output is correct
27 Correct 53 ms 19488 KB Output is correct
28 Correct 35 ms 16120 KB Output is correct
29 Correct 39 ms 17016 KB Output is correct
30 Correct 40 ms 17084 KB Output is correct
31 Correct 41 ms 17020 KB Output is correct
32 Correct 40 ms 16932 KB Output is correct
33 Correct 310 ms 69496 KB Output is correct
34 Correct 319 ms 69568 KB Output is correct
35 Correct 321 ms 69568 KB Output is correct
36 Correct 328 ms 69624 KB Output is correct
37 Correct 765 ms 115516 KB Output is correct
38 Correct 706 ms 115348 KB Output is correct
39 Correct 745 ms 115320 KB Output is correct
40 Correct 671 ms 109144 KB Output is correct
41 Correct 352 ms 71464 KB Output is correct
42 Correct 374 ms 73976 KB Output is correct
43 Correct 447 ms 85152 KB Output is correct
44 Correct 463 ms 85204 KB Output is correct
45 Correct 228 ms 57720 KB Output is correct
46 Correct 228 ms 52108 KB Output is correct
47 Correct 485 ms 85016 KB Output is correct
48 Correct 498 ms 85240 KB Output is correct
49 Correct 54 ms 65628 KB Output is correct
50 Correct 46 ms 55800 KB Output is correct
51 Correct 53 ms 65528 KB Output is correct
52 Correct 2 ms 504 KB Output is correct
53 Correct 55 ms 65500 KB Output is correct
54 Correct 54 ms 65528 KB Output is correct
55 Correct 66 ms 65528 KB Output is correct
56 Correct 54 ms 65504 KB Output is correct
57 Correct 67 ms 65528 KB Output is correct
58 Correct 51 ms 65148 KB Output is correct
59 Correct 53 ms 65284 KB Output is correct
60 Correct 3 ms 1016 KB Output is correct
61 Correct 1994 ms 217584 KB Output is correct
62 Correct 4298 ms 366496 KB Output is correct
63 Correct 4383 ms 367980 KB Output is correct
64 Correct 4423 ms 368012 KB Output is correct
65 Correct 1846 ms 215032 KB Output is correct
66 Correct 3632 ms 335208 KB Output is correct
67 Correct 3887 ms 344184 KB Output is correct
68 Correct 3845 ms 344516 KB Output is correct
69 Correct 3830 ms 344680 KB Output is correct
70 Correct 3877 ms 344568 KB Output is correct
71 Correct 3849 ms 344432 KB Output is correct
72 Execution timed out 5126 ms 491852 KB Time limit exceeded
73 Halted 0 ms 0 KB -