oj.uz

Submission #294966

# Submission time Handle Problem Language Result Execution time Memory
294966 2020-09-09T11:13:11 Z Pajaraja Rectangles (IOI19_rect) C++17
100 / 100
 3060 ms 272296 KB 
#include "rect.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define MAXN 2507
using namespace std;
vector<int> ind[MAXN];
short qx[2*MAXN*MAXN],qy[2*MAXN*MAXN],ql[2*MAXN*MAXN],qt[2*MAXN*MAXN],lge[2][MAXN],rge[2][MAXN],dp[2][MAXN][MAXN];
stack<int> st;
int bit[MAXN][MAXN],cnt;
inline void upd(int k,int u,int v)
{
    while(u<MAXN)
    {
        bit[k][u]+=v;
        u+=u&(-u);
    }
}
inline int fnd(int k,int u)
{
    int sol=0;
    while(u>=k)
    {
        sol+=bit[k][u];
        u-=u&(-u);
    }
    return sol;
}
bool cmp(int a,int b) {return ql[a]<ql[b];}
long long count_rectangles(std::vector<std::vector<int> > a)
{
    int n=a.size(),m=a[0].size(),l=0;
    long long sol=0;
    for(int i=0;i<2;i++) for(int j=0;j<MAXN;j++) for(int k=0;k<MAXN;k++) dp[i][j][k]=0;
    for(int i=1;i<n-1;i++)
    {
        for(int j=0;j<m;j++)
        {
            while(!st.empty() && a[i][st.top()]<a[i][j]) st.pop();
            if(!st.empty() && st.top()+1!=j)
            {
                if(dp[l^1][st.top()+1][j-1]) dp[l][st.top()+1][j-1]=dp[l^1][st.top()+1][j-1];
                else dp[l][st.top()+1][j-1]=i;
                qx[cnt]=st.top()+1; qy[cnt]=j-1; ql[cnt]=2*dp[l][st.top()+1][j-1]+1; ind[i].push_back(cnt++);
            }
            if(!st.empty()) lge[l][j]=st.top();
            else lge[l][j]=-1;
            st.push(j);
        }
        while(!st.empty()) st.pop();
        for(int j=m-1;j>=0;j--)
        {
            while(!st.empty() && a[i][st.top()]<a[i][j]) st.pop();
            if(!st.empty() && st.top()-1!=j && lge[l][st.top()]!=j)
            {
                if(dp[l^1][j+1][st.top()-1]) dp[l][j+1][st.top()-1]=dp[l^1][j+1][st.top()-1];
                else dp[l][j+1][st.top()-1]=i;
                qx[cnt]=j+1; qy[cnt]=st.top()-1; ql[cnt]=2*dp[l][j+1][st.top()-1]+1; ind[i].push_back(cnt++);
            }
            if(!st.empty()) rge[l][j]=st.top();
            else rge[l][j]=-1;
            st.push(j);
        }
        while(!st.empty()) st.pop();
        if(i!=1)
        {
            for(int j=0;j<m;j++) if(lge[l^1][j]!=-1) dp[l^1][lge[l^1][j]+1][j-1]=0;
            for(int j=0;j<m;j++) if(rge[l^1][j]!=-1) dp[l^1][j+1][rge[l^1][j]-1]=0;
        }
        l^=1;
    }
    for(int i=0;i<2;i++) for(int j=0;j<MAXN;j++) for(int k=0;k<MAXN;k++) dp[i][j][k]=0;
    for(int i=1;i<m;i++)
    {
        if(i!=m-1) for(int j=0;j<n;j++)
        {
            while(!st.empty() && a[st.top()][i]<a[j][i]) st.pop();
            if(!st.empty() && st.top()+1!=j)
            {
                if(dp[l^1][st.top()+1][j-1]) dp[l][st.top()+1][j-1]=dp[l^1][st.top()+1][j-1];
                else dp[l][st.top()+1][j-1]=i;
                lge[l][j]=st.top();
            }
            else lge[l][j]=-1;
            st.push(j);
        }
        while(!st.empty()) st.pop();
        if(i!=m-1) for(int j=n-1;j>=0;j--)
        {
            while(!st.empty() && a[st.top()][i]<a[j][i]) st.pop();
            if(!st.empty() && st.top()-1!=j && lge[l][st.top()]!=j)
            {
                if(dp[l^1][j+1][st.top()-1]) dp[l][j+1][st.top()-1]=dp[l^1][j+1][st.top()-1];
                else dp[l][j+1][st.top()-1]=i;
                rge[l][j]=st.top();
            }
            else rge[l][j]=-1;
            st.push(j);
        }
        while(!st.empty()) st.pop();
        if(i!=1)
        {
            for(int j=0;j<n;j++) if(lge[l^1][j]!=-1 && !dp[l][lge[l^1][j]+1][j-1]) {qx[cnt]=dp[l^1][lge[l^1][j]+1][j-1]; qy[cnt]=i-1; ql[cnt]=2*lge[l^1][j]+4; ind[j-1].push_back(cnt++);}
            for(int j=0;j<n;j++) if(rge[l^1][j]!=-1 && !dp[l][j+1][rge[l^1][j]-1] && lge[l^1][rge[l^1][j]]!=j) {qx[cnt]=dp[l^1][j+1][rge[l^1][j]-1]; qy[cnt]=i-1; ql[cnt]=2*j+4; ind[rge[l^1][j]-1].push_back(cnt++);}
            for(int j=0;j<n;j++) if(lge[l^1][j]!=-1) dp[l^1][lge[l^1][j]+1][j-1]=0;
            for(int j=0;j<n;j++) if(rge[l^1][j]!=-1) dp[l^1][j+1][rge[l^1][j]-1]=0;
        }
        l^=1;
    }
    for(int i=1;i<n-1;i++)
    {
        sort(ind[i].begin(),ind[i].end(),cmp);
        for(int j=0;j<ind[i].size();j++)
        {
            if(ql[ind[i][j]]&1) upd(qx[ind[i][j]],qy[ind[i][j]],1);
            else for(int k=qx[ind[i][j]];k<=qy[ind[i][j]];k++) sol+=fnd(k,qy[ind[i][j]]);
        }
        for(int j=0;j<ind[i].size();j++) if(ql[ind[i][j]]&1) upd(qx[ind[i][j]],qy[ind[i][j]],-1);
        ind[i].clear();
    }
	return sol;
}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:112:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |         for(int j=0;j<ind[i].size();j++)
      |                     ~^~~~~~~~~~~~~~
rect.cpp:117:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |         for(int j=0;j<ind[i].size();j++) if(ql[ind[i][j]]&1) upd(qx[ind[i][j]],qy[ind[i][j]],-1);
      |                     ~^~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 25088 KB Output is correct
2 Correct 18 ms 25344 KB Output is correct
3 Correct 18 ms 25344 KB Output is correct
4 Correct 19 ms 25344 KB Output is correct
5 Correct 18 ms 25088 KB Output is correct
6 Correct 18 ms 25344 KB Output is correct
7 Correct 18 ms 25216 KB Output is correct
8 Correct 18 ms 25344 KB Output is correct
9 Correct 18 ms 25344 KB Output is correct
10 Correct 18 ms 25344 KB Output is correct
11 Correct 18 ms 25344 KB Output is correct
12 Correct 19 ms 25344 KB Output is correct
13 Correct 18 ms 24960 KB Output is correct
14 Correct 20 ms 24960 KB Output is correct
15 Correct 18 ms 24960 KB Output is correct
16 Correct 19 ms 25088 KB Output is correct
17 Correct 21 ms 25984 KB Output is correct
18 Correct 20 ms 25984 KB Output is correct
19 Correct 21 ms 25976 KB Output is correct
20 Correct 20 ms 25856 KB Output is correct
21 Correct 20 ms 25984 KB Output is correct
22 Correct 20 ms 25984 KB Output is correct
23 Correct 20 ms 25984 KB Output is correct
24 Correct 19 ms 25472 KB Output is correct
25 Correct 18 ms 24960 KB Output is correct
26 Correct 18 ms 24960 KB Output is correct
27 Correct 18 ms 25344 KB Output is correct
28 Correct 18 ms 24960 KB Output is correct
29 Correct 18 ms 24960 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 25088 KB Output is correct
2 Correct 18 ms 25344 KB Output is correct
3 Correct 18 ms 25344 KB Output is correct
4 Correct 19 ms 25344 KB Output is correct
5 Correct 18 ms 25088 KB Output is correct
6 Correct 18 ms 25344 KB Output is correct
7 Correct 18 ms 25216 KB Output is correct
8 Correct 18 ms 25344 KB Output is correct
9 Correct 18 ms 25344 KB Output is correct
10 Correct 18 ms 25344 KB Output is correct
11 Correct 18 ms 25344 KB Output is correct
12 Correct 19 ms 25344 KB Output is correct
13 Correct 18 ms 24960 KB Output is correct
14 Correct 20 ms 24960 KB Output is correct
15 Correct 18 ms 24960 KB Output is correct
16 Correct 19 ms 25088 KB Output is correct
17 Correct 21 ms 25984 KB Output is correct
18 Correct 20 ms 25984 KB Output is correct
19 Correct 21 ms 25976 KB Output is correct
20 Correct 20 ms 25856 KB Output is correct
21 Correct 20 ms 25984 KB Output is correct
22 Correct 20 ms 25984 KB Output is correct
23 Correct 20 ms 25984 KB Output is correct
24 Correct 19 ms 25472 KB Output is correct
25 Correct 25 ms 27904 KB Output is correct
26 Correct 25 ms 27896 KB Output is correct
27 Correct 26 ms 28064 KB Output is correct
28 Correct 29 ms 27768 KB Output is correct
29 Correct 31 ms 28288 KB Output is correct
30 Correct 31 ms 28416 KB Output is correct
31 Correct 30 ms 28288 KB Output is correct
32 Correct 31 ms 28416 KB Output is correct
33 Correct 18 ms 24960 KB Output is correct
34 Correct 18 ms 24960 KB Output is correct
35 Correct 18 ms 25344 KB Output is correct
36 Correct 18 ms 24960 KB Output is correct
37 Correct 18 ms 24960 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 25088 KB Output is correct
2 Correct 18 ms 25344 KB Output is correct
3 Correct 18 ms 25344 KB Output is correct
4 Correct 19 ms 25344 KB Output is correct
5 Correct 18 ms 25088 KB Output is correct
6 Correct 18 ms 25344 KB Output is correct
7 Correct 18 ms 25216 KB Output is correct
8 Correct 18 ms 25344 KB Output is correct
9 Correct 18 ms 25344 KB Output is correct
10 Correct 18 ms 25344 KB Output is correct
11 Correct 18 ms 25344 KB Output is correct
12 Correct 19 ms 25344 KB Output is correct
13 Correct 18 ms 24960 KB Output is correct
14 Correct 20 ms 24960 KB Output is correct
15 Correct 18 ms 24960 KB Output is correct
16 Correct 19 ms 25088 KB Output is correct
17 Correct 21 ms 25984 KB Output is correct
18 Correct 20 ms 25984 KB Output is correct
19 Correct 21 ms 25976 KB Output is correct
20 Correct 20 ms 25856 KB Output is correct
21 Correct 20 ms 25984 KB Output is correct
22 Correct 20 ms 25984 KB Output is correct
23 Correct 20 ms 25984 KB Output is correct
24 Correct 19 ms 25472 KB Output is correct
25 Correct 25 ms 27904 KB Output is correct
26 Correct 25 ms 27896 KB Output is correct
27 Correct 26 ms 28064 KB Output is correct
28 Correct 29 ms 27768 KB Output is correct
29 Correct 31 ms 28288 KB Output is correct
30 Correct 31 ms 28416 KB Output is correct
31 Correct 30 ms 28288 KB Output is correct
32 Correct 31 ms 28416 KB Output is correct
33 Correct 102 ms 44664 KB Output is correct
34 Correct 98 ms 44688 KB Output is correct
35 Correct 105 ms 44536 KB Output is correct
36 Correct 104 ms 44800 KB Output is correct
37 Correct 136 ms 44280 KB Output is correct
38 Correct 140 ms 44280 KB Output is correct
39 Correct 136 ms 44664 KB Output is correct
40 Correct 129 ms 43896 KB Output is correct
41 Correct 94 ms 39544 KB Output is correct
42 Correct 114 ms 41080 KB Output is correct
43 Correct 196 ms 48504 KB Output is correct
44 Correct 207 ms 50552 KB Output is correct
45 Correct 102 ms 37752 KB Output is correct
46 Correct 110 ms 41340 KB Output is correct
47 Correct 182 ms 47896 KB Output is correct
48 Correct 184 ms 49016 KB Output is correct
49 Correct 18 ms 24960 KB Output is correct
50 Correct 18 ms 24960 KB Output is correct
51 Correct 18 ms 25344 KB Output is correct
52 Correct 18 ms 24960 KB Output is correct
53 Correct 18 ms 24960 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 35328 KB Output is correct
2 Correct 24 ms 35200 KB Output is correct
3 Correct 18 ms 25088 KB Output is correct
4 Correct 20 ms 25088 KB Output is correct
5 Correct 24 ms 34168 KB Output is correct
6 Correct 24 ms 34432 KB Output is correct
7 Correct 24 ms 34172 KB Output is correct
8 Correct 23 ms 33656 KB Output is correct
9 Correct 24 ms 33532 KB Output is correct
10 Correct 18 ms 25088 KB Output is correct
11 Correct 19 ms 25088 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 25088 KB Output is correct
2 Correct 582 ms 84088 KB Output is correct
3 Correct 1307 ms 135820 KB Output is correct
4 Correct 1290 ms 135672 KB Output is correct
5 Correct 1287 ms 136184 KB Output is correct
6 Correct 265 ms 54520 KB Output is correct
7 Correct 547 ms 76408 KB Output is correct
8 Correct 594 ms 79352 KB Output is correct
9 Correct 18 ms 24960 KB Output is correct
10 Correct 18 ms 24960 KB Output is correct
11 Correct 18 ms 25344 KB Output is correct
12 Correct 18 ms 24960 KB Output is correct
13 Correct 18 ms 24960 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 25088 KB Output is correct
2 Correct 18 ms 25344 KB Output is correct
3 Correct 18 ms 25344 KB Output is correct
4 Correct 19 ms 25344 KB Output is correct
5 Correct 18 ms 25088 KB Output is correct
6 Correct 18 ms 25344 KB Output is correct
7 Correct 18 ms 25216 KB Output is correct
8 Correct 18 ms 25344 KB Output is correct
9 Correct 18 ms 25344 KB Output is correct
10 Correct 18 ms 25344 KB Output is correct
11 Correct 18 ms 25344 KB Output is correct
12 Correct 19 ms 25344 KB Output is correct
13 Correct 18 ms 24960 KB Output is correct
14 Correct 20 ms 24960 KB Output is correct
15 Correct 18 ms 24960 KB Output is correct
16 Correct 19 ms 25088 KB Output is correct
17 Correct 21 ms 25984 KB Output is correct
18 Correct 20 ms 25984 KB Output is correct
19 Correct 21 ms 25976 KB Output is correct
20 Correct 20 ms 25856 KB Output is correct
21 Correct 20 ms 25984 KB Output is correct
22 Correct 20 ms 25984 KB Output is correct
23 Correct 20 ms 25984 KB Output is correct
24 Correct 19 ms 25472 KB Output is correct
25 Correct 25 ms 27904 KB Output is correct
26 Correct 25 ms 27896 KB Output is correct
27 Correct 26 ms 28064 KB Output is correct
28 Correct 29 ms 27768 KB Output is correct
29 Correct 31 ms 28288 KB Output is correct
30 Correct 31 ms 28416 KB Output is correct
31 Correct 30 ms 28288 KB Output is correct
32 Correct 31 ms 28416 KB Output is correct
33 Correct 102 ms 44664 KB Output is correct
34 Correct 98 ms 44688 KB Output is correct
35 Correct 105 ms 44536 KB Output is correct
36 Correct 104 ms 44800 KB Output is correct
37 Correct 136 ms 44280 KB Output is correct
38 Correct 140 ms 44280 KB Output is correct
39 Correct 136 ms 44664 KB Output is correct
40 Correct 129 ms 43896 KB Output is correct
41 Correct 94 ms 39544 KB Output is correct
42 Correct 114 ms 41080 KB Output is correct
43 Correct 196 ms 48504 KB Output is correct
44 Correct 207 ms 50552 KB Output is correct
45 Correct 102 ms 37752 KB Output is correct
46 Correct 110 ms 41340 KB Output is correct
47 Correct 182 ms 47896 KB Output is correct
48 Correct 184 ms 49016 KB Output is correct
49 Correct 24 ms 35328 KB Output is correct
50 Correct 24 ms 35200 KB Output is correct
51 Correct 18 ms 25088 KB Output is correct
52 Correct 20 ms 25088 KB Output is correct
53 Correct 24 ms 34168 KB Output is correct
54 Correct 24 ms 34432 KB Output is correct
55 Correct 24 ms 34172 KB Output is correct
56 Correct 23 ms 33656 KB Output is correct
57 Correct 24 ms 33532 KB Output is correct
58 Correct 18 ms 25088 KB Output is correct
59 Correct 19 ms 25088 KB Output is correct
60 Correct 18 ms 25088 KB Output is correct
61 Correct 582 ms 84088 KB Output is correct
62 Correct 1307 ms 135820 KB Output is correct
63 Correct 1290 ms 135672 KB Output is correct
64 Correct 1287 ms 136184 KB Output is correct
65 Correct 265 ms 54520 KB Output is correct
66 Correct 547 ms 76408 KB Output is correct
67 Correct 594 ms 79352 KB Output is correct
68 Correct 1333 ms 167420 KB Output is correct
69 Correct 1190 ms 167288 KB Output is correct
70 Correct 1460 ms 170668 KB Output is correct
71 Correct 1506 ms 170208 KB Output is correct
72 Correct 1696 ms 158328 KB Output is correct
73 Correct 1746 ms 168852 KB Output is correct
74 Correct 1760 ms 154516 KB Output is correct
75 Correct 2942 ms 236156 KB Output is correct
76 Correct 1806 ms 185592 KB Output is correct
77 Correct 2302 ms 214520 KB Output is correct
78 Correct 3060 ms 272296 KB Output is correct
79 Correct 1584 ms 156024 KB Output is correct
80 Correct 2761 ms 234804 KB Output is correct
81 Correct 2646 ms 239940 KB Output is correct
82 Correct 1044 ms 134648 KB Output is correct
83 Correct 1660 ms 194676 KB Output is correct
84 Correct 1621 ms 193500 KB Output is correct
85 Correct 1633 ms 174964 KB Output is correct
86 Correct 18 ms 24960 KB Output is correct
87 Correct 18 ms 24960 KB Output is correct
88 Correct 18 ms 25344 KB Output is correct
89 Correct 18 ms 24960 KB Output is correct
90 Correct 18 ms 24960 KB Output is correct