Submission #1115893

#	Time	Username	Problem	Language	Result	Execution time	Memory
1115893		thelegendary08	Drawing (CEOI22_drawing)	C++17	100 / 100	185 ms	42740 KiB

Main

#include<bits/stdc++.h>
#define pb push_back
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) cout<<#v<<' '; for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
const int mxn = 2e5 + 5;
vi order;
vi adj[mxn];
void dfs(int x, int from){
	order.pb(x);
	for(auto u : adj[x]){
		if(u != from){
			dfs(u,x);
		}
	}
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in(n);
	f0r(i,n-1){
		in2(a,b);
		adj[a].pb(b);
		adj[b].pb(a);
	}
	vector<pair<double,double>> pts;
	f0r(i,n){
		in2(a,b);
		pts.pb(make_pair(a,b));
	}
	
	vector<pair<double,int>> angs;
	FOR(i, 1, n){
		angs.pb({atan((pts[0].second - pts[i].second)/(pts[0].first - pts[i].first)),i});
	}
	sort(all(angs));
	
	vi poly;
	poly.pb(0);
	f0r(i, n-1){
		poly.pb(angs[i].second);
	}
	//vout(poly);
	FOR(i, 1, n+1){
		//vout(adj[i]);
	}
	
	dfs(1, -1);
	
	vi ans(n);
	f0r(i,n){
		ans[poly[i]] = order[i]; 
	}
	for(auto u : ans)cout<<u<<' ';
	
}

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