oj.uz

Submission #1030892

# Submission time Handle Problem Language Result Execution time Memory
1030892 2024-07-22T11:31:27 Z Zicrus Rectangles (IOI19_rect) C++17
25 / 100
 5000 ms 182028 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;

ll segMaxN(ll low, ll high, ll m) {
    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 mx;
}

ll segMaxM(ll low, ll high, ll n) {
    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 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));
    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]);
        }
    }

    ll res = 0;
    for (int lN = 1; lN <= n; lN++) {
        for (int lM = 1; lM <= m; lM++) {
            for (int i = 1; i+lN-1 < n-1; i++) {
                for (int j = 1; j+lM-1 < m-1; j++) {
                    
                    bool poss = 1;
                    for (int meta = i; meta < i+lN && poss; meta++) {
                        ll border = min(a[meta][j-1], a[meta][j+lM]);
                        if (border <= segMaxM(j, j+lM-1, meta)) {
                            poss = 0;
                        }
                    }
                    for (int meta = j; meta < j+lM && poss; meta++) {
                        ll border = min(a[i-1][meta], a[i+lN][meta]);
                        if (border <= segMaxN(i, i+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 3 ms 344 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 0 ms 432 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 432 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 0 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 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 2 ms 348 KB Output is correct
20 Correct 1 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 3 ms 344 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 0 ms 432 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 432 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 0 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 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 2 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 152 ms 820 KB Output is correct
23 Correct 147 ms 768 KB Output is correct
24 Correct 138 ms 604 KB Output is correct
25 Correct 72 ms 600 KB Output is correct
26 Correct 107 ms 600 KB Output is correct
27 Correct 84 ms 824 KB Output is correct
28 Correct 82 ms 600 KB Output is correct
29 Correct 18 ms 656 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 0 ms 432 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 432 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 0 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 348 KB Output is correct
17 Correct 152 ms 820 KB Output is correct
18 Correct 147 ms 768 KB Output is correct
19 Correct 138 ms 604 KB Output is correct
20 Correct 72 ms 600 KB Output is correct
21 Correct 107 ms 600 KB Output is correct
22 Correct 84 ms 824 KB Output is correct
23 Correct 82 ms 600 KB Output is correct
24 Correct 18 ms 656 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Execution timed out 5096 ms 2392 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 0 ms 432 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 432 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 0 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 348 KB Output is correct
17 Correct 152 ms 820 KB Output is correct
18 Correct 147 ms 768 KB Output is correct
19 Correct 138 ms 604 KB Output is correct
20 Correct 72 ms 600 KB Output is correct
21 Correct 107 ms 600 KB Output is correct
22 Correct 84 ms 824 KB Output is correct
23 Correct 82 ms 600 KB Output is correct
24 Correct 18 ms 656 KB Output is correct
25 Execution timed out 5096 ms 2392 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 856 KB Output is correct
2 Correct 92 ms 772 KB Output is correct
3 Correct 120 ms 1004 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 120 ms 916 KB Output is correct
6 Correct 120 ms 856 KB Output is correct
7 Correct 118 ms 856 KB Output is correct
8 Correct 120 ms 860 KB Output is correct
9 Correct 120 ms 860 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #6
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 2 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 Execution timed out 5089 ms 182028 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 0 ms 432 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 432 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 0 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 348 KB Output is correct
17 Correct 152 ms 820 KB Output is correct
18 Correct 147 ms 768 KB Output is correct
19 Correct 138 ms 604 KB Output is correct
20 Correct 72 ms 600 KB Output is correct
21 Correct 107 ms 600 KB Output is correct
22 Correct 84 ms 824 KB Output is correct
23 Correct 82 ms 600 KB Output is correct
24 Correct 18 ms 656 KB Output is correct
25 Execution timed out 5096 ms 2392 KB Time limit exceeded
26 Halted 0 ms 0 KB -