oj.uz

답안 #136915

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
136915 2019-07-26T14:08:38 Z hamzqq9 Unique Cities (JOI19_ho_t5) C++14
4 / 100
 2000 ms 39892 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];
vector<int> s;
int tot_op;
int cntd;
int has[N];
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<int>& roll) {

	while(!roll.empty()) {

		int x=roll.back();

		roll.ppb();

		++tot_op;

		s.pb(x);

		cntd+=(cnt[c[has[x]]]==0);

		cnt[c[has[x]]]++;

	}

}

void add(int node) {

	has[der[node]]=node;

	s.pb(der[node]);

	++tot_op;

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

	cnt[c[node]]++;

}

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

	while(sz(s) && cur<=s.back()) {

		++tot_op;

		roll.pb(s.back());

		cnt[c[has[s.back()]]]--;

		cntd-=(cnt[c[has[s.back()]]]==0);

		s.ppb();

	}

}

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]);

}

vector<int> temp;

void dfs(int node,int ata) {

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

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

	vector<int> roll;

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

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

	add(node);

	for(int i:v[node]) {

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

		dfs(i,node);

	}

	del(temp,der[node]); 

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

	add(node);

	for(int i:v[node]) {

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

		dfs(i,node);

	}

	del(temp,der[node]);

	umax(ans[node],cntd);

	rollback(roll);

}

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]);

//	cerr << tot_op << '\n';

}

Compilation message

joi2019_ho_t5.cpp: In function 'int main()':
joi2019_ho_t5.cpp:201: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:207: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:214: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 7 ms 4984 KB Output is correct
2 Correct 9 ms 5240 KB Output is correct
3 Correct 21 ms 5240 KB Output is correct
4 Correct 22 ms 5368 KB Output is correct
5 Correct 8 ms 5240 KB Output is correct
6 Correct 67 ms 5496 KB Output is correct
7 Correct 24 ms 5368 KB Output is correct
8 Correct 8 ms 5240 KB Output is correct
9 Correct 9 ms 5240 KB Output is correct
10 Correct 9 ms 5240 KB Output is correct
11 Correct 9 ms 5112 KB Output is correct
12 Correct 9 ms 5240 KB Output is correct
13 Correct 58 ms 5496 KB Output is correct
14 Correct 13 ms 5372 KB Output is correct
15 Correct 14 ms 5368 KB Output is correct
16 Correct 8 ms 5240 KB Output is correct
17 Correct 34 ms 5368 KB Output is correct
18 Correct 24 ms 5368 KB Output is correct
19 Correct 9 ms 5240 KB Output is correct
20 Correct 66 ms 5624 KB Output is correct
21 Correct 25 ms 5368 KB Output is correct
22 Correct 8 ms 5240 KB Output is correct
23 Correct 9 ms 5368 KB Output is correct
24 Correct 9 ms 5240 KB Output is correct
25 Correct 8 ms 5240 KB Output is correct
26 Correct 8 ms 5240 KB Output is correct
27 Correct 33 ms 5468 KB Output is correct
28 Correct 28 ms 5464 KB Output is correct
29 Correct 17 ms 5368 KB Output is correct
30 Correct 8 ms 5240 KB Output is correct
31 Correct 34 ms 5496 KB Output is correct
32 Correct 24 ms 5368 KB Output is correct

Subtask #2
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 15036 KB Output is correct
2 Execution timed out 2017 ms 26452 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 383 ms 19628 KB Output is correct
2 Execution timed out 2041 ms 39892 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 9 ms 5240 KB Output is correct
3 Correct 21 ms 5240 KB Output is correct
4 Correct 22 ms 5368 KB Output is correct
5 Correct 8 ms 5240 KB Output is correct
6 Correct 67 ms 5496 KB Output is correct
7 Correct 24 ms 5368 KB Output is correct
8 Correct 8 ms 5240 KB Output is correct
9 Correct 9 ms 5240 KB Output is correct
10 Correct 9 ms 5240 KB Output is correct
11 Correct 9 ms 5112 KB Output is correct
12 Correct 9 ms 5240 KB Output is correct
13 Correct 58 ms 5496 KB Output is correct
14 Correct 13 ms 5372 KB Output is correct
15 Correct 14 ms 5368 KB Output is correct
16 Correct 8 ms 5240 KB Output is correct
17 Correct 34 ms 5368 KB Output is correct
18 Correct 24 ms 5368 KB Output is correct
19 Correct 9 ms 5240 KB Output is correct
20 Correct 66 ms 5624 KB Output is correct
21 Correct 25 ms 5368 KB Output is correct
22 Correct 8 ms 5240 KB Output is correct
23 Correct 9 ms 5368 KB Output is correct
24 Correct 9 ms 5240 KB Output is correct
25 Correct 8 ms 5240 KB Output is correct
26 Correct 8 ms 5240 KB Output is correct
27 Correct 33 ms 5468 KB Output is correct
28 Correct 28 ms 5464 KB Output is correct
29 Correct 17 ms 5368 KB Output is correct
30 Correct 8 ms 5240 KB Output is correct
31 Correct 34 ms 5496 KB Output is correct
32 Correct 24 ms 5368 KB Output is correct
33 Correct 312 ms 15036 KB Output is correct
34 Execution timed out 2017 ms 26452 KB Time limit exceeded
35 Halted 0 ms 0 KB -