oj.uz

Submission #1038474

# Submission time Handle Problem Language Result Execution time Memory
1038474 2024-07-29T20:37:52 Z c2zi6 Rectangles (IOI19_rect) C++14
100 / 100
 1329 ms 468860 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "rect.h"

namespace TEST1 {
    int lg[3001];
    struct SPARSETABLE {
        VVI table;
        SPARSETABLE(){};
        SPARSETABLE(VI a) {
            int n = a.size();
            table = VVI(n, VI(14));
            reprl(i, n-1, 0) {
                table[i][0] = a[i];
                for (int j = 1; i+(1<<(j-1)) < n; j++) {
                    table[i][j] = max(table[i][j-1], table[i + (1<<(j-1))][j-1]);
                }
            }
        }
        int get(int l, int r) {
            int s = lg[r - l + 1];
            return max(table[l][s], table[r-(1<<s)+1][s]);
        }
    };
    ll count_rectangles(VVI a) {
        lg[1] = 0; replr(i, 2, 3000) lg[i] = lg[i/2]+1;
        int n = a.size();
        int m = a[0].size();
        vector<SPARSETABLE> rows(n);
        vector<SPARSETABLE> cols(m);
        rep(i, n) {
            rows[i] = SPARSETABLE(a[i]);
        }
        rep(j, m) {
            VI b;
            rep(i, n) b.pb(a[i][j]);
            cols[j] = SPARSETABLE(b);
        }
        ll ans = 0;
        replr(r1, 1, n-2) replr(r2, r1, n-2) {
            replr(c1, 1, m-2) replr(c2, c1, m-2) {
                bool good = true;
                replr(i, r1, r2) {
                    if (rows[i].get(c1, c2) >= min(a[i][c1-1], a[i][c2+1])) {
                        good = false;
                        break;
                    }
                }
                if (!good) continue;
                replr(j, c1, c2) {
                    if (cols[j].get(r1, r2) >= min(a[r1-1][j], a[r2+1][j])) {
                        good = false;
                        break;
                    }
                }
                if (!good) continue;
                /*cout << r1 << " " << r2 << " " << c1 << " " << c2 << endl;*/
                ans++;
            }
        }
        return ans;
    }
}

int gu[3000][3000], gd[3000][3000], gl[3000][3000], gr[3000][3000];
int lu[3000][3000], ru[3000][3000], ul[3000][3000], dl[3000][3000];

VL rect;
void check(int x1, int x2, int y1, int y2) {
    if (x2 < x1 || y2 < y1) return;
    /*cout << x1 << " " << x2 << " " << y1 << " " << y2 << endl;*/
    /*cout << "STATEMENTS:\n";*/
    /*cout << (gu[x2+1][y2] == x1-1 && ul[x2+1][y2] <= y1) << " || " << (gd[x1-1][y2] == x2+1 && dl[x1-1][y2] <= y1) << endl;*/
    /*cout << (gr[x2][y1-1] == y2+1 && ru[x2][y1-1] <= x1) << " || " << (gl[x2][y2+1] == y1-1 && lu[x2][y2+1] <= x1) << endl;*/
    if ((gu[x2+1][y2] == x1-1 && ul[x2+1][y2] <= y1) || (gd[x1-1][y2] == x2+1 && dl[x1-1][y2] <= y1)); else return;
    if ((gr[x2][y1-1] == y2+1 && ru[x2][y1-1] <= x1) || (gl[x2][y2+1] == y1-1 && lu[x2][y2+1] <= x1)); else return;
    rect.pb(1ll*x1*3000*3000*3000 + 1ll*x2*3000*3000 + 1ll*y1*3000 + 1ll*y2);
}

ll count_rectangles(VVI a) {
    int n = a.size();
    int m = a[0].size();
    rep(i, n) {
        stack<int> st;
        replr(j, 0, m-1) {
            while (st.size() && a[i][st.top()] < a[i][j]) st.pop();
            gl[i][j] = (st.size() ? st.top() : -1);
            st.push(j);
        }
        st = stack<int>();
        reprl(j, m-1, 0) {
            while (st.size() && a[i][st.top()] < a[i][j]) st.pop();
            gr[i][j] = (st.size() ? st.top() : -1);
            st.push(j);
        }
    }
    rep(j, m) {
        stack<int> st;
        replr(i, 0, n-1) {
            while (st.size() && a[st.top()][j] < a[i][j]) st.pop();
            gu[i][j] = (st.size() ? st.top() : -1);
            st.push(i);
        }
        st = stack<int>();
        reprl(i, n-1, 0) {
            while (st.size() && a[st.top()][j] < a[i][j]) st.pop();
            gd[i][j] = (st.size() ? st.top() : -1);
            st.push(i);
        }
    }
    rep(i, n) {
        rep(j, m) {
            if (~gl[i][j]) {
                if (i && gl[i-1][j] == gl[i][j]) lu[i][j] = lu[i-1][j];
                else if (i && gr[i-1][gl[i][j]] == j) lu[i][j] = ru[i-1][gl[i][j]];
                else lu[i][j] = i;
            }
            if (~gr[i][j]) {
                if (i && gr[i-1][j] == gr[i][j]) ru[i][j] = ru[i-1][j];
                else if (i && gl[i-1][gr[i][j]] == j) ru[i][j] = lu[i-1][gr[i][j]];
                else ru[i][j] = i;
            }
        }
    }
    rep(j, m) {
        rep(i, n) {
            if (~gu[i][j]) {
                if (j && gu[i][j-1] == gu[i][j]) ul[i][j] = ul[i][j-1];
                else if (j && gd[gu[i][j]][j-1] == i) ul[i][j] = dl[gu[i][j]][j-1];
                else ul[i][j] = j;
            }
            if (~gd[i][j]) {
                if (j && gd[i][j-1] == gd[i][j]) dl[i][j] = dl[i][j-1];
                else if (j && gu[gd[i][j]][j-1] == i) dl[i][j] = ul[gd[i][j]][j-1];
                else dl[i][j] = j;
            } else dl[i][j] = -1;
        }
    }
    rect.clear();
    replr(i, 1, n-2) replr(j, 1, m-2) {
        if (~gd[i-1][j] && ~gr[i][j-1]) check(i, gd[i-1][j]-1, j, gr[i][j-1]-1);
        if (~gd[i-1][j] && ~gl[i][j+1]) check(i, gd[i-1][j]-1, gl[i][j+1]+1, j);
        if (~gu[i+1][j] && ~gr[i][j-1]) check(gu[i+1][j]+1, i, j, gr[i][j-1]-1);
        if (~gu[i+1][j] && ~gl[i][j+1]) check(gu[i+1][j]+1, i, gl[i][j+1]+1, j);
        if (!~gr[i][j-1]) continue;
        int nextj = gr[i][j-1]-1;
        if (~gu[i+1][nextj]) check(gu[i+1][nextj]+1, i, j, nextj);
        if (~gd[i-1][nextj]) check(i, gd[i-1][nextj]-1, j, nextj);
    }
    ll ans = 0;
    if (rect.size()) {
        sort(all(rect));
        ans = 1;
        rep(i, rect.size()-1) ans += (rect[i] != rect[i+1]);
    }
    return ans;

    cout << ans << endl;
    return 0;
    if (ans == 0) return 0;
    ll real = TEST1::count_rectangles(a);
    cout << "MY ANSWER: " << ans << endl;
    cout << "REAL ANSWER: " << real << endl;
    if (real != ans) {
        rep(i, 300) cout << "ABORT ";
        cout << endl;
        rep(i, n) {
            rep(j, m) cout << a[i][j] << " ";
            cout << endl;
        }
        cout << endl;
        string _;
        while (cin >> _);
    }
    return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 18780 KB Output is correct
3 Correct 2 ms 18780 KB Output is correct
4 Correct 2 ms 18780 KB Output is correct
5 Correct 2 ms 18912 KB Output is correct
6 Correct 2 ms 18780 KB Output is correct
7 Correct 2 ms 18884 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 18780 KB Output is correct
10 Correct 3 ms 18780 KB Output is correct
11 Correct 2 ms 19032 KB Output is correct
12 Correct 2 ms 18780 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 14684 KB Output is correct
15 Correct 1 ms 14684 KB Output is correct
16 Correct 2 ms 14680 KB Output is correct
17 Correct 1 ms 8648 KB Output is correct
18 Correct 1 ms 12636 KB Output is correct
19 Correct 2 ms 19032 KB Output is correct
20 Correct 2 ms 18780 KB Output is correct
21 Correct 2 ms 14684 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 18780 KB Output is correct
3 Correct 2 ms 18780 KB Output is correct
4 Correct 2 ms 18780 KB Output is correct
5 Correct 2 ms 18912 KB Output is correct
6 Correct 2 ms 18780 KB Output is correct
7 Correct 2 ms 18884 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 18780 KB Output is correct
10 Correct 3 ms 18780 KB Output is correct
11 Correct 2 ms 19032 KB Output is correct
12 Correct 2 ms 18780 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 14684 KB Output is correct
15 Correct 1 ms 14684 KB Output is correct
16 Correct 2 ms 14680 KB Output is correct
17 Correct 1 ms 8648 KB Output is correct
18 Correct 1 ms 12636 KB Output is correct
19 Correct 2 ms 19032 KB Output is correct
20 Correct 2 ms 18780 KB Output is correct
21 Correct 2 ms 14684 KB Output is correct
22 Correct 3 ms 23388 KB Output is correct
23 Correct 3 ms 23388 KB Output is correct
24 Correct 3 ms 23388 KB Output is correct
25 Correct 3 ms 23056 KB Output is correct
26 Correct 3 ms 22984 KB Output is correct
27 Correct 3 ms 23128 KB Output is correct
28 Correct 3 ms 23144 KB Output is correct
29 Correct 3 ms 23132 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 18780 KB Output is correct
3 Correct 2 ms 18780 KB Output is correct
4 Correct 2 ms 18780 KB Output is correct
5 Correct 2 ms 18912 KB Output is correct
6 Correct 2 ms 18780 KB Output is correct
7 Correct 2 ms 18884 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 18780 KB Output is correct
10 Correct 3 ms 18780 KB Output is correct
11 Correct 2 ms 19032 KB Output is correct
12 Correct 2 ms 18780 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 14684 KB Output is correct
15 Correct 1 ms 14684 KB Output is correct
16 Correct 2 ms 14680 KB Output is correct
17 Correct 3 ms 23388 KB Output is correct
18 Correct 3 ms 23388 KB Output is correct
19 Correct 3 ms 23388 KB Output is correct
20 Correct 3 ms 23056 KB Output is correct
21 Correct 3 ms 22984 KB Output is correct
22 Correct 3 ms 23128 KB Output is correct
23 Correct 3 ms 23144 KB Output is correct
24 Correct 3 ms 23132 KB Output is correct
25 Correct 1 ms 8648 KB Output is correct
26 Correct 1 ms 12636 KB Output is correct
27 Correct 2 ms 19032 KB Output is correct
28 Correct 2 ms 18780 KB Output is correct
29 Correct 2 ms 14684 KB Output is correct
30 Correct 10 ms 37076 KB Output is correct
31 Correct 9 ms 36932 KB Output is correct
32 Correct 9 ms 37076 KB Output is correct
33 Correct 8 ms 35932 KB Output is correct
34 Correct 9 ms 36112 KB Output is correct
35 Correct 10 ms 36312 KB Output is correct
36 Correct 9 ms 36188 KB Output is correct
37 Correct 9 ms 36188 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 18780 KB Output is correct
3 Correct 2 ms 18780 KB Output is correct
4 Correct 2 ms 18780 KB Output is correct
5 Correct 2 ms 18912 KB Output is correct
6 Correct 2 ms 18780 KB Output is correct
7 Correct 2 ms 18884 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 18780 KB Output is correct
10 Correct 3 ms 18780 KB Output is correct
11 Correct 2 ms 19032 KB Output is correct
12 Correct 2 ms 18780 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 14684 KB Output is correct
15 Correct 1 ms 14684 KB Output is correct
16 Correct 2 ms 14680 KB Output is correct
17 Correct 3 ms 23388 KB Output is correct
18 Correct 3 ms 23388 KB Output is correct
19 Correct 3 ms 23388 KB Output is correct
20 Correct 3 ms 23056 KB Output is correct
21 Correct 3 ms 22984 KB Output is correct
22 Correct 3 ms 23128 KB Output is correct
23 Correct 3 ms 23144 KB Output is correct
24 Correct 3 ms 23132 KB Output is correct
25 Correct 10 ms 37076 KB Output is correct
26 Correct 9 ms 36932 KB Output is correct
27 Correct 9 ms 37076 KB Output is correct
28 Correct 8 ms 35932 KB Output is correct
29 Correct 9 ms 36112 KB Output is correct
30 Correct 10 ms 36312 KB Output is correct
31 Correct 9 ms 36188 KB Output is correct
32 Correct 9 ms 36188 KB Output is correct
33 Correct 1 ms 8648 KB Output is correct
34 Correct 1 ms 12636 KB Output is correct
35 Correct 2 ms 19032 KB Output is correct
36 Correct 2 ms 18780 KB Output is correct
37 Correct 2 ms 14684 KB Output is correct
38 Correct 34 ms 81640 KB Output is correct
39 Correct 34 ms 84564 KB Output is correct
40 Correct 35 ms 83796 KB Output is correct
41 Correct 34 ms 83792 KB Output is correct
42 Correct 92 ms 93116 KB Output is correct
43 Correct 95 ms 92332 KB Output is correct
44 Correct 92 ms 92352 KB Output is correct
45 Correct 89 ms 89644 KB Output is correct
46 Correct 61 ms 82632 KB Output is correct
47 Correct 66 ms 83652 KB Output is correct
48 Correct 76 ms 84424 KB Output is correct
49 Correct 78 ms 87236 KB Output is correct
50 Correct 52 ms 82276 KB Output is correct
51 Correct 44 ms 52684 KB Output is correct
52 Correct 74 ms 86344 KB Output is correct
53 Correct 81 ms 86568 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14936 KB Output is correct
2 Correct 2 ms 14940 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 3 ms 14792 KB Output is correct
6 Correct 2 ms 14940 KB Output is correct
7 Correct 2 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 2 ms 14940 KB Output is correct
10 Correct 2 ms 12632 KB Output is correct
11 Correct 2 ms 14680 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8648 KB Output is correct
2 Correct 1 ms 12636 KB Output is correct
3 Correct 2 ms 19032 KB Output is correct
4 Correct 2 ms 18780 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14680 KB Output is correct
7 Correct 318 ms 159232 KB Output is correct
8 Correct 588 ms 314720 KB Output is correct
9 Correct 605 ms 318304 KB Output is correct
10 Correct 584 ms 318176 KB Output is correct
11 Correct 131 ms 155472 KB Output is correct
12 Correct 335 ms 297812 KB Output is correct
13 Correct 357 ms 301460 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 18780 KB Output is correct
3 Correct 2 ms 18780 KB Output is correct
4 Correct 2 ms 18780 KB Output is correct
5 Correct 2 ms 18912 KB Output is correct
6 Correct 2 ms 18780 KB Output is correct
7 Correct 2 ms 18884 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 18780 KB Output is correct
10 Correct 3 ms 18780 KB Output is correct
11 Correct 2 ms 19032 KB Output is correct
12 Correct 2 ms 18780 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 14684 KB Output is correct
15 Correct 1 ms 14684 KB Output is correct
16 Correct 2 ms 14680 KB Output is correct
17 Correct 3 ms 23388 KB Output is correct
18 Correct 3 ms 23388 KB Output is correct
19 Correct 3 ms 23388 KB Output is correct
20 Correct 3 ms 23056 KB Output is correct
21 Correct 3 ms 22984 KB Output is correct
22 Correct 3 ms 23128 KB Output is correct
23 Correct 3 ms 23144 KB Output is correct
24 Correct 3 ms 23132 KB Output is correct
25 Correct 10 ms 37076 KB Output is correct
26 Correct 9 ms 36932 KB Output is correct
27 Correct 9 ms 37076 KB Output is correct
28 Correct 8 ms 35932 KB Output is correct
29 Correct 9 ms 36112 KB Output is correct
30 Correct 10 ms 36312 KB Output is correct
31 Correct 9 ms 36188 KB Output is correct
32 Correct 9 ms 36188 KB Output is correct
33 Correct 34 ms 81640 KB Output is correct
34 Correct 34 ms 84564 KB Output is correct
35 Correct 35 ms 83796 KB Output is correct
36 Correct 34 ms 83792 KB Output is correct
37 Correct 92 ms 93116 KB Output is correct
38 Correct 95 ms 92332 KB Output is correct
39 Correct 92 ms 92352 KB Output is correct
40 Correct 89 ms 89644 KB Output is correct
41 Correct 61 ms 82632 KB Output is correct
42 Correct 66 ms 83652 KB Output is correct
43 Correct 76 ms 84424 KB Output is correct
44 Correct 78 ms 87236 KB Output is correct
45 Correct 52 ms 82276 KB Output is correct
46 Correct 44 ms 52684 KB Output is correct
47 Correct 74 ms 86344 KB Output is correct
48 Correct 81 ms 86568 KB Output is correct
49 Correct 2 ms 14936 KB Output is correct
50 Correct 2 ms 14940 KB Output is correct
51 Correct 2 ms 14684 KB Output is correct
52 Correct 1 ms 10588 KB Output is correct
53 Correct 3 ms 14792 KB Output is correct
54 Correct 2 ms 14940 KB Output is correct
55 Correct 2 ms 14940 KB Output is correct
56 Correct 3 ms 14940 KB Output is correct
57 Correct 2 ms 14940 KB Output is correct
58 Correct 2 ms 12632 KB Output is correct
59 Correct 2 ms 14680 KB Output is correct
60 Correct 2 ms 14680 KB Output is correct
61 Correct 318 ms 159232 KB Output is correct
62 Correct 588 ms 314720 KB Output is correct
63 Correct 605 ms 318304 KB Output is correct
64 Correct 584 ms 318176 KB Output is correct
65 Correct 131 ms 155472 KB Output is correct
66 Correct 335 ms 297812 KB Output is correct
67 Correct 357 ms 301460 KB Output is correct
68 Correct 1 ms 8648 KB Output is correct
69 Correct 1 ms 12636 KB Output is correct
70 Correct 2 ms 19032 KB Output is correct
71 Correct 2 ms 18780 KB Output is correct
72 Correct 2 ms 14684 KB Output is correct
73 Correct 493 ms 321004 KB Output is correct
74 Correct 482 ms 320872 KB Output is correct
75 Correct 469 ms 328616 KB Output is correct
76 Correct 463 ms 329180 KB Output is correct
77 Correct 1329 ms 468860 KB Output is correct
78 Correct 633 ms 208664 KB Output is correct
79 Correct 699 ms 288508 KB Output is correct
80 Correct 986 ms 344988 KB Output is correct
81 Correct 606 ms 223648 KB Output is correct
82 Correct 862 ms 350960 KB Output is correct
83 Correct 1071 ms 370308 KB Output is correct
84 Correct 590 ms 216416 KB Output is correct
85 Correct 1050 ms 370332 KB Output is correct
86 Correct 964 ms 360900 KB Output is correct
87 Correct 825 ms 338056 KB Output is correct
88 Correct 1314 ms 468420 KB Output is correct
89 Correct 1314 ms 468688 KB Output is correct
90 Correct 1282 ms 468672 KB Output is correct