oj.uz

Submission #760375

# Submission time Handle Problem Language Result Execution time Memory
760375 2023-06-17T14:15:34 Z bgnbvnbv Rectangles (IOI19_rect) C++14
100 / 100
 1167 ms 351260 KB 
#include "rect.h"
#include<bits/stdc++.h>
#define TASKNAME "codeforce"
#define pb push_back
#define pli pair<ll,ll>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxN=2500+10;
const ll inf=1e18;
const ll mod=1e9+7;
vector<int>dq[maxN];
vector<ll>vec[maxN];
ll bit[maxN][maxN];
void update(ll t,ll i,ll v)
{
    while(i<=t)
    {
        bit[t][i]+=v;
        i+=i&(-i);
    }
}
ll get(ll t,ll i)
{
    ll aa=0;
    while(i>0)
    {
        aa+=bit[t][i];
        i-=i&(-i);
    }
    return aa;
}
struct qq
{
    ll x,y,en;
};
vector<qq>in[maxN];
ll count_rectangles(vector<vector<int>> a)
{
    ll n=a.size();
    ll m=a[0].size();
    for(int i=0;i<n;i++)
    {
        dq[i].pb(0);
    }
    for(int j=1;j<m;j++)
    {
        for(int i=0;i<n;i++)
        {
            while(dq[i].size()>0&&a[i][j]>a[i][dq[i].back()])
            {
                if(dq[i].back()<=j-2) vec[dq[i].back()+1].pb(i);
                dq[i].pop_back();
            }
            if(dq[i].size())
            {
                if(dq[i].back()<=j-2) vec[dq[i].back()+1].pb(i);
                if(a[i][j]==a[i][dq[i].back()]) dq[i].pop_back();
            }
            dq[i].pb(j);
        }
        for(int i=0;i<j;i++)
        {
            ll l;
            for(int k=0;k<vec[i].size();k++)
            {
                if(k==0)
                {
                    l=vec[i][k];
                }
                else if(vec[i][k]>vec[i][k-1]+1)
                {
                    in[l].pb({i,j-1,vec[i][k-1]});
                    l=vec[i][k];
                }
            }
            if(vec[i].size()>0) in[l].pb({i,j-1,vec[i].back()});
            vec[i].clear();
        }
    }


    for(int i=0;i<m;i++)
    {
        dq[i].clear();
        dq[i].pb(0);
    }
    vector<pair<ll,qq>>tap,cc;
    ll ans=0;
    for(int i=1;i<n;i++)
    {
        for(auto zz:in[i-1])
        {
            tap.pb({i-1,zz});
        }
        cc.clear();
        for(auto zz:tap)
        {
            if(zz.se.en>=i-1) cc.pb(zz);
        }
        swap(tap,cc);
        for(int j=0;j<m;j++)
        {
            while(dq[j].size()>0&&a[i][j]>a[dq[j].back()][j])
            {
                if(dq[j].back()+1<=i-1) vec[dq[j].back()+1].pb(j);
                dq[j].pop_back();
            }
            if(dq[j].size()>0)
            {
                if(dq[j].back()+1<=i-1) vec[dq[j].back()+1].pb(j);
                if(a[dq[j].back()][j]==a[i][j]) dq[j].pop_back();
            }
            dq[j].pb(i);
        }
        ll q=0;
        for(int j=0;j<i;j++)
        {
            ll l;
            while(q<tap.size()&&tap[q].fi<=j)
            {
                update(tap[q].se.y,tap[q].se.x,1);
                q++;
            }
            for(int k=0;k<vec[j].size();k++)
            {
                if(k==0)
                {
                    l=vec[j][k];
                }
                else if(vec[j][k]>vec[j][k-1]+1)
                {
                    l=vec[j][k];
                }
                ans+=get(vec[j][k],vec[j][k])-get(vec[j][k],l-1);
            }
            vec[j].clear();
        }
        q--;
        while(q>=0)
        {
            update(tap[q].se.y,tap[q].se.x,-1);
            q--;
        }
    }
    return ans;
}
/*void solve()
{
    cout << count_rectangles({{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}});
}
int main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}*/

Compilation message

rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:67:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |             for(int k=0;k<vec[i].size();k++)
      |                         ~^~~~~~~~~~~~~~
rect.cpp:122:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, qq> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |             while(q<tap.size()&&tap[q].fi<=j)
      |                   ~^~~~~~~~~~~
rect.cpp:127:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  127 |             for(int k=0;k<vec[j].size();k++)
      |                         ~^~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 488 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 488 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 612 KB Output is correct
20 Correct 1 ms 408 KB Output is correct
21 Correct 1 ms 488 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 488 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 488 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 612 KB Output is correct
20 Correct 1 ms 408 KB Output is correct
21 Correct 1 ms 488 KB Output is correct
22 Correct 2 ms 724 KB Output is correct
23 Correct 2 ms 692 KB Output is correct
24 Correct 1 ms 724 KB Output is correct
25 Correct 2 ms 884 KB Output is correct
26 Correct 2 ms 1008 KB Output is correct
27 Correct 2 ms 1012 KB Output is correct
28 Correct 2 ms 980 KB Output is correct
29 Correct 1 ms 780 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 488 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 488 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 2 ms 692 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 2 ms 884 KB Output is correct
21 Correct 2 ms 1008 KB Output is correct
22 Correct 2 ms 1012 KB Output is correct
23 Correct 2 ms 980 KB Output is correct
24 Correct 1 ms 780 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 612 KB Output is correct
28 Correct 1 ms 408 KB Output is correct
29 Correct 1 ms 488 KB Output is correct
30 Correct 4 ms 1656 KB Output is correct
31 Correct 5 ms 1656 KB Output is correct
32 Correct 5 ms 1776 KB Output is correct
33 Correct 5 ms 2420 KB Output is correct
34 Correct 7 ms 3484 KB Output is correct
35 Correct 7 ms 3540 KB Output is correct
36 Correct 6 ms 3060 KB Output is correct
37 Correct 7 ms 3084 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 488 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 488 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 2 ms 692 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 2 ms 884 KB Output is correct
21 Correct 2 ms 1008 KB Output is correct
22 Correct 2 ms 1012 KB Output is correct
23 Correct 2 ms 980 KB Output is correct
24 Correct 1 ms 780 KB Output is correct
25 Correct 4 ms 1656 KB Output is correct
26 Correct 5 ms 1656 KB Output is correct
27 Correct 5 ms 1776 KB Output is correct
28 Correct 5 ms 2420 KB Output is correct
29 Correct 7 ms 3484 KB Output is correct
30 Correct 7 ms 3540 KB Output is correct
31 Correct 6 ms 3060 KB Output is correct
32 Correct 7 ms 3084 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 612 KB Output is correct
36 Correct 1 ms 408 KB Output is correct
37 Correct 1 ms 488 KB Output is correct
38 Correct 41 ms 21424 KB Output is correct
39 Correct 54 ms 21016 KB Output is correct
40 Correct 40 ms 21316 KB Output is correct
41 Correct 41 ms 21220 KB Output is correct
42 Correct 40 ms 16248 KB Output is correct
43 Correct 37 ms 16232 KB Output is correct
44 Correct 47 ms 16536 KB Output is correct
45 Correct 41 ms 16088 KB Output is correct
46 Correct 29 ms 13648 KB Output is correct
47 Correct 33 ms 14156 KB Output is correct
48 Correct 72 ms 28440 KB Output is correct
49 Correct 79 ms 30120 KB Output is correct
50 Correct 47 ms 16184 KB Output is correct
51 Correct 41 ms 17588 KB Output is correct
52 Correct 63 ms 21412 KB Output is correct
53 Correct 65 ms 23292 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1228 KB Output is correct
2 Correct 8 ms 1236 KB Output is correct
3 Correct 4 ms 572 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 12 ms 9036 KB Output is correct
6 Correct 11 ms 8972 KB Output is correct
7 Correct 9 ms 9020 KB Output is correct
8 Correct 11 ms 8664 KB Output is correct
9 Correct 13 ms 8192 KB Output is correct
10 Correct 7 ms 632 KB Output is correct
11 Correct 9 ms 6176 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 612 KB Output is correct
4 Correct 1 ms 408 KB Output is correct
5 Correct 1 ms 488 KB Output is correct
6 Correct 1 ms 488 KB Output is correct
7 Correct 260 ms 69936 KB Output is correct
8 Correct 519 ms 139104 KB Output is correct
9 Correct 404 ms 139592 KB Output is correct
10 Correct 425 ms 139696 KB Output is correct
11 Correct 79 ms 30756 KB Output is correct
12 Correct 192 ms 58056 KB Output is correct
13 Correct 157 ms 61844 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 488 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 488 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 2 ms 692 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 2 ms 884 KB Output is correct
21 Correct 2 ms 1008 KB Output is correct
22 Correct 2 ms 1012 KB Output is correct
23 Correct 2 ms 980 KB Output is correct
24 Correct 1 ms 780 KB Output is correct
25 Correct 4 ms 1656 KB Output is correct
26 Correct 5 ms 1656 KB Output is correct
27 Correct 5 ms 1776 KB Output is correct
28 Correct 5 ms 2420 KB Output is correct
29 Correct 7 ms 3484 KB Output is correct
30 Correct 7 ms 3540 KB Output is correct
31 Correct 6 ms 3060 KB Output is correct
32 Correct 7 ms 3084 KB Output is correct
33 Correct 41 ms 21424 KB Output is correct
34 Correct 54 ms 21016 KB Output is correct
35 Correct 40 ms 21316 KB Output is correct
36 Correct 41 ms 21220 KB Output is correct
37 Correct 40 ms 16248 KB Output is correct
38 Correct 37 ms 16232 KB Output is correct
39 Correct 47 ms 16536 KB Output is correct
40 Correct 41 ms 16088 KB Output is correct
41 Correct 29 ms 13648 KB Output is correct
42 Correct 33 ms 14156 KB Output is correct
43 Correct 72 ms 28440 KB Output is correct
44 Correct 79 ms 30120 KB Output is correct
45 Correct 47 ms 16184 KB Output is correct
46 Correct 41 ms 17588 KB Output is correct
47 Correct 63 ms 21412 KB Output is correct
48 Correct 65 ms 23292 KB Output is correct
49 Correct 6 ms 1228 KB Output is correct
50 Correct 8 ms 1236 KB Output is correct
51 Correct 4 ms 572 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 12 ms 9036 KB Output is correct
54 Correct 11 ms 8972 KB Output is correct
55 Correct 9 ms 9020 KB Output is correct
56 Correct 11 ms 8664 KB Output is correct
57 Correct 13 ms 8192 KB Output is correct
58 Correct 7 ms 632 KB Output is correct
59 Correct 9 ms 6176 KB Output is correct
60 Correct 1 ms 488 KB Output is correct
61 Correct 260 ms 69936 KB Output is correct
62 Correct 519 ms 139104 KB Output is correct
63 Correct 404 ms 139592 KB Output is correct
64 Correct 425 ms 139696 KB Output is correct
65 Correct 79 ms 30756 KB Output is correct
66 Correct 192 ms 58056 KB Output is correct
67 Correct 157 ms 61844 KB Output is correct
68 Correct 1 ms 468 KB Output is correct
69 Correct 1 ms 468 KB Output is correct
70 Correct 1 ms 612 KB Output is correct
71 Correct 1 ms 408 KB Output is correct
72 Correct 1 ms 488 KB Output is correct
73 Correct 590 ms 229572 KB Output is correct
74 Correct 682 ms 237408 KB Output is correct
75 Correct 633 ms 229060 KB Output is correct
76 Correct 762 ms 237856 KB Output is correct
77 Correct 703 ms 204920 KB Output is correct
78 Correct 561 ms 186064 KB Output is correct
79 Correct 637 ms 193604 KB Output is correct
80 Correct 1018 ms 295348 KB Output is correct
81 Correct 643 ms 220488 KB Output is correct
82 Correct 827 ms 236612 KB Output is correct
83 Correct 1167 ms 351260 KB Output is correct
84 Correct 579 ms 149180 KB Output is correct
85 Correct 1008 ms 254608 KB Output is correct
86 Correct 956 ms 247968 KB Output is correct
87 Correct 383 ms 147176 KB Output is correct
88 Correct 751 ms 203716 KB Output is correct
89 Correct 733 ms 201504 KB Output is correct
90 Correct 720 ms 200628 KB Output is correct