oj.uz

Submission #937444

# Submission time Handle Problem Language Result Execution time Memory
937444 2024-03-04T04:13:09 Z GrindMachine Rectangles (IOI19_rect) C++17
100 / 100
 2731 ms 659332 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

read some solutions long back, remember some ideas from there

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "rect.h"
 
template<typename T>
struct fenwick {
    int siz;
    vector<T> tree;
 
    fenwick() {
 
    }
 
    fenwick(int n) {
        siz = n;
        tree = vector<T>(n + 1);
    }
 
    int lsb(int x) {
        return x & -x;
    }
 
    void build(vector<T> &a, int n) {
        for (int i = 1; i <= n; ++i) {
            int par = i + lsb(i);
            tree[i] += a[i];
 
            if (par <= siz) {
                tree[par] += tree[i];
            }
        }
    }
 
    void pupd(int i, T v) {
        i++;
        while (i <= siz) {
            tree[i] += v;
            i += lsb(i);
        }
    }
 
    T sum(int i) {
        i++;
        T res = 0;
 
        while (i) {
            res += tree[i];
            i -= lsb(i);
        }
 
        return res;
    }
 
    T query(int l, int r) {
        if (l > r) return 0;
        T res = sum(r) - sum(l - 1);
        return res;
    }
};
 
long long count_rectangles(std::vector<std::vector<int> > a) {
    int n = sz(a), m = sz(a[0]);
    if(n <= 2 or m <= 2) return 0;
 
    vector<pii> up[n][m];
    int ptr = 0;
 
    rep(j,m){
        stack<int> st;
        rep(i,n){
            bool eq = false;
            while(!st.empty() and a[i][j] >= a[st.top()][j]){
                int k = st.top();
                st.pop();
                if(a[i][j] == a[k][j]){
                    eq = true;
                }
                if(i-k >= 2){
                    up[i][j].pb({k,ptr++});
                }
            }
 
            if(!st.empty() and !eq){
                int k = st.top();
                if(i-k >= 2){
                    up[i][j].pb({k,ptr++});
                }
            }
 
            st.push(i);
        }
    }
 
    vector<int> farthest(ptr);
    int seg_ptr[n][n];
    memset(seg_ptr,-1,sizeof seg_ptr);

    rev(j,m-1,0){
        if(j+2 < m){
            rep(i,n){
                for(auto [k,ptr] : up[i][j+2]){
                    seg_ptr[k][i] = -1;
                }
            }   
        }

        if(j+1 < m){
            rep(i,n){
                for(auto [k,ptr] : up[i][j+1]){
                    seg_ptr[k][i] = ptr;
                }
            }   
        }

        rep(i,n){
            for(auto [k,ptr] : up[i][j]){
                if(seg_ptr[k][i] != -1){
                    farthest[ptr] = farthest[seg_ptr[k][i]];
                }
                else{
                    farthest[ptr] = j;
                }
            }
        }
    }
 
    int prev_occ[m][m], first_occ[m][m];
    memset(prev_occ,-1,sizeof prev_occ);
    memset(first_occ,-1,sizeof first_occ);
 
    ll ans = 0;
    vector<int> queries[ptr];
 
    rep1(i,n-2){
        stack<int> st;
        vector<pii> good;
        rep(j,m){
            bool eq = false;
            while(!st.empty() and a[i][j] >= a[i][st.top()]){
                int k = st.top();
                st.pop();
                if(a[i][j] == a[i][k]){
                    eq = true;
                }
                if(j-k >= 2){
                    good.pb({k,j});
                }
            }
 
            // cout << j << endl;
            // cout << eq << endl;
            // auto st_copy = st;
            // while(!st_copy.empty()){
            //  cout << st_copy.top() << " ";
            //  st_copy.pop();
            // }
            // cout << endl;
 
            if(!st.empty() and !eq){
                int k = st.top();
                if(j-k >= 2){
                    // cout << k << " " << j << endl;
                    good.pb({k,j});
                }
            }
 
            st.push(j);
        }
 
        for(auto [l,r] : good){
            if(prev_occ[l][r] != i-1){
                first_occ[l][r] = i;
            }
 
            prev_occ[l][r] = i;
 
            int lo = 0, hi = sz(up[i+1][l+1])-1;
            int pos = -1;
 
            while(lo <= hi){
                int mid = (lo+hi) >> 1;
                if(up[i+1][l+1][mid].ff >= first_occ[l][r]-1){
                    pos = mid;
                    lo = mid+1;
                }
                else{
                    hi = mid-1;
                }
            }
 
            if(pos != -1){
                int ind = up[i+1][l+1][pos].ss;
                queries[ind].pb(r);
            }
 
            /*
 
            for(auto [k,ptr] : up[i+1][l+1]){
                if(k >= first_occ[l][r]-1){
                    if(farthest[ptr] >= r-1){
                        ans++;
                    }
                }
                else{
                    break;
                }
            }
 
            */
        }
    }
 
    fenwick<int> fenw(m);
 
    rep(i,n){
        rep(j,m){
            for(auto [k,ptr] : up[i][j]){
                fenw.pupd(farthest[ptr],1);
                trav(r,queries[ptr]){
                    ans += fenw.query(r-1,m-1);
                }
            }
 
            for(auto [k,ptr] : up[i][j]){
                fenw.pupd(farthest[ptr],-1);
            }
        }
    }
 
    /*
 
    int oans = 0;
 
    rep1(i1,n-2){
        rep1(j1,m-2){
            for(int i2 = i1; i2 < n-1; ++i2){
                for(int j2 = j1; j2 < m-1; ++j2){
                    bool ok = true;
                    for(int r = i1; r <= i2; ++r){
                        for(int c = j1; c <= j2; ++c){
                            if(a[r][c] >= min({a[i1-1][c],a[i2+1][c],a[r][j1-1],a[r][j2+1]})){
                                ok = false;
                                break;
                            }
                        }
                        if(!ok) break;
                    }
 
                    if(ok){
                        oans++;
                        cout << i1 << " " << j1 << " " << i2 << " " << j2 << endl;
                    }
                }
            }
        }
    }
    
    */
    
    // cout << ans << endl;
    // cout << oans << endl;
    // cout << endl;
 
    // assert(ans == oans);
 
    return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 432 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 432 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 860 KB Output is correct
23 Correct 1 ms 860 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 2 ms 1024 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 2 ms 884 KB Output is correct
29 Correct 1 ms 604 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 432 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 2 ms 1024 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 2 ms 884 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 4 ms 3676 KB Output is correct
31 Correct 5 ms 3672 KB Output is correct
32 Correct 5 ms 3928 KB Output is correct
33 Correct 6 ms 3164 KB Output is correct
34 Correct 10 ms 4412 KB Output is correct
35 Correct 10 ms 4444 KB Output is correct
36 Correct 10 ms 4444 KB Output is correct
37 Correct 10 ms 4188 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 432 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 2 ms 1024 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 2 ms 884 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 4 ms 3676 KB Output is correct
26 Correct 5 ms 3672 KB Output is correct
27 Correct 5 ms 3928 KB Output is correct
28 Correct 6 ms 3164 KB Output is correct
29 Correct 10 ms 4412 KB Output is correct
30 Correct 10 ms 4444 KB Output is correct
31 Correct 10 ms 4444 KB Output is correct
32 Correct 10 ms 4188 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 48 ms 34056 KB Output is correct
39 Correct 51 ms 35720 KB Output is correct
40 Correct 73 ms 38900 KB Output is correct
41 Correct 70 ms 40272 KB Output is correct
42 Correct 58 ms 43604 KB Output is correct
43 Correct 58 ms 43604 KB Output is correct
44 Correct 58 ms 43860 KB Output is correct
45 Correct 55 ms 41900 KB Output is correct
46 Correct 60 ms 30584 KB Output is correct
47 Correct 85 ms 34592 KB Output is correct
48 Correct 155 ms 50004 KB Output is correct
49 Correct 165 ms 52048 KB Output is correct
50 Correct 72 ms 26192 KB Output is correct
51 Correct 76 ms 27400 KB Output is correct
52 Correct 156 ms 49208 KB Output is correct
53 Correct 153 ms 50240 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 49748 KB Output is correct
2 Correct 21 ms 35932 KB Output is correct
3 Correct 29 ms 49500 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 29 ms 49584 KB Output is correct
6 Correct 28 ms 49492 KB Output is correct
7 Correct 28 ms 49500 KB Output is correct
8 Correct 28 ms 49612 KB Output is correct
9 Correct 28 ms 49500 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 474 ms 191948 KB Output is correct
8 Correct 1189 ms 383944 KB Output is correct
9 Correct 1234 ms 385468 KB Output is correct
10 Correct 1217 ms 385520 KB Output is correct
11 Correct 173 ms 157544 KB Output is correct
12 Correct 396 ms 262472 KB Output is correct
13 Correct 410 ms 280512 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 432 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 2 ms 1024 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 2 ms 884 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 4 ms 3676 KB Output is correct
26 Correct 5 ms 3672 KB Output is correct
27 Correct 5 ms 3928 KB Output is correct
28 Correct 6 ms 3164 KB Output is correct
29 Correct 10 ms 4412 KB Output is correct
30 Correct 10 ms 4444 KB Output is correct
31 Correct 10 ms 4444 KB Output is correct
32 Correct 10 ms 4188 KB Output is correct
33 Correct 48 ms 34056 KB Output is correct
34 Correct 51 ms 35720 KB Output is correct
35 Correct 73 ms 38900 KB Output is correct
36 Correct 70 ms 40272 KB Output is correct
37 Correct 58 ms 43604 KB Output is correct
38 Correct 58 ms 43604 KB Output is correct
39 Correct 58 ms 43860 KB Output is correct
40 Correct 55 ms 41900 KB Output is correct
41 Correct 60 ms 30584 KB Output is correct
42 Correct 85 ms 34592 KB Output is correct
43 Correct 155 ms 50004 KB Output is correct
44 Correct 165 ms 52048 KB Output is correct
45 Correct 72 ms 26192 KB Output is correct
46 Correct 76 ms 27400 KB Output is correct
47 Correct 156 ms 49208 KB Output is correct
48 Correct 153 ms 50240 KB Output is correct
49 Correct 29 ms 49748 KB Output is correct
50 Correct 21 ms 35932 KB Output is correct
51 Correct 29 ms 49500 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 29 ms 49584 KB Output is correct
54 Correct 28 ms 49492 KB Output is correct
55 Correct 28 ms 49500 KB Output is correct
56 Correct 28 ms 49612 KB Output is correct
57 Correct 28 ms 49500 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 474 ms 191948 KB Output is correct
62 Correct 1189 ms 383944 KB Output is correct
63 Correct 1234 ms 385468 KB Output is correct
64 Correct 1217 ms 385520 KB Output is correct
65 Correct 173 ms 157544 KB Output is correct
66 Correct 396 ms 262472 KB Output is correct
67 Correct 410 ms 280512 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 823 ms 427188 KB Output is correct
74 Correct 859 ms 445740 KB Output is correct
75 Correct 1361 ms 494420 KB Output is correct
76 Correct 1355 ms 515664 KB Output is correct
77 Correct 1077 ms 545208 KB Output is correct
78 Correct 1480 ms 395088 KB Output is correct
79 Correct 1601 ms 408776 KB Output is correct
80 Correct 2632 ms 633540 KB Output is correct
81 Correct 1573 ms 411216 KB Output is correct
82 Correct 2056 ms 527376 KB Output is correct
83 Correct 2731 ms 659332 KB Output is correct
84 Correct 1466 ms 389628 KB Output is correct
85 Correct 2575 ms 641392 KB Output is correct
86 Correct 2547 ms 623336 KB Output is correct
87 Correct 596 ms 325420 KB Output is correct
88 Correct 1047 ms 544704 KB Output is correct
89 Correct 1024 ms 542068 KB Output is correct
90 Correct 1036 ms 541716 KB Output is correct