oj.uz

답안 #136898

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
136898 2019-07-26T13:29:22 Z hamzqq9 Unique Cities (JOI19_ho_t5) C++14
4 / 100
 2000 ms 140388 KB 
#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define ii pair<int,int>
#define ll long long
#define umin(x,y) x=min(x,y)
#define umax(x,y) x=max(x,y)
#define orta ((bas+son)>>1)
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define inf 2000000000
#define N 200005
#define MOD 998244353
using namespace std;

int n,m;
int mxd[N][2],der[N];
int ans[N],c[N],deep[N];
multiset<ii> s;
int cntd;
int cnt[N];
vector<int> v[N];

struct diameter_finder {

	int l,r;
	int mx;

	void dfs(int node,int ata,int len) {

		if(len>mx) {

			mx=len;
			l=node;

		}

		for(int i:v[node]) {

			if(i==ata) continue ;

			dfs(i,node,len+1);

		}

	}
 
	void find() {

		mx=0;

		dfs(1,0,0);

		r=l;

		mx=0;

		dfs(r,0,0);

	}

} dia;

void rollback(vector<ii>& roll) {

	while(!roll.empty()) {

		ii x=roll.back();

		roll.ppb();

		s.insert(x);

		cntd+=(cnt[x.nd]==0);

		cnt[x.nd]++;

	}

}

void add(int node) {

	s.insert({der[node],c[node]});

	cntd+=(cnt[c[node]]==0);

	cnt[c[node]]++;

}

void del(vector<ii>& roll,int cur) {

	auto pos=s.lower_bound({cur,0});

	while(pos!=s.end()) {

		roll.pb(*pos);

		cnt[pos->nd]--;

		cntd-=(cnt[pos->nd]==0);

		s.erase(pos++);

	}

}

void upd(int node,int nd) {

	if(mxd[node][1]<nd) mxd[node][1]=nd;

	if(mxd[node][1]>mxd[node][0]) swap(mxd[node][1],mxd[node][0]);

}

void dfs(int node,int ata) {

//	cerr << "node is : " << node <<'\n';

//	for(auto x:s) cerr << x.st << ' ' << x.nd << '\n';

	vector<ii> roll;

//	cerr << "roll upto : " << 2*der[node]-mxd[node][0] << "\n";

	del(roll,2*der[node]-mxd[node][0]);

	umax(ans[node],cntd);

	add(node);

	for(int i:v[node]) {

		if(i==ata || i==deep[node]) continue ;

		dfs(i,node);

	}

	rollback(roll);

	del(roll,2*der[node]-mxd[node][1]);

	add(node);

	for(int i:v[node]) {

		if(i!=deep[node]) continue ;

		dfs(i,node);

	}

	rollback(roll);

	del(roll,der[node]);

}

void dfs1(int node,int ata) {

	der[node]=der[ata]+1;

	mxd[node][0]=mxd[node][1]=der[node];
	deep[node]=node;

	for(int i:v[node]) {

		if(i==ata) continue ;

		dfs1(i,node);

		upd(node,mxd[i][0]);

		if(mxd[node][0]==mxd[i][0]) {

			deep[node]=i;

		}

	}

}

int main() {

	scanf("%d %d",&n,&m);

	for(int i=1;i<n;i++) {

		int x,y;

		scanf("%d %d",&x,&y);

		v[x].pb(y);
		v[y].pb(x);

	}

	for(int i=1;i<=n;i++) scanf("%d",c+i);

	dia.find();

//	cerr << "root is : " << dia.l << '\n';

	dfs1(dia.l,0);
	dfs(dia.l,0);

//	cerr << "root is : " << dia.r << '\n';

	dfs1(dia.r,0);
	dfs(dia.r,0);

	for(int i=1;i<=n;i++) printf("%d\n",ans[i]);

}

Compilation message

joi2019_ho_t5.cpp: In function 'int main()':
joi2019_ho_t5.cpp:191: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:197:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&x,&y);
   ~~~~~^~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:204:29: 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",c+i);
                        ~~~~~^~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 9 ms 5112 KB Output is correct
3 Correct 78 ms 7724 KB Output is correct
4 Correct 68 ms 7008 KB Output is correct
5 Correct 10 ms 5240 KB Output is correct
6 Correct 338 ms 16112 KB Output is correct
7 Correct 82 ms 7288 KB Output is correct
8 Correct 9 ms 5112 KB Output is correct
9 Correct 10 ms 5368 KB Output is correct
10 Correct 10 ms 5240 KB Output is correct
11 Correct 10 ms 5112 KB Output is correct
12 Correct 8 ms 5240 KB Output is correct
13 Correct 291 ms 14992 KB Output is correct
14 Correct 33 ms 6008 KB Output is correct
15 Correct 31 ms 5880 KB Output is correct
16 Correct 8 ms 5240 KB Output is correct
17 Correct 153 ms 10588 KB Output is correct
18 Correct 80 ms 7384 KB Output is correct
19 Correct 10 ms 5240 KB Output is correct
20 Correct 336 ms 16104 KB Output is correct
21 Correct 87 ms 7288 KB Output is correct
22 Correct 10 ms 5112 KB Output is correct
23 Correct 10 ms 5240 KB Output is correct
24 Correct 10 ms 5112 KB Output is correct
25 Correct 10 ms 5240 KB Output is correct
26 Correct 10 ms 5112 KB Output is correct
27 Correct 139 ms 9848 KB Output is correct
28 Correct 112 ms 8864 KB Output is correct
29 Correct 47 ms 6464 KB Output is correct
30 Correct 8 ms 5116 KB Output is correct
31 Correct 151 ms 10616 KB Output is correct
32 Correct 81 ms 7392 KB Output is correct

Subtask #2
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 329 ms 13440 KB Output is correct
2 Execution timed out 2023 ms 140388 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 488 ms 17620 KB Output is correct
2 Execution timed out 2078 ms 137636 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 9 ms 5112 KB Output is correct
3 Correct 78 ms 7724 KB Output is correct
4 Correct 68 ms 7008 KB Output is correct
5 Correct 10 ms 5240 KB Output is correct
6 Correct 338 ms 16112 KB Output is correct
7 Correct 82 ms 7288 KB Output is correct
8 Correct 9 ms 5112 KB Output is correct
9 Correct 10 ms 5368 KB Output is correct
10 Correct 10 ms 5240 KB Output is correct
11 Correct 10 ms 5112 KB Output is correct
12 Correct 8 ms 5240 KB Output is correct
13 Correct 291 ms 14992 KB Output is correct
14 Correct 33 ms 6008 KB Output is correct
15 Correct 31 ms 5880 KB Output is correct
16 Correct 8 ms 5240 KB Output is correct
17 Correct 153 ms 10588 KB Output is correct
18 Correct 80 ms 7384 KB Output is correct
19 Correct 10 ms 5240 KB Output is correct
20 Correct 336 ms 16104 KB Output is correct
21 Correct 87 ms 7288 KB Output is correct
22 Correct 10 ms 5112 KB Output is correct
23 Correct 10 ms 5240 KB Output is correct
24 Correct 10 ms 5112 KB Output is correct
25 Correct 10 ms 5240 KB Output is correct
26 Correct 10 ms 5112 KB Output is correct
27 Correct 139 ms 9848 KB Output is correct
28 Correct 112 ms 8864 KB Output is correct
29 Correct 47 ms 6464 KB Output is correct
30 Correct 8 ms 5116 KB Output is correct
31 Correct 151 ms 10616 KB Output is correct
32 Correct 81 ms 7392 KB Output is correct
33 Correct 329 ms 13440 KB Output is correct
34 Execution timed out 2023 ms 140388 KB Time limit exceeded
35 Halted 0 ms 0 KB -