제출 #397157

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
397157		keta_tsimakuridze	동기화 (JOI13_synchronization)	C++14	100 / 100	491 ms	29592 KiB

synchronization

#include<bits/stdc++.h>
#define f first
#define int long long
#define s second
using namespace std;
const int N=2e5+5,mod=1e9+7;
int t,cnt[N],pos[N],ind[N],cur,n,m,q,u[N],v[N],bef[N],par[N],sz[N],st[N],ch[N],idx,f[N];
vector<int>V[N];
pair<int,int> tree[4*N];
string s;
void update(int u,int ind,int l,int r,int val){
	if(l>ind || r<ind) return;
	if(l==r) {
		tree[u]={val,l};
		return;
	}
	int mid=(l+r)/2;
	update(2*u,ind,l,mid,val);
	update(2*u+1,ind,mid+1,r,val);
	tree[u]=max(tree[2*u],tree[2*u+1]);
}
pair<int,int> getans(int u,int start,int end,int l,int r){
	if(l>end || r<start) return {0,0};
	if(start<=l && r<=end) return tree[u];
	int mid=(l+r)/2;
	return max( getans(2*u,start,end,l,mid),getans(2*u+1,start,end,mid+1,r) );
}
void get_sz(int u,int p){
	sz[u] = 1;
	cnt[u] = 1;
	for(int i=0;i<V[u].size();i++){
		if(V[u][i]!=p) get_sz(V[u][i],u),par[V[u][i]]=u,sz[u]+=sz[V[u][i]];
	}
}
void dfs(int u,int p){
	if(!st[cur]) st[cur]=u;
	ch[u] = cur;
	idx++;
	update(1,idx,1,n,1);
	pos[idx] = u;
	ind[u] = idx;
	int mx=0,v=0;
	for(int i=0;i<V[u].size();i++){
		if(V[u][i]!=p && sz[V[u][i]]>mx) mx=sz[V[u][i]],v=V[u][i];
	}
	if(v) dfs(v,u);
	for(int i=0;i<V[u].size();i++){
		if(V[u][i]!=p && V[u][i]!=v){
			cur++;
			dfs(V[u][i],u);
		}
	}
}
int get(int u) {
	while(u!=1) {
		pair<int,int> g = getans(1,ind[st[ch[u]]],ind[u],1,n);
		if(g.f == 1){
		return pos[g.s]; }
		u = par[st[ch[u]]];
	}
}
void remove(int u){ 
	int root=get(u);
	update(1,ind[u],1,n,1);
	
	bef[u] = cnt[root];
	cnt[u] = cnt[root];
}
void add(int u) {
	update(1,ind[u],1,n,0); 
	int root = get(u);
	cnt[root]+=cnt[u] - bef[u];
}
 main(){
	// t=1;
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>n>>m>>q;
	for(int i=1;i<n;i++){
		cin>>u[i]>>v[i];
		V[v[i]].push_back(u[i]);
		V[u[i]].push_back(v[i]);
	}
	get_sz(1,0);
	cur=1;
	dfs(1,0);
	for(int i=1;i<=m;i++){
		int ind;
		cin>>ind;
		if(sz[v[ind]]>sz[u[ind]]) swap(v[ind],u[ind]);
		if(f[ind]) remove(v[ind]),f[ind]=0;
		else add(v[ind]),f[ind]=1;
	}
	for(int i=1;i<=q;i++){
		int u;
		cin >> u;
		cout<<cnt[get(u)]<<" ";
	}
}

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

synchronization.cpp: In function 'void get_sz(long long int, long long int)':
synchronization.cpp:31:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |  for(int i=0;i<V[u].size();i++){
      |              ~^~~~~~~~~~~~
synchronization.cpp: In function 'void dfs(long long int, long long int)':
synchronization.cpp:43:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |  for(int i=0;i<V[u].size();i++){
      |              ~^~~~~~~~~~~~
synchronization.cpp:47:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |  for(int i=0;i<V[u].size();i++){
      |              ~^~~~~~~~~~~~
synchronization.cpp: At global scope:
synchronization.cpp:74:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   74 |  main(){
      |       ^
synchronization.cpp: In function 'long long int get(long long int)':
synchronization.cpp:61:1: warning: control reaches end of non-void function [-Wreturn-type]
   61 | }
      | ^

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 10 / 10
• Subtask 4: 20 / 20
• Subtask 5: 40 / 40