# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1174664 | guagua0407 | Balanced Tree (info1cup18_balancedtree) | C++20 | 4094 ms | 4312 KiB |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const int inf=1e9;
void solve(){
int n;
cin>>n;
vector<vector<int>> adj(n+1);
for(int i=0;i<n-1;i++){
int a,b;
cin>>a>>b;
adj[a].push_back(b);
adj[b].push_back(a);
}
vector<int> C(n+1);
vector<int> tmp;
for(int i=1;i<=n;i++){
cin>>C[i];
if(C[i]==-1) tmp.push_back(i);
}
pair<int,vector<int>> mnn;
vector<int> d(n+1);
vector<int> c=C;
mnn.f=inf;
int sz=(int)tmp.size();
for(int S=0;S<(1<<sz);S++){
for(int i=0;i<sz;i++){
if(S&(1<<i)) c[tmp[i]]=1;
else c[tmp[i]]=0;
}
int D=0;
int mn=n+1;
int cc;
function<void(int,int)> dfs=[&](int v,int p){
d[v]=d[p]+1;
if(d[v]!=1 and c[v]==cc){
mn=min(mn,d[v]-1);
return;
}
for(auto u:adj[v]){
if(u==p) continue;
dfs(u,v);
}
};
for(int i=1;i<=n;i++){
cc=c[i];
mn=n+1;
dfs(i,0);
D=max(D,mn);
}
mnn=min(mnn,{D,c});
}
if(mnn.f==n+1){
cout<<-1<<'\n';
}
else{
cout<<mnn.f<<'\n';
for(int i=1;i<=n;i++){
cout<<mnn.s[i]<<' ';
}
cout<<'\n';
}
}
int main() {_
int t;
cin>>t;
while(t--){
solve();
}
return 0;
}
//maybe its multiset not set
//yeeorz
//diaoborz
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |