oj.uz

Submission #648435

# Submission time Handle Problem Language Result Execution time Memory
648435 2022-10-06T13:27:01 Z 406 Hamburg Steak (JOI20_hamburg) C++17
21 / 100
 3000 ms 27656 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

const int N = 2e5 + 50;
const int M = 2 * N + 5;
int l[N], r[N], u[N], d[N], n, k;
bitset<N> used, full;
vector<pair<int, int>> points;
vector<int> X, Y, cl[M], op[M];

void rec();

inline bool check() {
        return used.count() == 0;
}

inline bool inter(int i, int x, int y) {
        return l[i] <= x && x <= r[i] && d[i] <= y && y <= u[i];
}

inline void add_point(int x, int y) {
        vector<int> change;
        for (int i = used._Find_first(); i < n; i = used._Find_next(i)) {
                if (inter(i, x, y)) {
                        used[i] = false;
                        change.push_back(i);
                }
        }
        if (change.empty())
                return;
        points.emplace_back(x, y);

        rec();

        for (auto cc: change) used[cc] = true;
        points.pop_back();

}

void rec() {
        if (check() && (int) points.size() <= k) {
                for (int i = 0; i < (int) points.size(); i++)
                        cout << X[points[i].first] << ' ' << Y[points[i].second] << '\n';
                for (int i = points.size(); i < k; i++)
                        cout << 1 << ' ' << 1 << '\n';
                exit(0);
        }
        if (points.size() >= k)
                return;

        int minR = 2 * n;
        int minU = 2 * n;
        int maxD = 0;
        int maxL = 0;

        for (int i = used._Find_first(); i < n; i = used._Find_next(i)) {
                minR = min(minR, r[i]);
                maxL = max(maxL, l[i]);

                minU = min(minU, u[i]);
                maxD = max(maxD, d[i]);
        }

        if (maxL <= minR || maxD <= minU) {
                add_point(minR, minU);
        }
        else {
                add_point(minR, minU);
                add_point(minR, maxD);
                add_point(maxL, minU);
                add_point(maxL, maxD);
                if (points.size())
                        return;
                int mxD = 2 * n;
                int mnU = 0;
                //assert(used.count() == n);
                for (int i = 0; i < n; i++) if (l[i] <= minR) {
                        mxD = max(mxD, d[i]);
                        mnU = min(mnU, u[i]);
                }
                add_point(minR, mxD);
                add_point(minR, mnU);
                mxD = 2 * n;
                mnU = 0;
                for (int i = 0; i < n; i++) if (r[i] >= maxL) {
                        mxD = max(mxD, d[i]);
                        mnU = min(mnU, u[i]);
                }

                add_point(maxL, mxD);
                add_point(maxL, mnU);

                int mxL = 0;
                int mnR = 2 * n;

                for (int i = 0; i < n; i++) if (u[i] >= maxD) {
                        mxL = max(mxL, l[i]);
                        mnR = min(mnR, r[i]);
                }
                add_point(mxL, maxD);
                add_point(mnR, maxD);

                mxL = 0;
                mnR = 2 * n;

                for (int i = 0; i < n; i++) if (d[i] <= minU) {
                        mxL = max(mxL, l[i]);
                        mnR = min(mnR, r[i]);
                }

                add_point(mxL, minU);
                add_point(mnR, minU);

                for (int h = minU + 1; h < maxD; h++)
                        add_point(minR, h);
        }
}

signed main() {
        ios::sync_with_stdio(0);
        cin.tie(0);

        cin >> n >> k;
        X.reserve(2 * n), Y.reserve(2 * n);
        for (int i = 0; i < n; i++) {
                cin >> l[i] >> d[i] >> r[i] >> u[i];
                X.push_back(l[i]);
                X.push_back(r[i]);
                Y.push_back(d[i]);
                Y.push_back(u[i]);
        }
        sort(X.begin(), X.end());
        X.resize(unique(X.begin(), X.end()) - X.begin());

        sort(Y.begin(), Y.end());
        Y.resize(unique(Y.begin(), Y.end()) - Y.begin());

        for (int i = 0; i < n; i++) {
                l[i] = lower_bound(X.begin(), X.end(), l[i]) - X.begin();
                r[i] = lower_bound(X.begin(), X.end(), r[i]) - X.begin();

                u[i] = lower_bound(Y.begin(), Y.end(), u[i]) - Y.begin();
                d[i] = lower_bound(Y.begin(), Y.end(), d[i]) - Y.begin();
        }

        for (int i = 0; i < n; i++)
                used[i] = true;

        rec();
        cout << "NO I DID NOT FIND ANYTHING\n";
        return 0;
}

Compilation message

hamburg.cpp: In function 'void rec()':
hamburg.cpp:51:27: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   51 |         if (points.size() >= k)
      |             ~~~~~~~~~~~~~~^~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19284 KB Output is correct
2 Correct 12 ms 19268 KB Output is correct
3 Correct 14 ms 19260 KB Output is correct
4 Correct 13 ms 19248 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 19304 KB Output is correct
2 Correct 14 ms 19284 KB Output is correct
3 Correct 13 ms 19188 KB Output is correct
4 Correct 13 ms 19272 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19284 KB Output is correct
2 Correct 12 ms 19264 KB Output is correct
3 Correct 13 ms 19284 KB Output is correct
4 Correct 13 ms 19188 KB Output is correct
5 Correct 12 ms 19260 KB Output is correct
6 Correct 14 ms 19272 KB Output is correct
7 Correct 15 ms 19284 KB Output is correct
8 Correct 14 ms 19284 KB Output is correct
9 Correct 14 ms 19244 KB Output is correct
10 Correct 13 ms 19220 KB Output is correct
11 Correct 13 ms 19228 KB Output is correct
12 Correct 13 ms 19244 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19224 KB Output is correct
2 Correct 12 ms 19284 KB Output is correct
3 Correct 13 ms 19284 KB Output is correct
4 Correct 13 ms 19392 KB Output is correct
5 Correct 14 ms 19232 KB Output is correct
6 Correct 16 ms 19268 KB Output is correct
7 Correct 14 ms 19284 KB Output is correct
8 Correct 13 ms 19284 KB Output is correct
9 Correct 13 ms 19228 KB Output is correct
10 Correct 13 ms 19284 KB Output is correct
11 Correct 13 ms 19300 KB Output is correct
12 Correct 13 ms 19264 KB Output is correct
13 Correct 16 ms 19252 KB Output is correct
14 Correct 351 ms 19404 KB Output is correct
15 Correct 15 ms 19232 KB Output is correct
16 Correct 14 ms 19284 KB Output is correct
17 Correct 701 ms 19288 KB Output is correct
18 Correct 16 ms 19284 KB Output is correct
19 Correct 16 ms 19264 KB Output is correct
20 Correct 1642 ms 19276 KB Output is correct
21 Correct 21 ms 19264 KB Output is correct
22 Correct 17 ms 19284 KB Output is correct
23 Correct 624 ms 19284 KB Output is correct
24 Correct 18 ms 19256 KB Output is correct
25 Correct 14 ms 19212 KB Output is correct
26 Correct 14 ms 19284 KB Output is correct
27 Correct 14 ms 19284 KB Output is correct
28 Correct 14 ms 19244 KB Output is correct
29 Correct 14 ms 19300 KB Output is correct
30 Correct 14 ms 19284 KB Output is correct
31 Correct 306 ms 19288 KB Output is correct
32 Correct 255 ms 19284 KB Output is correct
33 Correct 459 ms 19284 KB Output is correct
34 Correct 192 ms 19288 KB Output is correct
35 Correct 671 ms 19268 KB Output is correct
36 Correct 907 ms 19288 KB Output is correct
37 Correct 569 ms 19404 KB Output is correct
38 Correct 1213 ms 19268 KB Output is correct
39 Correct 1313 ms 19280 KB Output is correct
40 Correct 701 ms 19376 KB Output is correct
41 Correct 81 ms 19284 KB Output is correct
42 Correct 727 ms 19300 KB Output is correct
43 Correct 715 ms 19284 KB Output is correct
44 Correct 620 ms 19396 KB Output is correct
45 Correct 14 ms 19268 KB Output is correct
46 Correct 734 ms 19280 KB Output is correct
47 Correct 1294 ms 19284 KB Output is correct
48 Correct 1706 ms 19280 KB Output is correct
49 Correct 484 ms 19284 KB Output is correct
50 Correct 400 ms 19288 KB Output is correct
51 Correct 1155 ms 19284 KB Output is correct
52 Correct 709 ms 19404 KB Output is correct
53 Correct 483 ms 19284 KB Output is correct
54 Correct 555 ms 19284 KB Output is correct
55 Correct 17 ms 19284 KB Output is correct
56 Correct 20 ms 19284 KB Output is correct
57 Correct 20 ms 19300 KB Output is correct
58 Correct 19 ms 19284 KB Output is correct

Subtask #5
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19284 KB Output is correct
2 Correct 12 ms 19268 KB Output is correct
3 Correct 14 ms 19260 KB Output is correct
4 Correct 13 ms 19248 KB Output is correct
5 Correct 276 ms 27296 KB Output is correct
6 Correct 290 ms 27304 KB Output is correct
7 Correct 297 ms 27296 KB Output is correct
8 Correct 273 ms 27296 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 19304 KB Output is correct
2 Correct 14 ms 19284 KB Output is correct
3 Correct 13 ms 19188 KB Output is correct
4 Correct 13 ms 19272 KB Output is correct
5 Correct 291 ms 27348 KB Output is correct
6 Correct 296 ms 27656 KB Output is correct
7 Correct 294 ms 27432 KB Output is correct
8 Correct 288 ms 27400 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19284 KB Output is correct
2 Correct 12 ms 19264 KB Output is correct
3 Correct 13 ms 19284 KB Output is correct
4 Correct 13 ms 19188 KB Output is correct
5 Correct 12 ms 19260 KB Output is correct
6 Correct 14 ms 19272 KB Output is correct
7 Correct 15 ms 19284 KB Output is correct
8 Correct 14 ms 19284 KB Output is correct
9 Correct 14 ms 19244 KB Output is correct
10 Correct 13 ms 19220 KB Output is correct
11 Correct 13 ms 19228 KB Output is correct
12 Correct 13 ms 19244 KB Output is correct
13 Correct 294 ms 27296 KB Output is correct
14 Correct 301 ms 27100 KB Output is correct
15 Correct 289 ms 27260 KB Output is correct
16 Correct 279 ms 27296 KB Output is correct
17 Correct 295 ms 27236 KB Output is correct
18 Correct 298 ms 27308 KB Output is correct
19 Correct 304 ms 27172 KB Output is correct
20 Correct 318 ms 27144 KB Output is correct
21 Correct 393 ms 27448 KB Output is correct
22 Correct 344 ms 27324 KB Output is correct
23 Correct 313 ms 27288 KB Output is correct
24 Correct 310 ms 27364 KB Output is correct

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19224 KB Output is correct
2 Correct 12 ms 19284 KB Output is correct
3 Correct 13 ms 19284 KB Output is correct
4 Correct 13 ms 19392 KB Output is correct
5 Correct 14 ms 19232 KB Output is correct
6 Correct 16 ms 19268 KB Output is correct
7 Correct 14 ms 19284 KB Output is correct
8 Correct 13 ms 19284 KB Output is correct
9 Correct 13 ms 19228 KB Output is correct
10 Correct 13 ms 19284 KB Output is correct
11 Correct 13 ms 19300 KB Output is correct
12 Correct 13 ms 19264 KB Output is correct
13 Correct 16 ms 19252 KB Output is correct
14 Correct 351 ms 19404 KB Output is correct
15 Correct 15 ms 19232 KB Output is correct
16 Correct 14 ms 19284 KB Output is correct
17 Correct 701 ms 19288 KB Output is correct
18 Correct 16 ms 19284 KB Output is correct
19 Correct 16 ms 19264 KB Output is correct
20 Correct 1642 ms 19276 KB Output is correct
21 Correct 21 ms 19264 KB Output is correct
22 Correct 17 ms 19284 KB Output is correct
23 Correct 624 ms 19284 KB Output is correct
24 Correct 18 ms 19256 KB Output is correct
25 Correct 14 ms 19212 KB Output is correct
26 Correct 14 ms 19284 KB Output is correct
27 Correct 14 ms 19284 KB Output is correct
28 Correct 14 ms 19244 KB Output is correct
29 Correct 14 ms 19300 KB Output is correct
30 Correct 14 ms 19284 KB Output is correct
31 Correct 306 ms 19288 KB Output is correct
32 Correct 255 ms 19284 KB Output is correct
33 Correct 459 ms 19284 KB Output is correct
34 Correct 192 ms 19288 KB Output is correct
35 Correct 671 ms 19268 KB Output is correct
36 Correct 907 ms 19288 KB Output is correct
37 Correct 569 ms 19404 KB Output is correct
38 Correct 1213 ms 19268 KB Output is correct
39 Correct 1313 ms 19280 KB Output is correct
40 Correct 701 ms 19376 KB Output is correct
41 Correct 81 ms 19284 KB Output is correct
42 Correct 727 ms 19300 KB Output is correct
43 Correct 715 ms 19284 KB Output is correct
44 Correct 620 ms 19396 KB Output is correct
45 Correct 14 ms 19268 KB Output is correct
46 Correct 734 ms 19280 KB Output is correct
47 Correct 1294 ms 19284 KB Output is correct
48 Correct 1706 ms 19280 KB Output is correct
49 Correct 484 ms 19284 KB Output is correct
50 Correct 400 ms 19288 KB Output is correct
51 Correct 1155 ms 19284 KB Output is correct
52 Correct 709 ms 19404 KB Output is correct
53 Correct 483 ms 19284 KB Output is correct
54 Correct 555 ms 19284 KB Output is correct
55 Correct 17 ms 19284 KB Output is correct
56 Correct 20 ms 19284 KB Output is correct
57 Correct 20 ms 19300 KB Output is correct
58 Correct 19 ms 19284 KB Output is correct
59 Correct 310 ms 26948 KB Output is correct
60 Correct 271 ms 26916 KB Output is correct
61 Correct 309 ms 26920 KB Output is correct
62 Correct 293 ms 26920 KB Output is correct
63 Correct 273 ms 26956 KB Output is correct
64 Correct 289 ms 27044 KB Output is correct
65 Correct 289 ms 26912 KB Output is correct
66 Correct 276 ms 27040 KB Output is correct
67 Correct 344 ms 27148 KB Output is correct
68 Correct 338 ms 27024 KB Output is correct
69 Correct 302 ms 27144 KB Output is correct
70 Correct 307 ms 26876 KB Output is correct
71 Correct 637 ms 27116 KB Output is correct
72 Execution timed out 3094 ms 26996 KB Time limit exceeded
73 Halted 0 ms 0 KB -