oj.uz

Submission #575920

# Submission time Handle Problem Language Result Execution time Memory
575920 2022-06-11T17:58:22 Z piOOE Roads (CEOI20_roads) C++17
100 / 100
 170 ms 17184 KB 
#include <bits/stdc++.h>

using namespace std;

#define sz(x) ((int)size(x))
#define all(x) begin(x), end(x)
#define trace(x) cout << #x << ": " << (x) << endl;
#define int long long

typedef long long ll;
typedef long double ld;
typedef double db;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

int rand(int l, int r) { return (int) ((ll) rnd() % (r - l + 1)) + l; }

const int N = 100002, infI = 1e9 + 7;

int X[N][2], Y[N][2];

pair<int, int> Rmost[N];
int x_now = -infI;

ld get(int i) {
    if (x_now == X[i][0]) {
        return Y[i][0];
    }
    ld k = (Y[i][0] - Y[i][1]) / (ld) (X[i][0] - X[i][1]);
    ld b = Y[i][0] - X[i][0] * k;
    return k * x_now + b;
}

auto comp = [](int i, int j) {
    return get(i) < get(j);
};

set<int, decltype(comp)> st(comp);

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<tuple<int, int, int, int>> qu;
    for (int i = 0; i < n; ++i) {
        cin >> X[i][0] >> Y[i][0] >> X[i][1] >> Y[i][1];
        if (X[i][0] > X[i][1] || (X[i][0] == X[i][1] && Y[i][0] > Y[i][1])) {
            swap(X[i][0], X[i][1]);
            swap(Y[i][0], Y[i][1]);
        }
        qu.emplace_back(X[i][0], Y[i][0], 0, i);
        qu.emplace_back(X[i][1], Y[i][1], 1, i);
    }
    fill(all(Rmost), make_pair(-infI, -infI));
    sort(all(qu));
    X[n][0] = -infI, Y[n][0] = -infI;
    X[n][1] = infI, Y[n][1] = -infI;
    X[n + 1][0] = -infI, Y[n + 1][0] = infI;
    X[n + 1][1] = infI, Y[n + 1][1] = infI;
    st.insert(n);
    st.insert(n + 1);
    for (auto [x, y, tt, i]: qu) {
        x_now = x;
        if (tt == 0) {
            st.insert(i);
            auto it = st.find(i);
            pair<int, int> now = Rmost[*prev(it)];
            Rmost[*prev(it)] = Rmost[i] = {X[i][0], Y[i][0]};
            if (now.first != -infI) {
                cout << now.first << " " << now.second << " " << X[i][0] << " " << Y[i][0] << '\n';
            }
        } else {
            auto it = st.find(i);
            Rmost[*prev(it)] = {X[i][1], Y[i][1]};
            st.erase(i);
        }
    }
    return 0;
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 58 ms 6200 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 2 ms 2004 KB Output is correct
4 Correct 11 ms 3580 KB Output is correct
5 Correct 21 ms 5052 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 2 ms 2004 KB Output is correct
4 Correct 11 ms 3540 KB Output is correct
5 Correct 24 ms 5056 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 1 ms 1872 KB Output is correct
8 Correct 2 ms 2132 KB Output is correct
9 Correct 13 ms 3544 KB Output is correct
10 Correct 170 ms 17184 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 3 ms 2004 KB Output is correct
4 Correct 13 ms 3544 KB Output is correct
5 Correct 25 ms 5092 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 1 ms 1876 KB Output is correct
8 Correct 2 ms 2132 KB Output is correct
9 Correct 12 ms 3536 KB Output is correct
10 Correct 54 ms 9552 KB Output is correct
11 Correct 1 ms 1876 KB Output is correct
12 Correct 1 ms 1864 KB Output is correct
13 Correct 1 ms 1868 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 2 ms 2004 KB Output is correct
5 Correct 13 ms 3576 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 1 ms 1876 KB Output is correct
8 Correct 2 ms 2132 KB Output is correct
9 Correct 12 ms 3528 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 1 ms 1872 KB Output is correct
12 Correct 2 ms 2004 KB Output is correct
13 Correct 11 ms 3536 KB Output is correct
14 Correct 1 ms 1876 KB Output is correct
15 Correct 1 ms 1876 KB Output is correct
16 Correct 1 ms 1876 KB Output is correct
17 Correct 1 ms 1876 KB Output is correct
18 Correct 1 ms 1876 KB Output is correct
19 Correct 2 ms 1876 KB Output is correct
20 Correct 2 ms 2004 KB Output is correct
21 Correct 2 ms 1876 KB Output is correct
22 Correct 6 ms 2520 KB Output is correct
23 Correct 6 ms 2528 KB Output is correct
24 Correct 11 ms 3028 KB Output is correct
25 Correct 1 ms 1876 KB Output is correct

Subtask #6
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 63 ms 6196 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 2 ms 2004 KB Output is correct
6 Correct 11 ms 3536 KB Output is correct
7 Correct 21 ms 5084 KB Output is correct
8 Correct 1 ms 1876 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 2 ms 2132 KB Output is correct
11 Correct 12 ms 3536 KB Output is correct
12 Correct 165 ms 17172 KB Output is correct
13 Correct 1 ms 2000 KB Output is correct
14 Correct 1 ms 1876 KB Output is correct
15 Correct 2 ms 2004 KB Output is correct
16 Correct 11 ms 3536 KB Output is correct
17 Correct 53 ms 9584 KB Output is correct
18 Correct 1 ms 1876 KB Output is correct
19 Correct 1 ms 1864 KB Output is correct
20 Correct 2 ms 1876 KB Output is correct
21 Correct 2 ms 1868 KB Output is correct
22 Correct 2 ms 1876 KB Output is correct
23 Correct 2 ms 1876 KB Output is correct
24 Correct 2 ms 2004 KB Output is correct
25 Correct 1 ms 1864 KB Output is correct
26 Correct 6 ms 2520 KB Output is correct
27 Correct 6 ms 2564 KB Output is correct
28 Correct 13 ms 3100 KB Output is correct
29 Correct 89 ms 10772 KB Output is correct
30 Correct 138 ms 15092 KB Output is correct
31 Correct 1 ms 1876 KB Output is correct
32 Correct 110 ms 12216 KB Output is correct
33 Correct 111 ms 12116 KB Output is correct
34 Correct 151 ms 15528 KB Output is correct
35 Correct 151 ms 16172 KB Output is correct
36 Correct 154 ms 16852 KB Output is correct