oj.uz

Submission #136897

# Submission time Handle Problem Language Result Execution time Memory
136897 2019-07-26T13:28:49 Z hamzqq9 Unique Cities (JOI19_ho_t5) C++14
4 / 100
 333 ms 11516 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 3005
#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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 424 KB Output is correct
2 Correct 6 ms 576 KB Output is correct
3 Correct 79 ms 3064 KB Output is correct
4 Correct 64 ms 2384 KB Output is correct
5 Correct 5 ms 508 KB Output is correct
6 Correct 330 ms 11448 KB Output is correct
7 Correct 76 ms 2680 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 6 ms 632 KB Output is correct
11 Correct 5 ms 632 KB Output is correct
12 Correct 4 ms 504 KB Output is correct
13 Correct 274 ms 10368 KB Output is correct
14 Correct 25 ms 1400 KB Output is correct
15 Correct 24 ms 1272 KB Output is correct
16 Correct 4 ms 632 KB Output is correct
17 Correct 148 ms 6092 KB Output is correct
18 Correct 77 ms 2712 KB Output is correct
19 Correct 5 ms 504 KB Output is correct
20 Correct 333 ms 11516 KB Output is correct
21 Correct 76 ms 2680 KB Output is correct
22 Correct 5 ms 508 KB Output is correct
23 Correct 6 ms 632 KB Output is correct
24 Correct 6 ms 632 KB Output is correct
25 Correct 5 ms 508 KB Output is correct
26 Correct 5 ms 504 KB Output is correct
27 Correct 136 ms 5452 KB Output is correct
28 Correct 108 ms 4236 KB Output is correct
29 Correct 43 ms 1832 KB Output is correct
30 Correct 4 ms 504 KB Output is correct
31 Correct 148 ms 6084 KB Output is correct
32 Correct 77 ms 2684 KB Output is correct

Subtask #2
0 / 32.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 636 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 424 KB Output is correct
2 Correct 6 ms 576 KB Output is correct
3 Correct 79 ms 3064 KB Output is correct
4 Correct 64 ms 2384 KB Output is correct
5 Correct 5 ms 508 KB Output is correct
6 Correct 330 ms 11448 KB Output is correct
7 Correct 76 ms 2680 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 6 ms 632 KB Output is correct
11 Correct 5 ms 632 KB Output is correct
12 Correct 4 ms 504 KB Output is correct
13 Correct 274 ms 10368 KB Output is correct
14 Correct 25 ms 1400 KB Output is correct
15 Correct 24 ms 1272 KB Output is correct
16 Correct 4 ms 632 KB Output is correct
17 Correct 148 ms 6092 KB Output is correct
18 Correct 77 ms 2712 KB Output is correct
19 Correct 5 ms 504 KB Output is correct
20 Correct 333 ms 11516 KB Output is correct
21 Correct 76 ms 2680 KB Output is correct
22 Correct 5 ms 508 KB Output is correct
23 Correct 6 ms 632 KB Output is correct
24 Correct 6 ms 632 KB Output is correct
25 Correct 5 ms 508 KB Output is correct
26 Correct 5 ms 504 KB Output is correct
27 Correct 136 ms 5452 KB Output is correct
28 Correct 108 ms 4236 KB Output is correct
29 Correct 43 ms 1832 KB Output is correct
30 Correct 4 ms 504 KB Output is correct
31 Correct 148 ms 6084 KB Output is correct
32 Correct 77 ms 2684 KB Output is correct
33 Runtime error 3 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
34 Halted 0 ms 0 KB -