제출 #739576

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
739576		Sam_a17	Unique Cities (JOI19_ho_t5)	C++17	100 / 100	438 ms	52316 KiB

joi2019_ho_t5

#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;
} 

컴파일 시 표준 에러 (stderr) 메시지

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 / 4
• Subtask 2: 32 / 32
• Subtask 3: 32 / 32
• Subtask 4: 32 / 32