oj.uz

Submission #624561

# Submission time Handle Problem Language Result Execution time Memory
624561 2022-08-08T13:13:21 Z wiwiho Rectangles (IOI19_rect) C++14
100 / 100
 3102 ms 1048576 KB 
#include "rect.h"

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

ll count_rectangles(vector<vector<int>> A){
    int n = A.size();
    int m = A[0].size();
    //for(int i = 0; i < n; i++) printv(A[i], cerr);
    
    vector<vector<int>> L(n, vector<int>(m, -1));
    vector<vector<int>> R(n, vector<int>(m, -1));
    vector<vector<int>> U(n, vector<int>(m, -1));
    vector<vector<int>> D(n, vector<int>(m, -1));

    for(int i = 0; i < n; i++){
        vector<int> v;
        for(int j = 0; j < m; j++){
            while(!v.empty() && A[i][v.back()] < A[i][j]){
                R[i][v.back()] = j;
                v.pob;
            }
            if(v.empty() || A[i][v.back()] == A[i][j]){
                v.eb(j);
                continue;
            }
            L[i][j] = v.back();
            v.eb(j);
        }
    }
    for(int i = 0; i < m; i++){
        vector<int> v;
        for(int j = 0; j < n; j++){
            while(!v.empty() && A[v.back()][i] < A[j][i]){
                D[v.back()][i] = j;
                v.pob;
            }
            if(v.empty() || A[v.back()][i] == A[j][i]){
                v.eb(j);
                continue;
            }
            U[j][i] = v.back();
            v.eb(j);
        }
    }

    vector<vector<vector<pii>>> row(n, vector<vector<pii>>(m));
    vector<vector<vector<pii>>> col(n, vector<vector<pii>>(m));

    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            if(L[i][j] != -1 && R[i][j] != -1)
                row[i][L[i][j] + 1].eb(mp(R[i][j] - 1, j));
            if(U[i][j] != -1 && D[i][j] != -1)
                col[U[i][j] + 1][j].eb(mp(D[i][j] - 1, i));
            //cerr << "row " << i << " " << j << " " << L[i][j] << " " << R[i][j] << "\n";
        }
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            lsort(row[i][j]);
            lsort(col[i][j]);
        }
    }

    auto getrow = [&](int i, int l, int r){
        //cerr << "getrow " << i << " " << l << " " << r << " : ";
        //printv(row[i][l], cerr);
        auto it = lower_bound(iter(row[i][l]), mp(r, 0));
        if(it == row[i][l].end() || it->F != r) return -1;
        return it->S;
    };
    auto getcol = [&](int i, int l, int r){
        auto it = lower_bound(iter(col[l][i]), mp(r, 0));
        if(it == col[l][i].end() || it->F != r) return -1;
        return it->S;
    };

    vector<vector<int>> rc(n, vector<int>(m, -1));
    vector<vector<int>> cc(n, vector<int>(m, -1));
    for(int i = n - 1; i >= 0; i--){
        for(int j = m - 1; j >= 0; j--){
            if(L[i][j] == -1 || R[i][j] == -1) continue;
            int id = i == n - 1 ? -1 : getrow(i + 1, L[i][j] + 1, R[i][j] - 1);
            if(id == -1) rc[i][j] = i;
            else rc[i][j] = rc[i + 1][id];
        }
    }
    for(int j = m - 1; j >= 0; j--){
        for(int i = n - 1; i >= 0; i--){
            if(U[i][j] == -1 || D[i][j] == -1) continue;
            int id = j == m - 1 ? -1 : getcol(j + 1, U[i][j] + 1, D[i][j] - 1);
            if(id == -1) cc[i][j] = j;
            else cc[i][j] = cc[id][j + 1];
        }
    }

    vector<pair<pii, pii>> ans;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            if(L[i][j] == -1 || R[i][j] == -1 || U[i][j] == -1 || D[i][j] == -1) continue;
            //cerr << "test " << i << " " << j << " " << L[i][j] << " " << R[i][j] << " " << U[i][j] << " " << D[i][j] << "\n";
            int idr = getrow(U[i][j] + 1, L[i][j] + 1, R[i][j] - 1);
            int idc = getcol(L[i][j] + 1, U[i][j] + 1, D[i][j] - 1);
            //cerr << idr << " " << idc << "\n";
            if(idr == -1 || idc == -1) continue;
            if(rc[U[i][j] + 1][idr] < D[i][j] - 1) continue;
            if(cc[idc][L[i][j] + 1] < R[i][j] - 1) continue;
            /*bool ok = true;
            //cerr << "test " << i << " " << j << "\n";
            for(int x = U[i][j] + 1; x < D[i][j]; x++){
                int mx = -1, mxp = -1;
                for(int y = L[i][j] + 1; y < R[i][j]; y++){
                    if(A[x][y] > mx) mx = A[x][y], mxp = y;
                }
                //if(U[x][mxp] == -1 || D[x][mxp] == -1) ok = false;
                if(L[x][mxp] != L[i][j] || R[x][mxp] != R[i][j]) ok = false;
            }
            for(int y = L[i][j] + 1; y < R[i][j]; y++){
                int mx = -1, mxp = -1;
                for(int x = U[i][j] + 1; x < D[i][j]; x++){
                    if(A[x][y] > mx) mx = A[x][y], mxp = x;
                }
                //if(L[mxp][y] == -1 || R[mxp][y] == -1) ok = false;
                if(U[mxp][y] != U[i][j] || D[mxp][y] != D[i][j]) ok = false;
                //else assert(getcol(y, U[i][j] + 1, D[i][j] - 1) != -1);
            }
            if(!ok) continue;*/
            ans.eb(mp(mp(L[i][j] + 1, R[i][j] - 1), mp(U[i][j] + 1, D[i][j] - 1)));
        }
    }
    lsort(ans);
    uni(ans);

	return ans.size();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 296 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 296 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 2 ms 1364 KB Output is correct
23 Correct 3 ms 1492 KB Output is correct
24 Correct 2 ms 1456 KB Output is correct
25 Correct 2 ms 980 KB Output is correct
26 Correct 3 ms 996 KB Output is correct
27 Correct 3 ms 1108 KB Output is correct
28 Correct 3 ms 1112 KB Output is correct
29 Correct 1 ms 700 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 296 KB Output is correct
17 Correct 2 ms 1364 KB Output is correct
18 Correct 3 ms 1492 KB Output is correct
19 Correct 2 ms 1456 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Correct 3 ms 996 KB Output is correct
22 Correct 3 ms 1108 KB Output is correct
23 Correct 3 ms 1112 KB Output is correct
24 Correct 1 ms 700 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 296 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 13 ms 7248 KB Output is correct
31 Correct 13 ms 7248 KB Output is correct
32 Correct 14 ms 7392 KB Output is correct
33 Correct 9 ms 4436 KB Output is correct
34 Correct 18 ms 5520 KB Output is correct
35 Correct 15 ms 5592 KB Output is correct
36 Correct 15 ms 5428 KB Output is correct
37 Correct 15 ms 5460 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 296 KB Output is correct
17 Correct 2 ms 1364 KB Output is correct
18 Correct 3 ms 1492 KB Output is correct
19 Correct 2 ms 1456 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Correct 3 ms 996 KB Output is correct
22 Correct 3 ms 1108 KB Output is correct
23 Correct 3 ms 1112 KB Output is correct
24 Correct 1 ms 700 KB Output is correct
25 Correct 13 ms 7248 KB Output is correct
26 Correct 13 ms 7248 KB Output is correct
27 Correct 14 ms 7392 KB Output is correct
28 Correct 9 ms 4436 KB Output is correct
29 Correct 18 ms 5520 KB Output is correct
30 Correct 15 ms 5592 KB Output is correct
31 Correct 15 ms 5428 KB Output is correct
32 Correct 15 ms 5460 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 296 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 89 ms 55016 KB Output is correct
39 Correct 77 ms 50196 KB Output is correct
40 Correct 71 ms 50188 KB Output is correct
41 Correct 67 ms 45528 KB Output is correct
42 Correct 180 ms 78600 KB Output is correct
43 Correct 180 ms 80968 KB Output is correct
44 Correct 193 ms 81316 KB Output is correct
45 Correct 189 ms 76848 KB Output is correct
46 Correct 77 ms 48080 KB Output is correct
47 Correct 107 ms 51132 KB Output is correct
48 Correct 244 ms 62908 KB Output is correct
49 Correct 221 ms 64872 KB Output is correct
50 Correct 105 ms 32728 KB Output is correct
51 Correct 106 ms 32612 KB Output is correct
52 Correct 207 ms 62424 KB Output is correct
53 Correct 206 ms 63480 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1360 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 1108 KB Output is correct
6 Correct 2 ms 1072 KB Output is correct
7 Correct 2 ms 1108 KB Output is correct
8 Correct 2 ms 1076 KB Output is correct
9 Correct 2 ms 1108 KB Output is correct
10 Correct 1 ms 560 KB Output is correct
11 Correct 1 ms 724 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 471 ms 272468 KB Output is correct
8 Correct 1048 ms 590064 KB Output is correct
9 Correct 1051 ms 592328 KB Output is correct
10 Correct 1090 ms 592348 KB Output is correct
11 Correct 193 ms 242252 KB Output is correct
12 Correct 410 ms 460044 KB Output is correct
13 Correct 424 ms 490512 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 296 KB Output is correct
17 Correct 2 ms 1364 KB Output is correct
18 Correct 3 ms 1492 KB Output is correct
19 Correct 2 ms 1456 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Correct 3 ms 996 KB Output is correct
22 Correct 3 ms 1108 KB Output is correct
23 Correct 3 ms 1112 KB Output is correct
24 Correct 1 ms 700 KB Output is correct
25 Correct 13 ms 7248 KB Output is correct
26 Correct 13 ms 7248 KB Output is correct
27 Correct 14 ms 7392 KB Output is correct
28 Correct 9 ms 4436 KB Output is correct
29 Correct 18 ms 5520 KB Output is correct
30 Correct 15 ms 5592 KB Output is correct
31 Correct 15 ms 5428 KB Output is correct
32 Correct 15 ms 5460 KB Output is correct
33 Correct 89 ms 55016 KB Output is correct
34 Correct 77 ms 50196 KB Output is correct
35 Correct 71 ms 50188 KB Output is correct
36 Correct 67 ms 45528 KB Output is correct
37 Correct 180 ms 78600 KB Output is correct
38 Correct 180 ms 80968 KB Output is correct
39 Correct 193 ms 81316 KB Output is correct
40 Correct 189 ms 76848 KB Output is correct
41 Correct 77 ms 48080 KB Output is correct
42 Correct 107 ms 51132 KB Output is correct
43 Correct 244 ms 62908 KB Output is correct
44 Correct 221 ms 64872 KB Output is correct
45 Correct 105 ms 32728 KB Output is correct
46 Correct 106 ms 32612 KB Output is correct
47 Correct 207 ms 62424 KB Output is correct
48 Correct 206 ms 63480 KB Output is correct
49 Correct 2 ms 1360 KB Output is correct
50 Correct 2 ms 1108 KB Output is correct
51 Correct 1 ms 852 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 2 ms 1108 KB Output is correct
54 Correct 2 ms 1072 KB Output is correct
55 Correct 2 ms 1108 KB Output is correct
56 Correct 2 ms 1076 KB Output is correct
57 Correct 2 ms 1108 KB Output is correct
58 Correct 1 ms 560 KB Output is correct
59 Correct 1 ms 724 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 471 ms 272468 KB Output is correct
62 Correct 1048 ms 590064 KB Output is correct
63 Correct 1051 ms 592328 KB Output is correct
64 Correct 1090 ms 592348 KB Output is correct
65 Correct 193 ms 242252 KB Output is correct
66 Correct 410 ms 460044 KB Output is correct
67 Correct 424 ms 490512 KB Output is correct
68 Correct 1 ms 212 KB Output is correct
69 Correct 1 ms 296 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 0 ms 340 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 1278 ms 732592 KB Output is correct
74 Correct 1086 ms 665744 KB Output is correct
75 Correct 1124 ms 666444 KB Output is correct
76 Correct 1010 ms 599932 KB Output is correct
77 Correct 2806 ms 1048576 KB Output is correct
78 Correct 1753 ms 479420 KB Output is correct
79 Correct 1853 ms 511916 KB Output is correct
80 Correct 3006 ms 809840 KB Output is correct
81 Correct 1819 ms 495808 KB Output is correct
82 Correct 2426 ms 650168 KB Output is correct
83 Correct 3102 ms 837296 KB Output is correct
84 Correct 1686 ms 477780 KB Output is correct
85 Correct 2895 ms 821084 KB Output is correct
86 Correct 2820 ms 799008 KB Output is correct
87 Correct 1559 ms 623784 KB Output is correct
88 Correct 2803 ms 1048576 KB Output is correct
89 Correct 2859 ms 1048576 KB Output is correct
90 Correct 2762 ms 1048576 KB Output is correct