oj.uz

Submission #146960

# Submission time Handle Problem Language Result Execution time Memory
146960 2019-08-26T20:54:18 Z nikolapesic2802 Rectangles (IOI19_rect) C++17
59 / 100
 5000 ms 642968 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " << (x) << "\n";

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}

const int N=2501;
vector<int> in;
struct segTree{
    vector<int> mi;
    void init(int l=0,int r=N-1,int i=1)
    {
        if(i==1)
            mi.resize(4*N),in.resize(N);
        if(l==r)
        {
            mi[i]=in[l];
            return;
        }
        int m=(l+r)>>1;
        init(l,m,2*i);
        init(m+1,r,2*i+1);
        mi[i]=min(mi[2*i],mi[2*i+1]);
    }
    int get(int qs,int qe,int l=0,int r=N-1,int i=1)
    {
        if(qs>r||qe<l)
            return INT_MAX;
        if(qs<=l&&qe>=r)
            return mi[i];
        int m=(l+r)>>1;
        return min(get(qs,qe,l,m,2*i),get(qs,qe,m+1,r,2*i+1));
    }
}r1[N],r2[N],c1[N],c2[N];
int l[N][N],r[N][N],d[N][N],u[N][N];
map<pair<pair<int,int>,pair<int,int> >,int> done;
ll count_rectangles(vector<vector<int> > a)
{
    int n=a.size(),m=a[0].size(),sol=0;
    vector<pair<int,int> > stk;
    for(int i=0;i<n;i++)
    {
        stk={{INT_MAX,-1}};
        for(int j=0;j<m;j++)
        {
            while(stk.back().f<a[i][j])
                stk.pop_back();
            l[i][j]=j-stk.back().s-1;
            stk.pb({a[i][j],j});
        }
        stk={{INT_MAX,m}};
        for(int j=m-1;j>=0;j--)
        {
            while(stk.back().f<a[i][j])
                stk.pop_back();
            r[i][j]=stk.back().s-j-1;
            stk.pb({a[i][j],j});
        }
    }
    for(int j=0;j<m;j++)
    {
        stk={{INT_MAX,-1}};
        for(int i=0;i<n;i++)
        {
            while(stk.back().f<a[i][j])
                stk.pop_back();
            u[i][j]=i-stk.back().s-1;
            stk.pb({a[i][j],i});
        }
        stk={{INT_MAX,n}};
        for(int i=n-1;i>=0;i--)
        {
            while(stk.back().f<a[i][j])
                stk.pop_back();
            d[i][j]=stk.back().s-i-1;
            stk.pb({a[i][j],i});
        }
    }
    for(int j=0;j<m;j++)
    {
        in.clear();
        for(int i=0;i<n;i++)
            in.pb(l[i][j]);
        c1[j].init();
    }
    for(int j=0;j<m;j++)
    {
        in.clear();
        for(int i=0;i<n;i++)
            in.pb(r[i][j]);
        c2[j].init();
    }
    for(int i=0;i<n;i++)
    {
        in.clear();
        for(int j=0;j<m;j++)
            in.pb(u[i][j]);
        r1[i].init();
    }
    for(int i=0;i<n;i++)
    {
        in.clear();
        for(int j=0;j<m;j++)
            in.pb(d[i][j]);
        r2[i].init();
    }
    for(int i=0;i<n;i++)
    {
        stk={{INT_MAX,-1}};
        for(int j=0;j<m;j++)
        {
            while(stk.back().f<=a[i][j])
                stk.pop_back();
            l[i][j]=stk.back().s+1;
            stk.pb({a[i][j],j});
        }
        stk={{INT_MAX,m}};
        for(int j=m-1;j>=0;j--)
        {
            while(stk.back().f<=a[i][j])
                stk.pop_back();
            r[i][j]=stk.back().s-1;
            stk.pb({a[i][j],j});
        }
    }
    for(int j=0;j<m;j++)
    {
        stk={{INT_MAX,-1}};
        for(int i=0;i<n;i++)
        {
            while(stk.back().f<=a[i][j])
                stk.pop_back();
            u[i][j]=stk.back().s+1;
            stk.pb({a[i][j],i});
        }
        stk={{INT_MAX,n}};
        for(int i=n-1;i>=0;i--)
        {
            while(stk.back().f<=a[i][j])
                stk.pop_back();
            d[i][j]=stk.back().s-1;
            stk.pb({a[i][j],i});
        }
    }
    for(int i=1;i<n-1;i++)
        for(int j=1;j<m-1;j++)
            sol+=r[i][j]<m-1&&l[i][j]>0&&u[i][j]>0&&d[i][j]<n-1&&done[{{l[i][j],r[i][j]},{u[i][j],d[i][j]}}]==0&&c1[r[i][j]+1].get(u[i][j],d[i][j])>r[i][j]-l[i][j]&&c2[l[i][j]-1].get(u[i][j],d[i][j])>r[i][j]-l[i][j]&&r1[d[i][j]+1].get(l[i][j],r[i][j])>d[i][j]-u[i][j]&&r2[u[i][j]-1].get(l[i][j],r[i][j])>d[i][j]-u[i][j],done[{{l[i][j],r[i][j]},{u[i][j],d[i][j]}}]=1;
    return sol;
}
/*int main()
{
    freopen("rect.in","r",stdin);
    int n,m;
    scanf("%i %i",&n,&m);
    vector<vector<int> > mat(n,vector<int>(m));
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
            scanf("%i",&mat[i][j]);
    printf("%lld\n",count_rectangles(mat));
}*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1532 KB Output is correct
2 Correct 10 ms 5752 KB Output is correct
3 Correct 10 ms 5880 KB Output is correct
4 Correct 10 ms 5880 KB Output is correct
5 Correct 10 ms 5752 KB Output is correct
6 Correct 11 ms 5880 KB Output is correct
7 Correct 8 ms 4472 KB Output is correct
8 Correct 7 ms 4088 KB Output is correct
9 Correct 10 ms 5752 KB Output is correct
10 Correct 10 ms 5752 KB Output is correct
11 Correct 10 ms 5880 KB Output is correct
12 Correct 10 ms 5752 KB Output is correct
13 Correct 2 ms 760 KB Output is correct
14 Correct 4 ms 1656 KB Output is correct
15 Correct 5 ms 2296 KB Output is correct
16 Correct 3 ms 1144 KB Output is correct
17 Correct 2 ms 760 KB Output is correct
18 Correct 3 ms 1144 KB Output is correct
19 Correct 10 ms 5752 KB Output is correct
20 Correct 8 ms 4600 KB Output is correct
21 Correct 4 ms 1656 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1532 KB Output is correct
2 Correct 10 ms 5752 KB Output is correct
3 Correct 10 ms 5880 KB Output is correct
4 Correct 10 ms 5880 KB Output is correct
5 Correct 10 ms 5752 KB Output is correct
6 Correct 11 ms 5880 KB Output is correct
7 Correct 8 ms 4472 KB Output is correct
8 Correct 7 ms 4088 KB Output is correct
9 Correct 10 ms 5752 KB Output is correct
10 Correct 10 ms 5752 KB Output is correct
11 Correct 10 ms 5880 KB Output is correct
12 Correct 10 ms 5752 KB Output is correct
13 Correct 2 ms 760 KB Output is correct
14 Correct 4 ms 1656 KB Output is correct
15 Correct 5 ms 2296 KB Output is correct
16 Correct 3 ms 1144 KB Output is correct
17 Correct 27 ms 14968 KB Output is correct
18 Correct 27 ms 14940 KB Output is correct
19 Correct 27 ms 14968 KB Output is correct
20 Correct 26 ms 14712 KB Output is correct
21 Correct 28 ms 14800 KB Output is correct
22 Correct 28 ms 14840 KB Output is correct
23 Correct 28 ms 14968 KB Output is correct
24 Correct 22 ms 11512 KB Output is correct
25 Correct 2 ms 760 KB Output is correct
26 Correct 3 ms 1144 KB Output is correct
27 Correct 10 ms 5752 KB Output is correct
28 Correct 8 ms 4600 KB Output is correct
29 Correct 4 ms 1656 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1532 KB Output is correct
2 Correct 10 ms 5752 KB Output is correct
3 Correct 10 ms 5880 KB Output is correct
4 Correct 10 ms 5880 KB Output is correct
5 Correct 10 ms 5752 KB Output is correct
6 Correct 11 ms 5880 KB Output is correct
7 Correct 8 ms 4472 KB Output is correct
8 Correct 7 ms 4088 KB Output is correct
9 Correct 10 ms 5752 KB Output is correct
10 Correct 10 ms 5752 KB Output is correct
11 Correct 10 ms 5880 KB Output is correct
12 Correct 10 ms 5752 KB Output is correct
13 Correct 2 ms 760 KB Output is correct
14 Correct 4 ms 1656 KB Output is correct
15 Correct 5 ms 2296 KB Output is correct
16 Correct 3 ms 1144 KB Output is correct
17 Correct 27 ms 14968 KB Output is correct
18 Correct 27 ms 14940 KB Output is correct
19 Correct 27 ms 14968 KB Output is correct
20 Correct 26 ms 14712 KB Output is correct
21 Correct 28 ms 14800 KB Output is correct
22 Correct 28 ms 14840 KB Output is correct
23 Correct 28 ms 14968 KB Output is correct
24 Correct 22 ms 11512 KB Output is correct
25 Correct 92 ms 38508 KB Output is correct
26 Correct 94 ms 38520 KB Output is correct
27 Correct 91 ms 38524 KB Output is correct
28 Correct 84 ms 37636 KB Output is correct
29 Correct 98 ms 38460 KB Output is correct
30 Correct 98 ms 38520 KB Output is correct
31 Correct 102 ms 38136 KB Output is correct
32 Correct 98 ms 37880 KB Output is correct
33 Correct 2 ms 760 KB Output is correct
34 Correct 3 ms 1144 KB Output is correct
35 Correct 10 ms 5752 KB Output is correct
36 Correct 8 ms 4600 KB Output is correct
37 Correct 4 ms 1656 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1532 KB Output is correct
2 Correct 10 ms 5752 KB Output is correct
3 Correct 10 ms 5880 KB Output is correct
4 Correct 10 ms 5880 KB Output is correct
5 Correct 10 ms 5752 KB Output is correct
6 Correct 11 ms 5880 KB Output is correct
7 Correct 8 ms 4472 KB Output is correct
8 Correct 7 ms 4088 KB Output is correct
9 Correct 10 ms 5752 KB Output is correct
10 Correct 10 ms 5752 KB Output is correct
11 Correct 10 ms 5880 KB Output is correct
12 Correct 10 ms 5752 KB Output is correct
13 Correct 2 ms 760 KB Output is correct
14 Correct 4 ms 1656 KB Output is correct
15 Correct 5 ms 2296 KB Output is correct
16 Correct 3 ms 1144 KB Output is correct
17 Correct 27 ms 14968 KB Output is correct
18 Correct 27 ms 14940 KB Output is correct
19 Correct 27 ms 14968 KB Output is correct
20 Correct 26 ms 14712 KB Output is correct
21 Correct 28 ms 14800 KB Output is correct
22 Correct 28 ms 14840 KB Output is correct
23 Correct 28 ms 14968 KB Output is correct
24 Correct 22 ms 11512 KB Output is correct
25 Correct 92 ms 38508 KB Output is correct
26 Correct 94 ms 38520 KB Output is correct
27 Correct 91 ms 38524 KB Output is correct
28 Correct 84 ms 37636 KB Output is correct
29 Correct 98 ms 38460 KB Output is correct
30 Correct 98 ms 38520 KB Output is correct
31 Correct 102 ms 38136 KB Output is correct
32 Correct 98 ms 37880 KB Output is correct
33 Correct 540 ms 163576 KB Output is correct
34 Correct 455 ms 163704 KB Output is correct
35 Correct 659 ms 163652 KB Output is correct
36 Correct 557 ms 163620 KB Output is correct
37 Correct 841 ms 163576 KB Output is correct
38 Correct 848 ms 163448 KB Output is correct
39 Correct 850 ms 163704 KB Output is correct
40 Correct 771 ms 156536 KB Output is correct
41 Correct 534 ms 145580 KB Output is correct
42 Correct 661 ms 150616 KB Output is correct
43 Correct 1043 ms 163548 KB Output is correct
44 Correct 1036 ms 163548 KB Output is correct
45 Correct 512 ms 115036 KB Output is correct
46 Correct 544 ms 109688 KB Output is correct
47 Correct 908 ms 157816 KB Output is correct
48 Correct 912 ms 158204 KB Output is correct
49 Correct 2 ms 760 KB Output is correct
50 Correct 3 ms 1144 KB Output is correct
51 Correct 10 ms 5752 KB Output is correct
52 Correct 8 ms 4600 KB Output is correct
53 Correct 4 ms 1656 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 197084 KB Output is correct
2 Correct 254 ms 167484 KB Output is correct
3 Correct 290 ms 196984 KB Output is correct
4 Correct 3 ms 888 KB Output is correct
5 Correct 292 ms 196984 KB Output is correct
6 Correct 317 ms 196984 KB Output is correct
7 Correct 292 ms 196984 KB Output is correct
8 Correct 292 ms 197096 KB Output is correct
9 Correct 300 ms 197028 KB Output is correct
10 Correct 290 ms 196572 KB Output is correct
11 Correct 289 ms 196808 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2296 KB Output is correct
2 Correct 3168 ms 423352 KB Output is correct
3 Execution timed out 5057 ms 642968 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1532 KB Output is correct
2 Correct 10 ms 5752 KB Output is correct
3 Correct 10 ms 5880 KB Output is correct
4 Correct 10 ms 5880 KB Output is correct
5 Correct 10 ms 5752 KB Output is correct
6 Correct 11 ms 5880 KB Output is correct
7 Correct 8 ms 4472 KB Output is correct
8 Correct 7 ms 4088 KB Output is correct
9 Correct 10 ms 5752 KB Output is correct
10 Correct 10 ms 5752 KB Output is correct
11 Correct 10 ms 5880 KB Output is correct
12 Correct 10 ms 5752 KB Output is correct
13 Correct 2 ms 760 KB Output is correct
14 Correct 4 ms 1656 KB Output is correct
15 Correct 5 ms 2296 KB Output is correct
16 Correct 3 ms 1144 KB Output is correct
17 Correct 27 ms 14968 KB Output is correct
18 Correct 27 ms 14940 KB Output is correct
19 Correct 27 ms 14968 KB Output is correct
20 Correct 26 ms 14712 KB Output is correct
21 Correct 28 ms 14800 KB Output is correct
22 Correct 28 ms 14840 KB Output is correct
23 Correct 28 ms 14968 KB Output is correct
24 Correct 22 ms 11512 KB Output is correct
25 Correct 92 ms 38508 KB Output is correct
26 Correct 94 ms 38520 KB Output is correct
27 Correct 91 ms 38524 KB Output is correct
28 Correct 84 ms 37636 KB Output is correct
29 Correct 98 ms 38460 KB Output is correct
30 Correct 98 ms 38520 KB Output is correct
31 Correct 102 ms 38136 KB Output is correct
32 Correct 98 ms 37880 KB Output is correct
33 Correct 540 ms 163576 KB Output is correct
34 Correct 455 ms 163704 KB Output is correct
35 Correct 659 ms 163652 KB Output is correct
36 Correct 557 ms 163620 KB Output is correct
37 Correct 841 ms 163576 KB Output is correct
38 Correct 848 ms 163448 KB Output is correct
39 Correct 850 ms 163704 KB Output is correct
40 Correct 771 ms 156536 KB Output is correct
41 Correct 534 ms 145580 KB Output is correct
42 Correct 661 ms 150616 KB Output is correct
43 Correct 1043 ms 163548 KB Output is correct
44 Correct 1036 ms 163548 KB Output is correct
45 Correct 512 ms 115036 KB Output is correct
46 Correct 544 ms 109688 KB Output is correct
47 Correct 908 ms 157816 KB Output is correct
48 Correct 912 ms 158204 KB Output is correct
49 Correct 301 ms 197084 KB Output is correct
50 Correct 254 ms 167484 KB Output is correct
51 Correct 290 ms 196984 KB Output is correct
52 Correct 3 ms 888 KB Output is correct
53 Correct 292 ms 196984 KB Output is correct
54 Correct 317 ms 196984 KB Output is correct
55 Correct 292 ms 196984 KB Output is correct
56 Correct 292 ms 197096 KB Output is correct
57 Correct 300 ms 197028 KB Output is correct
58 Correct 290 ms 196572 KB Output is correct
59 Correct 289 ms 196808 KB Output is correct
60 Correct 5 ms 2296 KB Output is correct
61 Correct 3168 ms 423352 KB Output is correct
62 Execution timed out 5057 ms 642968 KB Time limit exceeded
63 Halted 0 ms 0 KB -