Submission #691443

#	Time	Username	Problem	Language	Result	Execution time	Memory
691443		Sohsoh84	Drawing (CEOI22_drawing)	C++17	100 / 100	260 ms	53328 KiB

Main

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

#define all(x)			(x).begin(),(x).end()
#define X			first
#define Y			second
#define sep			' '
#define endl			'\n'
#define debug(x)		cerr << #x << ": " <<  x << endl;

const ll MAXN = 1e6 + 10;

int n, sz = 0, ans[MAXN];
pair<pll, int> A[MAXN];
vector<int> vec, adj[MAXN];

inline ll Cross(pll x, pll y) {
	return 1ll * x.X * y.Y - 1ll * x.Y * y.X;
}
 
inline bool cmp(int i, int j) {
	return Cross(make_pair(A[0].X.X - A[i].X.X, A[0].X.Y - A[i].X.Y), 
			make_pair(A[0].X.X - A[j].X.X, A[0].X.Y - A[j].X.Y)) < 0;
}

void dfs(int v, int p, int l) {
	ans[l] = v;
	for (int u : adj[v])
		if (u != p)
			dfs(u, v, A[vec[sz++]].Y);
} 

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n;
	for (int i = 1; i < n; i++) {
		int u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}

	for (int i = 0; i < n; i++) {
		ll x, y;
		cin >> x >> y;
		A[i] = {{x, y}, i};
	}	

	for (int i = 1; i < n; i++)
		vec.push_back(i);

	sort(all(vec), cmp);
	dfs(1, 0, 0);

	for (int i = 0; i < n; i++)
		cout << ans[i] << sep;
	cout << endl;
	return 0;
}

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