oj.uz

답안 #648438

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
648438 2022-10-06T13:32:30 Z 406 함박 스테이크 (JOI20_hamburg) C++17
21 / 100
 3000 ms 12096 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;
int 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 i = 0; i < n; i++)
                        op[d[i]]++, cl[u[i]]++;

                vector<int> p;
                for (int h = 0; h < Y.size(); h++) {
                        if (p.size() && p.back() == (h - 1))
                                p.back()++;
                        else if (op[h])
                                p.push_back(h);
                        if (cl[h])
                                p.push_back(-1);
                }
                sort(p.rbegin(), p.rend());
                p.pop_back();

                random_shuffle(p.begin(), p.end());

                for (auto h: p)
                        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:52: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]
   52 |         if (points.size() >= k)
      |             ~~~~~~~~~~~~~~^~~~
hamburg.cpp:122:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |                 for (int h = 0; h < Y.size(); h++) {
      |                                 ~~^~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 468 KB Output is correct
2 Correct 3 ms 472 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 468 KB Output is correct

Subtask #2
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 476 KB Output is correct

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 472 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 4 ms 476 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 5 ms 468 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 480 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 476 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 3 ms 472 KB Output is correct
8 Correct 3 ms 444 KB Output is correct
9 Correct 3 ms 476 KB Output is correct
10 Correct 3 ms 476 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 6 ms 468 KB Output is correct
14 Correct 179 ms 552 KB Output is correct
15 Correct 6 ms 468 KB Output is correct
16 Correct 5 ms 480 KB Output is correct
17 Correct 77 ms 520 KB Output is correct
18 Correct 5 ms 468 KB Output is correct
19 Correct 6 ms 476 KB Output is correct
20 Correct 370 ms 536 KB Output is correct
21 Correct 7 ms 468 KB Output is correct
22 Correct 6 ms 468 KB Output is correct
23 Correct 32 ms 468 KB Output is correct
24 Correct 5 ms 468 KB Output is correct
25 Correct 5 ms 480 KB Output is correct
26 Correct 5 ms 468 KB Output is correct
27 Correct 6 ms 468 KB Output is correct
28 Correct 4 ms 440 KB Output is correct
29 Correct 4 ms 468 KB Output is correct
30 Correct 5 ms 468 KB Output is correct
31 Correct 216 ms 540 KB Output is correct
32 Correct 11 ms 468 KB Output is correct
33 Correct 263 ms 528 KB Output is correct
34 Correct 26 ms 448 KB Output is correct
35 Correct 51 ms 500 KB Output is correct
36 Correct 49 ms 552 KB Output is correct
37 Correct 57 ms 556 KB Output is correct
38 Correct 206 ms 540 KB Output is correct
39 Correct 116 ms 540 KB Output is correct
40 Correct 79 ms 552 KB Output is correct
41 Correct 73 ms 548 KB Output is correct
42 Correct 225 ms 548 KB Output is correct
43 Correct 76 ms 540 KB Output is correct
44 Correct 36 ms 468 KB Output is correct
45 Correct 6 ms 476 KB Output is correct
46 Correct 118 ms 544 KB Output is correct
47 Correct 32 ms 540 KB Output is correct
48 Correct 69 ms 468 KB Output is correct
49 Correct 109 ms 620 KB Output is correct
50 Correct 75 ms 536 KB Output is correct
51 Correct 55 ms 552 KB Output is correct
52 Correct 37 ms 556 KB Output is correct
53 Correct 16 ms 560 KB Output is correct
54 Correct 142 ms 540 KB Output is correct
55 Correct 9 ms 520 KB Output is correct
56 Correct 10 ms 512 KB Output is correct
57 Correct 10 ms 504 KB Output is correct
58 Correct 9 ms 468 KB Output is correct

Subtask #5
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 468 KB Output is correct
2 Correct 3 ms 472 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 317 ms 8764 KB Output is correct
6 Correct 325 ms 8760 KB Output is correct
7 Correct 321 ms 8768 KB Output is correct
8 Correct 359 ms 8768 KB Output is correct

Subtask #6
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 476 KB Output is correct
5 Correct 322 ms 8772 KB Output is correct
6 Correct 322 ms 9120 KB Output is correct
7 Correct 329 ms 8872 KB Output is correct
8 Correct 340 ms 8860 KB Output is correct

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 472 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 4 ms 476 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 5 ms 468 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 311 ms 8760 KB Output is correct
14 Correct 335 ms 8512 KB Output is correct
15 Correct 321 ms 8764 KB Output is correct
16 Correct 343 ms 8772 KB Output is correct
17 Correct 378 ms 8632 KB Output is correct
18 Correct 380 ms 8812 KB Output is correct
19 Correct 309 ms 8640 KB Output is correct
20 Correct 352 ms 8756 KB Output is correct
21 Correct 440 ms 8948 KB Output is correct
22 Correct 388 ms 8692 KB Output is correct
23 Correct 354 ms 8788 KB Output is correct
24 Correct 353 ms 8840 KB Output is correct

Subtask #8
0 / 79.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 480 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 476 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 3 ms 472 KB Output is correct
8 Correct 3 ms 444 KB Output is correct
9 Correct 3 ms 476 KB Output is correct
10 Correct 3 ms 476 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 6 ms 468 KB Output is correct
14 Correct 179 ms 552 KB Output is correct
15 Correct 6 ms 468 KB Output is correct
16 Correct 5 ms 480 KB Output is correct
17 Correct 77 ms 520 KB Output is correct
18 Correct 5 ms 468 KB Output is correct
19 Correct 6 ms 476 KB Output is correct
20 Correct 370 ms 536 KB Output is correct
21 Correct 7 ms 468 KB Output is correct
22 Correct 6 ms 468 KB Output is correct
23 Correct 32 ms 468 KB Output is correct
24 Correct 5 ms 468 KB Output is correct
25 Correct 5 ms 480 KB Output is correct
26 Correct 5 ms 468 KB Output is correct
27 Correct 6 ms 468 KB Output is correct
28 Correct 4 ms 440 KB Output is correct
29 Correct 4 ms 468 KB Output is correct
30 Correct 5 ms 468 KB Output is correct
31 Correct 216 ms 540 KB Output is correct
32 Correct 11 ms 468 KB Output is correct
33 Correct 263 ms 528 KB Output is correct
34 Correct 26 ms 448 KB Output is correct
35 Correct 51 ms 500 KB Output is correct
36 Correct 49 ms 552 KB Output is correct
37 Correct 57 ms 556 KB Output is correct
38 Correct 206 ms 540 KB Output is correct
39 Correct 116 ms 540 KB Output is correct
40 Correct 79 ms 552 KB Output is correct
41 Correct 73 ms 548 KB Output is correct
42 Correct 225 ms 548 KB Output is correct
43 Correct 76 ms 540 KB Output is correct
44 Correct 36 ms 468 KB Output is correct
45 Correct 6 ms 476 KB Output is correct
46 Correct 118 ms 544 KB Output is correct
47 Correct 32 ms 540 KB Output is correct
48 Correct 69 ms 468 KB Output is correct
49 Correct 109 ms 620 KB Output is correct
50 Correct 75 ms 536 KB Output is correct
51 Correct 55 ms 552 KB Output is correct
52 Correct 37 ms 556 KB Output is correct
53 Correct 16 ms 560 KB Output is correct
54 Correct 142 ms 540 KB Output is correct
55 Correct 9 ms 520 KB Output is correct
56 Correct 10 ms 512 KB Output is correct
57 Correct 10 ms 504 KB Output is correct
58 Correct 9 ms 468 KB Output is correct
59 Correct 291 ms 8376 KB Output is correct
60 Correct 359 ms 8396 KB Output is correct
61 Correct 278 ms 8460 KB Output is correct
62 Correct 285 ms 8380 KB Output is correct
63 Correct 291 ms 8392 KB Output is correct
64 Correct 273 ms 8508 KB Output is correct
65 Correct 280 ms 8384 KB Output is correct
66 Correct 281 ms 8512 KB Output is correct
67 Correct 366 ms 8440 KB Output is correct
68 Correct 328 ms 8428 KB Output is correct
69 Correct 301 ms 8648 KB Output is correct
70 Correct 309 ms 8320 KB Output is correct
71 Correct 636 ms 8520 KB Output is correct
72 Execution timed out 3096 ms 12096 KB Time limit exceeded
73 Halted 0 ms 0 KB -