제출 #1105431

#제출 시각아이디문제언어결과실행 시간메모리
1105431koukirocksThe Xana coup (BOI21_xanadu)C++17
0 / 100
24 ms7504 KiB
#include <bits/stdc++.h> #define speed ios_base::sync_with_stdio(0); cin.tie(0) #define all(x) (x).begin(),(x).end() #define F first #define S second //#pragma GCC optimize("O3,unroll-loops") //#pragma GCC target("avx,avx2") //#pragma GCC target("popcnt") using namespace std; typedef long long ll; typedef unsigned long long ull; typedef double db; typedef long double ldb; typedef pair<int,int> pii; typedef pair<ll,ll> pll; const ll MAX=1e5+10,P=1e9+7; const ll INF=0x3f3f3f3f,oo=0x3f3f3f3f3f3f3f3f; const ldb eps=1e-6; const ldb PI=acos(-1.0); const int dir[4][2]={{0,1},{0,-1},{1,0},{-1,0}}; template<typename T> using vvector = vector<vector<T>>; void dfs(int v,int p,vvector<int> &G,vector<int> &a) { ; } int main() { speed; int n; cin>>n; vvector<int> G(n+1); for (int i=0;i<n-1;i++) { int a,b; cin>>a>>b; G[a].push_back(b); G[b].push_back(a); } vector<int> a(n+1); for (int i=1;i<=n;i++) { cin>>a[i]; } dfs(1,0,G,a); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...