oj.uz

답안 #575922

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
575922 2022-06-11T18:01:57 Z piOOE Roads (CEOI20_roads) C++17
100 / 100
 137 ms 9820 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;

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;

db get(int i) {
    if (x_now == X[i][0]) {
        return Y[i][0];
    }
    db k = (Y[i][0] - Y[i][1]) / (db) (X[i][0] - X[i][1]);
    db 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) {
            auto it = st.insert(i).first;
            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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 46 ms 3792 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 2 ms 1108 KB Output is correct
4 Correct 10 ms 2004 KB Output is correct
5 Correct 20 ms 2724 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 2 ms 1236 KB Output is correct
4 Correct 11 ms 2028 KB Output is correct
5 Correct 20 ms 2792 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 2 ms 1108 KB Output is correct
8 Correct 2 ms 1108 KB Output is correct
9 Correct 11 ms 1992 KB Output is correct
10 Correct 137 ms 8788 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 2 ms 1220 KB Output is correct
4 Correct 10 ms 2004 KB Output is correct
5 Correct 20 ms 2736 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 10 ms 2000 KB Output is correct
10 Correct 49 ms 5016 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 2 ms 1108 KB Output is correct
5 Correct 11 ms 2004 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 2 ms 1108 KB Output is correct
9 Correct 12 ms 1992 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 2 ms 1236 KB Output is correct
13 Correct 9 ms 1936 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 2 ms 1108 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 5 ms 1508 KB Output is correct
23 Correct 5 ms 1468 KB Output is correct
24 Correct 9 ms 1708 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct

Subtask #6
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 48 ms 3776 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 2 ms 1184 KB Output is correct
6 Correct 10 ms 2004 KB Output is correct
7 Correct 20 ms 2748 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 11 ms 2004 KB Output is correct
12 Correct 135 ms 8872 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 11 ms 1928 KB Output is correct
17 Correct 47 ms 5036 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 5 ms 1492 KB Output is correct
27 Correct 5 ms 1492 KB Output is correct
28 Correct 9 ms 1756 KB Output is correct
29 Correct 71 ms 6212 KB Output is correct
30 Correct 104 ms 8632 KB Output is correct
31 Correct 1 ms 1108 KB Output is correct
32 Correct 90 ms 6316 KB Output is correct
33 Correct 101 ms 6436 KB Output is correct
34 Correct 118 ms 7992 KB Output is correct
35 Correct 122 ms 8248 KB Output is correct
36 Correct 121 ms 9820 KB Output is correct