oj.uz

Submission #1030997

# Submission time Handle Problem Language Result Execution time Memory
1030997 2024-07-22T13:23:12 Z Zicrus Rectangles (IOI19_rect) C++17
37 / 100
 1938 ms 196916 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]);
        }
    }

    unordered_set<ll> s;

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

            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;
}

Compilation message

rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:66:13: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   66 |             while (a[i][left] <= ref && left > 0) left--; left++;
      |             ^~~~~
rect.cpp:66:59: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   66 |             while (a[i][left] <= ref && left > 0) left--; left++;
      |                                                           ^~~~
rect.cpp:67:13: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   67 |             while (a[i][right] <= ref && right < m-1) right++; right--;
      |             ^~~~~
rect.cpp:67:64: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   67 |             while (a[i][right] <= ref && right < m-1) right++; right--;
      |                                                                ^~~~~
rect.cpp:68:13: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   68 |             while (a[top][j] <= ref && top > 0) top--; top++;
      |             ^~~~~
rect.cpp:68:56: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   68 |             while (a[top][j] <= ref && top > 0) top--; top++;
      |                                                        ^~~
rect.cpp:69:13: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   69 |             while (a[bottom][j] <= ref && bottom < n-1) bottom++; bottom--;
      |             ^~~~~
rect.cpp:69:67: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   69 |             while (a[bottom][j] <= ref && bottom < n-1) bottom++; bottom--;
      |                                                                   ^~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 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 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 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 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 10 ms 860 KB Output is correct
23 Correct 6 ms 944 KB Output is correct
24 Correct 6 ms 860 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 1 ms 600 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 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 10 ms 860 KB Output is correct
18 Correct 6 ms 944 KB Output is correct
19 Correct 6 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 119 ms 3792 KB Output is correct
31 Correct 117 ms 3684 KB Output is correct
32 Correct 126 ms 3736 KB Output is correct
33 Correct 10 ms 3420 KB Output is correct
34 Correct 10 ms 3784 KB Output is correct
35 Correct 10 ms 3768 KB Output is correct
36 Correct 9 ms 3512 KB Output is correct
37 Correct 12 ms 3512 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 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 10 ms 860 KB Output is correct
18 Correct 6 ms 944 KB Output is correct
19 Correct 6 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 119 ms 3792 KB Output is correct
26 Correct 117 ms 3684 KB Output is correct
27 Correct 126 ms 3736 KB Output is correct
28 Correct 10 ms 3420 KB Output is correct
29 Correct 10 ms 3784 KB Output is correct
30 Correct 10 ms 3768 KB Output is correct
31 Correct 9 ms 3512 KB Output is correct
32 Correct 12 ms 3512 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Incorrect 230 ms 40412 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 11 ms 860 KB Output is correct
2 Correct 8 ms 960 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 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 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 1938 ms 196916 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 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 10 ms 860 KB Output is correct
18 Correct 6 ms 944 KB Output is correct
19 Correct 6 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 119 ms 3792 KB Output is correct
26 Correct 117 ms 3684 KB Output is correct
27 Correct 126 ms 3736 KB Output is correct
28 Correct 10 ms 3420 KB Output is correct
29 Correct 10 ms 3784 KB Output is correct
30 Correct 10 ms 3768 KB Output is correct
31 Correct 9 ms 3512 KB Output is correct
32 Correct 12 ms 3512 KB Output is correct
33 Incorrect 230 ms 40412 KB Output isn't correct
34 Halted 0 ms 0 KB -