oj.uz

답안 #752944

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752944 2023-06-04T10:25:51 Z Sam_a17 수도 (JOI20_capital_city) C++17
100 / 100
 2837 ms 42148 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;
}

int curr;
void add_group(int group) {
  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);
}

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

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;

      vis[centr] = true;
      nodes.push_back(centr);
      add_group(cc[centr]);
      
      int ok = 1;
      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 6 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 5 ms 9748 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 7 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 5 ms 9668 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 5 ms 9748 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 7 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 5 ms 9668 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 6 ms 9812 KB Output is correct
12 Correct 7 ms 9900 KB Output is correct
13 Correct 7 ms 9812 KB Output is correct
14 Correct 9 ms 9812 KB Output is correct
15 Correct 7 ms 9928 KB Output is correct
16 Correct 7 ms 9812 KB Output is correct
17 Correct 7 ms 9940 KB Output is correct
18 Correct 6 ms 9940 KB Output is correct
19 Correct 6 ms 9940 KB Output is correct
20 Correct 5 ms 9940 KB Output is correct
21 Correct 6 ms 9940 KB Output is correct
22 Correct 6 ms 10052 KB Output is correct
23 Correct 6 ms 9940 KB Output is correct
24 Correct 7 ms 9932 KB Output is correct
25 Correct 7 ms 9940 KB Output is correct
26 Correct 7 ms 10028 KB Output is correct
27 Correct 7 ms 9916 KB Output is correct
28 Correct 7 ms 9940 KB Output is correct
29 Correct 8 ms 9940 KB Output is correct
30 Correct 7 ms 9940 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 561 ms 38108 KB Output is correct
2 Correct 209 ms 38368 KB Output is correct
3 Correct 571 ms 37684 KB Output is correct
4 Correct 190 ms 38468 KB Output is correct
5 Correct 517 ms 34880 KB Output is correct
6 Correct 185 ms 38468 KB Output is correct
7 Correct 555 ms 35376 KB Output is correct
8 Correct 181 ms 38064 KB Output is correct
9 Correct 2067 ms 33476 KB Output is correct
10 Correct 2194 ms 34668 KB Output is correct
11 Correct 1939 ms 37544 KB Output is correct
12 Correct 1836 ms 40468 KB Output is correct
13 Correct 1742 ms 34276 KB Output is correct
14 Correct 2199 ms 40532 KB Output is correct
15 Correct 1342 ms 40228 KB Output is correct
16 Correct 1809 ms 35176 KB Output is correct
17 Correct 1711 ms 35868 KB Output is correct
18 Correct 1743 ms 35880 KB Output is correct
19 Correct 1334 ms 39204 KB Output is correct
20 Correct 2837 ms 41392 KB Output is correct
21 Correct 7 ms 9684 KB Output is correct

Subtask #4
59.0 / 59.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 5 ms 9748 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 7 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 5 ms 9668 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 6 ms 9812 KB Output is correct
12 Correct 7 ms 9900 KB Output is correct
13 Correct 7 ms 9812 KB Output is correct
14 Correct 9 ms 9812 KB Output is correct
15 Correct 7 ms 9928 KB Output is correct
16 Correct 7 ms 9812 KB Output is correct
17 Correct 7 ms 9940 KB Output is correct
18 Correct 6 ms 9940 KB Output is correct
19 Correct 6 ms 9940 KB Output is correct
20 Correct 5 ms 9940 KB Output is correct
21 Correct 6 ms 9940 KB Output is correct
22 Correct 6 ms 10052 KB Output is correct
23 Correct 6 ms 9940 KB Output is correct
24 Correct 7 ms 9932 KB Output is correct
25 Correct 7 ms 9940 KB Output is correct
26 Correct 7 ms 10028 KB Output is correct
27 Correct 7 ms 9916 KB Output is correct
28 Correct 7 ms 9940 KB Output is correct
29 Correct 8 ms 9940 KB Output is correct
30 Correct 7 ms 9940 KB Output is correct
31 Correct 561 ms 38108 KB Output is correct
32 Correct 209 ms 38368 KB Output is correct
33 Correct 571 ms 37684 KB Output is correct
34 Correct 190 ms 38468 KB Output is correct
35 Correct 517 ms 34880 KB Output is correct
36 Correct 185 ms 38468 KB Output is correct
37 Correct 555 ms 35376 KB Output is correct
38 Correct 181 ms 38064 KB Output is correct
39 Correct 2067 ms 33476 KB Output is correct
40 Correct 2194 ms 34668 KB Output is correct
41 Correct 1939 ms 37544 KB Output is correct
42 Correct 1836 ms 40468 KB Output is correct
43 Correct 1742 ms 34276 KB Output is correct
44 Correct 2199 ms 40532 KB Output is correct
45 Correct 1342 ms 40228 KB Output is correct
46 Correct 1809 ms 35176 KB Output is correct
47 Correct 1711 ms 35868 KB Output is correct
48 Correct 1743 ms 35880 KB Output is correct
49 Correct 1334 ms 39204 KB Output is correct
50 Correct 2837 ms 41392 KB Output is correct
51 Correct 7 ms 9684 KB Output is correct
52 Correct 499 ms 25644 KB Output is correct
53 Correct 472 ms 25548 KB Output is correct
54 Correct 499 ms 25540 KB Output is correct
55 Correct 612 ms 25636 KB Output is correct
56 Correct 492 ms 25560 KB Output is correct
57 Correct 583 ms 25664 KB Output is correct
58 Correct 546 ms 28996 KB Output is correct
59 Correct 480 ms 29080 KB Output is correct
60 Correct 602 ms 28360 KB Output is correct
61 Correct 644 ms 28036 KB Output is correct
62 Correct 186 ms 42148 KB Output is correct
63 Correct 195 ms 42144 KB Output is correct
64 Correct 210 ms 41784 KB Output is correct
65 Correct 188 ms 42088 KB Output is correct
66 Correct 396 ms 33996 KB Output is correct
67 Correct 339 ms 33820 KB Output is correct
68 Correct 356 ms 34036 KB Output is correct
69 Correct 314 ms 34024 KB Output is correct
70 Correct 384 ms 34044 KB Output is correct
71 Correct 340 ms 34004 KB Output is correct
72 Correct 329 ms 33936 KB Output is correct
73 Correct 311 ms 33092 KB Output is correct
74 Correct 447 ms 34064 KB Output is correct
75 Correct 406 ms 34052 KB Output is correct
76 Correct 667 ms 32776 KB Output is correct
77 Correct 609 ms 30652 KB Output is correct
78 Correct 1373 ms 35644 KB Output is correct
79 Correct 1592 ms 33716 KB Output is correct
80 Correct 2791 ms 40972 KB Output is correct
81 Correct 1946 ms 37384 KB Output is correct
82 Correct 1477 ms 37460 KB Output is correct
83 Correct 1775 ms 34060 KB Output is correct
84 Correct 1205 ms 40128 KB Output is correct
85 Correct 1817 ms 38504 KB Output is correct
86 Correct 1549 ms 33696 KB Output is correct
87 Correct 1895 ms 35484 KB Output is correct
88 Correct 820 ms 36472 KB Output is correct
89 Correct 1217 ms 32472 KB Output is correct
90 Correct 1959 ms 32360 KB Output is correct
91 Correct 1449 ms 34708 KB Output is correct
92 Correct 778 ms 33248 KB Output is correct
93 Correct 1196 ms 33156 KB Output is correct
94 Correct 1191 ms 32308 KB Output is correct
95 Correct 1253 ms 33948 KB Output is correct
96 Correct 763 ms 32536 KB Output is correct
97 Correct 1116 ms 34632 KB Output is correct