oj.uz

답안 #752948

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752948 2023-06-04T10:33:52 Z Sam_a17 수도 (JOI20_capital_city) C++17
100 / 100
 846 ms 38956 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
void print(long double t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T> void print(T v[],T n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
long long ka() {
	long long x = 0;
	bool z = false;
	while (1)
	{
		char y = getchar();
		if (y == '-')
			z = true;
		else if ('0' <= y && y <= '9')
			x = x * 10 + y - '0';
		else
		{
			if (z)
				x *= -1;
			return x;
		}
	}
}
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
 
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5 + 10;
vector<int> adj[N], qq[N];
bool used[N], vis[N], used_color[N];
int n, k, ans, compSize, cc[N];
int cnt_color[N], sz[N];
vector<int> use;
queue<int> q, qu;
 
int p[N];
 
void dfs(int node, int parent, bool flag) {
  sz[node] = 1;
  p[node] = parent;
  
  if(flag) {
    compSize++;
    cnt_color[cc[node]]++;
    if(cnt_color[cc[node]] == 1) {
      use.push_back(cc[node]);
    }
  }

  for(auto i: adj[node]) {
    if(i == parent || used[i]) continue;
    dfs(i, node, flag);
    sz[node] += sz[i];
  }
}

int get_centroid(int node, int parent) {
  for(auto i: adj[node]) {
    if(i == parent || used[i]) continue;
    if(sz[i] * 2 > compSize) {
      return get_centroid(i, node);
    }
  }
  return node;
}

int centroid(int u) {
  compSize = 0;
  dfs(u, 0, true);
  int pp = get_centroid(u, 0);
  dfs(pp, 0, false);
  return pp;
}

bool valid(int color) {
  return cnt_color[color] == sz(qq[color]);
}

int curr, ok = 1;
void add_group(int group) {
  if(!valid(group)) {
    ok = 0;
    return;
  }

  curr++;
  for(auto i: qq[group]) {
    if(!vis[i]) {
      qu.push(i);
    }
  }
  used_color[group] = true;
}

vector<int> nodes;

void go_up(int node) {
  if(vis[node]) {
    return;
  } else if(!used_color[cc[node]]) {
    add_group(cc[node]);
  }
  nodes.push_back(node);
  vis[node] = true;
  node = p[node];
  go_up(node);
}



void centroid_depomposition() {
  queue<int> q;
  q.push(1);

  while(!q.empty()) {
    auto u = q.front();
    q.pop();

    int centr = centroid(u);

    if(valid(cc[centr])) {
      curr = 0, ok = 1;
      
      vis[centr] = true;
      nodes.push_back(centr);
      add_group(cc[centr]);
      
      while(!qu.empty()) {
        auto u = qu.front();
        qu.pop();
        if(!valid(cc[u])) {
          ok = 0;
          break;
        }
        go_up(u);
      }

      while(!qu.empty()) qu.pop();

      if(ok) {
        ans = min(ans, curr - 1);
      }
    }

    for(auto i: use) {
      cnt_color[i] = 0;
      used_color[i] = 0;
    } 
    for(auto i: nodes) {
      vis[i] = false;
    }
    nodes.clear();
    use.clear();

    used[centr] = true;
    for(auto i: adj[centr]) {
      if(used[i]) continue;
      q.push(i);
    }
  }
}
 
void solve_() {
  cin >> n >> k;
 
  for(int i = 1; i <= n - 1; i++) {
    int a, b; cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
 
  for(int i = 1; i <= n; i++) {
    int c; cin >> c;
    cc[i] = c;
    qq[c].push_back(i);
  }

  ans = k - 1;
  centroid_depomposition();
 
  cout << ans << '\n';
}
 
int main() {
  setIO();
  
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1; 
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

capital_city.cpp: In function 'void setIO(std::string)':
capital_city.cpp:88:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
capital_city.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9684 KB Output is correct
2 Correct 8 ms 9736 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 8 ms 9676 KB Output is correct
7 Correct 8 ms 9740 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 6 ms 9740 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9684 KB Output is correct
2 Correct 8 ms 9736 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 8 ms 9676 KB Output is correct
7 Correct 8 ms 9740 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 6 ms 9740 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 7 ms 9808 KB Output is correct
12 Correct 7 ms 9812 KB Output is correct
13 Correct 7 ms 9812 KB Output is correct
14 Correct 8 ms 9848 KB Output is correct
15 Correct 7 ms 9940 KB Output is correct
16 Correct 7 ms 9812 KB Output is correct
17 Correct 7 ms 9940 KB Output is correct
18 Correct 8 ms 9940 KB Output is correct
19 Correct 6 ms 9928 KB Output is correct
20 Correct 7 ms 9940 KB Output is correct
21 Correct 6 ms 9880 KB Output is correct
22 Correct 7 ms 10068 KB Output is correct
23 Correct 8 ms 9888 KB Output is correct
24 Correct 7 ms 9940 KB Output is correct
25 Correct 7 ms 9940 KB Output is correct
26 Correct 11 ms 10000 KB Output is correct
27 Correct 7 ms 9940 KB Output is correct
28 Correct 7 ms 9940 KB Output is correct
29 Correct 7 ms 9940 KB Output is correct
30 Correct 8 ms 9880 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 626 ms 38372 KB Output is correct
2 Correct 194 ms 38956 KB Output is correct
3 Correct 622 ms 38076 KB Output is correct
4 Correct 227 ms 38852 KB Output is correct
5 Correct 654 ms 35212 KB Output is correct
6 Correct 213 ms 38768 KB Output is correct
7 Correct 723 ms 35580 KB Output is correct
8 Correct 203 ms 38488 KB Output is correct
9 Correct 736 ms 33860 KB Output is correct
10 Correct 720 ms 31444 KB Output is correct
11 Correct 733 ms 34344 KB Output is correct
12 Correct 787 ms 37028 KB Output is correct
13 Correct 771 ms 31160 KB Output is correct
14 Correct 836 ms 37456 KB Output is correct
15 Correct 752 ms 37076 KB Output is correct
16 Correct 782 ms 31876 KB Output is correct
17 Correct 818 ms 32824 KB Output is correct
18 Correct 846 ms 32724 KB Output is correct
19 Correct 772 ms 35920 KB Output is correct
20 Correct 688 ms 38012 KB Output is correct
21 Correct 6 ms 9740 KB Output is correct

Subtask #4
59.0 / 59.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9684 KB Output is correct
2 Correct 8 ms 9736 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 8 ms 9676 KB Output is correct
7 Correct 8 ms 9740 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 6 ms 9740 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 7 ms 9808 KB Output is correct
12 Correct 7 ms 9812 KB Output is correct
13 Correct 7 ms 9812 KB Output is correct
14 Correct 8 ms 9848 KB Output is correct
15 Correct 7 ms 9940 KB Output is correct
16 Correct 7 ms 9812 KB Output is correct
17 Correct 7 ms 9940 KB Output is correct
18 Correct 8 ms 9940 KB Output is correct
19 Correct 6 ms 9928 KB Output is correct
20 Correct 7 ms 9940 KB Output is correct
21 Correct 6 ms 9880 KB Output is correct
22 Correct 7 ms 10068 KB Output is correct
23 Correct 8 ms 9888 KB Output is correct
24 Correct 7 ms 9940 KB Output is correct
25 Correct 7 ms 9940 KB Output is correct
26 Correct 11 ms 10000 KB Output is correct
27 Correct 7 ms 9940 KB Output is correct
28 Correct 7 ms 9940 KB Output is correct
29 Correct 7 ms 9940 KB Output is correct
30 Correct 8 ms 9880 KB Output is correct
31 Correct 626 ms 38372 KB Output is correct
32 Correct 194 ms 38956 KB Output is correct
33 Correct 622 ms 38076 KB Output is correct
34 Correct 227 ms 38852 KB Output is correct
35 Correct 654 ms 35212 KB Output is correct
36 Correct 213 ms 38768 KB Output is correct
37 Correct 723 ms 35580 KB Output is correct
38 Correct 203 ms 38488 KB Output is correct
39 Correct 736 ms 33860 KB Output is correct
40 Correct 720 ms 31444 KB Output is correct
41 Correct 733 ms 34344 KB Output is correct
42 Correct 787 ms 37028 KB Output is correct
43 Correct 771 ms 31160 KB Output is correct
44 Correct 836 ms 37456 KB Output is correct
45 Correct 752 ms 37076 KB Output is correct
46 Correct 782 ms 31876 KB Output is correct
47 Correct 818 ms 32824 KB Output is correct
48 Correct 846 ms 32724 KB Output is correct
49 Correct 772 ms 35920 KB Output is correct
50 Correct 688 ms 38012 KB Output is correct
51 Correct 6 ms 9740 KB Output is correct
52 Correct 573 ms 22444 KB Output is correct
53 Correct 534 ms 22536 KB Output is correct
54 Correct 519 ms 22516 KB Output is correct
55 Correct 598 ms 22480 KB Output is correct
56 Correct 548 ms 22468 KB Output is correct
57 Correct 576 ms 22468 KB Output is correct
58 Correct 560 ms 25696 KB Output is correct
59 Correct 548 ms 25700 KB Output is correct
60 Correct 616 ms 25012 KB Output is correct
61 Correct 800 ms 24704 KB Output is correct
62 Correct 228 ms 38808 KB Output is correct
63 Correct 217 ms 38872 KB Output is correct
64 Correct 220 ms 38588 KB Output is correct
65 Correct 211 ms 38796 KB Output is correct
66 Correct 360 ms 30660 KB Output is correct
67 Correct 380 ms 30592 KB Output is correct
68 Correct 374 ms 30672 KB Output is correct
69 Correct 353 ms 30588 KB Output is correct
70 Correct 371 ms 30676 KB Output is correct
71 Correct 401 ms 30632 KB Output is correct
72 Correct 430 ms 30672 KB Output is correct
73 Correct 382 ms 29724 KB Output is correct
74 Correct 351 ms 30708 KB Output is correct
75 Correct 409 ms 30684 KB Output is correct
76 Correct 680 ms 29336 KB Output is correct
77 Correct 665 ms 27380 KB Output is correct
78 Correct 763 ms 32424 KB Output is correct
79 Correct 726 ms 30472 KB Output is correct
80 Correct 710 ms 37956 KB Output is correct
81 Correct 794 ms 34132 KB Output is correct
82 Correct 701 ms 34112 KB Output is correct
83 Correct 707 ms 30768 KB Output is correct
84 Correct 799 ms 36776 KB Output is correct
85 Correct 777 ms 35112 KB Output is correct
86 Correct 765 ms 30308 KB Output is correct
87 Correct 764 ms 32232 KB Output is correct
88 Correct 719 ms 33168 KB Output is correct
89 Correct 635 ms 29112 KB Output is correct
90 Correct 634 ms 29064 KB Output is correct
91 Correct 613 ms 31364 KB Output is correct
92 Correct 683 ms 29956 KB Output is correct
93 Correct 601 ms 29900 KB Output is correct
94 Correct 664 ms 29172 KB Output is correct
95 Correct 622 ms 30668 KB Output is correct
96 Correct 589 ms 29384 KB Output is correct
97 Correct 557 ms 31556 KB Output is correct