oj.uz

Submission #648341

# Submission time Handle Problem Language Result Execution time Memory
648341 2022-10-06T07:49:38 Z 406 Hamburg Steak (JOI20_hamburg) C++17
15 / 100
 3000 ms 27180 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);
                }
        }
        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 = 0; h < Y.size(); 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:49: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]
   49 |         if (points.size() >= k)
      |             ~~~~~~~~~~~~~~^~~~
hamburg.cpp:78:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |                 for (int h = 0; h < Y.size(); h++)
      |                                 ~~^~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19220 KB Output is correct
2 Correct 13 ms 19276 KB Output is correct
3 Correct 12 ms 19284 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 13 ms 19248 KB Output is correct
2 Correct 13 ms 19268 KB Output is correct
3 Correct 14 ms 19512 KB Output is correct
4 Correct 13 ms 19268 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19268 KB Output is correct
2 Correct 13 ms 19228 KB Output is correct
3 Correct 13 ms 19268 KB Output is correct
4 Correct 13 ms 19268 KB Output is correct
5 Correct 12 ms 19284 KB Output is correct
6 Correct 13 ms 19284 KB Output is correct
7 Correct 13 ms 19284 KB Output is correct
8 Correct 14 ms 19268 KB Output is correct
9 Correct 16 ms 19268 KB Output is correct
10 Correct 15 ms 19260 KB Output is correct
11 Correct 13 ms 19248 KB Output is correct
12 Correct 13 ms 19268 KB Output is correct

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19304 KB Output is correct
2 Correct 13 ms 19284 KB Output is correct
3 Correct 13 ms 19236 KB Output is correct
4 Correct 12 ms 19268 KB Output is correct
5 Correct 12 ms 19264 KB Output is correct
6 Correct 13 ms 19264 KB Output is correct
7 Correct 14 ms 19348 KB Output is correct
8 Correct 12 ms 19248 KB Output is correct
9 Correct 13 ms 19224 KB Output is correct
10 Correct 13 ms 19228 KB Output is correct
11 Correct 12 ms 19284 KB Output is correct
12 Correct 13 ms 19268 KB Output is correct
13 Correct 17 ms 19228 KB Output is correct
14 Correct 1756 ms 19412 KB Output is correct
15 Correct 16 ms 19284 KB Output is correct
16 Correct 15 ms 19268 KB Output is correct
17 Correct 1743 ms 19288 KB Output is correct
18 Correct 16 ms 19284 KB Output is correct
19 Correct 16 ms 19284 KB Output is correct
20 Correct 2858 ms 19292 KB Output is correct
21 Correct 17 ms 19280 KB Output is correct
22 Correct 15 ms 19284 KB Output is correct
23 Correct 2250 ms 19284 KB Output is correct
24 Correct 16 ms 19284 KB Output is correct
25 Correct 14 ms 19264 KB Output is correct
26 Correct 15 ms 19188 KB Output is correct
27 Correct 14 ms 19268 KB Output is correct
28 Correct 14 ms 19272 KB Output is correct
29 Correct 15 ms 19284 KB Output is correct
30 Correct 14 ms 19284 KB Output is correct
31 Correct 1719 ms 19284 KB Output is correct
32 Correct 1533 ms 19404 KB Output is correct
33 Correct 1697 ms 19284 KB Output is correct
34 Correct 1358 ms 19292 KB Output is correct
35 Correct 2703 ms 19400 KB Output is correct
36 Correct 2074 ms 19532 KB Output is correct
37 Correct 1883 ms 19284 KB Output is correct
38 Correct 2564 ms 19284 KB Output is correct
39 Correct 2241 ms 19284 KB Output is correct
40 Correct 1959 ms 19292 KB Output is correct
41 Correct 1710 ms 19292 KB Output is correct
42 Correct 1623 ms 19284 KB Output is correct
43 Correct 2510 ms 19284 KB Output is correct
44 Correct 2227 ms 19280 KB Output is correct
45 Correct 14 ms 19284 KB Output is correct
46 Correct 1763 ms 19272 KB Output is correct
47 Correct 2631 ms 19280 KB Output is correct
48 Correct 2860 ms 19284 KB Output is correct
49 Correct 1690 ms 19284 KB Output is correct
50 Correct 1325 ms 19284 KB Output is correct
51 Execution timed out 3082 ms 19284 KB Time limit exceeded
52 Halted 0 ms 0 KB -

Subtask #5
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19220 KB Output is correct
2 Correct 13 ms 19276 KB Output is correct
3 Correct 12 ms 19284 KB Output is correct
4 Correct 12 ms 19284 KB Output is correct
5 Correct 271 ms 26752 KB Output is correct
6 Correct 268 ms 26780 KB Output is correct
7 Correct 273 ms 26792 KB Output is correct
8 Correct 268 ms 26788 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19248 KB Output is correct
2 Correct 13 ms 19268 KB Output is correct
3 Correct 14 ms 19512 KB Output is correct
4 Correct 13 ms 19268 KB Output is correct
5 Correct 272 ms 26880 KB Output is correct
6 Correct 274 ms 27180 KB Output is correct
7 Correct 270 ms 26948 KB Output is correct
8 Correct 294 ms 26924 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19268 KB Output is correct
2 Correct 13 ms 19228 KB Output is correct
3 Correct 13 ms 19268 KB Output is correct
4 Correct 13 ms 19268 KB Output is correct
5 Correct 12 ms 19284 KB Output is correct
6 Correct 13 ms 19284 KB Output is correct
7 Correct 13 ms 19284 KB Output is correct
8 Correct 14 ms 19268 KB Output is correct
9 Correct 16 ms 19268 KB Output is correct
10 Correct 15 ms 19260 KB Output is correct
11 Correct 13 ms 19248 KB Output is correct
12 Correct 13 ms 19268 KB Output is correct
13 Correct 273 ms 26760 KB Output is correct
14 Correct 268 ms 26528 KB Output is correct
15 Correct 274 ms 26844 KB Output is correct
16 Correct 276 ms 26700 KB Output is correct
17 Correct 275 ms 26796 KB Output is correct
18 Correct 284 ms 26704 KB Output is correct
19 Correct 286 ms 26732 KB Output is correct
20 Correct 300 ms 26700 KB Output is correct
21 Correct 391 ms 26948 KB Output is correct
22 Correct 318 ms 26756 KB Output is correct
23 Correct 343 ms 26812 KB Output is correct
24 Correct 317 ms 26832 KB Output is correct

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19304 KB Output is correct
2 Correct 13 ms 19284 KB Output is correct
3 Correct 13 ms 19236 KB Output is correct
4 Correct 12 ms 19268 KB Output is correct
5 Correct 12 ms 19264 KB Output is correct
6 Correct 13 ms 19264 KB Output is correct
7 Correct 14 ms 19348 KB Output is correct
8 Correct 12 ms 19248 KB Output is correct
9 Correct 13 ms 19224 KB Output is correct
10 Correct 13 ms 19228 KB Output is correct
11 Correct 12 ms 19284 KB Output is correct
12 Correct 13 ms 19268 KB Output is correct
13 Correct 17 ms 19228 KB Output is correct
14 Correct 1756 ms 19412 KB Output is correct
15 Correct 16 ms 19284 KB Output is correct
16 Correct 15 ms 19268 KB Output is correct
17 Correct 1743 ms 19288 KB Output is correct
18 Correct 16 ms 19284 KB Output is correct
19 Correct 16 ms 19284 KB Output is correct
20 Correct 2858 ms 19292 KB Output is correct
21 Correct 17 ms 19280 KB Output is correct
22 Correct 15 ms 19284 KB Output is correct
23 Correct 2250 ms 19284 KB Output is correct
24 Correct 16 ms 19284 KB Output is correct
25 Correct 14 ms 19264 KB Output is correct
26 Correct 15 ms 19188 KB Output is correct
27 Correct 14 ms 19268 KB Output is correct
28 Correct 14 ms 19272 KB Output is correct
29 Correct 15 ms 19284 KB Output is correct
30 Correct 14 ms 19284 KB Output is correct
31 Correct 1719 ms 19284 KB Output is correct
32 Correct 1533 ms 19404 KB Output is correct
33 Correct 1697 ms 19284 KB Output is correct
34 Correct 1358 ms 19292 KB Output is correct
35 Correct 2703 ms 19400 KB Output is correct
36 Correct 2074 ms 19532 KB Output is correct
37 Correct 1883 ms 19284 KB Output is correct
38 Correct 2564 ms 19284 KB Output is correct
39 Correct 2241 ms 19284 KB Output is correct
40 Correct 1959 ms 19292 KB Output is correct
41 Correct 1710 ms 19292 KB Output is correct
42 Correct 1623 ms 19284 KB Output is correct
43 Correct 2510 ms 19284 KB Output is correct
44 Correct 2227 ms 19280 KB Output is correct
45 Correct 14 ms 19284 KB Output is correct
46 Correct 1763 ms 19272 KB Output is correct
47 Correct 2631 ms 19280 KB Output is correct
48 Correct 2860 ms 19284 KB Output is correct
49 Correct 1690 ms 19284 KB Output is correct
50 Correct 1325 ms 19284 KB Output is correct
51 Execution timed out 3082 ms 19284 KB Time limit exceeded
52 Halted 0 ms 0 KB -