제출 #1096318

#제출 시각아이디문제언어결과실행 시간메모리
1096318vjudge1The Xana coup (BOI21_xanadu)C++14
0 / 100
57 ms9812 KiB
#include<bits/stdc++.h> using namespace std; const int maxn=2e5+10; int n,a[maxn]; vector<int>e[maxn]; int main(){ cin>>n; for(int i=1;i<n;i++){ int u,v; cin>>u>>v; e[u].emplace_back(v); e[v].emplace_back(u); } for(int i=1;i<=n;i++)cin>>a[i]; if(n%3==0)cout<<"impossible"; else cout<<n-1; 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...