oj.uz

Submission #648142

# Submission time Handle Problem Language Result Execution time Memory
648142 2022-10-05T13:55:40 Z 406 Hamburg Steak (JOI20_hamburg) C++17
3 / 100
 3000 ms 40256 KB 
#include <bits/stdc++.h>
using namespace std;

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];

inline bool check() {
        return used == full;
}

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

void rec(int x) {
        if (check()) {
                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 (x == k)
                return;

        for (int i = 0; i <= 2 * n; i++)
                op[i].clear(), cl[i].clear();

        int minR = 2 * n;
        for (int i = 0; i < n; i++) if (!used[i])
                minR = min(minR, r[i]);

        for (int i = 0; i < n; i++) if (!used[i] && l[i] <= minR) {
                cl[u[i]].push_back(i);
                op[d[i]].push_back(i);
        }

        set<int> S;
        vector<int> p;
        for (int h = 0; h <= 2 * n; h++) {
                if (cl[h].size())
                        p.push_back(h);
                continue;
                for (auto u: op[h])
                        S.insert(u);
                for (auto v: cl[h]) {
                        if (S.count(v)) {
                                p.push_back(h);
                                S.clear();
                        }
                }
        }
        /*
        assert(S.empty());

        for (int h = 2 * n; h >= 0; h--) {
                for (auto u: cl[h])
                        S.insert(u);
                for (auto v: op[h]) {
                        if (S.count(v)) {
                                p.push_back(h);
                                S.clear();
                        }
                }
        }
        */
        /*
        sort(p.begin(), p.end());
        p.resize(unique(p.begin(), p.end()) - p.begin());
        */

        for (auto h: p) {
                vector<int> change;
                for (int i = 0; i < n; i++) if (!used[i]) {
                        if (inter(i, minR, h)) {
                                used[i] = true;
                                change.push_back(i);
                        }
                }
                points.emplace_back(minR, h);
                rec(x + 1);

                //RESET:
                for (auto cc: change) used[cc] = false;
                points.pop_back();
        }
}

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++)
                full[i] = true;
        used = 0;

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

Subtask #1
1.0 / 1.0

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

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19340 KB Output is correct
2 Correct 1824 ms 19360 KB Output is correct
3 Correct 15 ms 19284 KB Output is correct
4 Correct 79 ms 19304 KB Output is correct

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19320 KB Output is correct
2 Correct 14 ms 19392 KB Output is correct
3 Correct 12 ms 19284 KB Output is correct
4 Correct 15 ms 19284 KB Output is correct
5 Correct 20 ms 19268 KB Output is correct
6 Correct 13 ms 19388 KB Output is correct
7 Correct 20 ms 19284 KB Output is correct
8 Correct 973 ms 19360 KB Output is correct
9 Execution timed out 3068 ms 19360 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19384 KB Output is correct
2 Correct 13 ms 19284 KB Output is correct
3 Correct 13 ms 19284 KB Output is correct
4 Correct 13 ms 19284 KB Output is correct
5 Correct 14 ms 19460 KB Output is correct
6 Correct 13 ms 19328 KB Output is correct
7 Correct 13 ms 19412 KB Output is correct
8 Correct 41 ms 19388 KB Output is correct
9 Execution timed out 3085 ms 19368 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19284 KB Output is correct
2 Correct 14 ms 19284 KB Output is correct
3 Correct 15 ms 19284 KB Output is correct
4 Correct 13 ms 19284 KB Output is correct
5 Correct 350 ms 40168 KB Output is correct
6 Correct 355 ms 40236 KB Output is correct
7 Correct 364 ms 40216 KB Output is correct
8 Correct 342 ms 40256 KB Output is correct

Subtask #6
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19340 KB Output is correct
2 Correct 1824 ms 19360 KB Output is correct
3 Correct 15 ms 19284 KB Output is correct
4 Correct 79 ms 19304 KB Output is correct
5 Correct 361 ms 39884 KB Output is correct
6 Execution timed out 3057 ms 39420 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19320 KB Output is correct
2 Correct 14 ms 19392 KB Output is correct
3 Correct 12 ms 19284 KB Output is correct
4 Correct 15 ms 19284 KB Output is correct
5 Correct 20 ms 19268 KB Output is correct
6 Correct 13 ms 19388 KB Output is correct
7 Correct 20 ms 19284 KB Output is correct
8 Correct 973 ms 19360 KB Output is correct
9 Execution timed out 3068 ms 19360 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19384 KB Output is correct
2 Correct 13 ms 19284 KB Output is correct
3 Correct 13 ms 19284 KB Output is correct
4 Correct 13 ms 19284 KB Output is correct
5 Correct 14 ms 19460 KB Output is correct
6 Correct 13 ms 19328 KB Output is correct
7 Correct 13 ms 19412 KB Output is correct
8 Correct 41 ms 19388 KB Output is correct
9 Execution timed out 3085 ms 19368 KB Time limit exceeded
10 Halted 0 ms 0 KB -