oj.uz

Submission #199629

# Submission time Handle Problem Language Result Execution time Memory
199629 2020-02-02T11:10:53 Z medk Rectangles (IOI19_rect) C++14
59 / 100
 5000 ms 360204 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;

map<pair<int,int>,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);
    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(mp.count({i-1,l2-1}))
            {
                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(mp.count({i-1,l+1}))
            {
                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=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(mp2.count({l2-1,i-1}))
            {
                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(mp2.count({l+1,i-1}))
            {
                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 6 ms 380 KB Output is correct
2 Correct 7 ms 760 KB Output is correct
3 Correct 7 ms 760 KB Output is correct
4 Correct 7 ms 760 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 7 ms 632 KB Output is correct
7 Correct 6 ms 504 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 7 ms 632 KB Output is correct
10 Correct 7 ms 632 KB Output is correct
11 Correct 7 ms 632 KB Output is correct
12 Correct 7 ms 632 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 6 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 6 ms 504 KB Output is correct
20 Correct 5 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 6 ms 380 KB Output is correct
2 Correct 7 ms 760 KB Output is correct
3 Correct 7 ms 760 KB Output is correct
4 Correct 7 ms 760 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 7 ms 632 KB Output is correct
7 Correct 6 ms 504 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 7 ms 632 KB Output is correct
10 Correct 7 ms 632 KB Output is correct
11 Correct 7 ms 632 KB Output is correct
12 Correct 7 ms 632 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 19 ms 2808 KB Output is correct
18 Correct 19 ms 2784 KB Output is correct
19 Correct 19 ms 2808 KB Output is correct
20 Correct 14 ms 1528 KB Output is correct
21 Correct 21 ms 2296 KB Output is correct
22 Correct 21 ms 2300 KB Output is correct
23 Correct 20 ms 2296 KB Output is correct
24 Correct 12 ms 1272 KB Output is correct
25 Correct 6 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 6 ms 504 KB Output is correct
28 Correct 5 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 6 ms 380 KB Output is correct
2 Correct 7 ms 760 KB Output is correct
3 Correct 7 ms 760 KB Output is correct
4 Correct 7 ms 760 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 7 ms 632 KB Output is correct
7 Correct 6 ms 504 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 7 ms 632 KB Output is correct
10 Correct 7 ms 632 KB Output is correct
11 Correct 7 ms 632 KB Output is correct
12 Correct 7 ms 632 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 19 ms 2808 KB Output is correct
18 Correct 19 ms 2784 KB Output is correct
19 Correct 19 ms 2808 KB Output is correct
20 Correct 14 ms 1528 KB Output is correct
21 Correct 21 ms 2296 KB Output is correct
22 Correct 21 ms 2300 KB Output is correct
23 Correct 20 ms 2296 KB Output is correct
24 Correct 12 ms 1272 KB Output is correct
25 Correct 102 ms 15608 KB Output is correct
26 Correct 104 ms 15608 KB Output is correct
27 Correct 105 ms 15720 KB Output is correct
28 Correct 63 ms 7672 KB Output is correct
29 Correct 140 ms 13096 KB Output is correct
30 Correct 141 ms 13288 KB Output is correct
31 Correct 129 ms 12408 KB Output is correct
32 Correct 128 ms 12252 KB Output is correct
33 Correct 6 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 6 ms 504 KB Output is correct
36 Correct 5 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 6 ms 380 KB Output is correct
2 Correct 7 ms 760 KB Output is correct
3 Correct 7 ms 760 KB Output is correct
4 Correct 7 ms 760 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 7 ms 632 KB Output is correct
7 Correct 6 ms 504 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 7 ms 632 KB Output is correct
10 Correct 7 ms 632 KB Output is correct
11 Correct 7 ms 632 KB Output is correct
12 Correct 7 ms 632 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 19 ms 2808 KB Output is correct
18 Correct 19 ms 2784 KB Output is correct
19 Correct 19 ms 2808 KB Output is correct
20 Correct 14 ms 1528 KB Output is correct
21 Correct 21 ms 2296 KB Output is correct
22 Correct 21 ms 2300 KB Output is correct
23 Correct 20 ms 2296 KB Output is correct
24 Correct 12 ms 1272 KB Output is correct
25 Correct 102 ms 15608 KB Output is correct
26 Correct 104 ms 15608 KB Output is correct
27 Correct 105 ms 15720 KB Output is correct
28 Correct 63 ms 7672 KB Output is correct
29 Correct 140 ms 13096 KB Output is correct
30 Correct 141 ms 13288 KB Output is correct
31 Correct 129 ms 12408 KB Output is correct
32 Correct 128 ms 12252 KB Output is correct
33 Correct 821 ms 96524 KB Output is correct
34 Correct 630 ms 96528 KB Output is correct
35 Correct 1215 ms 119288 KB Output is correct
36 Correct 1036 ms 119288 KB Output is correct
37 Correct 1541 ms 188060 KB Output is correct
38 Correct 1568 ms 187568 KB Output is correct
39 Correct 1559 ms 187896 KB Output is correct
40 Correct 1431 ms 175576 KB Output is correct
41 Correct 742 ms 67336 KB Output is correct
42 Correct 1127 ms 90408 KB Output is correct
43 Correct 3009 ms 160260 KB Output is correct
44 Correct 3009 ms 161912 KB Output is correct
45 Correct 1284 ms 80600 KB Output is correct
46 Correct 1191 ms 80632 KB Output is correct
47 Correct 2555 ms 148600 KB Output is correct
48 Correct 2667 ms 149240 KB Output is correct
49 Correct 6 ms 376 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 6 ms 504 KB Output is correct
52 Correct 5 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 27 ms 1656 KB Output is correct
2 Correct 22 ms 1528 KB Output is correct
3 Correct 19 ms 504 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 25 ms 1144 KB Output is correct
6 Correct 24 ms 1144 KB Output is correct
7 Correct 22 ms 1144 KB Output is correct
8 Correct 22 ms 1016 KB Output is correct
9 Correct 21 ms 1016 KB Output is correct
10 Correct 19 ms 504 KB Output is correct
11 Correct 19 ms 504 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 Execution timed out 5066 ms 360204 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 380 KB Output is correct
2 Correct 7 ms 760 KB Output is correct
3 Correct 7 ms 760 KB Output is correct
4 Correct 7 ms 760 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 7 ms 632 KB Output is correct
7 Correct 6 ms 504 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 7 ms 632 KB Output is correct
10 Correct 7 ms 632 KB Output is correct
11 Correct 7 ms 632 KB Output is correct
12 Correct 7 ms 632 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 19 ms 2808 KB Output is correct
18 Correct 19 ms 2784 KB Output is correct
19 Correct 19 ms 2808 KB Output is correct
20 Correct 14 ms 1528 KB Output is correct
21 Correct 21 ms 2296 KB Output is correct
22 Correct 21 ms 2300 KB Output is correct
23 Correct 20 ms 2296 KB Output is correct
24 Correct 12 ms 1272 KB Output is correct
25 Correct 102 ms 15608 KB Output is correct
26 Correct 104 ms 15608 KB Output is correct
27 Correct 105 ms 15720 KB Output is correct
28 Correct 63 ms 7672 KB Output is correct
29 Correct 140 ms 13096 KB Output is correct
30 Correct 141 ms 13288 KB Output is correct
31 Correct 129 ms 12408 KB Output is correct
32 Correct 128 ms 12252 KB Output is correct
33 Correct 821 ms 96524 KB Output is correct
34 Correct 630 ms 96528 KB Output is correct
35 Correct 1215 ms 119288 KB Output is correct
36 Correct 1036 ms 119288 KB Output is correct
37 Correct 1541 ms 188060 KB Output is correct
38 Correct 1568 ms 187568 KB Output is correct
39 Correct 1559 ms 187896 KB Output is correct
40 Correct 1431 ms 175576 KB Output is correct
41 Correct 742 ms 67336 KB Output is correct
42 Correct 1127 ms 90408 KB Output is correct
43 Correct 3009 ms 160260 KB Output is correct
44 Correct 3009 ms 161912 KB Output is correct
45 Correct 1284 ms 80600 KB Output is correct
46 Correct 1191 ms 80632 KB Output is correct
47 Correct 2555 ms 148600 KB Output is correct
48 Correct 2667 ms 149240 KB Output is correct
49 Correct 27 ms 1656 KB Output is correct
50 Correct 22 ms 1528 KB Output is correct
51 Correct 19 ms 504 KB Output is correct
52 Correct 6 ms 376 KB Output is correct
53 Correct 25 ms 1144 KB Output is correct
54 Correct 24 ms 1144 KB Output is correct
55 Correct 22 ms 1144 KB Output is correct
56 Correct 22 ms 1016 KB Output is correct
57 Correct 21 ms 1016 KB Output is correct
58 Correct 19 ms 504 KB Output is correct
59 Correct 19 ms 504 KB Output is correct
60 Correct 5 ms 376 KB Output is correct
61 Execution timed out 5066 ms 360204 KB Time limit exceeded
62 Halted 0 ms 0 KB -