#include <bits/stdc++.h>
#define DIM 30010
using namespace std;
vector <int> L[DIM],w,aux;
int E[DIM*3],level[DIM],fth[DIM],first[DIM],p[DIM*3];
int cnt[DIM][22][22];
pair <int,int> rmq[20][DIM];
multiset <pair<int,int> > s[DIM];
int n,m,i,j,x,y,tip,q,k,t1,t2;
void dfs (int nod, int tata){
E[++k] = nod;
first[nod] = k;
fth[nod] = tata;
level[nod] = 1 + level[tata];
for (auto vecin : L[nod]){
if (vecin != tata){
dfs (vecin,nod);
E[++k] = nod;
}}}
int get_lca (int x, int y){
int posx = first[x], posy = first[y];
if (posx > posy)
swap (posx,posy);
int nr = p[posy - posx + 1];
pair <int, int> sol = min (rmq[nr][posx], rmq[nr][posy - (1<<nr) + 1]);
return E[sol.second];
}
void drum (int x, int y){
int lca = get_lca (x,y);
w.clear();
int nod = x;
while (nod != lca){
w.push_back(nod);
nod = fth[nod];
}
w.push_back(lca);
nod = y;
aux.clear();
while (nod != lca){
aux.push_back(nod);
nod = fth[nod];
}
for (j=aux.size()-1;j>=0;j--)
w.push_back(aux[j]);
}
void adauga (int x, int y){
drum (x,y);
/// in w am lantul de la x la y
int t = 0, lg = w.size();
for (auto nod : w){
/// il inserez pe t in setul nodului
//s[nod].insert(make_pair(t,lg));
cnt[nod][t][lg]++;
t++;
}
}
void scoate (int x, int y){
drum (x,y);
int t = 0, lg = w.size();
for (auto nod : w){
//s[nod].erase (make_pair(t,lg));
cnt[nod][t][lg]--;
t++;
}
}
int solve (int x, int y, int t){
if (t < 0)
return 0;
drum (x,y);
int sol = 0;
for (auto nod : w){
for (int a=0;a<=20;a++){
if (a > t)
break;
for (int b=1;b<=20;b++){
int nr = (t - a) / b + 1;
sol += nr * cnt[nod][a][b];
}
}
/*for (auto it : s[nod]){
int a = it.first, b = it.second;
if (t < a)
continue;
int nr = (t - a) / b;
sol += nr + 1;
}*/
}
return sol;
}
int main (){
ifstream cin ("traffickers.in");
ofstream cout ("traffickers.out");
cin>>n;
for (i=1;i<n;i++){
cin>>x>>y;
L[x].push_back(y);
L[y].push_back(x);
}
dfs (1,0);
for (i=1;i<=k;i++)
rmq[0][i] = make_pair(level[E[i]],i);
for (i=1;(1<<i)<=k;i++)
for (j=1;j<=k;j++){
rmq[i][j] = rmq[i-1][j];
if (j + (1<<(i-1)) <= k && rmq[i-1][j + (1<<(i-1))].first < rmq[i][j].first)
rmq[i][j] = rmq[i-1][j + (1<<(i-1))];
}
for (i=2;i<=k;i++)
p[i] = p[i/2] + 1;
cin>>m; /// nr inital de traficanti
for (i=1;i<=m;i++){
cin>>x>>y;
adauga (x,y);
}
cin>>q;
for (;q--;){
cin>>tip>>x>>y;
if (tip == 1){
adauga (x,y);
continue;
}
if (tip == 2){
scoate (x,y);
continue;
}
cin>>t1>>t2;
cout<<solve(x,y,t2) - solve(x,y,t1-1)<<"\n";
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
2432 KB |
Output isn't correct |
| 2 |
Incorrect |
5 ms |
2432 KB |
Output isn't correct |
| 3 |
Incorrect |
5 ms |
2432 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
2560 KB |
Output isn't correct |
| 2 |
Incorrect |
5 ms |
2560 KB |
Output isn't correct |
| 3 |
Incorrect |
5 ms |
2560 KB |
Output isn't correct |
| 4 |
Incorrect |
5 ms |
2432 KB |
Output isn't correct |
| 5 |
Incorrect |
5 ms |
2560 KB |
Output isn't correct |
| 6 |
Incorrect |
6 ms |
2432 KB |
Output isn't correct |
| 7 |
Incorrect |
6 ms |
2560 KB |
Output isn't correct |
| 8 |
Incorrect |
5 ms |
2560 KB |
Output isn't correct |
| 9 |
Incorrect |
5 ms |
2432 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
2560 KB |
Output isn't correct |
| 2 |
Incorrect |
5 ms |
2560 KB |
Output isn't correct |
| 3 |
Incorrect |
5 ms |
2432 KB |
Output isn't correct |
| 4 |
Incorrect |
6 ms |
2432 KB |
Output isn't correct |
| 5 |
Incorrect |
6 ms |
2432 KB |
Output isn't correct |
| 6 |
Incorrect |
5 ms |
2560 KB |
Output isn't correct |
| 7 |
Incorrect |
6 ms |
2432 KB |
Output isn't correct |
| 8 |
Incorrect |
5 ms |
2432 KB |
Output isn't correct |
