oj.uz

Submission #817630

# Submission time Handle Problem Language Result Execution time Memory
817630 2023-08-09T14:16:01 Z DJeniUp Rectangles (IOI19_rect) C++17
100 / 100
 1331 ms 140308 KB 
#include "bits/stdc++.h"
#include "rect.h"

#pragma GCC optimize("O3")

using namespace std;

typedef  int ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pairll;
typedef pair<ll,ull>pairull;
typedef pair<ll,pairll>pair3l;
typedef long double ld;
typedef pair<ld,ld>pairld;

typedef pair<string,ll>pairsl;

#define fr first
#define sc second
#define pb push_back
#define endl '\n'
#define N 100007
#define MOD 1000000007
#define INF 10000000000007
#define eps 0.00000000001
#define A 50
#define PI 3.14159265359

ll n,m,d[2500][2500],t[2500][2500],l[2500][2500],p[2501];

stack<ll>s;

vector<ll>k1;

//vector<ll>h;

vector<ll>v[12][2500];

bitset<2500>o[2500];

void S(vector<ll>&a1,vector<ll>&b1,ll z,vector<ll>&res){
    res.clear();
    ll x=0;
    ll y=0;
    while(x<a1.size() && y<b1.size() && a1[x]<=z && b1[y]<=z){
        //cout<<x<<" "<<y<<" "<<a1[x]<<" "<<b1[y]<<endl;
        if(a1[x]==b1[y]){
            res.pb(a1[x]);
            x++;
            y++;
        }else if(a1[x]<b1[y])x++;
        else y++;
    }
    return ;
}

long long count_rectangles(std::vector<std::vector<int> > a){
    n=a.size();
    m=a[0].size();
    //cout<<n<<" "<<m<<endl;
    for(int i=2;i<=m;i++){
        if((1<<(p[i-1]+1))==i){
            p[i]=p[i-1]+1;
        }else p[i]=p[i-1];
    }
    for(int i=1;i<n-1;i++){
        while(s.size()>0)s.pop();
        s.push(m-1);
        for(int j=m-2;j>0;j--){
            while(s.size()>0 && a[i][s.top()]<=a[i][j])s.pop();
            if(s.size()>0){
                d[i][j]=s.top();
            }
            s.push(j);
        }
    }
    //cout<<1<<endl;
    for(int j=1;j<m-1;j++){
        while(s.size()>0)s.pop();
        s.push(n-1);
        for(int i=n-2;i>0;i--){
            while(s.size()>0 && a[s.top()][j]<=a[i][j])s.pop();
            if(s.size()>0){
                t[i][j]=s.top();
            }
            s.push(i);
        }
    }
    //cout<<2<<endl;

    //cout<<3<<endl;
    ll res=0;
    for(int i=n-2;i>0;i--){
        for(int j=1;j<m-1;j++){
            v[0][j].clear();
            //cout<<i<<" "<<j<<endl;
            ll x=a[i][j];
            ll y=t[i][j];
            while(y!=0 && x<a[i-1][j]){
                v[0][j].pb(y-1);
                //cout<<i<<" "<<j<<" "<<y-1<<endl;
                x=a[y][j];
                y=t[y][j];
            }
        }
        for(int k=1;k<=11;k++){
            for(int j=1;j<m-1;j++){
                if(j+(1<<(k-1))<=m){
                    S(v[k-1][j],v[k-1][j+(1<<(k-1))],n,v[k][j]);
                }
            }
        }
        for(int j=1;j<m-1;j++){
            ll x=a[i][j];
            ll y=d[i][j];
            while(y!=0 && x<a[i][j-1]){
                if(o[j][y-1]==0){
                    l[j][y-1]=i;
                }
                x=a[i][y];
                y=d[i][y];
            }
        //cout<<1<<endl;
            o[j]=0;
            x=a[i][j];
            y=d[i][j];
            while(y!=0 && x<a[i][j-1]){
                o[j][y-1]=1;
                ll ln=y-j;
                //cout<<y<<" "<<2<<" "<<p[ln]<<endl;
                //cout<<y<<" "<<2<<" "<<p[ln]<<endl;

                //cout<<l1<<endl;
                S(v[p[ln]][j],v[p[ln]][y-(1<<p[ln])],l[j][y-1],k1);
                res+=k1.size();
                x=a[i][y];
                y=d[i][y];
            }
        }
    }
    return res;
}

Compilation message

rect.cpp: In function 'void S(std::vector<int>&, std::vector<int>&, ll, std::vector<int>&)':
rect.cpp:45:12: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     while(x<a1.size() && y<b1.size() && a1[x]<=z && b1[y]<=z){
      |           ~^~~~~~~~~~
rect.cpp:45:27: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     while(x<a1.size() && y<b1.size() && a1[x]<=z && b1[y]<=z){
      |                          ~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1364 KB Output is correct
4 Correct 1 ms 1364 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 1388 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 1 ms 1284 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 1 ms 1364 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 1012 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 1016 KB Output is correct
19 Correct 1 ms 1364 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 980 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1364 KB Output is correct
4 Correct 1 ms 1364 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 1388 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 1 ms 1284 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 1 ms 1364 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 1012 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 1016 KB Output is correct
19 Correct 1 ms 1364 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 2 ms 2132 KB Output is correct
23 Correct 2 ms 2132 KB Output is correct
24 Correct 2 ms 2048 KB Output is correct
25 Correct 2 ms 2004 KB Output is correct
26 Correct 2 ms 2004 KB Output is correct
27 Correct 3 ms 2132 KB Output is correct
28 Correct 2 ms 2004 KB Output is correct
29 Correct 2 ms 1876 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1364 KB Output is correct
4 Correct 1 ms 1364 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 1388 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 1 ms 1284 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 1 ms 1364 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 1012 KB Output is correct
17 Correct 2 ms 2132 KB Output is correct
18 Correct 2 ms 2132 KB Output is correct
19 Correct 2 ms 2048 KB Output is correct
20 Correct 2 ms 2004 KB Output is correct
21 Correct 2 ms 2004 KB Output is correct
22 Correct 3 ms 2132 KB Output is correct
23 Correct 2 ms 2004 KB Output is correct
24 Correct 2 ms 1876 KB Output is correct
25 Correct 1 ms 980 KB Output is correct
26 Correct 1 ms 1016 KB Output is correct
27 Correct 1 ms 1364 KB Output is correct
28 Correct 1 ms 1108 KB Output is correct
29 Correct 1 ms 980 KB Output is correct
30 Correct 8 ms 4360 KB Output is correct
31 Correct 7 ms 4308 KB Output is correct
32 Correct 7 ms 4436 KB Output is correct
33 Correct 7 ms 4180 KB Output is correct
34 Correct 8 ms 4316 KB Output is correct
35 Correct 9 ms 4472 KB Output is correct
36 Correct 9 ms 4324 KB Output is correct
37 Correct 9 ms 4500 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1364 KB Output is correct
4 Correct 1 ms 1364 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 1388 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 1 ms 1284 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 1 ms 1364 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 1012 KB Output is correct
17 Correct 2 ms 2132 KB Output is correct
18 Correct 2 ms 2132 KB Output is correct
19 Correct 2 ms 2048 KB Output is correct
20 Correct 2 ms 2004 KB Output is correct
21 Correct 2 ms 2004 KB Output is correct
22 Correct 3 ms 2132 KB Output is correct
23 Correct 2 ms 2004 KB Output is correct
24 Correct 2 ms 1876 KB Output is correct
25 Correct 8 ms 4360 KB Output is correct
26 Correct 7 ms 4308 KB Output is correct
27 Correct 7 ms 4436 KB Output is correct
28 Correct 7 ms 4180 KB Output is correct
29 Correct 8 ms 4316 KB Output is correct
30 Correct 9 ms 4472 KB Output is correct
31 Correct 9 ms 4324 KB Output is correct
32 Correct 9 ms 4500 KB Output is correct
33 Correct 1 ms 980 KB Output is correct
34 Correct 1 ms 1016 KB Output is correct
35 Correct 1 ms 1364 KB Output is correct
36 Correct 1 ms 1108 KB Output is correct
37 Correct 1 ms 980 KB Output is correct
38 Correct 78 ms 19404 KB Output is correct
39 Correct 70 ms 18476 KB Output is correct
40 Correct 68 ms 19880 KB Output is correct
41 Correct 80 ms 19036 KB Output is correct
42 Correct 88 ms 18652 KB Output is correct
43 Correct 72 ms 18544 KB Output is correct
44 Correct 77 ms 18672 KB Output is correct
45 Correct 80 ms 17784 KB Output is correct
46 Correct 65 ms 18300 KB Output is correct
47 Correct 72 ms 18296 KB Output is correct
48 Correct 92 ms 19228 KB Output is correct
49 Correct 102 ms 19256 KB Output is correct
50 Correct 50 ms 13344 KB Output is correct
51 Correct 51 ms 12528 KB Output is correct
52 Correct 94 ms 18828 KB Output is correct
53 Correct 108 ms 18904 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12756 KB Output is correct
2 Correct 6 ms 10964 KB Output is correct
3 Correct 2 ms 1876 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 4 ms 7124 KB Output is correct
6 Correct 3 ms 7132 KB Output is correct
7 Correct 4 ms 6996 KB Output is correct
8 Correct 3 ms 6664 KB Output is correct
9 Correct 4 ms 6484 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1016 KB Output is correct
3 Correct 1 ms 1364 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 390 ms 58944 KB Output is correct
8 Correct 898 ms 111568 KB Output is correct
9 Correct 880 ms 112664 KB Output is correct
10 Correct 921 ms 112428 KB Output is correct
11 Correct 346 ms 32612 KB Output is correct
12 Correct 607 ms 55076 KB Output is correct
13 Correct 647 ms 55952 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1364 KB Output is correct
4 Correct 1 ms 1364 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 1388 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 1 ms 1284 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 1 ms 1364 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 1012 KB Output is correct
17 Correct 2 ms 2132 KB Output is correct
18 Correct 2 ms 2132 KB Output is correct
19 Correct 2 ms 2048 KB Output is correct
20 Correct 2 ms 2004 KB Output is correct
21 Correct 2 ms 2004 KB Output is correct
22 Correct 3 ms 2132 KB Output is correct
23 Correct 2 ms 2004 KB Output is correct
24 Correct 2 ms 1876 KB Output is correct
25 Correct 8 ms 4360 KB Output is correct
26 Correct 7 ms 4308 KB Output is correct
27 Correct 7 ms 4436 KB Output is correct
28 Correct 7 ms 4180 KB Output is correct
29 Correct 8 ms 4316 KB Output is correct
30 Correct 9 ms 4472 KB Output is correct
31 Correct 9 ms 4324 KB Output is correct
32 Correct 9 ms 4500 KB Output is correct
33 Correct 78 ms 19404 KB Output is correct
34 Correct 70 ms 18476 KB Output is correct
35 Correct 68 ms 19880 KB Output is correct
36 Correct 80 ms 19036 KB Output is correct
37 Correct 88 ms 18652 KB Output is correct
38 Correct 72 ms 18544 KB Output is correct
39 Correct 77 ms 18672 KB Output is correct
40 Correct 80 ms 17784 KB Output is correct
41 Correct 65 ms 18300 KB Output is correct
42 Correct 72 ms 18296 KB Output is correct
43 Correct 92 ms 19228 KB Output is correct
44 Correct 102 ms 19256 KB Output is correct
45 Correct 50 ms 13344 KB Output is correct
46 Correct 51 ms 12528 KB Output is correct
47 Correct 94 ms 18828 KB Output is correct
48 Correct 108 ms 18904 KB Output is correct
49 Correct 6 ms 12756 KB Output is correct
50 Correct 6 ms 10964 KB Output is correct
51 Correct 2 ms 1876 KB Output is correct
52 Correct 1 ms 980 KB Output is correct
53 Correct 4 ms 7124 KB Output is correct
54 Correct 3 ms 7132 KB Output is correct
55 Correct 4 ms 6996 KB Output is correct
56 Correct 3 ms 6664 KB Output is correct
57 Correct 4 ms 6484 KB Output is correct
58 Correct 1 ms 980 KB Output is correct
59 Correct 1 ms 1108 KB Output is correct
60 Correct 1 ms 1108 KB Output is correct
61 Correct 390 ms 58944 KB Output is correct
62 Correct 898 ms 111568 KB Output is correct
63 Correct 880 ms 112664 KB Output is correct
64 Correct 921 ms 112428 KB Output is correct
65 Correct 346 ms 32612 KB Output is correct
66 Correct 607 ms 55076 KB Output is correct
67 Correct 647 ms 55952 KB Output is correct
68 Correct 1 ms 980 KB Output is correct
69 Correct 1 ms 1016 KB Output is correct
70 Correct 1 ms 1364 KB Output is correct
71 Correct 1 ms 1108 KB Output is correct
72 Correct 1 ms 980 KB Output is correct
73 Correct 999 ms 120648 KB Output is correct
74 Correct 914 ms 116452 KB Output is correct
75 Correct 972 ms 133040 KB Output is correct
76 Correct 973 ms 128988 KB Output is correct
77 Correct 1143 ms 111316 KB Output is correct
78 Correct 737 ms 81320 KB Output is correct
79 Correct 821 ms 92356 KB Output is correct
80 Correct 1224 ms 139720 KB Output is correct
81 Correct 793 ms 107512 KB Output is correct
82 Correct 1117 ms 120692 KB Output is correct
83 Correct 1331 ms 140308 KB Output is correct
84 Correct 762 ms 94320 KB Output is correct
85 Correct 1293 ms 134484 KB Output is correct
86 Correct 1256 ms 130748 KB Output is correct
87 Correct 618 ms 115096 KB Output is correct
88 Correct 1130 ms 132008 KB Output is correct
89 Correct 1121 ms 132084 KB Output is correct
90 Correct 1119 ms 132120 KB Output is correct