Submission #1189796

#	Time	Username	Problem	Language	Result	Execution time	Memory
1189796		Gray	Drawing (CEOI22_drawing)	C++20	15 / 100	1596 ms	15808 KiB

Main

#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define ll int
#define ull unsigned long long
#define ld long double
#define ff first
#define ss second
#define ln "\n"
#define mp make_pair
#define pb push_back
#define INF (ll)1e18
ll MOD = (ll)(1e9+7);
ll n;
vector<array<ll, 3>> pts;
vector<vector<ll>> A;
vector<ll> sz;
void dfs(ll u, ll p){
    sz[u]=1;
    for (auto v:A[u]){
        if (v==p) continue;
        dfs(v, u); sz[u]+=sz[v];
    }
}

void gen(ll u, ll p, ll cx, ll cy, ll l, ll r, vector<array<ll, 3>> &avail, vector<ll> &res){
    ll cnt=0;
    for (auto v:A[u]){
        if (v==p) continue;
        cnt++;
    }
    if (cnt>=2){
        sort(avail.begin()+l, avail.begin()+r+1, [&](auto &op1, auto &op2){
            return atan2(op1[0]-cx, op1[1]-cy)<atan2(op2[0]-cx, op2[1]-cy);
        });
        for (auto v:A[u]){
            if (v==p) continue;
            ll ax=avail[r][0], ay=avail[r][1];
            res[avail[r][2]]=v; r--; ll cl=r+1;
            for (ll i=0; i<sz[v]-1; i++) {
                cl--;
            }
            gen(v, u, ax, ay, cl, r, avail, res);
            r=cl-1;
        }
    }else{
        for (auto v:A[u]){
            if (v==p) continue;
            ll ax=avail[r][0], ay=avail[r][1];
            res[avail[r][2]]=v; r--;
            gen(v, u, ax, ay, l, r, avail, res);
        }
    }
}

void solve(){
    cin >> n; pts.resize(n); A.resize(n+1);
    for (ll i=1; i<n; i++){
        ll u, v; cin >> u >> v;
        A[u].push_back(v); A[v].push_back(u);
    }
    sz.resize(n+1); dfs(1, 1);
    for (ll i=0; i<n; i++){
        cin >> pts[i][0] >> pts[i][1]; pts[i][2]=i;
    }
    sort(pts.begin(), pts.end(), [&](auto op1, auto op2){
        return op1[1]>op2[1];
    });
    vector<ll> res(n);
    res[pts[0][2]]=1;
    vector<array<ll, 3>> avail;
    for (ll i=1; i<n; i++) avail.push_back(pts[i]);
    gen(1, 1, pts[0][0], pts[0][1], 0, n-2, avail, res);
    for (ll i=0; i<n; i++) cout << res[i] << " ";
    cout << ln;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    #ifdef LOCAL
    auto start = chrono::high_resolution_clock::now();
    #endif
    ll testc=1;
    // cin >> testc;
    for (ll __c=1; __c<=testc; __c++) solve();
    #ifdef LOCAL
    auto duration = chrono::duration_cast<chrono::microseconds>(chrono::high_resolution_clock::now() - start);
    cout << setprecision(0) << fixed << "time: " << (double)duration.count()/1000.0 << " milliseconds" << endl;
    #endif
}

• Subtask 1: 0 / 10
• Subtask 2: 15 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 35
• Subtask 5: 0 / 25