oj.uz

Submission #561376

# Submission time Handle Problem Language Result Execution time Memory
561376 2022-05-12T17:29:32 Z fcmalkcin Rectangles (IOI19_rect) C++17
100 / 100
 4539 ms 832952 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll  int
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb push_back
//#define endl "\n"
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn=2e3+5e2+10;
//const ll maxn=50;
const ll mod=1e9+7  ;
const ll base=1e18;


/// i believe myself
/// goal 2/7
#include "rect.h"

bool dd[maxn][maxn];

vector<pair<ll,pll>> adj[maxn];
vector<pair<ll,pll>> adjq[maxn];
vector<ll> fwt[maxn][maxn];
vector<ll> vtfwt[maxn][maxn];
ll get(ll x,ll y,ll p)
{
    p=lower_bound(vtfwt[x][y].begin(),vtfwt[x][y].end(),p)-vtfwt[x][y].begin()+1;
    if (p>vtfwt[x][y].size()) return 0;
    ll ans=0;
    for (int i=p;i; i -= i&(-i))
        ans+=fwt[x][y][i];
    return ans;
}
void update1(ll x,ll y,ll p,ll diff)
{
    p=lower_bound(vtfwt[x][y].begin(),vtfwt[x][y].end(),p)-vtfwt[x][y].begin()+1;
    ll len=vtfwt[x][y].size();
    for (int i=p+1; i<=len; i+= i&(-i))
        fwt[x][y][i]-=diff;
    for (int i=1; i<=len; i+= i&(-i))
        fwt[x][y][i]+=diff;
}
void update(ll p,ll l,ll r,ll diff)
{
    for (int t=l; t<=r; t++)
    {
        update1(p,t,r,diff);
    }
}
long long count_rectangles(vector<vector<ll>> a)
{
    ll n=a.size();
    ll m=a[0].size();
    if (min(n,m)<=2)
        return 0;
    vector<pair<pll,ll>> vt;
    for (int i=1; i+1<n; i++)
    {
        stack<ll> st;
        vector<pll> vt1;
        for (int j=0; j<m; j++)
        {
            while (st.size()&&a[i][st.top()]<a[i][j])
                st.pop();
            if (st.size())
            {
                ll h=st.top();
                if (!dd[h][j]&&h+1<j)
                {
                    dd[h][j]=1;
                    vt.pb(make_pair(make_pair(h,j),i));
                    vt1.pb(make_pair(h,j));
                }
            }
            st.push(j);
        }
        while (st.size())
            st.pop();
        for (int j=m-1; j>=0; j--)
        {
            while (st.size()&&a[i][st.top()]<a[i][j])
                st.pop();
            if (st.size())
            {
                ll h=st.top();
                if (!dd[j][h]&&j+1<h)
                {
                    dd[j][h]=1;
                    vt.pb(make_pair(make_pair(j,h),i));
                    vt1.pb(make_pair(j,h));
                }
            }
            st.push(j);
        }
        for (auto p:vt1)
            dd[p.ff][p.ss]=false;
    }
    sort(vt.begin(),vt.end());
    for (int i=0; i<vt.size(); i++)
    {
        ll j=i+1;
        while (j<vt.size()&&vt[j].ff==vt[j-1].ff&&vt[j].ss-1==vt[j-1].ss)
            j++;
        j--;
        auto p=vt[j].ff;
        p.ff++;
        p.ss--;
        ll l=vt[i].ss-1;
        ll r=vt[j].ss+1;
        adj[l].pb(make_pair(r,p));
        for (int t=l;t<=r;t++)
        {
         //   vtfwt[t][p.ff].pb(p.ss);
        }
        i=j;
    }
    vt.clear();
    for (int j=0; j<m; j++)
    {
        stack<ll> st;
        vector<pll> vt1;
        for (int i=0; i<n; i++)
        {
            while (st.size()&&a[st.top()][j]<a[i][j])
                st.pop();
            if (st.size())
            {
                ll h=st.top();
                if (!dd[h][i]&&h+1<i)
                {
                    dd[h][i]=1;
                    vt.pb(make_pair(make_pair(h,i),j));
                    vt1.pb(make_pair(h,i));
                }
            }
            st.push(i);
        }
        while (st.size())
            st.pop();
        for (int i=n-1; i>=0; i--)
        {
            while (st.size()&&a[st.top()][j]<a[i][j])
                st.pop();
            if (st.size())
            {
                ll h=st.top();
                if (!dd[i][h]&&i+1<h)
                {
                    dd[i][h]=1;
                    vt.pb(make_pair(make_pair(i,h),j));
                    vt1.pb(make_pair(i,h));
                }
            }
            st.push(i);
        }
        for (auto p:vt1)
            dd[p.ff][p.ss]=false;
    }
    sort(vt.begin(),vt.end());
    for (int i=0; i<vt.size(); i++)
    {
        ll j=i+1;
        while (j<vt.size()&&vt[j].ff==vt[j-1].ff&&vt[j].ss-1==vt[j-1].ss)
            j++;
        j--;
        ll l=vt[i].ss;
        ll r=vt[j].ss;
        auto p=vt[j].ff;
        for (int t=l; t<=r; t++)
        {
            ll idnw=p.ss;
            vtfwt[idnw][t].pb(r);
        }
        i=j;
    }
    for (int i=0; i<n; i++)
    {
        for (int j=0; j<m; j++)
        {
            if (vtfwt[i][j].size())
            {

            sort(vtfwt[i][j].begin(),vtfwt[i][j].end());
            vtfwt[i][j].resize(unique(vtfwt[i][j].begin(),vtfwt[i][j].end())-vtfwt[i][j].begin());
            ll len=vtfwt[i][j].size();
            fwt[i][j]=vector<ll> (len+2,0);
            }
        }
    }
    for (int i=0; i<vt.size(); i++)
    {
        ll j=i+1;
        while (j<vt.size()&&vt[j].ff==vt[j-1].ff&&vt[j].ss-1==vt[j-1].ss)
            j++;
        j--;
        ll l=vt[i].ss;
        ll r=vt[j].ss;
        auto p=vt[j].ff;
        update(p.ss,l,r,1);
        adjq[p.ff+1].pb(make_pair(p.ss,make_pair(l,r)));
        i=j;
    }
    long long ans=0;
    for (int i=0; i<n; i++)
    {
        for (auto p:adjq[i])
        {
            update(p.ff,p.ss.ff,p.ss.ss,-1);
        }
        for (auto to:adj[i])
        {
            ll r=to.ff;
            auto p=to.ss;
            for (int t=i;t<=r;t++)
            {
                ans+=get(t,p.ff,p.ss);
            }
        }
    }
    return ans;
}


/*int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    if (fopen("test.inp", "r"))
    {
        freopen("test.inp", "r", stdin);
        freopen("test.out", "w", stdout);
    }
    vector<vector<ll>> a;
    ll n, m;
    cin>> n>> m;
    for (int i=0;i<n;i++)
    {
        vector<ll> vt;
        for (int j=0;j<m;j++)
        {
            ll x;
            cin>> x;
            vt.pb(x);
        }
        a.pb(vt);
    }
    cout <<count_rectangles(a)<<endl;
}*/

/*
6 5
4 8 7 5 6
7 4 10 3 5
9 7 20 14 2
9 14 7 3 6
5 7 5 2 7
4 5 13 5 6
*/

Compilation message

rect.cpp:15:15: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   15 | const ll base=1e18;
      |               ^~~~
rect.cpp: In function 'int get(int, int, int)':
rect.cpp:31:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     if (p>vtfwt[x][y].size()) return 0;
      |         ~^~~~~~~~~~~~~~~~~~~
rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:102:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |     for (int i=0; i<vt.size(); i++)
      |                   ~^~~~~~~~~~
rect.cpp:105:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |         while (j<vt.size()&&vt[j].ff==vt[j-1].ff&&vt[j].ss-1==vt[j-1].ss)
      |                ~^~~~~~~~~~
rect.cpp:163:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  163 |     for (int i=0; i<vt.size(); i++)
      |                   ~^~~~~~~~~~
rect.cpp:166:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  166 |         while (j<vt.size()&&vt[j].ff==vt[j-1].ff&&vt[j].ss-1==vt[j-1].ss)
      |                ~^~~~~~~~~~
rect.cpp:193:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  193 |     for (int i=0; i<vt.size(); i++)
      |                   ~^~~~~~~~~~
rect.cpp:196:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  196 |         while (j<vt.size()&&vt[j].ff==vt[j-1].ff&&vt[j].ss-1==vt[j-1].ss)
      |                ~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 296268 KB Output is correct
2 Correct 148 ms 296396 KB Output is correct
3 Correct 155 ms 296384 KB Output is correct
4 Correct 162 ms 296340 KB Output is correct
5 Correct 147 ms 296252 KB Output is correct
6 Correct 150 ms 296348 KB Output is correct
7 Correct 148 ms 296368 KB Output is correct
8 Correct 162 ms 296500 KB Output is correct
9 Correct 148 ms 296396 KB Output is correct
10 Correct 147 ms 296348 KB Output is correct
11 Correct 151 ms 296440 KB Output is correct
12 Correct 153 ms 296336 KB Output is correct
13 Correct 162 ms 296196 KB Output is correct
14 Correct 150 ms 296300 KB Output is correct
15 Correct 148 ms 296220 KB Output is correct
16 Correct 146 ms 296236 KB Output is correct
17 Correct 157 ms 296204 KB Output is correct
18 Correct 149 ms 296288 KB Output is correct
19 Correct 155 ms 296392 KB Output is correct
20 Correct 161 ms 296268 KB Output is correct
21 Correct 160 ms 296220 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 296268 KB Output is correct
2 Correct 148 ms 296396 KB Output is correct
3 Correct 155 ms 296384 KB Output is correct
4 Correct 162 ms 296340 KB Output is correct
5 Correct 147 ms 296252 KB Output is correct
6 Correct 150 ms 296348 KB Output is correct
7 Correct 148 ms 296368 KB Output is correct
8 Correct 162 ms 296500 KB Output is correct
9 Correct 148 ms 296396 KB Output is correct
10 Correct 147 ms 296348 KB Output is correct
11 Correct 151 ms 296440 KB Output is correct
12 Correct 153 ms 296336 KB Output is correct
13 Correct 162 ms 296196 KB Output is correct
14 Correct 150 ms 296300 KB Output is correct
15 Correct 148 ms 296220 KB Output is correct
16 Correct 146 ms 296236 KB Output is correct
17 Correct 157 ms 296204 KB Output is correct
18 Correct 149 ms 296288 KB Output is correct
19 Correct 155 ms 296392 KB Output is correct
20 Correct 161 ms 296268 KB Output is correct
21 Correct 160 ms 296220 KB Output is correct
22 Correct 158 ms 296668 KB Output is correct
23 Correct 153 ms 296692 KB Output is correct
24 Correct 145 ms 296680 KB Output is correct
25 Correct 158 ms 296784 KB Output is correct
26 Correct 150 ms 296956 KB Output is correct
27 Correct 167 ms 296988 KB Output is correct
28 Correct 171 ms 296948 KB Output is correct
29 Correct 149 ms 296652 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 296268 KB Output is correct
2 Correct 148 ms 296396 KB Output is correct
3 Correct 155 ms 296384 KB Output is correct
4 Correct 162 ms 296340 KB Output is correct
5 Correct 147 ms 296252 KB Output is correct
6 Correct 150 ms 296348 KB Output is correct
7 Correct 148 ms 296368 KB Output is correct
8 Correct 162 ms 296500 KB Output is correct
9 Correct 148 ms 296396 KB Output is correct
10 Correct 147 ms 296348 KB Output is correct
11 Correct 151 ms 296440 KB Output is correct
12 Correct 153 ms 296336 KB Output is correct
13 Correct 162 ms 296196 KB Output is correct
14 Correct 150 ms 296300 KB Output is correct
15 Correct 148 ms 296220 KB Output is correct
16 Correct 146 ms 296236 KB Output is correct
17 Correct 158 ms 296668 KB Output is correct
18 Correct 153 ms 296692 KB Output is correct
19 Correct 145 ms 296680 KB Output is correct
20 Correct 158 ms 296784 KB Output is correct
21 Correct 150 ms 296956 KB Output is correct
22 Correct 167 ms 296988 KB Output is correct
23 Correct 171 ms 296948 KB Output is correct
24 Correct 149 ms 296652 KB Output is correct
25 Correct 157 ms 296204 KB Output is correct
26 Correct 149 ms 296288 KB Output is correct
27 Correct 155 ms 296392 KB Output is correct
28 Correct 161 ms 296268 KB Output is correct
29 Correct 160 ms 296220 KB Output is correct
30 Correct 176 ms 298184 KB Output is correct
31 Correct 165 ms 298204 KB Output is correct
32 Correct 166 ms 298352 KB Output is correct
33 Correct 170 ms 298720 KB Output is correct
34 Correct 172 ms 300072 KB Output is correct
35 Correct 207 ms 300256 KB Output is correct
36 Correct 188 ms 299824 KB Output is correct
37 Correct 177 ms 299740 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 296268 KB Output is correct
2 Correct 148 ms 296396 KB Output is correct
3 Correct 155 ms 296384 KB Output is correct
4 Correct 162 ms 296340 KB Output is correct
5 Correct 147 ms 296252 KB Output is correct
6 Correct 150 ms 296348 KB Output is correct
7 Correct 148 ms 296368 KB Output is correct
8 Correct 162 ms 296500 KB Output is correct
9 Correct 148 ms 296396 KB Output is correct
10 Correct 147 ms 296348 KB Output is correct
11 Correct 151 ms 296440 KB Output is correct
12 Correct 153 ms 296336 KB Output is correct
13 Correct 162 ms 296196 KB Output is correct
14 Correct 150 ms 296300 KB Output is correct
15 Correct 148 ms 296220 KB Output is correct
16 Correct 146 ms 296236 KB Output is correct
17 Correct 158 ms 296668 KB Output is correct
18 Correct 153 ms 296692 KB Output is correct
19 Correct 145 ms 296680 KB Output is correct
20 Correct 158 ms 296784 KB Output is correct
21 Correct 150 ms 296956 KB Output is correct
22 Correct 167 ms 296988 KB Output is correct
23 Correct 171 ms 296948 KB Output is correct
24 Correct 149 ms 296652 KB Output is correct
25 Correct 176 ms 298184 KB Output is correct
26 Correct 165 ms 298204 KB Output is correct
27 Correct 166 ms 298352 KB Output is correct
28 Correct 170 ms 298720 KB Output is correct
29 Correct 172 ms 300072 KB Output is correct
30 Correct 207 ms 300256 KB Output is correct
31 Correct 188 ms 299824 KB Output is correct
32 Correct 177 ms 299740 KB Output is correct
33 Correct 157 ms 296204 KB Output is correct
34 Correct 149 ms 296288 KB Output is correct
35 Correct 155 ms 296392 KB Output is correct
36 Correct 161 ms 296268 KB Output is correct
37 Correct 160 ms 296220 KB Output is correct
38 Correct 293 ms 315044 KB Output is correct
39 Correct 266 ms 314888 KB Output is correct
40 Correct 327 ms 329260 KB Output is correct
41 Correct 273 ms 329276 KB Output is correct
42 Correct 338 ms 311416 KB Output is correct
43 Correct 332 ms 311468 KB Output is correct
44 Correct 346 ms 311412 KB Output is correct
45 Correct 337 ms 310956 KB Output is correct
46 Correct 264 ms 316080 KB Output is correct
47 Correct 310 ms 319704 KB Output is correct
48 Correct 472 ms 339108 KB Output is correct
49 Correct 498 ms 339400 KB Output is correct
50 Correct 320 ms 319696 KB Output is correct
51 Correct 322 ms 318764 KB Output is correct
52 Correct 453 ms 330832 KB Output is correct
53 Correct 457 ms 331344 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 302664 KB Output is correct
2 Correct 143 ms 301640 KB Output is correct
3 Correct 141 ms 296316 KB Output is correct
4 Correct 141 ms 296312 KB Output is correct
5 Correct 160 ms 300728 KB Output is correct
6 Correct 162 ms 300844 KB Output is correct
7 Correct 157 ms 300876 KB Output is correct
8 Correct 147 ms 300520 KB Output is correct
9 Correct 166 ms 300388 KB Output is correct
10 Correct 153 ms 296256 KB Output is correct
11 Correct 142 ms 296268 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 296204 KB Output is correct
2 Correct 149 ms 296288 KB Output is correct
3 Correct 155 ms 296392 KB Output is correct
4 Correct 161 ms 296268 KB Output is correct
5 Correct 160 ms 296220 KB Output is correct
6 Correct 149 ms 296260 KB Output is correct
7 Correct 869 ms 403164 KB Output is correct
8 Correct 1793 ms 522784 KB Output is correct
9 Correct 1743 ms 523396 KB Output is correct
10 Correct 1735 ms 524328 KB Output is correct
11 Correct 297 ms 321436 KB Output is correct
12 Correct 466 ms 343176 KB Output is correct
13 Correct 488 ms 346340 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 296268 KB Output is correct
2 Correct 148 ms 296396 KB Output is correct
3 Correct 155 ms 296384 KB Output is correct
4 Correct 162 ms 296340 KB Output is correct
5 Correct 147 ms 296252 KB Output is correct
6 Correct 150 ms 296348 KB Output is correct
7 Correct 148 ms 296368 KB Output is correct
8 Correct 162 ms 296500 KB Output is correct
9 Correct 148 ms 296396 KB Output is correct
10 Correct 147 ms 296348 KB Output is correct
11 Correct 151 ms 296440 KB Output is correct
12 Correct 153 ms 296336 KB Output is correct
13 Correct 162 ms 296196 KB Output is correct
14 Correct 150 ms 296300 KB Output is correct
15 Correct 148 ms 296220 KB Output is correct
16 Correct 146 ms 296236 KB Output is correct
17 Correct 158 ms 296668 KB Output is correct
18 Correct 153 ms 296692 KB Output is correct
19 Correct 145 ms 296680 KB Output is correct
20 Correct 158 ms 296784 KB Output is correct
21 Correct 150 ms 296956 KB Output is correct
22 Correct 167 ms 296988 KB Output is correct
23 Correct 171 ms 296948 KB Output is correct
24 Correct 149 ms 296652 KB Output is correct
25 Correct 176 ms 298184 KB Output is correct
26 Correct 165 ms 298204 KB Output is correct
27 Correct 166 ms 298352 KB Output is correct
28 Correct 170 ms 298720 KB Output is correct
29 Correct 172 ms 300072 KB Output is correct
30 Correct 207 ms 300256 KB Output is correct
31 Correct 188 ms 299824 KB Output is correct
32 Correct 177 ms 299740 KB Output is correct
33 Correct 293 ms 315044 KB Output is correct
34 Correct 266 ms 314888 KB Output is correct
35 Correct 327 ms 329260 KB Output is correct
36 Correct 273 ms 329276 KB Output is correct
37 Correct 338 ms 311416 KB Output is correct
38 Correct 332 ms 311468 KB Output is correct
39 Correct 346 ms 311412 KB Output is correct
40 Correct 337 ms 310956 KB Output is correct
41 Correct 264 ms 316080 KB Output is correct
42 Correct 310 ms 319704 KB Output is correct
43 Correct 472 ms 339108 KB Output is correct
44 Correct 498 ms 339400 KB Output is correct
45 Correct 320 ms 319696 KB Output is correct
46 Correct 322 ms 318764 KB Output is correct
47 Correct 453 ms 330832 KB Output is correct
48 Correct 457 ms 331344 KB Output is correct
49 Correct 158 ms 302664 KB Output is correct
50 Correct 143 ms 301640 KB Output is correct
51 Correct 141 ms 296316 KB Output is correct
52 Correct 141 ms 296312 KB Output is correct
53 Correct 160 ms 300728 KB Output is correct
54 Correct 162 ms 300844 KB Output is correct
55 Correct 157 ms 300876 KB Output is correct
56 Correct 147 ms 300520 KB Output is correct
57 Correct 166 ms 300388 KB Output is correct
58 Correct 153 ms 296256 KB Output is correct
59 Correct 142 ms 296268 KB Output is correct
60 Correct 149 ms 296260 KB Output is correct
61 Correct 869 ms 403164 KB Output is correct
62 Correct 1793 ms 522784 KB Output is correct
63 Correct 1743 ms 523396 KB Output is correct
64 Correct 1735 ms 524328 KB Output is correct
65 Correct 297 ms 321436 KB Output is correct
66 Correct 466 ms 343176 KB Output is correct
67 Correct 488 ms 346340 KB Output is correct
68 Correct 157 ms 296204 KB Output is correct
69 Correct 149 ms 296288 KB Output is correct
70 Correct 155 ms 296392 KB Output is correct
71 Correct 161 ms 296268 KB Output is correct
72 Correct 160 ms 296220 KB Output is correct
73 Correct 2037 ms 499800 KB Output is correct
74 Correct 1940 ms 492584 KB Output is correct
75 Correct 2660 ms 677168 KB Output is correct
76 Correct 2226 ms 670408 KB Output is correct
77 Correct 2720 ms 462404 KB Output is correct
78 Correct 2573 ms 580652 KB Output is correct
79 Correct 2791 ms 607544 KB Output is correct
80 Correct 4269 ms 766336 KB Output is correct
81 Correct 2657 ms 620180 KB Output is correct
82 Correct 3468 ms 715668 KB Output is correct
83 Correct 4539 ms 832952 KB Output is correct
84 Correct 2349 ms 571748 KB Output is correct
85 Correct 4014 ms 767964 KB Output is correct
86 Correct 3907 ms 753884 KB Output is correct
87 Correct 1585 ms 427324 KB Output is correct
88 Correct 2726 ms 510112 KB Output is correct
89 Correct 2680 ms 510276 KB Output is correct
90 Correct 2661 ms 510324 KB Output is correct