oj.uz

Submission #199619

# Submission time Handle Problem Language Result Execution time Memory
199619 2020-02-02T09:45:28 Z medk Rectangles (IOI19_rect) C++14
59 / 100
 5000 ms 817380 KB 
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")

#include <bits/stdc++.h>
#include "rect.h"

#define ll long long
#define pb push_back
#define x first
#define y second

using namespace std;

vector<vector<set<pair<int,int>>>> mp,mp2;
vector<int> bit(2501);

void upd(int x, int val)
{
    x++;
    for(;x<=2500;x+=(x&-x))
        bit[x]+=val;
}

int getpre(int x)
{
    x++;
    int ret=0;
    for(;x>0;x-=(x&-x))
        ret+=bit[x];
    return ret;
}

ll count_rectangles(vector<vector<int>> a)
{
    int n=a.size(), m=a[0].size();
    for(int i=0;i<n;i++)
        mp.pb(vector<set<pair<int,int>>>(m)), mp2.pb(vector<set<pair<int,int>>>(m));
    for(int i=1;i<n-1;i++)
    {
        fill(bit.begin(),bit.end(),0);
        vector<pair<int,int>> vp;
        for(int j=0;j<m;j++) vp.pb({a[i][j],j});
        sort(vp.begin(),vp.end());
        for(int j=0;j<m;j++)
        {
            upd(vp[j].y,1);
            int l=vp[j].y, r=m-1;
            while(l<r)
            {
                int md=(l+r)/2+1;
                if(getpre(md)-getpre(vp[j].y)==md-vp[j].y) l=md;
                else r=md-1;
            }
            int l2=0, r2=vp[j].y;
            while(l2<r2)
            {
                int md=(l2+r2)/2;
                if(getpre(vp[j].y)-getpre(md-1)==vp[j].y-md+1) r2=md;
                else l2=md+1;
            }
            if(l2==0 || l==m-1) continue;
            if(a[i][l+1]==vp[j].x || a[i][l2-1]==vp[j].x) continue;
            int num=1;
            if(int(mp[i-1][l2-1].size()))
            {
                auto it = mp[i-1][l2-1].lower_bound({l+1,0});
                if(it!=mp[i-1][l2-1].end()) if((*it).x==l+1) num+=(*it).y;
            }
            mp[i][l2-1].insert({l+1,num});
            num=1;
            if((int)mp[i-1][l+1].size())
            {
                auto it = mp[i-1][l+1].lower_bound({l2-1,0});
                if(it!=mp[i-1][l+1].end()) if((*it).x==l2-1) num+=(*it).y;
            }
            mp[i][l+1].insert({l2-1,num});
        }
    }
    ll ans=0;
    for(int i=1;i<m-1;i++)
    {
        fill(bit.begin(),bit.end(),0);
        vector<pair<int,int>> vp;
        for(int j=0;j<n;j++) vp.pb({a[j][i],j});
        sort(vp.begin(),vp.end());
        for(int j=0;j<n;j++)
        {
            upd(vp[j].y,1);
            int l=vp[j].y, r=n-1;
            while(l<r)
            {
                int md=(l+r)/2+1;
                if(getpre(md)-getpre(vp[j].y)==md-vp[j].y) l=md;
                else r=md-1;
            }
            int l2=0, r2=vp[j].y;
            while(l2<r2)
            {
                int md=(l2+r2)/2;
                if(getpre(vp[j].y)-getpre(md-1)==vp[j].y-md+1) r2=md;
                else l2=md+1;
            }
            if(l2==0 || l==n-1) continue;
            if(a[l+1][i]==vp[j].x || a[l2-1][i]==vp[j].x) continue;
            int num=1;
            if((int)mp2[l2-1][i-1].size())
            {
                auto it = mp2[l2-1][i-1].lower_bound({l+1,0});
                if(it!=mp2[l2-1][i-1].end()) if((*it).x==l+1) num+=(*it).y;
            }
            mp2[l2-1][i].insert({l+1,num});
            num=1;
            if((int)mp2[l+1][i-1].size())
            {
                auto it = mp2[l+1][i-1].lower_bound({l2-1,0});
                if(it!=mp2[l+1][i-1].end()) if((*it).x==l2-1) num+=(*it).y;
            }
            mp2[l+1][i].insert({l2-1,num});
                auto it = mp[l][i+1].lower_bound({i-num,l-l2+1});
                for(;it!=mp[l][i+1].end();it++)
                {
                    if((*it).x>i+1) break;
                    if((*it).y>=l-l2+1) ans++;
                }
        }
    }
    return ans;
}

/*int main()
{
    freopen("test.in","r",stdin)
    int n,m; cin>>n>>m;
    vector<vector<int>> a(n);
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
    {
        int k; cin>>k;
        a[i].pb(k);
    }
    cout<<count_rectangles(a);
}*/

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 6 ms 632 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 6 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 6 ms 504 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 12 ms 2172 KB Output is correct
18 Correct 12 ms 2168 KB Output is correct
19 Correct 12 ms 2168 KB Output is correct
20 Correct 10 ms 1400 KB Output is correct
21 Correct 12 ms 2040 KB Output is correct
22 Correct 13 ms 2040 KB Output is correct
23 Correct 12 ms 2040 KB Output is correct
24 Correct 8 ms 1144 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 380 KB Output is correct
27 Correct 5 ms 504 KB Output is correct
28 Correct 6 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 6 ms 632 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 6 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 6 ms 504 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 12 ms 2172 KB Output is correct
18 Correct 12 ms 2168 KB Output is correct
19 Correct 12 ms 2168 KB Output is correct
20 Correct 10 ms 1400 KB Output is correct
21 Correct 12 ms 2040 KB Output is correct
22 Correct 13 ms 2040 KB Output is correct
23 Correct 12 ms 2040 KB Output is correct
24 Correct 8 ms 1144 KB Output is correct
25 Correct 55 ms 12024 KB Output is correct
26 Correct 58 ms 12024 KB Output is correct
27 Correct 54 ms 12152 KB Output is correct
28 Correct 47 ms 7288 KB Output is correct
29 Correct 70 ms 11512 KB Output is correct
30 Correct 71 ms 11768 KB Output is correct
31 Correct 68 ms 11256 KB Output is correct
32 Correct 67 ms 11128 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 380 KB Output is correct
35 Correct 5 ms 504 KB Output is correct
36 Correct 6 ms 376 KB Output is correct
37 Correct 5 ms 376 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 6 ms 632 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 6 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 6 ms 504 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 12 ms 2172 KB Output is correct
18 Correct 12 ms 2168 KB Output is correct
19 Correct 12 ms 2168 KB Output is correct
20 Correct 10 ms 1400 KB Output is correct
21 Correct 12 ms 2040 KB Output is correct
22 Correct 13 ms 2040 KB Output is correct
23 Correct 12 ms 2040 KB Output is correct
24 Correct 8 ms 1144 KB Output is correct
25 Correct 55 ms 12024 KB Output is correct
26 Correct 58 ms 12024 KB Output is correct
27 Correct 54 ms 12152 KB Output is correct
28 Correct 47 ms 7288 KB Output is correct
29 Correct 70 ms 11512 KB Output is correct
30 Correct 71 ms 11768 KB Output is correct
31 Correct 68 ms 11256 KB Output is correct
32 Correct 67 ms 11128 KB Output is correct
33 Correct 551 ms 97996 KB Output is correct
34 Correct 546 ms 97912 KB Output is correct
35 Correct 578 ms 98272 KB Output is correct
36 Correct 582 ms 98040 KB Output is correct
37 Correct 775 ms 143608 KB Output is correct
38 Correct 780 ms 143640 KB Output is correct
39 Correct 778 ms 143608 KB Output is correct
40 Correct 754 ms 134356 KB Output is correct
41 Correct 542 ms 74324 KB Output is correct
42 Correct 643 ms 86904 KB Output is correct
43 Correct 1173 ms 141152 KB Output is correct
44 Correct 1173 ms 142200 KB Output is correct
45 Correct 564 ms 71928 KB Output is correct
46 Correct 561 ms 72056 KB Output is correct
47 Correct 1113 ms 134776 KB Output is correct
48 Correct 1168 ms 135288 KB Output is correct
49 Correct 5 ms 376 KB Output is correct
50 Correct 5 ms 380 KB Output is correct
51 Correct 5 ms 504 KB Output is correct
52 Correct 6 ms 376 KB Output is correct
53 Correct 5 ms 376 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1656 KB Output is correct
2 Correct 9 ms 1400 KB Output is correct
3 Correct 9 ms 1144 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 10 ms 1400 KB Output is correct
6 Correct 10 ms 1400 KB Output is correct
7 Correct 10 ms 1400 KB Output is correct
8 Correct 10 ms 1400 KB Output is correct
9 Correct 10 ms 1400 KB Output is correct
10 Correct 7 ms 632 KB Output is correct
11 Correct 7 ms 888 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 3725 ms 428156 KB Output is correct
3 Execution timed out 5102 ms 817380 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 6 ms 632 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 6 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 6 ms 504 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 12 ms 2172 KB Output is correct
18 Correct 12 ms 2168 KB Output is correct
19 Correct 12 ms 2168 KB Output is correct
20 Correct 10 ms 1400 KB Output is correct
21 Correct 12 ms 2040 KB Output is correct
22 Correct 13 ms 2040 KB Output is correct
23 Correct 12 ms 2040 KB Output is correct
24 Correct 8 ms 1144 KB Output is correct
25 Correct 55 ms 12024 KB Output is correct
26 Correct 58 ms 12024 KB Output is correct
27 Correct 54 ms 12152 KB Output is correct
28 Correct 47 ms 7288 KB Output is correct
29 Correct 70 ms 11512 KB Output is correct
30 Correct 71 ms 11768 KB Output is correct
31 Correct 68 ms 11256 KB Output is correct
32 Correct 67 ms 11128 KB Output is correct
33 Correct 551 ms 97996 KB Output is correct
34 Correct 546 ms 97912 KB Output is correct
35 Correct 578 ms 98272 KB Output is correct
36 Correct 582 ms 98040 KB Output is correct
37 Correct 775 ms 143608 KB Output is correct
38 Correct 780 ms 143640 KB Output is correct
39 Correct 778 ms 143608 KB Output is correct
40 Correct 754 ms 134356 KB Output is correct
41 Correct 542 ms 74324 KB Output is correct
42 Correct 643 ms 86904 KB Output is correct
43 Correct 1173 ms 141152 KB Output is correct
44 Correct 1173 ms 142200 KB Output is correct
45 Correct 564 ms 71928 KB Output is correct
46 Correct 561 ms 72056 KB Output is correct
47 Correct 1113 ms 134776 KB Output is correct
48 Correct 1168 ms 135288 KB Output is correct
49 Correct 9 ms 1656 KB Output is correct
50 Correct 9 ms 1400 KB Output is correct
51 Correct 9 ms 1144 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 10 ms 1400 KB Output is correct
54 Correct 10 ms 1400 KB Output is correct
55 Correct 10 ms 1400 KB Output is correct
56 Correct 10 ms 1400 KB Output is correct
57 Correct 10 ms 1400 KB Output is correct
58 Correct 7 ms 632 KB Output is correct
59 Correct 7 ms 888 KB Output is correct
60 Correct 5 ms 376 KB Output is correct
61 Correct 3725 ms 428156 KB Output is correct
62 Execution timed out 5102 ms 817380 KB Time limit exceeded
63 Halted 0 ms 0 KB -