oj.uz

Submission #648173

# Submission time Handle Problem Language Result Execution time Memory
648173 2022-10-05T16:05:37 Z 406 Hamburg Steak (JOI20_hamburg) C++17
2 / 100
 369 ms 40428 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 (p.size() && p.back() == (h - 1))
                        p.back()++;
                else if (op[h].size())
                        p.push_back(h);
                if (cl[h].size())
                        p.push_back(-1);
        }

        sort(p.begin(), p.end());
        p.resize(unique(p.begin(), p.end()) - p.begin());
        reverse(p.begin(), p.end());
        p.pop_back();
        random_shuffle(p.begin(), p.end());

        assert(p.size() <= 200);

        for (auto h: p) {
                if (h == -1) 
                        continue;
                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";
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19284 KB Output is correct
2 Correct 16 ms 19368 KB Output is correct
3 Correct 13 ms 19284 KB Output is correct
4 Correct 11 ms 19396 KB Output is correct

Subtask #2
0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 19284 KB Output is correct
2 Runtime error 26 ms 39124 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19284 KB Output is correct
2 Runtime error 27 ms 39076 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19452 KB Output is correct
2 Runtime error 27 ms 39168 KB Execution killed with signal 6
3 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 16 ms 19368 KB Output is correct
3 Correct 13 ms 19284 KB Output is correct
4 Correct 11 ms 19396 KB Output is correct
5 Correct 369 ms 40188 KB Output is correct
6 Correct 360 ms 40428 KB Output is correct
7 Correct 351 ms 40256 KB Output is correct
8 Correct 359 ms 40260 KB Output is correct

Subtask #6
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 19284 KB Output is correct
2 Runtime error 26 ms 39124 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19284 KB Output is correct
2 Runtime error 27 ms 39076 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19452 KB Output is correct
2 Runtime error 27 ms 39168 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -