oj.uz

답안 #750919

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
750919 2023-05-30T14:06:12 Z drdilyor Drawing (CEOI22_drawing) C++17
100 / 100
 668 ms 83840 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>

using namespace std;
using ll = long long;
const int inf = 1e9;
const ll infl = 1e18;
mt19937 rng;

using pt = pair<int,int>;
bool ccw(pt A, pt B, pt C) {
    return ll(C.second-A.second) * (B.first-A.first) > ll(B.second-A.second) * (C.first-A.first);
}
bool intersect(pt A, pt B, pt C, pt D) {
    return ccw(A, C, D) != ccw(B, C, D) && ccw(A, B, C) != ccw(A, B, D);
}

int main() {

    int n;
    cin >> n;

    vector<vector<int>> adj(n);
    vector<pair<int,int>> pts(n);
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        u--;v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    map<pair<int,int>, int> ix;
    for (auto& [x, y] : pts)
        cin >> x >> y;
    for (int i = 0; i < n; i++)
        ix[pts[i]]= i;

    int r = 0;
    for (; r < n; r++)
        if (adj[r].size() < 3) break;

    vector<int> res(n, -1);
    vector<int> subs(n, 1);
    auto dfs_sz = [&](auto& dfs_sz, int i, int p=-1)->void {
        for (int e : adj[i]) if (e != p) {
            dfs_sz(dfs_sz, e, i);
            subs[i] += subs[e];
        }
    };
    dfs_sz(dfs_sz, r);

    auto dfs = [&](auto& dfs, vector<pair<int,int>>::iterator p1, vector<pair<int,int>>::iterator p2, int i, int p =-1)->void {
        vector<int> ch;
        for (int e : adj[i]) {
            if (e != p) ch.push_back(e);
        }
        if (ch.empty()) {
            assert(p1 == p2);
            return;
        }
        if (ch.size() == 1) {
            res[ch[0]] = ix[*--p2];
            dfs(dfs, p1, p2, ch[0], i);
        } else {
            //sort(p1, p2, [](const auto& p, const auto& q)->bool { return (ll)p.second * q.first > (ll) q.second * p.first; });
            assert(p2 - p1 == subs[ch[0]] + subs[ch[1]]);
            auto q1 = p1 + subs[ch[0]];
            auto q2 = p2;
            p2 = q1;
            //sort(p1, p2, greater());
            //sort(q1, q2, greater());
            res[ch[0]] = ix[*--p2];
            res[ch[1]] = ix[*--q2];
            dfs(dfs, p1, p2, ch[0], i);
            dfs(dfs, q1, q2, ch[1], i);
        }
    };

    sort(pts.begin(), pts.end(), greater());
    res[r] = ix[pts.back()];
    pts.pop_back();
    dfs(dfs, pts.begin(), pts.end(), r);

    vector<int> byp(n);
    for (int i = 0; i < n; i++)
        assert(res[i] >= 0),
        byp[res[i]] = i;
    for (int i : byp) {
        cout << i+1 << ' ';
    }
    cout << '\n';

    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 16588 KB Output is correct
2 Correct 294 ms 31296 KB Output is correct
3 Correct 303 ms 29108 KB Output is correct
4 Correct 373 ms 41644 KB Output is correct
5 Correct 321 ms 44280 KB Output is correct
6 Correct 268 ms 19904 KB Output is correct
7 Correct 273 ms 22844 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 852 KB Output is correct
2 Correct 9 ms 1124 KB Output is correct
3 Correct 9 ms 1064 KB Output is correct
4 Correct 7 ms 1748 KB Output is correct
5 Correct 9 ms 1620 KB Output is correct
6 Correct 8 ms 852 KB Output is correct
7 Correct 8 ms 980 KB Output is correct
8 Correct 7 ms 852 KB Output is correct
9 Correct 8 ms 1364 KB Output is correct
10 Correct 8 ms 980 KB Output is correct
11 Correct 8 ms 1620 KB Output is correct
12 Correct 8 ms 1364 KB Output is correct
13 Correct 8 ms 852 KB Output is correct
14 Correct 12 ms 1060 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 852 KB Output is correct
2 Correct 9 ms 1124 KB Output is correct
3 Correct 9 ms 1064 KB Output is correct
4 Correct 7 ms 1748 KB Output is correct
5 Correct 9 ms 1620 KB Output is correct
6 Correct 8 ms 852 KB Output is correct
7 Correct 8 ms 980 KB Output is correct
8 Correct 7 ms 852 KB Output is correct
9 Correct 8 ms 1364 KB Output is correct
10 Correct 8 ms 980 KB Output is correct
11 Correct 8 ms 1620 KB Output is correct
12 Correct 8 ms 1364 KB Output is correct
13 Correct 8 ms 852 KB Output is correct
14 Correct 12 ms 1060 KB Output is correct
15 Correct 26 ms 1620 KB Output is correct
16 Correct 22 ms 2900 KB Output is correct
17 Correct 20 ms 2092 KB Output is correct
18 Correct 19 ms 3932 KB Output is correct
19 Correct 20 ms 3704 KB Output is correct
20 Correct 19 ms 1672 KB Output is correct
21 Correct 26 ms 2380 KB Output is correct
22 Correct 22 ms 1636 KB Output is correct
23 Correct 21 ms 2292 KB Output is correct
24 Correct 19 ms 2124 KB Output is correct
25 Correct 20 ms 3888 KB Output is correct
26 Correct 18 ms 3668 KB Output is correct
27 Correct 18 ms 1644 KB Output is correct
28 Correct 19 ms 2308 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 852 KB Output is correct
2 Correct 9 ms 1124 KB Output is correct
3 Correct 9 ms 1064 KB Output is correct
4 Correct 7 ms 1748 KB Output is correct
5 Correct 9 ms 1620 KB Output is correct
6 Correct 8 ms 852 KB Output is correct
7 Correct 8 ms 980 KB Output is correct
8 Correct 7 ms 852 KB Output is correct
9 Correct 8 ms 1364 KB Output is correct
10 Correct 8 ms 980 KB Output is correct
11 Correct 8 ms 1620 KB Output is correct
12 Correct 8 ms 1364 KB Output is correct
13 Correct 8 ms 852 KB Output is correct
14 Correct 12 ms 1060 KB Output is correct
15 Correct 26 ms 1620 KB Output is correct
16 Correct 22 ms 2900 KB Output is correct
17 Correct 20 ms 2092 KB Output is correct
18 Correct 19 ms 3932 KB Output is correct
19 Correct 20 ms 3704 KB Output is correct
20 Correct 19 ms 1672 KB Output is correct
21 Correct 26 ms 2380 KB Output is correct
22 Correct 22 ms 1636 KB Output is correct
23 Correct 21 ms 2292 KB Output is correct
24 Correct 19 ms 2124 KB Output is correct
25 Correct 20 ms 3888 KB Output is correct
26 Correct 18 ms 3668 KB Output is correct
27 Correct 18 ms 1644 KB Output is correct
28 Correct 19 ms 2308 KB Output is correct
29 Correct 189 ms 11736 KB Output is correct
30 Correct 196 ms 22064 KB Output is correct
31 Correct 190 ms 19424 KB Output is correct
32 Correct 211 ms 31628 KB Output is correct
33 Correct 192 ms 27724 KB Output is correct
34 Correct 193 ms 14256 KB Output is correct
35 Correct 186 ms 17028 KB Output is correct
36 Correct 150 ms 12276 KB Output is correct
37 Correct 205 ms 21216 KB Output is correct
38 Correct 195 ms 20556 KB Output is correct
39 Correct 205 ms 27808 KB Output is correct
40 Correct 176 ms 23572 KB Output is correct
41 Correct 154 ms 12296 KB Output is correct
42 Correct 187 ms 17188 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 16588 KB Output is correct
2 Correct 294 ms 31296 KB Output is correct
3 Correct 303 ms 29108 KB Output is correct
4 Correct 373 ms 41644 KB Output is correct
5 Correct 321 ms 44280 KB Output is correct
6 Correct 268 ms 19904 KB Output is correct
7 Correct 273 ms 22844 KB Output is correct
8 Correct 7 ms 852 KB Output is correct
9 Correct 9 ms 1124 KB Output is correct
10 Correct 9 ms 1064 KB Output is correct
11 Correct 7 ms 1748 KB Output is correct
12 Correct 9 ms 1620 KB Output is correct
13 Correct 8 ms 852 KB Output is correct
14 Correct 8 ms 980 KB Output is correct
15 Correct 7 ms 852 KB Output is correct
16 Correct 8 ms 1364 KB Output is correct
17 Correct 8 ms 980 KB Output is correct
18 Correct 8 ms 1620 KB Output is correct
19 Correct 8 ms 1364 KB Output is correct
20 Correct 8 ms 852 KB Output is correct
21 Correct 12 ms 1060 KB Output is correct
22 Correct 26 ms 1620 KB Output is correct
23 Correct 22 ms 2900 KB Output is correct
24 Correct 20 ms 2092 KB Output is correct
25 Correct 19 ms 3932 KB Output is correct
26 Correct 20 ms 3704 KB Output is correct
27 Correct 19 ms 1672 KB Output is correct
28 Correct 26 ms 2380 KB Output is correct
29 Correct 22 ms 1636 KB Output is correct
30 Correct 21 ms 2292 KB Output is correct
31 Correct 19 ms 2124 KB Output is correct
32 Correct 20 ms 3888 KB Output is correct
33 Correct 18 ms 3668 KB Output is correct
34 Correct 18 ms 1644 KB Output is correct
35 Correct 19 ms 2308 KB Output is correct
36 Correct 189 ms 11736 KB Output is correct
37 Correct 196 ms 22064 KB Output is correct
38 Correct 190 ms 19424 KB Output is correct
39 Correct 211 ms 31628 KB Output is correct
40 Correct 192 ms 27724 KB Output is correct
41 Correct 193 ms 14256 KB Output is correct
42 Correct 186 ms 17028 KB Output is correct
43 Correct 150 ms 12276 KB Output is correct
44 Correct 205 ms 21216 KB Output is correct
45 Correct 195 ms 20556 KB Output is correct
46 Correct 205 ms 27808 KB Output is correct
47 Correct 176 ms 23572 KB Output is correct
48 Correct 154 ms 12296 KB Output is correct
49 Correct 187 ms 17188 KB Output is correct
50 Correct 362 ms 22168 KB Output is correct
51 Correct 668 ms 60240 KB Output is correct
52 Correct 589 ms 45504 KB Output is correct
53 Correct 550 ms 66664 KB Output is correct
54 Correct 565 ms 83840 KB Output is correct
55 Correct 575 ms 35360 KB Output is correct
56 Correct 558 ms 40672 KB Output is correct
57 Correct 99 ms 7720 KB Output is correct
58 Correct 627 ms 49816 KB Output is correct
59 Correct 590 ms 45384 KB Output is correct
60 Correct 613 ms 80580 KB Output is correct
61 Correct 549 ms 62072 KB Output is correct
62 Correct 104 ms 7700 KB Output is correct
63 Correct 571 ms 40264 KB Output is correct