oj.uz

답안 #648440

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
648440 2022-10-06T13:34:59 Z 406 함박 스테이크 (JOI20_hamburg) C++17
21 / 100
 3000 ms 10836 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;
                for (int i = 0; i < n; i++) if (l[i] <= minR)
                        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);
                }
                random_shuffle(p.begin(), p.end());

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

Subtask #1
1.0 / 1.0

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

Subtask #2
1.0 / 1.0

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

Subtask #3
3.0 / 3.0

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

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 5 ms 436 KB Output is correct
14 Correct 46 ms 468 KB Output is correct
15 Correct 5 ms 340 KB Output is correct
16 Correct 6 ms 340 KB Output is correct
17 Correct 33 ms 464 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 5 ms 340 KB Output is correct
20 Correct 60 ms 468 KB Output is correct
21 Correct 6 ms 340 KB Output is correct
22 Correct 4 ms 340 KB Output is correct
23 Correct 17 ms 476 KB Output is correct
24 Correct 4 ms 444 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 4 ms 340 KB Output is correct
27 Correct 4 ms 340 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 3 ms 416 KB Output is correct
30 Correct 4 ms 340 KB Output is correct
31 Correct 112 ms 468 KB Output is correct
32 Correct 40 ms 468 KB Output is correct
33 Correct 83 ms 340 KB Output is correct
34 Correct 12 ms 436 KB Output is correct
35 Correct 6 ms 432 KB Output is correct
36 Correct 57 ms 468 KB Output is correct
37 Correct 129 ms 468 KB Output is correct
38 Correct 48 ms 456 KB Output is correct
39 Correct 40 ms 440 KB Output is correct
40 Correct 88 ms 468 KB Output is correct
41 Correct 32 ms 468 KB Output is correct
42 Correct 15 ms 468 KB Output is correct
43 Correct 93 ms 476 KB Output is correct
44 Correct 14 ms 468 KB Output is correct
45 Correct 4 ms 428 KB Output is correct
46 Correct 22 ms 476 KB Output is correct
47 Correct 24 ms 464 KB Output is correct
48 Correct 7 ms 428 KB Output is correct
49 Correct 128 ms 468 KB Output is correct
50 Correct 14 ms 468 KB Output is correct
51 Correct 55 ms 464 KB Output is correct
52 Correct 21 ms 524 KB Output is correct
53 Correct 11 ms 432 KB Output is correct
54 Correct 12 ms 464 KB Output is correct
55 Correct 5 ms 468 KB Output is correct
56 Correct 5 ms 468 KB Output is correct
57 Correct 6 ms 468 KB Output is correct
58 Correct 5 ms 468 KB Output is correct

Subtask #5
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 282 ms 7748 KB Output is correct
6 Correct 263 ms 7740 KB Output is correct
7 Correct 312 ms 7848 KB Output is correct
8 Correct 270 ms 7748 KB Output is correct

Subtask #6
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 4 ms 404 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 278 ms 7816 KB Output is correct
6 Correct 314 ms 8108 KB Output is correct
7 Correct 266 ms 7864 KB Output is correct
8 Correct 310 ms 7916 KB Output is correct

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 416 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 277 ms 7756 KB Output is correct
14 Correct 317 ms 7472 KB Output is correct
15 Correct 286 ms 7884 KB Output is correct
16 Correct 298 ms 7740 KB Output is correct
17 Correct 273 ms 7612 KB Output is correct
18 Correct 273 ms 7756 KB Output is correct
19 Correct 293 ms 7624 KB Output is correct
20 Correct 275 ms 7672 KB Output is correct
21 Correct 402 ms 7928 KB Output is correct
22 Correct 350 ms 7688 KB Output is correct
23 Correct 307 ms 7780 KB Output is correct
24 Correct 331 ms 7784 KB Output is correct

Subtask #8
0 / 79.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 5 ms 436 KB Output is correct
14 Correct 46 ms 468 KB Output is correct
15 Correct 5 ms 340 KB Output is correct
16 Correct 6 ms 340 KB Output is correct
17 Correct 33 ms 464 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 5 ms 340 KB Output is correct
20 Correct 60 ms 468 KB Output is correct
21 Correct 6 ms 340 KB Output is correct
22 Correct 4 ms 340 KB Output is correct
23 Correct 17 ms 476 KB Output is correct
24 Correct 4 ms 444 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 4 ms 340 KB Output is correct
27 Correct 4 ms 340 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 3 ms 416 KB Output is correct
30 Correct 4 ms 340 KB Output is correct
31 Correct 112 ms 468 KB Output is correct
32 Correct 40 ms 468 KB Output is correct
33 Correct 83 ms 340 KB Output is correct
34 Correct 12 ms 436 KB Output is correct
35 Correct 6 ms 432 KB Output is correct
36 Correct 57 ms 468 KB Output is correct
37 Correct 129 ms 468 KB Output is correct
38 Correct 48 ms 456 KB Output is correct
39 Correct 40 ms 440 KB Output is correct
40 Correct 88 ms 468 KB Output is correct
41 Correct 32 ms 468 KB Output is correct
42 Correct 15 ms 468 KB Output is correct
43 Correct 93 ms 476 KB Output is correct
44 Correct 14 ms 468 KB Output is correct
45 Correct 4 ms 428 KB Output is correct
46 Correct 22 ms 476 KB Output is correct
47 Correct 24 ms 464 KB Output is correct
48 Correct 7 ms 428 KB Output is correct
49 Correct 128 ms 468 KB Output is correct
50 Correct 14 ms 468 KB Output is correct
51 Correct 55 ms 464 KB Output is correct
52 Correct 21 ms 524 KB Output is correct
53 Correct 11 ms 432 KB Output is correct
54 Correct 12 ms 464 KB Output is correct
55 Correct 5 ms 468 KB Output is correct
56 Correct 5 ms 468 KB Output is correct
57 Correct 6 ms 468 KB Output is correct
58 Correct 5 ms 468 KB Output is correct
59 Correct 307 ms 7616 KB Output is correct
60 Correct 276 ms 7616 KB Output is correct
61 Correct 264 ms 7636 KB Output is correct
62 Correct 279 ms 7632 KB Output is correct
63 Correct 263 ms 7656 KB Output is correct
64 Correct 274 ms 7676 KB Output is correct
65 Correct 278 ms 7608 KB Output is correct
66 Correct 275 ms 7624 KB Output is correct
67 Correct 369 ms 7696 KB Output is correct
68 Correct 345 ms 7640 KB Output is correct
69 Correct 283 ms 8028 KB Output is correct
70 Correct 299 ms 7556 KB Output is correct
71 Correct 621 ms 7952 KB Output is correct
72 Execution timed out 3057 ms 10836 KB Time limit exceeded
73 Halted 0 ms 0 KB -