oj.uz

Submission #199909

# Submission time Handle Problem Language Result Execution time Memory
199909 2020-02-03T23:50:55 Z medk Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 922884 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);
}
 
int connect(int i, int j)
{
    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];
  return i;
}
 
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]++;
            int par=getp(vp[j].y);
            if(vp[j].y!=m-1)
                if(tmp[vp[j].y+1]==i)
                    par=connect(par, vp[j].y+1);
            if(vp[j].y!=0)
                if(tmp[vp[j].y-1]==i)
                    par=connect(par, vp[j].y-1);
            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][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]++;
            int par=getp(vp[j].y);
            if(vp[j].y!=n-1)
                if(tmp[vp[j].y+1]==i)
                    par=connect(par, vp[j].y+1);
            if(vp[j].y!=0)
                if(tmp[vp[j].y-1]==i)
                    par=connect(par, vp[j].y-1);
            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[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;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 49400 KB Output is correct
2 Correct 34 ms 49400 KB Output is correct
3 Correct 35 ms 49404 KB Output is correct
4 Correct 36 ms 49456 KB Output is correct
5 Correct 34 ms 49400 KB Output is correct
6 Correct 37 ms 49400 KB Output is correct
7 Correct 35 ms 49400 KB Output is correct
8 Correct 35 ms 49400 KB Output is correct
9 Correct 34 ms 49400 KB Output is correct
10 Correct 36 ms 49400 KB Output is correct
11 Correct 35 ms 49400 KB Output is correct
12 Correct 34 ms 49400 KB Output is correct
13 Correct 34 ms 49272 KB Output is correct
14 Correct 33 ms 49400 KB Output is correct
15 Correct 34 ms 49400 KB Output is correct
16 Correct 34 ms 49276 KB Output is correct
17 Correct 35 ms 49400 KB Output is correct
18 Correct 34 ms 49272 KB Output is correct
19 Correct 34 ms 49400 KB Output is correct
20 Correct 35 ms 49276 KB Output is correct
21 Correct 34 ms 49400 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 49400 KB Output is correct
2 Correct 34 ms 49400 KB Output is correct
3 Correct 35 ms 49404 KB Output is correct
4 Correct 36 ms 49456 KB Output is correct
5 Correct 34 ms 49400 KB Output is correct
6 Correct 37 ms 49400 KB Output is correct
7 Correct 35 ms 49400 KB Output is correct
8 Correct 35 ms 49400 KB Output is correct
9 Correct 34 ms 49400 KB Output is correct
10 Correct 36 ms 49400 KB Output is correct
11 Correct 35 ms 49400 KB Output is correct
12 Correct 34 ms 49400 KB Output is correct
13 Correct 34 ms 49272 KB Output is correct
14 Correct 33 ms 49400 KB Output is correct
15 Correct 34 ms 49400 KB Output is correct
16 Correct 34 ms 49276 KB Output is correct
17 Correct 41 ms 50040 KB Output is correct
18 Correct 39 ms 50040 KB Output is correct
19 Correct 37 ms 49912 KB Output is correct
20 Correct 37 ms 49784 KB Output is correct
21 Correct 37 ms 50168 KB Output is correct
22 Correct 37 ms 50168 KB Output is correct
23 Correct 37 ms 50296 KB Output is correct
24 Correct 36 ms 49784 KB Output is correct
25 Correct 35 ms 49400 KB Output is correct
26 Correct 34 ms 49272 KB Output is correct
27 Correct 34 ms 49400 KB Output is correct
28 Correct 35 ms 49276 KB Output is correct
29 Correct 34 ms 49400 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 49400 KB Output is correct
2 Correct 34 ms 49400 KB Output is correct
3 Correct 35 ms 49404 KB Output is correct
4 Correct 36 ms 49456 KB Output is correct
5 Correct 34 ms 49400 KB Output is correct
6 Correct 37 ms 49400 KB Output is correct
7 Correct 35 ms 49400 KB Output is correct
8 Correct 35 ms 49400 KB Output is correct
9 Correct 34 ms 49400 KB Output is correct
10 Correct 36 ms 49400 KB Output is correct
11 Correct 35 ms 49400 KB Output is correct
12 Correct 34 ms 49400 KB Output is correct
13 Correct 34 ms 49272 KB Output is correct
14 Correct 33 ms 49400 KB Output is correct
15 Correct 34 ms 49400 KB Output is correct
16 Correct 34 ms 49276 KB Output is correct
17 Correct 41 ms 50040 KB Output is correct
18 Correct 39 ms 50040 KB Output is correct
19 Correct 37 ms 49912 KB Output is correct
20 Correct 37 ms 49784 KB Output is correct
21 Correct 37 ms 50168 KB Output is correct
22 Correct 37 ms 50168 KB Output is correct
23 Correct 37 ms 50296 KB Output is correct
24 Correct 36 ms 49784 KB Output is correct
25 Correct 57 ms 53368 KB Output is correct
26 Correct 58 ms 53344 KB Output is correct
27 Correct 57 ms 53408 KB Output is correct
28 Correct 51 ms 52400 KB Output is correct
29 Correct 64 ms 55516 KB Output is correct
30 Correct 58 ms 55592 KB Output is correct
31 Correct 58 ms 55208 KB Output is correct
32 Correct 58 ms 55208 KB Output is correct
33 Correct 35 ms 49400 KB Output is correct
34 Correct 34 ms 49272 KB Output is correct
35 Correct 34 ms 49400 KB Output is correct
36 Correct 35 ms 49276 KB Output is correct
37 Correct 34 ms 49400 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 49400 KB Output is correct
2 Correct 34 ms 49400 KB Output is correct
3 Correct 35 ms 49404 KB Output is correct
4 Correct 36 ms 49456 KB Output is correct
5 Correct 34 ms 49400 KB Output is correct
6 Correct 37 ms 49400 KB Output is correct
7 Correct 35 ms 49400 KB Output is correct
8 Correct 35 ms 49400 KB Output is correct
9 Correct 34 ms 49400 KB Output is correct
10 Correct 36 ms 49400 KB Output is correct
11 Correct 35 ms 49400 KB Output is correct
12 Correct 34 ms 49400 KB Output is correct
13 Correct 34 ms 49272 KB Output is correct
14 Correct 33 ms 49400 KB Output is correct
15 Correct 34 ms 49400 KB Output is correct
16 Correct 34 ms 49276 KB Output is correct
17 Correct 41 ms 50040 KB Output is correct
18 Correct 39 ms 50040 KB Output is correct
19 Correct 37 ms 49912 KB Output is correct
20 Correct 37 ms 49784 KB Output is correct
21 Correct 37 ms 50168 KB Output is correct
22 Correct 37 ms 50168 KB Output is correct
23 Correct 37 ms 50296 KB Output is correct
24 Correct 36 ms 49784 KB Output is correct
25 Correct 57 ms 53368 KB Output is correct
26 Correct 58 ms 53344 KB Output is correct
27 Correct 57 ms 53408 KB Output is correct
28 Correct 51 ms 52400 KB Output is correct
29 Correct 64 ms 55516 KB Output is correct
30 Correct 58 ms 55592 KB Output is correct
31 Correct 58 ms 55208 KB Output is correct
32 Correct 58 ms 55208 KB Output is correct
33 Correct 198 ms 76384 KB Output is correct
34 Correct 189 ms 87688 KB Output is correct
35 Correct 197 ms 87688 KB Output is correct
36 Correct 187 ms 99976 KB Output is correct
37 Correct 346 ms 99064 KB Output is correct
38 Correct 339 ms 98936 KB Output is correct
39 Correct 340 ms 99064 KB Output is correct
40 Correct 317 ms 95868 KB Output is correct
41 Correct 202 ms 76580 KB Output is correct
42 Correct 251 ms 90636 KB Output is correct
43 Correct 420 ms 120584 KB Output is correct
44 Correct 427 ms 121224 KB Output is correct
45 Correct 220 ms 85020 KB Output is correct
46 Correct 220 ms 85156 KB Output is correct
47 Correct 399 ms 115464 KB Output is correct
48 Correct 409 ms 115860 KB Output is correct
49 Correct 35 ms 49400 KB Output is correct
50 Correct 34 ms 49272 KB Output is correct
51 Correct 34 ms 49400 KB Output is correct
52 Correct 35 ms 49276 KB Output is correct
53 Correct 34 ms 49400 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 49784 KB Output is correct
2 Correct 45 ms 49784 KB Output is correct
3 Correct 46 ms 49400 KB Output is correct
4 Correct 33 ms 49272 KB Output is correct
5 Correct 50 ms 49656 KB Output is correct
6 Correct 47 ms 49656 KB Output is correct
7 Correct 47 ms 49704 KB Output is correct
8 Correct 47 ms 49656 KB Output is correct
9 Correct 45 ms 49660 KB Output is correct
10 Correct 44 ms 49400 KB Output is correct
11 Correct 45 ms 49400 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 49404 KB Output is correct
2 Correct 1068 ms 221884 KB Output is correct
3 Correct 2372 ms 391780 KB Output is correct
4 Correct 2385 ms 392760 KB Output is correct
5 Correct 2380 ms 392964 KB Output is correct
6 Correct 420 ms 73592 KB Output is correct
7 Correct 775 ms 95596 KB Output is correct
8 Correct 882 ms 98548 KB Output is correct
9 Correct 35 ms 49400 KB Output is correct
10 Correct 34 ms 49272 KB Output is correct
11 Correct 34 ms 49400 KB Output is correct
12 Correct 35 ms 49276 KB Output is correct
13 Correct 34 ms 49400 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 49400 KB Output is correct
2 Correct 34 ms 49400 KB Output is correct
3 Correct 35 ms 49404 KB Output is correct
4 Correct 36 ms 49456 KB Output is correct
5 Correct 34 ms 49400 KB Output is correct
6 Correct 37 ms 49400 KB Output is correct
7 Correct 35 ms 49400 KB Output is correct
8 Correct 35 ms 49400 KB Output is correct
9 Correct 34 ms 49400 KB Output is correct
10 Correct 36 ms 49400 KB Output is correct
11 Correct 35 ms 49400 KB Output is correct
12 Correct 34 ms 49400 KB Output is correct
13 Correct 34 ms 49272 KB Output is correct
14 Correct 33 ms 49400 KB Output is correct
15 Correct 34 ms 49400 KB Output is correct
16 Correct 34 ms 49276 KB Output is correct
17 Correct 41 ms 50040 KB Output is correct
18 Correct 39 ms 50040 KB Output is correct
19 Correct 37 ms 49912 KB Output is correct
20 Correct 37 ms 49784 KB Output is correct
21 Correct 37 ms 50168 KB Output is correct
22 Correct 37 ms 50168 KB Output is correct
23 Correct 37 ms 50296 KB Output is correct
24 Correct 36 ms 49784 KB Output is correct
25 Correct 57 ms 53368 KB Output is correct
26 Correct 58 ms 53344 KB Output is correct
27 Correct 57 ms 53408 KB Output is correct
28 Correct 51 ms 52400 KB Output is correct
29 Correct 64 ms 55516 KB Output is correct
30 Correct 58 ms 55592 KB Output is correct
31 Correct 58 ms 55208 KB Output is correct
32 Correct 58 ms 55208 KB Output is correct
33 Correct 198 ms 76384 KB Output is correct
34 Correct 189 ms 87688 KB Output is correct
35 Correct 197 ms 87688 KB Output is correct
36 Correct 187 ms 99976 KB Output is correct
37 Correct 346 ms 99064 KB Output is correct
38 Correct 339 ms 98936 KB Output is correct
39 Correct 340 ms 99064 KB Output is correct
40 Correct 317 ms 95868 KB Output is correct
41 Correct 202 ms 76580 KB Output is correct
42 Correct 251 ms 90636 KB Output is correct
43 Correct 420 ms 120584 KB Output is correct
44 Correct 427 ms 121224 KB Output is correct
45 Correct 220 ms 85020 KB Output is correct
46 Correct 220 ms 85156 KB Output is correct
47 Correct 399 ms 115464 KB Output is correct
48 Correct 409 ms 115860 KB Output is correct
49 Correct 47 ms 49784 KB Output is correct
50 Correct 45 ms 49784 KB Output is correct
51 Correct 46 ms 49400 KB Output is correct
52 Correct 33 ms 49272 KB Output is correct
53 Correct 50 ms 49656 KB Output is correct
54 Correct 47 ms 49656 KB Output is correct
55 Correct 47 ms 49704 KB Output is correct
56 Correct 47 ms 49656 KB Output is correct
57 Correct 45 ms 49660 KB Output is correct
58 Correct 44 ms 49400 KB Output is correct
59 Correct 45 ms 49400 KB Output is correct
60 Correct 35 ms 49404 KB Output is correct
61 Correct 1068 ms 221884 KB Output is correct
62 Correct 2372 ms 391780 KB Output is correct
63 Correct 2385 ms 392760 KB Output is correct
64 Correct 2380 ms 392964 KB Output is correct
65 Correct 420 ms 73592 KB Output is correct
66 Correct 775 ms 95596 KB Output is correct
67 Correct 882 ms 98548 KB Output is correct
68 Correct 2238 ms 392056 KB Output is correct
69 Correct 2267 ms 538460 KB Output is correct
70 Correct 2297 ms 540800 KB Output is correct
71 Correct 2303 ms 687420 KB Output is correct
72 Correct 4392 ms 685120 KB Output is correct
73 Correct 3520 ms 599196 KB Output is correct
74 Correct 3675 ms 632628 KB Output is correct
75 Execution timed out 5097 ms 922884 KB Time limit exceeded
76 Halted 0 ms 0 KB -