oj.uz

답안 #113082

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
113082 2019-05-23T14:25:23 Z gs14004 Unique Cities (JOI19_ho_t5) C++17
4 / 100
 2000 ms 24372 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
using pi = pair<int, int>;

vector<int> gph[MAXN];
int n, m, r[2], dist[2][MAXN];
int a[MAXN], par[MAXN];
pi dp[MAXN];

void dfs_far(int x, int p){
	par[x] = p;
	dp[x] = pi(0, x);
	for(auto &i : gph[x]){
		if(i != p){
			dfs_far(i, x);
			dp[x] = max(dp[x], pi(dp[i].first + 1, i));
		}
	}
}

struct jaryoguzo{
	vector<int> v;
	int mark[MAXN];
	void push_back(int x){
		v.push_back(x);
	}
	void pop_back(){
		v.pop_back();
	}
	void mark_interval(int s, int e, int d){
		for(int i=s; i<e && i<v.size(); i++){
			mark[v.size()-1-i] += d;
		}
	}
	int query(){
		vector<int> cnt(m + 1);
		for(int i=0; i<v.size(); i++){
			if(!mark[i]) cnt[v[i]]++;
		}
		int dap = 0;
		for(int i=1; i<=m; i++){
			if(cnt[i]) dap++;
		}
		return dap;
	}
}JG;

int ret[MAXN];

void dfs_calc(int x, int p){
	vector<int> pth, sndmax;
	for(int j=x; ; j=dp[j].second){
		int smax = 0;
		for(auto &k : gph[j]){
			if(k != par[j] && k != dp[j].second){
				smax = max(smax, dp[k].first + 1); 
			}
		}
		pth.push_back(j);
		sndmax.push_back(smax);
		if(j == dp[j].second) break;
	}
	int pointer = (int)pth.size() - 1;
	JG.mark_interval(0, pointer, +1);
	for(int i = 0; i < pth.size(); i++){
		ret[pth[i]] = JG.query();
		JG.push_back(a[pth[i]]);
		for(auto &j : gph[pth[i]]){
			if(j != par[pth[i]] && dp[pth[i]].second != j){
				dfs_calc(j, pth[i]);
			}
		}
		pointer += 1;
		if(i + 1 < pth.size()) JG.mark_interval(0, 1, +1);
		if(i + 1 < pth.size()) JG.mark_interval(pointer - 2 * i - 2, pointer - 2 * i, -1);
		if(i + 1 < pth.size()) JG.mark_interval(1, 1 + sndmax[i], +1);
	}
	for(int i = (int)pth.size() - 1; i >= 0; i--){
		if(i + 1 < pth.size()) JG.mark_interval(1, 1 + sndmax[i], -1);
		if(i + 1 < pth.size()) JG.mark_interval(pointer - 2 * i - 2, pointer - 2 * i, +1);
		if(i + 1 < pth.size()) JG.mark_interval(0, 1, -1);
		pointer -= 1;
		JG.pop_back();
	}
	JG.mark_interval(0, pointer, -1);
}

vector<int> solve(int r){
	dfs_far(r, -1);
	dfs_calc(r, -1);
	return vector<int>(ret + 1, ret + n + 1);
}

void fill_dist(int x, int p, int d, int l){
	dist[l][x] = d;
	for(auto &i : gph[x]){
		if(i != p){
			fill_dist(i, x, d + 1, l);
		}
	}
}

pi dfs(int x, int p){
	pi ret(0, x);
	for(auto &i : gph[x]){
		if(i != p){
			auto y = dfs(i, x);
			y.first++;
			ret = max(ret, y);
		}
	}
	return ret;
}

int main(){
	scanf("%d %d",&n,&m);
	for(int i=0; i<n-1; i++){
		int s, e; scanf("%d %d",&s,&e);
		gph[s].push_back(e);
		gph[e].push_back(s);
	}
	for(int i=1; i<=n; i++) scanf("%d",&a[i]);
	r[0] = dfs(1, 0).second;
	r[1] = dfs(r[0], 0).second;
	fill_dist(r[0], -1, 0, 0);
	fill_dist(r[1], -1, 0, 1);
	auto v1 = solve(r[0]);
	auto v2 = solve(r[1]);
	for(int i=1; i<=n; i++){
		if(dist[0][i] <= dist[1][i]) printf("%d\n", v2[i-1]);
		else printf("%d\n", v1[i-1]);
	}
}

Compilation message

joi2019_ho_t5.cpp: In member function 'void jaryoguzo::mark_interval(int, int, int)':
joi2019_ho_t5.cpp:32:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=s; i<e && i<v.size(); i++){
                       ~^~~~~~~~~
joi2019_ho_t5.cpp: In member function 'int jaryoguzo::query()':
joi2019_ho_t5.cpp:38:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0; i<v.size(); i++){
                ~^~~~~~~~~
joi2019_ho_t5.cpp: In function 'void dfs_calc(int, int)':
joi2019_ho_t5.cpp:66:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < pth.size(); i++){
                 ~~^~~~~~~~~~~~
joi2019_ho_t5.cpp:75:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(i + 1 < pth.size()) JG.mark_interval(0, 1, +1);
      ~~~~~~^~~~~~~~~~~~
joi2019_ho_t5.cpp:76:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(i + 1 < pth.size()) JG.mark_interval(pointer - 2 * i - 2, pointer - 2 * i, -1);
      ~~~~~~^~~~~~~~~~~~
joi2019_ho_t5.cpp:77:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(i + 1 < pth.size()) JG.mark_interval(1, 1 + sndmax[i], +1);
      ~~~~~~^~~~~~~~~~~~
joi2019_ho_t5.cpp:80:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(i + 1 < pth.size()) JG.mark_interval(1, 1 + sndmax[i], -1);
      ~~~~~~^~~~~~~~~~~~
joi2019_ho_t5.cpp:81:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(i + 1 < pth.size()) JG.mark_interval(pointer - 2 * i - 2, pointer - 2 * i, +1);
      ~~~~~~^~~~~~~~~~~~
joi2019_ho_t5.cpp:82:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(i + 1 < pth.size()) JG.mark_interval(0, 1, -1);
      ~~~~~~^~~~~~~~~~~~
joi2019_ho_t5.cpp: In function 'int main()':
joi2019_ho_t5.cpp:117:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:119:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int s, e; scanf("%d %d",&s,&e);
             ~~~~~^~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:123:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1; i<=n; i++) scanf("%d",&a[i]);
                          ~~~~~^~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5040 KB Output is correct
2 Correct 12 ms 5248 KB Output is correct
3 Correct 10 ms 5248 KB Output is correct
4 Correct 11 ms 5348 KB Output is correct
5 Correct 8 ms 5248 KB Output is correct
6 Correct 13 ms 5348 KB Output is correct
7 Correct 10 ms 5248 KB Output is correct
8 Correct 9 ms 5248 KB Output is correct
9 Correct 9 ms 5248 KB Output is correct
10 Correct 8 ms 5248 KB Output is correct
11 Correct 9 ms 5248 KB Output is correct
12 Correct 8 ms 5248 KB Output is correct
13 Correct 11 ms 5384 KB Output is correct
14 Correct 10 ms 5248 KB Output is correct
15 Correct 9 ms 5220 KB Output is correct
16 Correct 8 ms 5248 KB Output is correct
17 Correct 11 ms 5348 KB Output is correct
18 Correct 12 ms 5248 KB Output is correct
19 Correct 11 ms 5220 KB Output is correct
20 Correct 17 ms 5376 KB Output is correct
21 Correct 14 ms 5380 KB Output is correct
22 Correct 9 ms 5248 KB Output is correct
23 Correct 16 ms 5248 KB Output is correct
24 Correct 14 ms 5248 KB Output is correct
25 Correct 12 ms 5220 KB Output is correct
26 Correct 10 ms 5248 KB Output is correct
27 Correct 18 ms 5376 KB Output is correct
28 Correct 14 ms 5376 KB Output is correct
29 Correct 17 ms 5340 KB Output is correct
30 Correct 9 ms 5248 KB Output is correct
31 Correct 11 ms 5376 KB Output is correct
32 Correct 14 ms 5248 KB Output is correct

Subtask #2
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 353 ms 14648 KB Output is correct
2 Execution timed out 2033 ms 24372 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2050 ms 17280 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5040 KB Output is correct
2 Correct 12 ms 5248 KB Output is correct
3 Correct 10 ms 5248 KB Output is correct
4 Correct 11 ms 5348 KB Output is correct
5 Correct 8 ms 5248 KB Output is correct
6 Correct 13 ms 5348 KB Output is correct
7 Correct 10 ms 5248 KB Output is correct
8 Correct 9 ms 5248 KB Output is correct
9 Correct 9 ms 5248 KB Output is correct
10 Correct 8 ms 5248 KB Output is correct
11 Correct 9 ms 5248 KB Output is correct
12 Correct 8 ms 5248 KB Output is correct
13 Correct 11 ms 5384 KB Output is correct
14 Correct 10 ms 5248 KB Output is correct
15 Correct 9 ms 5220 KB Output is correct
16 Correct 8 ms 5248 KB Output is correct
17 Correct 11 ms 5348 KB Output is correct
18 Correct 12 ms 5248 KB Output is correct
19 Correct 11 ms 5220 KB Output is correct
20 Correct 17 ms 5376 KB Output is correct
21 Correct 14 ms 5380 KB Output is correct
22 Correct 9 ms 5248 KB Output is correct
23 Correct 16 ms 5248 KB Output is correct
24 Correct 14 ms 5248 KB Output is correct
25 Correct 12 ms 5220 KB Output is correct
26 Correct 10 ms 5248 KB Output is correct
27 Correct 18 ms 5376 KB Output is correct
28 Correct 14 ms 5376 KB Output is correct
29 Correct 17 ms 5340 KB Output is correct
30 Correct 9 ms 5248 KB Output is correct
31 Correct 11 ms 5376 KB Output is correct
32 Correct 14 ms 5248 KB Output is correct
33 Correct 353 ms 14648 KB Output is correct
34 Execution timed out 2033 ms 24372 KB Time limit exceeded
35 Halted 0 ms 0 KB -