oj.uz

Submission #433935

# Submission time Handle Problem Language Result Execution time Memory
433935 2021-06-20T12:27:26 Z AmineWeslati Traffickers (RMI18_traffickers) C++14
0 / 100
 3500 ms 11088 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int>vi;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x),end(x)

typedef string str; 

typedef pair<int,int>pi;
#define fi first
#define se second
typedef vector<pi>vpi;
#define eb emplace_back

#define FOR(i,a,b) for(int i=a; i<b; i++)
#define ROF(i,a,b) for(int i=b-1; i>=a; i--)


void ckmin(int &x, int y){x=min(x,y);}
//------------------------------------

const int MX=1e5;

int N; 
vi adj[MX];
multiset<pi> vec[MX];

vi par(MX);
void dfs(int u, int p, int dest){
	//if(u==dest) return; 
	for(int v: adj[u]) if(v!=p){
		par[v]=u;
		dfs(v,u,dest);
	}

}

void add(int u, int v){
	dfs(u,u,v);

	int cur=v,n=0;

	vi cy; 
	while(1){
		n++;
		cy.pb(cur);
		if(cur==u) break;
		cur=par[cur];
	}
	reverse(all(cy));

	FOR(i,0,n){
		vec[cy[i]].insert({n,i});
	}
}

void del(int u, int v){
	dfs(u,u,v);

	int cur=v,n=0;

	vi cy; 
	while(1){
		n++;
		cy.pb(cur);
		if(cur==u) break;
		cur=par[cur];
	}
	reverse(all(cy));

	FOR(i,0,n){
		vec[cy[i]].erase(vec[cy[i]].find({n,i}));
	}
}

int main(){

	cin>>N; 
	FOR(i,0,N-1){
		int u,v; cin>>u>>v;
		adj[u].pb(v);
		adj[v].pb(u);
	}

	int K; cin>>K;
	FOR(i,0,K){
		int u,v; cin>>u>>v;
		add(u,v);
	}

	/*FOR(i,1,N+1){
		for(auto x: vec[i]) cout << x.fi << ' ' << x.se << endl;
		cout << endl;
	}*/

	int Q; cin>>Q;
	while(Q--){
		int ty; cin>>ty;
		if(ty==1){
			int u,v; cin>>u>>v;
			add(u,v);
		}
		else if(ty==2){
			int u,v; cin>>u>>v;
			del(u,v);
		}
		else{
			int u,v,t,tt; cin>>u>>v>>t>>tt; 
			dfs(u,u,v);

			int cur=v,ans=0; 
			while(1){
				for(auto it: vec[cur]){
					int a=it.fi,b=it.se;
					int l=(t-b+a-1)/a,r=(tt-b)/a;
					if(l<0) l=0;
					ans+=max(0,r-l+1);
				}

				if(cur==u) break;
				cur=par[cur];
			}
			cout << ans << endl;
		}
		
	}



}

/*
5
1 2
2 3
2 4
1 5
1
4 1
5
3 3 5 0 3
1 2 5
3 4 5 1 5
2 2 5
3 3 5 0 3
*/

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 7756 KB Output isn't correct
2 Incorrect 65 ms 8036 KB Output isn't correct
3 Incorrect 39 ms 7944 KB Output isn't correct

Subtask #2
0 / 45.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3572 ms 10996 KB Time limit exceeded
2 Execution timed out 3568 ms 10936 KB Time limit exceeded
3 Execution timed out 3570 ms 10900 KB Time limit exceeded
4 Execution timed out 3573 ms 10912 KB Time limit exceeded
5 Execution timed out 3588 ms 10824 KB Time limit exceeded
6 Execution timed out 3560 ms 10980 KB Time limit exceeded
7 Execution timed out 3559 ms 11088 KB Time limit exceeded
8 Execution timed out 3577 ms 10976 KB Time limit exceeded
9 Execution timed out 3537 ms 10784 KB Time limit exceeded

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3526 ms 10232 KB Time limit exceeded
2 Execution timed out 3523 ms 10388 KB Time limit exceeded
3 Execution timed out 3536 ms 10600 KB Time limit exceeded
4 Execution timed out 3556 ms 10272 KB Time limit exceeded
5 Execution timed out 3549 ms 10168 KB Time limit exceeded
6 Execution timed out 3569 ms 10576 KB Time limit exceeded
7 Execution timed out 3591 ms 10708 KB Time limit exceeded
8 Execution timed out 3590 ms 10472 KB Time limit exceeded