oj.uz

답안 #826748

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
826748 2023-08-16T01:43:58 Z kevinsogo Rectangles (IOI19_rect) C++17
100 / 100
 1789 ms 624068 KB 
#include <bits/stdc++.h>
using namespace std;
#include "rect.h"
using ll = long long;
template<class T>
using vec = vector<T>;

vec<vec<int>> transpose(const vec<vec<int>>& g) {
    vec<vec<int>> h(g[0].size(), vec<int>(g.size()));
    for (int i = 0; i < g.size(); i++) {
        for (int j = 0; j < g[i].size(); j++) h[j][i] = g[i][j];
    }
    return h;
}

ll _count_rectangles(const vec<vec<int>>& g) {
    int r, c;
    if ((r = g.size()) < (c = g[0].size())) return _count_rectangles(transpose(g));

    vec<vec<int>> U(r, vec<int>(c, -1));
    vec<vec<int>> D(r, vec<int>(c, r));
    vec<vec<int>> L(r, vec<int>(c, -1));
    vec<vec<int>> R(r, vec<int>(c, c));
    for (int j = 0; j < c; j++) {
        {
            vec<int> stak;
            for (int i = 0; i < r; i++) {
                while (not stak.empty() and g[stak.back()][j] < g[i][j]) stak.pop_back();
                if (not stak.empty()) U[i][j] = stak.back();
                stak.push_back(i);
            }
        }
        {
            vec<int> stak;
            for (int i = r; i--;) {
                while (not stak.empty() and g[stak.back()][j] < g[i][j]) stak.pop_back();
                if (not stak.empty()) D[i][j] = stak.back();
                stak.push_back(i);
            }
        }
    }
    for (int i = 0; i < r; i++) {
        {
            vec<int> stak;
            for (int j = 0; j < c; j++) {
                while (not stak.empty() and g[i][stak.back()] < g[i][j]) stak.pop_back();
                if (not stak.empty()) L[i][j] = stak.back();
                stak.push_back(j);
            }
        }
        {
            vec<int> stak;
            for (int j = c; j--;) {
                while (not stak.empty() and g[i][stak.back()] < g[i][j]) stak.pop_back();
                if (not stak.empty()) R[i][j] = stak.back();
                stak.push_back(j);
            }
        }
    }
    for (int i = 0; i < r; i++) {
        for (int j = 0; j < c; j++) {
            assert(-1 <= U[i][j] and U[i][j] < i and i < D[i][j] and D[i][j] <= r);
            assert(-1 <= L[i][j] and L[i][j] < j and j < R[i][j] and R[i][j] <= c);
        }
    }

    vec<vec<vec<int>>> poss(c + 1, vec<vec<int>>(c + 1));
    vec<vec<vec<pair<int,int>>>> ques(c + 1, vec<vec<pair<int,int>>>(c + 1));

    ll ans = 0;
    vec<pair<int,int>> jque = {{0, c-1}};
    vec<vec<int>> ips(r);
    vec<vec<pair<int,int>>> jps(r);
    while (not jque.empty()) {
        auto [j1, j2] = jque.back(); jque.pop_back();
        if (j2 - j1 <= 1) continue;
        int jm = j1 + j2 >> 1;
        jque.emplace_back(j1, jm);
        jque.emplace_back(jm, j2);

        for (int i = 0; i < r; i++) {
            for (int J1 = j1; J1 < jm; J1++) {
                int J2 = R[i][J1];
                if (jm < J2 and J2 <= j2) jps[i].emplace_back(J1, J2);
            }
            for (int J2 = jm+1; J2 < j2+1; J2++) {
                int J1 = L[i][J2];
                if (j1 <= J1 and J1 < jm and R[i][J1] != J2) jps[i].emplace_back(J1, J2);
            }
        }

        for (int i1 = 0; i1 < r; i1++) {
            int i2 = D[i1][jm];
            if (0 <= i2 and i2 < r and i2 - i1 >= 2) ips[i1].push_back(i2);
        }
        for (int i2 = 0; i2 < r; i2++) {
            int i1 = U[i2][jm];
            if (0 <= i1 and i1 < r and i2 - i1 >= 2 and i2 != D[i1][jm]) ips[i1].push_back(i2);
        }

        for (int i = 0; i < r; i++) {
            for (auto [J1, J2] : jps[i]) poss[J1][J2].push_back(i);
        }

        for (int i1 = 0; i1 < r; i1++) {
            while (not ips[i1].empty()) {
                int i2 = ips[i1].back(); ips[i1].pop_back();
                int j1x = jm;
                while (j1 < j1x and j1x < j2 and (D[i1][j1x] == i2 or U[i2][j1x] == i1)) j1x--;
                int j2x = jm;
                while (j1 < j2x and j2x < j2 and (D[i1][j2x] == i2 or U[i2][j2x] == i1)) j2x++;
                for (auto [J1, J2] : jps[i1+1]) {
                    if (j1x <= J1 and J1 < J2 and J2 <= j2x) ques[J1][J2].emplace_back(i1+1, i2);
                }
            }
        }

        for (int i = 0; i < r; i++) {
            while (not jps[i].empty()) {
                auto [J1, J2] = jps[i].back(); jps[i].pop_back();
                int im = c, ix = c;
                while (not poss[J1][J2].empty()) {
                    int i = poss[J1][J2].back(); poss[J1][J2].pop_back();
                    if (ix != i + 1) im = i + 1;
                    ix = i;
                    while (not ques[J1][J2].empty() and ques[J1][J2].back().first >= i) {
                        auto [i1, i2] = ques[J1][J2].back(); ques[J1][J2].pop_back();
                        assert(i1 == i);
                        if (i2 <= im) ans++;
                    }
                }
            }
        }
    }
    return ans;
}

ll count_rectangles(vec<vec<int>> g) {
    return _count_rectangles(g);
}

Compilation message

rect.cpp: In function 'vec<std::vector<int> > transpose(vec<std::vector<int> >&)':
rect.cpp:10:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for (int i = 0; i < g.size(); i++) {
      |                     ~~^~~~~~~~~~
rect.cpp:11:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |         for (int j = 0; j < g[i].size(); j++) h[j][i] = g[i][j];
      |                         ~~^~~~~~~~~~~~~
rect.cpp: In function 'll _count_rectangles(vec<std::vector<int> >&)':
rect.cpp:77:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   77 |         int jm = j1 + j2 >> 1;
      |                  ~~~^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 276 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 276 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 1 ms 952 KB Output is correct
24 Correct 1 ms 940 KB Output is correct
25 Correct 2 ms 728 KB Output is correct
26 Correct 2 ms 852 KB Output is correct
27 Correct 2 ms 852 KB Output is correct
28 Correct 2 ms 852 KB Output is correct
29 Correct 1 ms 468 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 276 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 952 KB Output is correct
19 Correct 1 ms 940 KB Output is correct
20 Correct 2 ms 728 KB Output is correct
21 Correct 2 ms 852 KB Output is correct
22 Correct 2 ms 852 KB Output is correct
23 Correct 2 ms 852 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 6 ms 4180 KB Output is correct
31 Correct 6 ms 4200 KB Output is correct
32 Correct 6 ms 4220 KB Output is correct
33 Correct 7 ms 3412 KB Output is correct
34 Correct 10 ms 3924 KB Output is correct
35 Correct 10 ms 4028 KB Output is correct
36 Correct 10 ms 3924 KB Output is correct
37 Correct 10 ms 3924 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 276 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 952 KB Output is correct
19 Correct 1 ms 940 KB Output is correct
20 Correct 2 ms 728 KB Output is correct
21 Correct 2 ms 852 KB Output is correct
22 Correct 2 ms 852 KB Output is correct
23 Correct 2 ms 852 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 6 ms 4180 KB Output is correct
26 Correct 6 ms 4200 KB Output is correct
27 Correct 6 ms 4220 KB Output is correct
28 Correct 7 ms 3412 KB Output is correct
29 Correct 10 ms 3924 KB Output is correct
30 Correct 10 ms 4028 KB Output is correct
31 Correct 10 ms 3924 KB Output is correct
32 Correct 10 ms 3924 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 71 ms 47756 KB Output is correct
39 Correct 85 ms 47724 KB Output is correct
40 Correct 79 ms 52008 KB Output is correct
41 Correct 74 ms 52008 KB Output is correct
42 Correct 70 ms 49604 KB Output is correct
43 Correct 72 ms 49808 KB Output is correct
44 Correct 92 ms 50000 KB Output is correct
45 Correct 71 ms 47392 KB Output is correct
46 Correct 69 ms 37236 KB Output is correct
47 Correct 80 ms 38084 KB Output is correct
48 Correct 120 ms 43504 KB Output is correct
49 Correct 125 ms 45476 KB Output is correct
50 Correct 58 ms 17100 KB Output is correct
51 Correct 56 ms 18068 KB Output is correct
52 Correct 116 ms 44328 KB Output is correct
53 Correct 135 ms 45364 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1364 KB Output is correct
2 Correct 2 ms 1236 KB Output is correct
3 Correct 2 ms 1076 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 1236 KB Output is correct
6 Correct 2 ms 1236 KB Output is correct
7 Correct 2 ms 1284 KB Output is correct
8 Correct 2 ms 1236 KB Output is correct
9 Correct 2 ms 1236 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 2 ms 1060 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 489 ms 164392 KB Output is correct
8 Correct 1139 ms 490408 KB Output is correct
9 Correct 1079 ms 469552 KB Output is correct
10 Correct 1032 ms 469744 KB Output is correct
11 Correct 356 ms 163172 KB Output is correct
12 Correct 797 ms 408764 KB Output is correct
13 Correct 818 ms 453944 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 276 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 952 KB Output is correct
19 Correct 1 ms 940 KB Output is correct
20 Correct 2 ms 728 KB Output is correct
21 Correct 2 ms 852 KB Output is correct
22 Correct 2 ms 852 KB Output is correct
23 Correct 2 ms 852 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 6 ms 4180 KB Output is correct
26 Correct 6 ms 4200 KB Output is correct
27 Correct 6 ms 4220 KB Output is correct
28 Correct 7 ms 3412 KB Output is correct
29 Correct 10 ms 3924 KB Output is correct
30 Correct 10 ms 4028 KB Output is correct
31 Correct 10 ms 3924 KB Output is correct
32 Correct 10 ms 3924 KB Output is correct
33 Correct 71 ms 47756 KB Output is correct
34 Correct 85 ms 47724 KB Output is correct
35 Correct 79 ms 52008 KB Output is correct
36 Correct 74 ms 52008 KB Output is correct
37 Correct 70 ms 49604 KB Output is correct
38 Correct 72 ms 49808 KB Output is correct
39 Correct 92 ms 50000 KB Output is correct
40 Correct 71 ms 47392 KB Output is correct
41 Correct 69 ms 37236 KB Output is correct
42 Correct 80 ms 38084 KB Output is correct
43 Correct 120 ms 43504 KB Output is correct
44 Correct 125 ms 45476 KB Output is correct
45 Correct 58 ms 17100 KB Output is correct
46 Correct 56 ms 18068 KB Output is correct
47 Correct 116 ms 44328 KB Output is correct
48 Correct 135 ms 45364 KB Output is correct
49 Correct 2 ms 1364 KB Output is correct
50 Correct 2 ms 1236 KB Output is correct
51 Correct 2 ms 1076 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 2 ms 1236 KB Output is correct
54 Correct 2 ms 1236 KB Output is correct
55 Correct 2 ms 1284 KB Output is correct
56 Correct 2 ms 1236 KB Output is correct
57 Correct 2 ms 1236 KB Output is correct
58 Correct 1 ms 1108 KB Output is correct
59 Correct 2 ms 1060 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 489 ms 164392 KB Output is correct
62 Correct 1139 ms 490408 KB Output is correct
63 Correct 1079 ms 469552 KB Output is correct
64 Correct 1032 ms 469744 KB Output is correct
65 Correct 356 ms 163172 KB Output is correct
66 Correct 797 ms 408764 KB Output is correct
67 Correct 818 ms 453944 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 1270 ms 569620 KB Output is correct
74 Correct 1139 ms 575316 KB Output is correct
75 Correct 1325 ms 624068 KB Output is correct
76 Correct 1420 ms 623948 KB Output is correct
77 Correct 1398 ms 607288 KB Output is correct
78 Correct 960 ms 270228 KB Output is correct
79 Correct 1050 ms 266376 KB Output is correct
80 Correct 1745 ms 525564 KB Output is correct
81 Correct 1008 ms 263528 KB Output is correct
82 Correct 1374 ms 379080 KB Output is correct
83 Correct 1789 ms 532152 KB Output is correct
84 Correct 963 ms 264912 KB Output is correct
85 Correct 1786 ms 531668 KB Output is correct
86 Correct 1714 ms 533232 KB Output is correct
87 Correct 718 ms 285904 KB Output is correct
88 Correct 1358 ms 589884 KB Output is correct
89 Correct 1361 ms 584236 KB Output is correct
90 Correct 1345 ms 584116 KB Output is correct