# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1170622 | SmuggingSpun | 수도 (JOI20_capital_city) | C++20 | 1 ms | 328 KiB |
#include<bits/stdc++.h>
#define taskname "A"
using namespace std;
int n, k;
namespace sub1{
void solve(){
vector<vector<int>>g(n + 1);
for(int i = 1; i < n; i++){
int u, v;
cin >> u >> v;
g[u].emplace_back(v);
g[v].emplace_back(u);
}
vector<int>color(n + 1), cnt_color(k, 0);
for(int i = 1; i <= n; i++){
cin >> color[i];
cnt_color[--color[i]]++;
}
int ans = n;
for(int mask = (1 << k) - 1; mask > 0; mask--){
if(__builtin_popcount(mask) < ans){
queue<int>q;
vector<bool>vis(n + 1, false);
for(int i = 1; i <= n; i++){
if(1 << color[i] & mask){
q.push(i);
vis[i] = true;
break;
}
}
while(!q.empty()){
int u = q.front();
q.pop();
for(int& v : g[u]){
if(!vis[v] && (1 << color[v] & mask)){
vis[v] = true;
q.push(v);
}
}
}
int expect = 0;
for(int i = 0; i < k; i++){
if(1 << i & mask){
expect += cnt_color[i];
}
}
if(count(vis.begin(), vis.end(), true) == expect){
ans = __builtin_popcount(mask);
}
}
}
cout << ans - 1;
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
cin >> n >> k;
if(n <= 20){
sub1::solve();
}
}
컴파일 시 표준 에러 (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... |