oj.uz

Submission #1031027

# Submission time Handle Problem Language Result Execution time Memory
1031027 2024-07-22T13:38:33 Z Zicrus Rectangles (IOI19_rect) C++17
37 / 100
 5000 ms 742440 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.count(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.count(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();
    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 1 ms 344 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 792 KB Output is correct
4 Correct 2 ms 856 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 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 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 1 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 1 ms 344 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 792 KB Output is correct
4 Correct 2 ms 856 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 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 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 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 21 ms 5408 KB Output is correct
23 Correct 20 ms 5316 KB Output is correct
24 Correct 20 ms 5316 KB Output is correct
25 Correct 14 ms 3860 KB Output is correct
26 Correct 16 ms 5360 KB Output is correct
27 Correct 16 ms 5320 KB Output is correct
28 Correct 16 ms 5320 KB Output is correct
29 Correct 6 ms 2396 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 792 KB Output is correct
4 Correct 2 ms 856 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 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 21 ms 5408 KB Output is correct
18 Correct 20 ms 5316 KB Output is correct
19 Correct 20 ms 5316 KB Output is correct
20 Correct 14 ms 3860 KB Output is correct
21 Correct 16 ms 5360 KB Output is correct
22 Correct 16 ms 5320 KB Output is correct
23 Correct 16 ms 5320 KB Output is correct
24 Correct 6 ms 2396 KB Output is correct
25 Correct 1 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 1 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 286 ms 30824 KB Output is correct
31 Correct 301 ms 30616 KB Output is correct
32 Correct 263 ms 30828 KB Output is correct
33 Correct 127 ms 28836 KB Output is correct
34 Correct 194 ms 40240 KB Output is correct
35 Correct 196 ms 40496 KB Output is correct
36 Correct 197 ms 39728 KB Output is correct
37 Correct 221 ms 39652 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 792 KB Output is correct
4 Correct 2 ms 856 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 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 21 ms 5408 KB Output is correct
18 Correct 20 ms 5316 KB Output is correct
19 Correct 20 ms 5316 KB Output is correct
20 Correct 14 ms 3860 KB Output is correct
21 Correct 16 ms 5360 KB Output is correct
22 Correct 16 ms 5320 KB Output is correct
23 Correct 16 ms 5320 KB Output is correct
24 Correct 6 ms 2396 KB Output is correct
25 Correct 286 ms 30824 KB Output is correct
26 Correct 301 ms 30616 KB Output is correct
27 Correct 263 ms 30828 KB Output is correct
28 Correct 127 ms 28836 KB Output is correct
29 Correct 194 ms 40240 KB Output is correct
30 Correct 196 ms 40496 KB Output is correct
31 Correct 197 ms 39728 KB Output is correct
32 Correct 221 ms 39652 KB Output is correct
33 Correct 1 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 1 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Execution timed out 5105 ms 455120 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 2484 KB Output is correct
2 Correct 25 ms 2232 KB Output is correct
3 Correct 2 ms 1116 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 9 ms 3512 KB Output is correct
6 Correct 11 ms 3428 KB Output is correct
7 Correct 9 ms 3512 KB Output is correct
8 Correct 9 ms 3512 KB Output is correct
9 Correct 9 ms 3512 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Execution timed out 5108 ms 742440 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 792 KB Output is correct
4 Correct 2 ms 856 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 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 21 ms 5408 KB Output is correct
18 Correct 20 ms 5316 KB Output is correct
19 Correct 20 ms 5316 KB Output is correct
20 Correct 14 ms 3860 KB Output is correct
21 Correct 16 ms 5360 KB Output is correct
22 Correct 16 ms 5320 KB Output is correct
23 Correct 16 ms 5320 KB Output is correct
24 Correct 6 ms 2396 KB Output is correct
25 Correct 286 ms 30824 KB Output is correct
26 Correct 301 ms 30616 KB Output is correct
27 Correct 263 ms 30828 KB Output is correct
28 Correct 127 ms 28836 KB Output is correct
29 Correct 194 ms 40240 KB Output is correct
30 Correct 196 ms 40496 KB Output is correct
31 Correct 197 ms 39728 KB Output is correct
32 Correct 221 ms 39652 KB Output is correct
33 Execution timed out 5105 ms 455120 KB Time limit exceeded
34 Halted 0 ms 0 KB -