oj.uz

Submission #144086

# Submission time Handle Problem Language Result Execution time Memory
144086 2019-08-16T02:00:10 Z Lyestria Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 445308 KB 
#include "rect.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mn=2510;
struct seg{
    int seg[mn*2];
    inline 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]);
    }
    inline 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];
unordered_set<ll>ss;
long long hsh(ll a,ll b,ll c,ll d){
    return (a<<48)|(b<<32)|(c<<16)|d;
}
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(hsh(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:76: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 2424 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 1912 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 760 KB Output is correct
15 Correct 3 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 4 ms 2040 KB Output is correct
21 Correct 2 ms 888 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 2424 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 1912 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 760 KB Output is correct
15 Correct 3 ms 1016 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 10 ms 6392 KB Output is correct
18 Correct 10 ms 6392 KB Output is correct
19 Correct 10 ms 6312 KB Output is correct
20 Correct 9 ms 6136 KB Output is correct
21 Correct 9 ms 6108 KB Output is correct
22 Correct 9 ms 6140 KB Output is correct
23 Correct 9 ms 6136 KB Output is correct
24 Correct 7 ms 4984 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 4 ms 2040 KB Output is correct
29 Correct 2 ms 888 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 2424 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 1912 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 760 KB Output is correct
15 Correct 3 ms 1016 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 10 ms 6392 KB Output is correct
18 Correct 10 ms 6392 KB Output is correct
19 Correct 10 ms 6312 KB Output is correct
20 Correct 9 ms 6136 KB Output is correct
21 Correct 9 ms 6108 KB Output is correct
22 Correct 9 ms 6140 KB Output is correct
23 Correct 9 ms 6136 KB Output is correct
24 Correct 7 ms 4984 KB Output is correct
25 Correct 43 ms 17456 KB Output is correct
26 Correct 43 ms 17576 KB Output is correct
27 Correct 43 ms 17420 KB Output is correct
28 Correct 34 ms 15992 KB Output is correct
29 Correct 38 ms 16504 KB Output is correct
30 Correct 38 ms 16424 KB Output is correct
31 Correct 39 ms 16504 KB Output is correct
32 Correct 38 ms 16316 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 4 ms 2040 KB Output is correct
37 Correct 2 ms 888 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 2424 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 1912 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 760 KB Output is correct
15 Correct 3 ms 1016 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 10 ms 6392 KB Output is correct
18 Correct 10 ms 6392 KB Output is correct
19 Correct 10 ms 6312 KB Output is correct
20 Correct 9 ms 6136 KB Output is correct
21 Correct 9 ms 6108 KB Output is correct
22 Correct 9 ms 6140 KB Output is correct
23 Correct 9 ms 6136 KB Output is correct
24 Correct 7 ms 4984 KB Output is correct
25 Correct 43 ms 17456 KB Output is correct
26 Correct 43 ms 17576 KB Output is correct
27 Correct 43 ms 17420 KB Output is correct
28 Correct 34 ms 15992 KB Output is correct
29 Correct 38 ms 16504 KB Output is correct
30 Correct 38 ms 16424 KB Output is correct
31 Correct 39 ms 16504 KB Output is correct
32 Correct 38 ms 16316 KB Output is correct
33 Correct 317 ms 69608 KB Output is correct
34 Correct 314 ms 69624 KB Output is correct
35 Correct 316 ms 69624 KB Output is correct
36 Correct 310 ms 69624 KB Output is correct
37 Correct 608 ms 93928 KB Output is correct
38 Correct 547 ms 94084 KB Output is correct
39 Correct 554 ms 93956 KB Output is correct
40 Correct 527 ms 90700 KB Output is correct
41 Correct 375 ms 70360 KB Output is correct
42 Correct 361 ms 71512 KB Output is correct
43 Correct 422 ms 76664 KB Output is correct
44 Correct 432 ms 76516 KB Output is correct
45 Correct 217 ms 53392 KB Output is correct
46 Correct 216 ms 47884 KB Output is correct
47 Correct 442 ms 76468 KB Output is correct
48 Correct 448 ms 76472 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 4 ms 2040 KB Output is correct
53 Correct 2 ms 888 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 65540 KB Output is correct
2 Correct 47 ms 55800 KB Output is correct
3 Correct 53 ms 65444 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 55 ms 65528 KB Output is correct
6 Correct 55 ms 65400 KB Output is correct
7 Correct 54 ms 65528 KB Output is correct
8 Correct 55 ms 65528 KB Output is correct
9 Correct 55 ms 65528 KB Output is correct
10 Correct 51 ms 65056 KB Output is correct
11 Correct 55 ms 65276 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 1968 ms 212460 KB Output is correct
3 Correct 4286 ms 355096 KB Output is correct
4 Correct 4336 ms 356408 KB Output is correct
5 Correct 4348 ms 356424 KB Output is correct
6 Correct 1900 ms 214960 KB Output is correct
7 Correct 3602 ms 335176 KB Output is correct
8 Correct 3797 ms 344312 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 4 ms 2040 KB Output is correct
13 Correct 2 ms 888 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 2424 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 1912 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 760 KB Output is correct
15 Correct 3 ms 1016 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 10 ms 6392 KB Output is correct
18 Correct 10 ms 6392 KB Output is correct
19 Correct 10 ms 6312 KB Output is correct
20 Correct 9 ms 6136 KB Output is correct
21 Correct 9 ms 6108 KB Output is correct
22 Correct 9 ms 6140 KB Output is correct
23 Correct 9 ms 6136 KB Output is correct
24 Correct 7 ms 4984 KB Output is correct
25 Correct 43 ms 17456 KB Output is correct
26 Correct 43 ms 17576 KB Output is correct
27 Correct 43 ms 17420 KB Output is correct
28 Correct 34 ms 15992 KB Output is correct
29 Correct 38 ms 16504 KB Output is correct
30 Correct 38 ms 16424 KB Output is correct
31 Correct 39 ms 16504 KB Output is correct
32 Correct 38 ms 16316 KB Output is correct
33 Correct 317 ms 69608 KB Output is correct
34 Correct 314 ms 69624 KB Output is correct
35 Correct 316 ms 69624 KB Output is correct
36 Correct 310 ms 69624 KB Output is correct
37 Correct 608 ms 93928 KB Output is correct
38 Correct 547 ms 94084 KB Output is correct
39 Correct 554 ms 93956 KB Output is correct
40 Correct 527 ms 90700 KB Output is correct
41 Correct 375 ms 70360 KB Output is correct
42 Correct 361 ms 71512 KB Output is correct
43 Correct 422 ms 76664 KB Output is correct
44 Correct 432 ms 76516 KB Output is correct
45 Correct 217 ms 53392 KB Output is correct
46 Correct 216 ms 47884 KB Output is correct
47 Correct 442 ms 76468 KB Output is correct
48 Correct 448 ms 76472 KB Output is correct
49 Correct 54 ms 65540 KB Output is correct
50 Correct 47 ms 55800 KB Output is correct
51 Correct 53 ms 65444 KB Output is correct
52 Correct 2 ms 504 KB Output is correct
53 Correct 55 ms 65528 KB Output is correct
54 Correct 55 ms 65400 KB Output is correct
55 Correct 54 ms 65528 KB Output is correct
56 Correct 55 ms 65528 KB Output is correct
57 Correct 55 ms 65528 KB Output is correct
58 Correct 51 ms 65056 KB Output is correct
59 Correct 55 ms 65276 KB Output is correct
60 Correct 3 ms 1016 KB Output is correct
61 Correct 1968 ms 212460 KB Output is correct
62 Correct 4286 ms 355096 KB Output is correct
63 Correct 4336 ms 356408 KB Output is correct
64 Correct 4348 ms 356424 KB Output is correct
65 Correct 1900 ms 214960 KB Output is correct
66 Correct 3602 ms 335176 KB Output is correct
67 Correct 3797 ms 344312 KB Output is correct
68 Correct 3833 ms 344508 KB Output is correct
69 Correct 3854 ms 344508 KB Output is correct
70 Correct 3832 ms 344408 KB Output is correct
71 Correct 3828 ms 344304 KB Output is correct
72 Execution timed out 5060 ms 445308 KB Time limit exceeded
73 Halted 0 ms 0 KB -