oj.uz

Submission #1031030

# Submission time Handle Problem Language Result Execution time Memory
1031030 2024-07-22T13:43:03 Z Zicrus Rectangles (IOI19_rect) C++17
50 / 100
 320 ms 62728 KB 
#include <bits/stdc++.h>
#include "rect.h"
using namespace std;

typedef long long ll;

ll n, m;
ll pow2N, pow2M;
vector<vector<ll>> segN, segM;

unordered_map<ll, ll> sN, sM;
 
ll segMaxN(ll low, ll high, ll m) {
    ll hash = (low << 32) | (high << 16) | m;
    if (sN[hash]) return sN[hash];

    low += pow2N; high += pow2N;
    ll mx = 0;
    while (low <= high) {
        if (low & 1) mx = max(mx, segN[m][low++]);
        if (!(high & 1)) mx = max(mx, segN[m][high--]);
        low /= 2; high /= 2;
    }
    return sN[hash] = mx;
}
 
ll segMaxM(ll low, ll high, ll n) {
    ll hash = (low << 32) | (high << 16) | n;
    if (sM[hash]) return sM[hash];

    low += pow2M; high += pow2M;
    ll mx = 0;
    while (low <= high) {
        if (low & 1) mx = max(mx, segM[n][low++]);
        if (!(high & 1)) mx = max(mx, segM[n][high--]);
        low /= 2; high /= 2;
    }
    return sM[hash] = mx;
}

ll count_rectangles(vector<vector<int>> a) {
    if (a.size() <= 2) return 0;
    n = a.size(); m = a[0].size();

    if (n > 200 && m > 200) {
        if (a.size() <= 2) return 0;
        n = a.size(); m = a[0].size();
    
        vector<vector<bool>> vst(n, vector<bool>(m));
        ll res = 0;
        for (int i = 1; i < n-1; i++) {
            for (int j = 1; j < m-1; j++) {
                if (a[i][j] || vst[i][j]) continue;
                
                ll ptrN = i, ptrM = j;
                while (!a[ptrN][ptrM] && ptrM < m-1) ptrM++;
                ptrM--;
                while (!a[ptrN][ptrM] && ptrN < n-1) ptrN++;
                ptrN--;
    
                bool poss = true;
                for (int x = i; x <= ptrN && poss; x++) {
                    for (int y = j; y <= ptrM && poss; y++) {
                        vst[x][y] = true;
                        if (a[x][y]) poss = false;
                    }
                }
                for (int x = i; x <= ptrN && poss; x++) {
                    if (!a[x][j-1]) poss = false;
                    if (!a[x][ptrM+1]) poss = false;
                }
                for (int y = j; y <= ptrM && poss; y++) {
                    if (!a[i-1][y]) poss = false;
                    if (!a[ptrN+1][y]) poss = false;
                }
                res += poss;
            }
        }
        return res;
    }

    pow2N = 1ll << (ll)ceil(log2(n));
    pow2M = 1ll << (ll)ceil(log2(m));
    sN = unordered_map<ll, ll>(); sM = unordered_map<ll, ll>();
    vector<int> am = a[1];
    segN = vector<vector<ll>>(m, vector<ll>(2*pow2N));
    segM = vector<vector<ll>>(n, vector<ll>(2*pow2M));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            segN[j][pow2N+i] = a[i][j];
            segM[i][pow2M+j] = a[i][j];
        }
    }
    for (int meta = 0; meta < n; meta++) {
        for (int i = pow2M-1; i > 0; i--) {
            segM[meta][i] = max(segM[meta][2*i], segM[meta][2*i+1]);
        }
    }
    for (int meta = 0; meta < m; meta++) {
        for (int i = pow2N-1; i > 0; i--) {
            segN[meta][i] = max(segN[meta][2*i], segN[meta][2*i+1]);
        }
    }

    unordered_set<ll> s;

    ll res = 0;
    for (int i = 1; i < n-1; i++) {
        for (int j = 1; j < m-1; j++) {
            ll left = j, right = j, top = i, bottom = i;
            ll ref = a[i][j];

            ll low = 0, high = j;
            while (low < high) {
                ll mid = (low + high + 1) / 2;
                if (segMaxM(mid, high, i) <= ref) {
                    high = mid-1;
                }
                else {
                    low = mid;
                }
            }
            left = low+1;
            low = j, high = m-1;
            while (low < high) {
                ll mid = (low + high) / 2;
                if (segMaxM(low, mid, i) <= ref) {
                    low = mid+1;
                }
                else {
                    high = mid;
                }
            }
            right = high-1;

            low = 0, high = i;
            while (low < high) {
                ll mid = (low + high + 1) / 2;
                if (segMaxN(mid, high, j) <= ref) {
                    high = mid-1;
                }
                else {
                    low = mid;
                }
            }
            top = low+1;
            low = i, high = n-1;
            while (low < high) {
                ll mid = (low + high) / 2;
                if (segMaxN(low, mid, j) <= ref) {
                    low = mid+1;
                }
                else {
                    high = mid;
                }
            }
            bottom = high-1;

            ll hash = (left << 48) | (right << 32) | (top << 16) | bottom;
            if (s.count(hash)) continue;
            s.insert(hash);

            ll lN = bottom-top+1, lM = right-left+1;
            bool poss = 1;
            for (int meta = top; meta < top+lN && poss; meta++) {
                ll border = min(a[meta][left-1], a[meta][left+lM]);
                if (border <= segMaxM(left, left+lM-1, meta)) {
                    poss = 0;
                }
            }
            for (int meta = left; meta < left+lM && poss; meta++) {
                ll border = min(a[top-1][meta], a[top+lN][meta]);
                if (border <= segMaxN(top, top+lN-1, meta)) {
                    poss = 0;
                }
            }
            res += poss;
        }
    }
    return res;
}

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 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 0 ms 348 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 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 23 ms 5388 KB Output is correct
23 Correct 21 ms 5320 KB Output is correct
24 Correct 21 ms 5320 KB Output is correct
25 Correct 17 ms 3860 KB Output is correct
26 Correct 16 ms 5240 KB Output is correct
27 Correct 17 ms 5316 KB Output is correct
28 Correct 17 ms 5316 KB Output is correct
29 Correct 7 ms 2396 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 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 23 ms 5388 KB Output is correct
18 Correct 21 ms 5320 KB Output is correct
19 Correct 21 ms 5320 KB Output is correct
20 Correct 17 ms 3860 KB Output is correct
21 Correct 16 ms 5240 KB Output is correct
22 Correct 17 ms 5316 KB Output is correct
23 Correct 17 ms 5316 KB Output is correct
24 Correct 7 ms 2396 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 320 ms 30520 KB Output is correct
31 Correct 268 ms 30612 KB Output is correct
32 Correct 252 ms 30580 KB Output is correct
33 Correct 134 ms 28644 KB Output is correct
34 Correct 224 ms 40132 KB Output is correct
35 Correct 201 ms 40244 KB Output is correct
36 Correct 170 ms 39480 KB Output is correct
37 Correct 226 ms 39460 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 23 ms 5388 KB Output is correct
18 Correct 21 ms 5320 KB Output is correct
19 Correct 21 ms 5320 KB Output is correct
20 Correct 17 ms 3860 KB Output is correct
21 Correct 16 ms 5240 KB Output is correct
22 Correct 17 ms 5316 KB Output is correct
23 Correct 17 ms 5316 KB Output is correct
24 Correct 7 ms 2396 KB Output is correct
25 Correct 320 ms 30520 KB Output is correct
26 Correct 268 ms 30612 KB Output is correct
27 Correct 252 ms 30580 KB Output is correct
28 Correct 134 ms 28644 KB Output is correct
29 Correct 224 ms 40132 KB Output is correct
30 Correct 201 ms 40244 KB Output is correct
31 Correct 170 ms 39480 KB Output is correct
32 Correct 226 ms 39460 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Incorrect 14 ms 4188 KB Output isn't correct
39 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 2224 KB Output is correct
2 Correct 29 ms 2128 KB Output is correct
3 Correct 3 ms 1112 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 3512 KB Output is correct
6 Correct 9 ms 3508 KB Output is correct
7 Correct 9 ms 3512 KB Output is correct
8 Correct 8 ms 3336 KB Output is correct
9 Correct 10 ms 3284 KB Output is correct
10 Correct 0 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 1 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 64 ms 23324 KB Output is correct
8 Correct 129 ms 62092 KB Output is correct
9 Correct 128 ms 62728 KB Output is correct
10 Correct 147 ms 62548 KB Output is correct
11 Correct 41 ms 31136 KB Output is correct
12 Correct 78 ms 58704 KB Output is correct
13 Correct 99 ms 62516 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 23 ms 5388 KB Output is correct
18 Correct 21 ms 5320 KB Output is correct
19 Correct 21 ms 5320 KB Output is correct
20 Correct 17 ms 3860 KB Output is correct
21 Correct 16 ms 5240 KB Output is correct
22 Correct 17 ms 5316 KB Output is correct
23 Correct 17 ms 5316 KB Output is correct
24 Correct 7 ms 2396 KB Output is correct
25 Correct 320 ms 30520 KB Output is correct
26 Correct 268 ms 30612 KB Output is correct
27 Correct 252 ms 30580 KB Output is correct
28 Correct 134 ms 28644 KB Output is correct
29 Correct 224 ms 40132 KB Output is correct
30 Correct 201 ms 40244 KB Output is correct
31 Correct 170 ms 39480 KB Output is correct
32 Correct 226 ms 39460 KB Output is correct
33 Incorrect 14 ms 4188 KB Output isn't correct
34 Halted 0 ms 0 KB -