oj.uz

Submission #199622

# Submission time Handle Problem Language Result Execution time Memory
199622 2020-02-02T10:30:46 Z medk Rectangles (IOI19_rect) C++14
18 / 100
 5000 ms 799108 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<pair<int,pair<int,int>>> dsu;
vector<int> sz;

int getp(int x)
{
    while(x!=dsu[x].x)
    {
        dsu[x].x=dsu[dsu[x].x].x;
        x=dsu[x].x;
    }
    return 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();
    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++)
    {
        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());
        vector<bool> tmp(2500);
        for(int j=0;j<m;j++)
        {
            tmp[vp[j].y]=1;
            if(vp[j].y!=m-1)
                if(tmp[vp[j].y+1])
                    connect(vp[j].y, vp[j].y+1);
            if(vp[j].y!=0)
                if(tmp[vp[j].y-1])
                    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(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++)
    {
        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());
        vector<bool> tmp(2500);
        for(int j=0;j<n;j++)
        {
            tmp[vp[j].y]=1;
            if(vp[j].y!=m-1)
                if(tmp[vp[j].y+1])
                    connect(vp[j].y, vp[j].y+1);
            if(vp[j].y!=0)
                if(tmp[vp[j].y-1])
                    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((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 632 KB Output is correct
3 Correct 6 ms 632 KB Output is correct
4 Correct 6 ms 632 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 6 ms 632 KB Output is correct
7 Correct 6 ms 632 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 6 ms 636 KB Output is correct
10 Correct 6 ms 632 KB Output is correct
11 Correct 6 ms 636 KB Output is correct
12 Correct 6 ms 632 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 6 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 380 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 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
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 632 KB Output is correct
3 Correct 6 ms 632 KB Output is correct
4 Correct 6 ms 632 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 6 ms 632 KB Output is correct
7 Correct 6 ms 632 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 6 ms 636 KB Output is correct
10 Correct 6 ms 632 KB Output is correct
11 Correct 6 ms 636 KB Output is correct
12 Correct 6 ms 632 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 6 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 10 ms 2168 KB Output is correct
18 Correct 11 ms 2168 KB Output is correct
19 Correct 11 ms 2168 KB Output is correct
20 Correct 8 ms 1528 KB Output is correct
21 Correct 11 ms 2040 KB Output is correct
22 Incorrect 11 ms 2040 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 632 KB Output is correct
3 Correct 6 ms 632 KB Output is correct
4 Correct 6 ms 632 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 6 ms 632 KB Output is correct
7 Correct 6 ms 632 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 6 ms 636 KB Output is correct
10 Correct 6 ms 632 KB Output is correct
11 Correct 6 ms 636 KB Output is correct
12 Correct 6 ms 632 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 6 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 10 ms 2168 KB Output is correct
18 Correct 11 ms 2168 KB Output is correct
19 Correct 11 ms 2168 KB Output is correct
20 Correct 8 ms 1528 KB Output is correct
21 Correct 11 ms 2040 KB Output is correct
22 Incorrect 11 ms 2040 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 632 KB Output is correct
3 Correct 6 ms 632 KB Output is correct
4 Correct 6 ms 632 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 6 ms 632 KB Output is correct
7 Correct 6 ms 632 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 6 ms 636 KB Output is correct
10 Correct 6 ms 632 KB Output is correct
11 Correct 6 ms 636 KB Output is correct
12 Correct 6 ms 632 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 6 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 10 ms 2168 KB Output is correct
18 Correct 11 ms 2168 KB Output is correct
19 Correct 11 ms 2168 KB Output is correct
20 Correct 8 ms 1528 KB Output is correct
21 Correct 11 ms 2040 KB Output is correct
22 Incorrect 11 ms 2040 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1656 KB Output is correct
2 Correct 11 ms 1460 KB Output is correct
3 Correct 10 ms 1276 KB Output is correct
4 Correct 5 ms 380 KB Output is correct
5 Correct 12 ms 1448 KB Output is correct
6 Correct 12 ms 1400 KB Output is correct
7 Correct 12 ms 1400 KB Output is correct
8 Correct 11 ms 1400 KB Output is correct
9 Correct 11 ms 1400 KB Output is correct
10 Correct 9 ms 632 KB Output is correct
11 Correct 10 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 1566 ms 426492 KB Output is correct
3 Execution timed out 5442 ms 799108 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 632 KB Output is correct
3 Correct 6 ms 632 KB Output is correct
4 Correct 6 ms 632 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 6 ms 632 KB Output is correct
7 Correct 6 ms 632 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 6 ms 636 KB Output is correct
10 Correct 6 ms 632 KB Output is correct
11 Correct 6 ms 636 KB Output is correct
12 Correct 6 ms 632 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 6 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 10 ms 2168 KB Output is correct
18 Correct 11 ms 2168 KB Output is correct
19 Correct 11 ms 2168 KB Output is correct
20 Correct 8 ms 1528 KB Output is correct
21 Correct 11 ms 2040 KB Output is correct
22 Incorrect 11 ms 2040 KB Output isn't correct
23 Halted 0 ms 0 KB -