oj.uz

Submission #199630

# Submission time Handle Problem Language Result Execution time Memory
199630 2020-02-02T11:38:21 Z medk Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 1048576 KB 
#include <bits/stdc++.h>
#include "rect.h"

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

using namespace std;

int where[2500][2500],where2[2500][2500];
vector<set<pair<int,int>>> mp,mp2;
vector<pair<int,pair<int,int>>> dsu;
vector<int> sz;

int getp(int x)
{
    if (x==dsu[x].x)
        return x;
    return dsu[x].x=getp(dsu[x].x);
}

void connect(int i, int j)
{
    i=getp(i), j=getp(j);
    if(sz[i]<sz[j]) swap(i,j);
    dsu[j].x=i;
    dsu[i].y.x=max(dsu[i].y.x,dsu[j].y.x);
    dsu[i].y.y=min(dsu[i].y.y,dsu[j].y.y);
    sz[i]+=sz[j];
}

ll count_rectangles(vector<vector<int>> a)
{
    for(int i=0;i<2500;i++) dsu.pb({i,{i,i}}), sz.pb(1);
    for(int i=0;i<2500;i++) for(int j=0;j<2500;j++) where[i][j]=-1,where2[i][j]=-1;
    vector<pair<int,pair<int,int>>> dsuin=dsu;
    int n=a.size(), m=a[0].size();
    vector<int> tmp(2500,0);
    for(int i=1;i<n-1;i++)
    {
        dsu=dsuin;
        fill(sz.begin(),sz.end(),1);
        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++)
        {
            tmp[vp[j].y]++;
            if(vp[j].y!=m-1)
                if(tmp[vp[j].y+1]==i)
                    connect(vp[j].y, vp[j].y+1);
            if(vp[j].y!=0)
                if(tmp[vp[j].y-1]==i)
                    connect(vp[j].y, vp[j].y-1);
            int par=getp(vp[j].y);
            int l=dsu[par].y.x, l2=dsu[par].y.y;
            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(where[i-1][l2-1]!=-1)
            {
                auto it = mp[where[i-1][l2-1]].lower_bound({l+1,0});
                if(it!=mp[where[i-1][l2-1]].end()) if((*it).x==l+1) num+=(*it).y;
            }
            if(where[i][l2-1]==-1) where[i][l2-1]=mp.size(), mp.pb(set<pair<int,int>>());
            mp[where[i][l2-1]].insert({l+1,num});
            num=1;
            if(where[i-1][l+1]!=-1)
            {
                auto it = mp[where[i-1][l+1]].lower_bound({l2-1,0});
                if(it!=mp[where[i-1][l+1]].end()) if((*it).x==l2-1) num+=(*it).y;
            }
            if(where[i][l+1]==-1) where[i][l+1]=mp.size(), mp.pb(set<pair<int,int>>());
            mp[where[i][l+1]].insert({l2-1,num});
        }
    }
    ll ans=0;
    for(int i=0;i<2500;i++) tmp[i]=0;
    for(int i=1;i<m-1;i++)
    {
        dsu=dsuin;
        fill(sz.begin(),sz.end(),1);
        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++)
        {
            tmp[vp[j].y]++;
            if(vp[j].y!=n-1)
                if(tmp[vp[j].y+1]==i)
                    connect(vp[j].y, vp[j].y+1);
            if(vp[j].y!=0)
                if(tmp[vp[j].y-1]==i)
                    connect(vp[j].y, vp[j].y-1);
            int par=getp(vp[j].y);
            int l=dsu[par].y.x, l2=dsu[par].y.y;
            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(where2[l2-1][i-1]!=-1)
            {
                auto it = mp2[where2[l2-1][i-1]].lower_bound({l+1,0});
                if(it!=mp2[where2[l2-1][i-1]].end()) if((*it).x==l+1) num+=(*it).y;
            }
            if(where2[l2-1][i]==-1) where2[l2-1][i]=mp2.size(), mp2.pb(set<pair<int,int>>());
            mp2[where2[l2-1][i]].insert({l+1,num});
            num=1;
            if(where2[l+1][i-1]!=-1)
            {
                auto it = mp2[where2[l+1][i-1]].lower_bound({l2-1,0});
                if(it!=mp2[where2[l+1][i-1]].end()) if((*it).x==l2-1) num+=(*it).y;
            }
            if(where2[l+1][i]==-1) where2[l+1][i]=mp2.size(), mp2.pb(set<pair<int,int>>());
            mp2[where2[l+1][i]].insert({l2-1,num});
            if(where[l][i+1]!=-1)
            {
                auto it = mp[where[l][i+1]].lower_bound({i-num,l-l2+1});
                for(;it!=mp[where[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 39 ms 49400 KB Output is correct
2 Correct 41 ms 49528 KB Output is correct
3 Correct 40 ms 49528 KB Output is correct
4 Correct 38 ms 49528 KB Output is correct
5 Correct 38 ms 49376 KB Output is correct
6 Correct 39 ms 49528 KB Output is correct
7 Correct 41 ms 49528 KB Output is correct
8 Correct 41 ms 49372 KB Output is correct
9 Correct 38 ms 49528 KB Output is correct
10 Correct 39 ms 49528 KB Output is correct
11 Correct 40 ms 49524 KB Output is correct
12 Correct 42 ms 49532 KB Output is correct
13 Correct 39 ms 49272 KB Output is correct
14 Correct 39 ms 49276 KB Output is correct
15 Correct 37 ms 49400 KB Output is correct
16 Correct 38 ms 49272 KB Output is correct
17 Correct 39 ms 49376 KB Output is correct
18 Correct 37 ms 49272 KB Output is correct
19 Correct 38 ms 49400 KB Output is correct
20 Correct 40 ms 49272 KB Output is correct
21 Correct 38 ms 49272 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 49400 KB Output is correct
2 Correct 41 ms 49528 KB Output is correct
3 Correct 40 ms 49528 KB Output is correct
4 Correct 38 ms 49528 KB Output is correct
5 Correct 38 ms 49376 KB Output is correct
6 Correct 39 ms 49528 KB Output is correct
7 Correct 41 ms 49528 KB Output is correct
8 Correct 41 ms 49372 KB Output is correct
9 Correct 38 ms 49528 KB Output is correct
10 Correct 39 ms 49528 KB Output is correct
11 Correct 40 ms 49524 KB Output is correct
12 Correct 42 ms 49532 KB Output is correct
13 Correct 39 ms 49272 KB Output is correct
14 Correct 39 ms 49276 KB Output is correct
15 Correct 37 ms 49400 KB Output is correct
16 Correct 38 ms 49272 KB Output is correct
17 Correct 49 ms 51124 KB Output is correct
18 Correct 46 ms 51124 KB Output is correct
19 Correct 45 ms 51124 KB Output is correct
20 Correct 49 ms 50168 KB Output is correct
21 Correct 45 ms 50808 KB Output is correct
22 Correct 46 ms 50808 KB Output is correct
23 Correct 47 ms 50812 KB Output is correct
24 Correct 42 ms 49908 KB Output is correct
25 Correct 39 ms 49376 KB Output is correct
26 Correct 37 ms 49272 KB Output is correct
27 Correct 38 ms 49400 KB Output is correct
28 Correct 40 ms 49272 KB Output is correct
29 Correct 38 ms 49272 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 49400 KB Output is correct
2 Correct 41 ms 49528 KB Output is correct
3 Correct 40 ms 49528 KB Output is correct
4 Correct 38 ms 49528 KB Output is correct
5 Correct 38 ms 49376 KB Output is correct
6 Correct 39 ms 49528 KB Output is correct
7 Correct 41 ms 49528 KB Output is correct
8 Correct 41 ms 49372 KB Output is correct
9 Correct 38 ms 49528 KB Output is correct
10 Correct 39 ms 49528 KB Output is correct
11 Correct 40 ms 49524 KB Output is correct
12 Correct 42 ms 49532 KB Output is correct
13 Correct 39 ms 49272 KB Output is correct
14 Correct 39 ms 49276 KB Output is correct
15 Correct 37 ms 49400 KB Output is correct
16 Correct 38 ms 49272 KB Output is correct
17 Correct 49 ms 51124 KB Output is correct
18 Correct 46 ms 51124 KB Output is correct
19 Correct 45 ms 51124 KB Output is correct
20 Correct 49 ms 50168 KB Output is correct
21 Correct 45 ms 50808 KB Output is correct
22 Correct 46 ms 50808 KB Output is correct
23 Correct 47 ms 50812 KB Output is correct
24 Correct 42 ms 49908 KB Output is correct
25 Correct 78 ms 61604 KB Output is correct
26 Correct 81 ms 61600 KB Output is correct
27 Correct 86 ms 61732 KB Output is correct
28 Correct 60 ms 54824 KB Output is correct
29 Correct 86 ms 59048 KB Output is correct
30 Correct 86 ms 59180 KB Output is correct
31 Correct 85 ms 58664 KB Output is correct
32 Correct 86 ms 58504 KB Output is correct
33 Correct 39 ms 49376 KB Output is correct
34 Correct 37 ms 49272 KB Output is correct
35 Correct 38 ms 49400 KB Output is correct
36 Correct 40 ms 49272 KB Output is correct
37 Correct 38 ms 49272 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 49400 KB Output is correct
2 Correct 41 ms 49528 KB Output is correct
3 Correct 40 ms 49528 KB Output is correct
4 Correct 38 ms 49528 KB Output is correct
5 Correct 38 ms 49376 KB Output is correct
6 Correct 39 ms 49528 KB Output is correct
7 Correct 41 ms 49528 KB Output is correct
8 Correct 41 ms 49372 KB Output is correct
9 Correct 38 ms 49528 KB Output is correct
10 Correct 39 ms 49528 KB Output is correct
11 Correct 40 ms 49524 KB Output is correct
12 Correct 42 ms 49532 KB Output is correct
13 Correct 39 ms 49272 KB Output is correct
14 Correct 39 ms 49276 KB Output is correct
15 Correct 37 ms 49400 KB Output is correct
16 Correct 38 ms 49272 KB Output is correct
17 Correct 49 ms 51124 KB Output is correct
18 Correct 46 ms 51124 KB Output is correct
19 Correct 45 ms 51124 KB Output is correct
20 Correct 49 ms 50168 KB Output is correct
21 Correct 45 ms 50808 KB Output is correct
22 Correct 46 ms 50808 KB Output is correct
23 Correct 47 ms 50812 KB Output is correct
24 Correct 42 ms 49908 KB Output is correct
25 Correct 78 ms 61604 KB Output is correct
26 Correct 81 ms 61600 KB Output is correct
27 Correct 86 ms 61732 KB Output is correct
28 Correct 60 ms 54824 KB Output is correct
29 Correct 86 ms 59048 KB Output is correct
30 Correct 86 ms 59180 KB Output is correct
31 Correct 85 ms 58664 KB Output is correct
32 Correct 86 ms 58504 KB Output is correct
33 Correct 308 ms 121992 KB Output is correct
34 Correct 282 ms 122124 KB Output is correct
35 Correct 299 ms 121992 KB Output is correct
36 Correct 280 ms 122140 KB Output is correct
37 Correct 570 ms 190568 KB Output is correct
38 Correct 537 ms 190572 KB Output is correct
39 Correct 550 ms 190652 KB Output is correct
40 Correct 511 ms 181404 KB Output is correct
41 Correct 251 ms 96240 KB Output is correct
42 Correct 314 ms 110728 KB Output is correct
43 Correct 686 ms 176496 KB Output is correct
44 Correct 685 ms 177484 KB Output is correct
45 Correct 354 ms 112984 KB Output is correct
46 Correct 342 ms 113164 KB Output is correct
47 Correct 662 ms 171244 KB Output is correct
48 Correct 672 ms 171336 KB Output is correct
49 Correct 39 ms 49376 KB Output is correct
50 Correct 37 ms 49272 KB Output is correct
51 Correct 38 ms 49400 KB Output is correct
52 Correct 40 ms 49272 KB Output is correct
53 Correct 38 ms 49272 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 50288 KB Output is correct
2 Correct 52 ms 50296 KB Output is correct
3 Correct 49 ms 49400 KB Output is correct
4 Correct 36 ms 49400 KB Output is correct
5 Correct 52 ms 49912 KB Output is correct
6 Correct 52 ms 49912 KB Output is correct
7 Correct 49 ms 49912 KB Output is correct
8 Correct 48 ms 49784 KB Output is correct
9 Correct 48 ms 49784 KB Output is correct
10 Correct 47 ms 49400 KB Output is correct
11 Correct 48 ms 49400 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 49272 KB Output is correct
2 Correct 1520 ms 353436 KB Output is correct
3 Correct 3332 ms 681972 KB Output is correct
4 Correct 3284 ms 683828 KB Output is correct
5 Correct 3375 ms 683332 KB Output is correct
6 Correct 437 ms 73592 KB Output is correct
7 Correct 812 ms 95632 KB Output is correct
8 Correct 895 ms 98628 KB Output is correct
9 Correct 39 ms 49376 KB Output is correct
10 Correct 37 ms 49272 KB Output is correct
11 Correct 38 ms 49400 KB Output is correct
12 Correct 40 ms 49272 KB Output is correct
13 Correct 38 ms 49272 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 49400 KB Output is correct
2 Correct 41 ms 49528 KB Output is correct
3 Correct 40 ms 49528 KB Output is correct
4 Correct 38 ms 49528 KB Output is correct
5 Correct 38 ms 49376 KB Output is correct
6 Correct 39 ms 49528 KB Output is correct
7 Correct 41 ms 49528 KB Output is correct
8 Correct 41 ms 49372 KB Output is correct
9 Correct 38 ms 49528 KB Output is correct
10 Correct 39 ms 49528 KB Output is correct
11 Correct 40 ms 49524 KB Output is correct
12 Correct 42 ms 49532 KB Output is correct
13 Correct 39 ms 49272 KB Output is correct
14 Correct 39 ms 49276 KB Output is correct
15 Correct 37 ms 49400 KB Output is correct
16 Correct 38 ms 49272 KB Output is correct
17 Correct 49 ms 51124 KB Output is correct
18 Correct 46 ms 51124 KB Output is correct
19 Correct 45 ms 51124 KB Output is correct
20 Correct 49 ms 50168 KB Output is correct
21 Correct 45 ms 50808 KB Output is correct
22 Correct 46 ms 50808 KB Output is correct
23 Correct 47 ms 50812 KB Output is correct
24 Correct 42 ms 49908 KB Output is correct
25 Correct 78 ms 61604 KB Output is correct
26 Correct 81 ms 61600 KB Output is correct
27 Correct 86 ms 61732 KB Output is correct
28 Correct 60 ms 54824 KB Output is correct
29 Correct 86 ms 59048 KB Output is correct
30 Correct 86 ms 59180 KB Output is correct
31 Correct 85 ms 58664 KB Output is correct
32 Correct 86 ms 58504 KB Output is correct
33 Correct 308 ms 121992 KB Output is correct
34 Correct 282 ms 122124 KB Output is correct
35 Correct 299 ms 121992 KB Output is correct
36 Correct 280 ms 122140 KB Output is correct
37 Correct 570 ms 190568 KB Output is correct
38 Correct 537 ms 190572 KB Output is correct
39 Correct 550 ms 190652 KB Output is correct
40 Correct 511 ms 181404 KB Output is correct
41 Correct 251 ms 96240 KB Output is correct
42 Correct 314 ms 110728 KB Output is correct
43 Correct 686 ms 176496 KB Output is correct
44 Correct 685 ms 177484 KB Output is correct
45 Correct 354 ms 112984 KB Output is correct
46 Correct 342 ms 113164 KB Output is correct
47 Correct 662 ms 171244 KB Output is correct
48 Correct 672 ms 171336 KB Output is correct
49 Correct 53 ms 50288 KB Output is correct
50 Correct 52 ms 50296 KB Output is correct
51 Correct 49 ms 49400 KB Output is correct
52 Correct 36 ms 49400 KB Output is correct
53 Correct 52 ms 49912 KB Output is correct
54 Correct 52 ms 49912 KB Output is correct
55 Correct 49 ms 49912 KB Output is correct
56 Correct 48 ms 49784 KB Output is correct
57 Correct 48 ms 49784 KB Output is correct
58 Correct 47 ms 49400 KB Output is correct
59 Correct 48 ms 49400 KB Output is correct
60 Correct 37 ms 49272 KB Output is correct
61 Correct 1520 ms 353436 KB Output is correct
62 Correct 3332 ms 681972 KB Output is correct
63 Correct 3284 ms 683828 KB Output is correct
64 Correct 3375 ms 683332 KB Output is correct
65 Correct 437 ms 73592 KB Output is correct
66 Correct 812 ms 95632 KB Output is correct
67 Correct 895 ms 98628 KB Output is correct
68 Correct 3830 ms 978744 KB Output is correct
69 Correct 3639 ms 1025420 KB Output is correct
70 Correct 3649 ms 1025276 KB Output is correct
71 Correct 3411 ms 1025276 KB Output is correct
72 Execution timed out 5127 ms 1048576 KB Time limit exceeded
73 Halted 0 ms 0 KB -