oj.uz

Submission #648343

# Submission time Handle Problem Language Result Execution time Memory
648343 2022-10-06T08:00:28 Z 406 Hamburg Steak (JOI20_hamburg) C++17
21 / 100
 3000 ms 26896 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) {
                add_point(minR, minU);
        }
        else if (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;
                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 19272 KB Output is correct
2 Correct 12 ms 19284 KB Output is correct
3 Correct 12 ms 19228 KB Output is correct
4 Correct 12 ms 19284 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 19236 KB Output is correct
2 Correct 13 ms 19264 KB Output is correct
3 Correct 14 ms 19312 KB Output is correct
4 Correct 12 ms 19284 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 19284 KB Output is correct
2 Correct 16 ms 19272 KB Output is correct
3 Correct 12 ms 19172 KB Output is correct
4 Correct 12 ms 19224 KB Output is correct
5 Correct 15 ms 19284 KB Output is correct
6 Correct 16 ms 19188 KB Output is correct
7 Correct 13 ms 19204 KB Output is correct
8 Correct 13 ms 19220 KB Output is correct
9 Correct 14 ms 19184 KB Output is correct
10 Correct 15 ms 19284 KB Output is correct
11 Correct 14 ms 19284 KB Output is correct
12 Correct 14 ms 19296 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 19284 KB Output is correct
2 Correct 15 ms 19236 KB Output is correct
3 Correct 16 ms 19284 KB Output is correct
4 Correct 12 ms 19284 KB Output is correct
5 Correct 13 ms 19264 KB Output is correct
6 Correct 14 ms 19172 KB Output is correct
7 Correct 14 ms 19256 KB Output is correct
8 Correct 12 ms 19268 KB Output is correct
9 Correct 13 ms 19284 KB Output is correct
10 Correct 15 ms 19284 KB Output is correct
11 Correct 13 ms 19268 KB Output is correct
12 Correct 13 ms 19284 KB Output is correct
13 Correct 18 ms 19300 KB Output is correct
14 Correct 356 ms 19288 KB Output is correct
15 Correct 15 ms 19284 KB Output is correct
16 Correct 14 ms 19228 KB Output is correct
17 Correct 704 ms 19288 KB Output is correct
18 Correct 18 ms 19284 KB Output is correct
19 Correct 15 ms 19284 KB Output is correct
20 Correct 1691 ms 19276 KB Output is correct
21 Correct 15 ms 19284 KB Output is correct
22 Correct 15 ms 19284 KB Output is correct
23 Correct 656 ms 19292 KB Output is correct
24 Correct 15 ms 19284 KB Output is correct
25 Correct 16 ms 19280 KB Output is correct
26 Correct 15 ms 19284 KB Output is correct
27 Correct 18 ms 19284 KB Output is correct
28 Correct 15 ms 19264 KB Output is correct
29 Correct 15 ms 19212 KB Output is correct
30 Correct 13 ms 19284 KB Output is correct
31 Correct 295 ms 19280 KB Output is correct
32 Correct 262 ms 19188 KB Output is correct
33 Correct 477 ms 19280 KB Output is correct
34 Correct 162 ms 19292 KB Output is correct
35 Correct 653 ms 19400 KB Output is correct
36 Correct 882 ms 19412 KB Output is correct
37 Correct 566 ms 19284 KB Output is correct
38 Correct 1254 ms 19280 KB Output is correct
39 Correct 1343 ms 19296 KB Output is correct
40 Correct 708 ms 19292 KB Output is correct
41 Correct 74 ms 19284 KB Output is correct
42 Correct 783 ms 19280 KB Output is correct
43 Correct 732 ms 19284 KB Output is correct
44 Correct 592 ms 19284 KB Output is correct
45 Correct 17 ms 19284 KB Output is correct
46 Correct 738 ms 19272 KB Output is correct
47 Correct 1341 ms 19284 KB Output is correct
48 Correct 1701 ms 19200 KB Output is correct
49 Correct 493 ms 19212 KB Output is correct
50 Correct 373 ms 19208 KB Output is correct
51 Correct 1200 ms 19204 KB Output is correct
52 Correct 722 ms 19204 KB Output is correct
53 Correct 508 ms 19204 KB Output is correct
54 Correct 600 ms 19204 KB Output is correct
55 Correct 968 ms 19208 KB Output is correct
56 Correct 936 ms 19204 KB Output is correct
57 Correct 903 ms 19204 KB Output is correct
58 Correct 933 ms 19332 KB Output is correct

Subtask #5
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19272 KB Output is correct
2 Correct 12 ms 19284 KB Output is correct
3 Correct 12 ms 19228 KB Output is correct
4 Correct 12 ms 19284 KB Output is correct
5 Correct 297 ms 26444 KB Output is correct
6 Correct 304 ms 26444 KB Output is correct
7 Correct 294 ms 26536 KB Output is correct
8 Correct 291 ms 26508 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 19236 KB Output is correct
2 Correct 13 ms 19264 KB Output is correct
3 Correct 14 ms 19312 KB Output is correct
4 Correct 12 ms 19284 KB Output is correct
5 Correct 303 ms 26528 KB Output is correct
6 Correct 309 ms 26896 KB Output is correct
7 Correct 282 ms 26564 KB Output is correct
8 Correct 307 ms 26692 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 19284 KB Output is correct
2 Correct 16 ms 19272 KB Output is correct
3 Correct 12 ms 19172 KB Output is correct
4 Correct 12 ms 19224 KB Output is correct
5 Correct 15 ms 19284 KB Output is correct
6 Correct 16 ms 19188 KB Output is correct
7 Correct 13 ms 19204 KB Output is correct
8 Correct 13 ms 19220 KB Output is correct
9 Correct 14 ms 19184 KB Output is correct
10 Correct 15 ms 19284 KB Output is correct
11 Correct 14 ms 19284 KB Output is correct
12 Correct 14 ms 19296 KB Output is correct
13 Correct 349 ms 26524 KB Output is correct
14 Correct 290 ms 26276 KB Output is correct
15 Correct 275 ms 26608 KB Output is correct
16 Correct 285 ms 26516 KB Output is correct
17 Correct 294 ms 26412 KB Output is correct
18 Correct 268 ms 26448 KB Output is correct
19 Correct 272 ms 26448 KB Output is correct
20 Correct 284 ms 26436 KB Output is correct
21 Correct 374 ms 26680 KB Output is correct
22 Correct 305 ms 26560 KB Output is correct
23 Correct 303 ms 26648 KB Output is correct
24 Correct 305 ms 26672 KB Output is correct

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 19284 KB Output is correct
2 Correct 15 ms 19236 KB Output is correct
3 Correct 16 ms 19284 KB Output is correct
4 Correct 12 ms 19284 KB Output is correct
5 Correct 13 ms 19264 KB Output is correct
6 Correct 14 ms 19172 KB Output is correct
7 Correct 14 ms 19256 KB Output is correct
8 Correct 12 ms 19268 KB Output is correct
9 Correct 13 ms 19284 KB Output is correct
10 Correct 15 ms 19284 KB Output is correct
11 Correct 13 ms 19268 KB Output is correct
12 Correct 13 ms 19284 KB Output is correct
13 Correct 18 ms 19300 KB Output is correct
14 Correct 356 ms 19288 KB Output is correct
15 Correct 15 ms 19284 KB Output is correct
16 Correct 14 ms 19228 KB Output is correct
17 Correct 704 ms 19288 KB Output is correct
18 Correct 18 ms 19284 KB Output is correct
19 Correct 15 ms 19284 KB Output is correct
20 Correct 1691 ms 19276 KB Output is correct
21 Correct 15 ms 19284 KB Output is correct
22 Correct 15 ms 19284 KB Output is correct
23 Correct 656 ms 19292 KB Output is correct
24 Correct 15 ms 19284 KB Output is correct
25 Correct 16 ms 19280 KB Output is correct
26 Correct 15 ms 19284 KB Output is correct
27 Correct 18 ms 19284 KB Output is correct
28 Correct 15 ms 19264 KB Output is correct
29 Correct 15 ms 19212 KB Output is correct
30 Correct 13 ms 19284 KB Output is correct
31 Correct 295 ms 19280 KB Output is correct
32 Correct 262 ms 19188 KB Output is correct
33 Correct 477 ms 19280 KB Output is correct
34 Correct 162 ms 19292 KB Output is correct
35 Correct 653 ms 19400 KB Output is correct
36 Correct 882 ms 19412 KB Output is correct
37 Correct 566 ms 19284 KB Output is correct
38 Correct 1254 ms 19280 KB Output is correct
39 Correct 1343 ms 19296 KB Output is correct
40 Correct 708 ms 19292 KB Output is correct
41 Correct 74 ms 19284 KB Output is correct
42 Correct 783 ms 19280 KB Output is correct
43 Correct 732 ms 19284 KB Output is correct
44 Correct 592 ms 19284 KB Output is correct
45 Correct 17 ms 19284 KB Output is correct
46 Correct 738 ms 19272 KB Output is correct
47 Correct 1341 ms 19284 KB Output is correct
48 Correct 1701 ms 19200 KB Output is correct
49 Correct 493 ms 19212 KB Output is correct
50 Correct 373 ms 19208 KB Output is correct
51 Correct 1200 ms 19204 KB Output is correct
52 Correct 722 ms 19204 KB Output is correct
53 Correct 508 ms 19204 KB Output is correct
54 Correct 600 ms 19204 KB Output is correct
55 Correct 968 ms 19208 KB Output is correct
56 Correct 936 ms 19204 KB Output is correct
57 Correct 903 ms 19204 KB Output is correct
58 Correct 933 ms 19332 KB Output is correct
59 Correct 271 ms 26404 KB Output is correct
60 Correct 281 ms 26404 KB Output is correct
61 Correct 272 ms 26416 KB Output is correct
62 Correct 276 ms 26448 KB Output is correct
63 Correct 266 ms 26444 KB Output is correct
64 Correct 284 ms 26596 KB Output is correct
65 Correct 275 ms 26428 KB Output is correct
66 Correct 272 ms 26412 KB Output is correct
67 Correct 339 ms 26568 KB Output is correct
68 Correct 307 ms 26404 KB Output is correct
69 Correct 285 ms 26620 KB Output is correct
70 Correct 292 ms 26388 KB Output is correct
71 Correct 609 ms 26548 KB Output is correct
72 Execution timed out 3040 ms 26288 KB Time limit exceeded
73 Halted 0 ms 0 KB -