oj.uz

답안 #739576

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
739576 2023-05-10T17:12:31 Z Sam_a17 Unique Cities (JOI19_ho_t5) C++17
100 / 100
 438 ms 52316 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 blt(x) __builtin_popcount(x)
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
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(long double t) {cerr << t;}
void print(unsigned long long 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, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } 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 grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};

int ka() {
	int 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;
int n, m, a[N], ans[N];
vector<int> adj[N];

int mxL, mxP;
 
void dfs1(int u, int p, int l) {
  for(auto i: adj[u])
    if(i != p)
      dfs1(i, u, l + 1);
 
  if(l > mxL) {
    mxL = l;
    mxP = u;
  }
}

int dp[N], depths[N], cnt[N];
int s;

void dfs2(int node, int parent) {
  depths[node] = depths[parent] + 1;
  dp[node] = 0;
  for(auto i: adj[node]) {
    if(i == parent) continue;
    dfs2(i, node);
    dp[node] = max(dp[node], dp[i]);
  }
  dp[node] += 1;
}


vector<int> lst;

void add(int curr) {
  lst.push_back(curr);
  curr = a[curr];
  cnt[curr]++;
  if(cnt[curr] == 1) {
    s++;
  }
}

void remove() {
  int curr = lst.back();
  cnt[a[curr]]--;
  lst.pop_back();
  if(cnt[a[curr]] == 0) {
    s--;
  }
}
 
void dfs(int node, int parent) {
  if(parent) {
    add(parent);
  }

  vector<pair<int, int>> child;
  for(auto i: adj[node]) {
    if(i == parent) continue;
    child.push_back({dp[i], i});
  }

  sort(rall(child));

  if(sz(child)) {
    int len = 0;
    if(sz(child) >= 2) {
      len = child[1].first;
    }

    for(auto i: child) {
      while (!lst.empty() && depths[node] - depths[lst.back()] <= len) {
        remove();
      }
      dfs(i.second, node);
      len = max(len, i.first);
    }
  }

  if(!lst.empty() && lst.back() == node) {
    remove();
  }
  while(lst.size() && depths[node]-depths[lst.back()] < dp[node]) remove();
  ans[node] = max(ans[node], s);
}

void solve_() {
  cin >> n >> m;

  for(int i = 1; i <= n - 1; i++) {
    int x, y; cin >> x >> y;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }

  for(int i = 1; i <= n; i++) {
    cin >> a[i];
  }

  dfs1(1, 0, 0);
  dfs2(mxP, 0);
  dfs(mxP, 0);

  s = 0;
  for(int i = 1; i <= n; i++) {
    cnt[i] = 0;
  }
  lst.clear();  

  //
  mxL = 0;
  dfs1(mxP, 0, 0);
  dfs2(mxP, 0);
  dfs(mxP, 0);

  for(int i = 1; i <= n; i++) {
    cout << ans[i] << '\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

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

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 4 ms 5076 KB Output is correct
3 Correct 4 ms 5204 KB Output is correct
4 Correct 4 ms 5204 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 5 ms 5460 KB Output is correct
7 Correct 5 ms 5332 KB Output is correct
8 Correct 5 ms 5076 KB Output is correct
9 Correct 5 ms 5204 KB Output is correct
10 Correct 5 ms 5128 KB Output is correct
11 Correct 5 ms 5176 KB Output is correct
12 Correct 4 ms 5204 KB Output is correct
13 Correct 4 ms 5460 KB Output is correct
14 Correct 5 ms 5204 KB Output is correct
15 Correct 5 ms 5204 KB Output is correct
16 Correct 5 ms 5172 KB Output is correct
17 Correct 4 ms 5304 KB Output is correct
18 Correct 5 ms 5332 KB Output is correct
19 Correct 5 ms 5172 KB Output is correct
20 Correct 5 ms 5432 KB Output is correct
21 Correct 5 ms 5332 KB Output is correct
22 Correct 6 ms 5172 KB Output is correct
23 Correct 4 ms 5204 KB Output is correct
24 Correct 5 ms 5204 KB Output is correct
25 Correct 5 ms 5108 KB Output is correct
26 Correct 4 ms 5100 KB Output is correct
27 Correct 5 ms 5332 KB Output is correct
28 Correct 4 ms 5332 KB Output is correct
29 Correct 6 ms 5304 KB Output is correct
30 Correct 5 ms 5204 KB Output is correct
31 Correct 6 ms 5332 KB Output is correct
32 Correct 5 ms 5332 KB Output is correct

Subtask #2
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 145 ms 12772 KB Output is correct
2 Correct 189 ms 31188 KB Output is correct
3 Correct 27 ms 9136 KB Output is correct
4 Correct 323 ms 18676 KB Output is correct
5 Correct 431 ms 50584 KB Output is correct
6 Correct 370 ms 34340 KB Output is correct
7 Correct 337 ms 19048 KB Output is correct
8 Correct 326 ms 22072 KB Output is correct
9 Correct 370 ms 20944 KB Output is correct
10 Correct 336 ms 20748 KB Output is correct
11 Correct 198 ms 22416 KB Output is correct
12 Correct 416 ms 38552 KB Output is correct
13 Correct 363 ms 34564 KB Output is correct
14 Correct 352 ms 33600 KB Output is correct
15 Correct 156 ms 22304 KB Output is correct
16 Correct 316 ms 40820 KB Output is correct
17 Correct 339 ms 35132 KB Output is correct

Subtask #3
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 229 ms 16372 KB Output is correct
2 Correct 382 ms 50416 KB Output is correct
3 Correct 32 ms 9740 KB Output is correct
4 Correct 329 ms 19540 KB Output is correct
5 Correct 438 ms 52316 KB Output is correct
6 Correct 397 ms 35540 KB Output is correct
7 Correct 300 ms 19628 KB Output is correct
8 Correct 339 ms 26196 KB Output is correct
9 Correct 329 ms 23988 KB Output is correct
10 Correct 338 ms 22184 KB Output is correct
11 Correct 254 ms 21292 KB Output is correct
12 Correct 406 ms 45772 KB Output is correct
13 Correct 333 ms 33712 KB Output is correct
14 Correct 360 ms 34200 KB Output is correct
15 Correct 166 ms 23456 KB Output is correct
16 Correct 314 ms 42220 KB Output is correct
17 Correct 353 ms 36152 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 4 ms 5076 KB Output is correct
3 Correct 4 ms 5204 KB Output is correct
4 Correct 4 ms 5204 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 5 ms 5460 KB Output is correct
7 Correct 5 ms 5332 KB Output is correct
8 Correct 5 ms 5076 KB Output is correct
9 Correct 5 ms 5204 KB Output is correct
10 Correct 5 ms 5128 KB Output is correct
11 Correct 5 ms 5176 KB Output is correct
12 Correct 4 ms 5204 KB Output is correct
13 Correct 4 ms 5460 KB Output is correct
14 Correct 5 ms 5204 KB Output is correct
15 Correct 5 ms 5204 KB Output is correct
16 Correct 5 ms 5172 KB Output is correct
17 Correct 4 ms 5304 KB Output is correct
18 Correct 5 ms 5332 KB Output is correct
19 Correct 5 ms 5172 KB Output is correct
20 Correct 5 ms 5432 KB Output is correct
21 Correct 5 ms 5332 KB Output is correct
22 Correct 6 ms 5172 KB Output is correct
23 Correct 4 ms 5204 KB Output is correct
24 Correct 5 ms 5204 KB Output is correct
25 Correct 5 ms 5108 KB Output is correct
26 Correct 4 ms 5100 KB Output is correct
27 Correct 5 ms 5332 KB Output is correct
28 Correct 4 ms 5332 KB Output is correct
29 Correct 6 ms 5304 KB Output is correct
30 Correct 5 ms 5204 KB Output is correct
31 Correct 6 ms 5332 KB Output is correct
32 Correct 5 ms 5332 KB Output is correct
33 Correct 145 ms 12772 KB Output is correct
34 Correct 189 ms 31188 KB Output is correct
35 Correct 27 ms 9136 KB Output is correct
36 Correct 323 ms 18676 KB Output is correct
37 Correct 431 ms 50584 KB Output is correct
38 Correct 370 ms 34340 KB Output is correct
39 Correct 337 ms 19048 KB Output is correct
40 Correct 326 ms 22072 KB Output is correct
41 Correct 370 ms 20944 KB Output is correct
42 Correct 336 ms 20748 KB Output is correct
43 Correct 198 ms 22416 KB Output is correct
44 Correct 416 ms 38552 KB Output is correct
45 Correct 363 ms 34564 KB Output is correct
46 Correct 352 ms 33600 KB Output is correct
47 Correct 156 ms 22304 KB Output is correct
48 Correct 316 ms 40820 KB Output is correct
49 Correct 339 ms 35132 KB Output is correct
50 Correct 229 ms 16372 KB Output is correct
51 Correct 382 ms 50416 KB Output is correct
52 Correct 32 ms 9740 KB Output is correct
53 Correct 329 ms 19540 KB Output is correct
54 Correct 438 ms 52316 KB Output is correct
55 Correct 397 ms 35540 KB Output is correct
56 Correct 300 ms 19628 KB Output is correct
57 Correct 339 ms 26196 KB Output is correct
58 Correct 329 ms 23988 KB Output is correct
59 Correct 338 ms 22184 KB Output is correct
60 Correct 254 ms 21292 KB Output is correct
61 Correct 406 ms 45772 KB Output is correct
62 Correct 333 ms 33712 KB Output is correct
63 Correct 360 ms 34200 KB Output is correct
64 Correct 166 ms 23456 KB Output is correct
65 Correct 314 ms 42220 KB Output is correct
66 Correct 353 ms 36152 KB Output is correct
67 Correct 24 ms 6868 KB Output is correct
68 Correct 123 ms 25196 KB Output is correct
69 Correct 186 ms 23712 KB Output is correct
70 Correct 287 ms 18652 KB Output is correct
71 Correct 418 ms 50580 KB Output is correct
72 Correct 400 ms 34376 KB Output is correct
73 Correct 309 ms 18716 KB Output is correct
74 Correct 328 ms 24884 KB Output is correct
75 Correct 330 ms 21672 KB Output is correct
76 Correct 294 ms 21164 KB Output is correct
77 Correct 235 ms 20692 KB Output is correct
78 Correct 383 ms 41808 KB Output is correct
79 Correct 318 ms 38460 KB Output is correct
80 Correct 331 ms 31884 KB Output is correct
81 Correct 151 ms 22236 KB Output is correct
82 Correct 341 ms 40648 KB Output is correct
83 Correct 328 ms 34920 KB Output is correct
84 Correct 298 ms 18860 KB Output is correct
85 Correct 358 ms 51248 KB Output is correct
86 Correct 373 ms 34964 KB Output is correct
87 Correct 277 ms 19044 KB Output is correct
88 Correct 311 ms 25652 KB Output is correct
89 Correct 299 ms 22476 KB Output is correct
90 Correct 308 ms 21728 KB Output is correct
91 Correct 228 ms 20756 KB Output is correct
92 Correct 408 ms 50252 KB Output is correct
93 Correct 325 ms 30616 KB Output is correct
94 Correct 308 ms 27468 KB Output is correct
95 Correct 154 ms 22808 KB Output is correct
96 Correct 341 ms 41224 KB Output is correct
97 Correct 318 ms 35516 KB Output is correct
98 Correct 282 ms 19460 KB Output is correct
99 Correct 372 ms 51620 KB Output is correct
100 Correct 411 ms 35564 KB Output is correct
101 Correct 285 ms 19812 KB Output is correct
102 Correct 323 ms 24736 KB Output is correct
103 Correct 321 ms 22596 KB Output is correct
104 Correct 315 ms 22012 KB Output is correct
105 Correct 244 ms 21220 KB Output is correct
106 Correct 366 ms 37540 KB Output is correct
107 Correct 369 ms 38768 KB Output is correct
108 Correct 356 ms 29452 KB Output is correct
109 Correct 182 ms 23308 KB Output is correct
110 Correct 332 ms 41924 KB Output is correct
111 Correct 359 ms 36092 KB Output is correct