oj.uz

Submission #648100

# Submission time Handle Problem Language Result Execution time Memory
648100 2022-10-05T11:31:29 Z 406 Hamburg Steak (JOI20_hamburg) C++17
2 / 100
 288 ms 40092 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 2e5 + 50;
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[N], op[N];

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 (x == k) {
                if (check()) {
                        //cout << "I FOUND IT \n";
                        //cout << "\\TODO\n";
                        for (auto p: points) {
                                cout << X[p.first] << ' ' << Y[p.second] << '\n';
                        }
                        exit(0);
                }
                return;
        }
        for (int i = 0; i < 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);
        }

/*
        cout << "NOT USED : \n";
        for (int i = 0; i < n; i++) if (!used[i])
                cout << i << ' ' << r[i] << '\n';
        cout << "\nEND IF NOT USED\n";

        cout << "MINR: " << minR << '\n';
*/

        set<int> S;
        vector<int> p;
        for (int h = 0; h <= 2 * n; h++) {
                for (auto u: op[h])
                        S.insert(u);
                for (auto v: cl[h]) {
                        if (S.count(v)) {
                                p.push_back(h);
                                S.clear();
                        }
                }
        }
        /*
        cout << "CANDIDATE POINTS: " << p.size() << '\n';
        for (auto u: p)
                cout << minR << ' ' << u << '\n';
        cout << "END OF CANDIDATE POINTS\n";
        */

        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);
                points.pop_back();

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

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;

/*
        cout << "POINTS: \n";
        for (int i = 0; i < n; i++) {
                cout << l[i] <<  ' ' << d[i] << ' ' << r[i] << ' ' << u[i] << '\n';
        }
*/
        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 7 ms 9940 KB Output is correct
2 Correct 8 ms 10068 KB Output is correct
3 Correct 8 ms 10140 KB Output is correct
4 Correct 8 ms 10012 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9912 KB Output is correct
2 Correct 8 ms 10100 KB Output is correct
3 Correct 8 ms 9980 KB Output is correct
4 Correct 8 ms 10068 KB Output is correct

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9884 KB Output is correct
2 Correct 8 ms 10068 KB Output is correct
3 Correct 7 ms 10068 KB Output is correct
4 Correct 8 ms 10068 KB Output is correct
5 Correct 8 ms 10008 KB Output is correct
6 Correct 8 ms 10068 KB Output is correct
7 Correct 8 ms 10068 KB Output is correct
8 Correct 8 ms 9980 KB Output is correct
9 Incorrect 12 ms 10068 KB Expected integer, but "NO" found
10 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9980 KB Output is correct
2 Correct 8 ms 10068 KB Output is correct
3 Correct 8 ms 10068 KB Output is correct
4 Correct 8 ms 10068 KB Output is correct
5 Correct 7 ms 10068 KB Output is correct
6 Correct 9 ms 10068 KB Output is correct
7 Correct 8 ms 10068 KB Output is correct
8 Incorrect 20 ms 10132 KB Expected integer, but "NO" found
9 Halted 0 ms 0 KB -

Subtask #5
0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9940 KB Output is correct
2 Correct 8 ms 10068 KB Output is correct
3 Correct 8 ms 10140 KB Output is correct
4 Correct 8 ms 10012 KB Output is correct
5 Runtime error 288 ms 40068 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #6
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9912 KB Output is correct
2 Correct 8 ms 10100 KB Output is correct
3 Correct 8 ms 9980 KB Output is correct
4 Correct 8 ms 10068 KB Output is correct
5 Runtime error 288 ms 40092 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9884 KB Output is correct
2 Correct 8 ms 10068 KB Output is correct
3 Correct 7 ms 10068 KB Output is correct
4 Correct 8 ms 10068 KB Output is correct
5 Correct 8 ms 10008 KB Output is correct
6 Correct 8 ms 10068 KB Output is correct
7 Correct 8 ms 10068 KB Output is correct
8 Correct 8 ms 9980 KB Output is correct
9 Incorrect 12 ms 10068 KB Expected integer, but "NO" found
10 Halted 0 ms 0 KB -

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9980 KB Output is correct
2 Correct 8 ms 10068 KB Output is correct
3 Correct 8 ms 10068 KB Output is correct
4 Correct 8 ms 10068 KB Output is correct
5 Correct 7 ms 10068 KB Output is correct
6 Correct 9 ms 10068 KB Output is correct
7 Correct 8 ms 10068 KB Output is correct
8 Incorrect 20 ms 10132 KB Expected integer, but "NO" found
9 Halted 0 ms 0 KB -