#include <bits/stdc++.h>
#define DIMN 100010
using namespace std;
int tt[DIMN] , lvl[DIMN] , f[DIMN];
int up[DIMN] , l[DIMN] , d[DIMN] , poz[DIMN] , idx_aint[DIMN];
vector < map <short,int> > aint[DIMN];
vector <int> v[DIMN] , w[DIMN];
int elem , lnt , curr;
void dfs_lant(int nod , int fth){
int i,vecin,ok=0,maxi,fiu;
tt[nod] = fth;
d[nod] = 1;
maxi=0;
fiu=0;
for (i=0;i<v[nod].size();i++){
vecin=v[nod][i];
if (vecin!=tt[nod]){
ok=1;
lvl[vecin] = 1 + lvl[nod];
dfs_lant(vecin , nod);
d[nod] += d[vecin];
if (d[vecin]>maxi){
maxi=d[vecin];
fiu=vecin;
}
}
}
if (!ok){ /// frunza
lnt++;
l[nod]=lnt; /// lantul din care apartine
w[lnt].push_back(nod);
}else { /// unim cu poz
w[l[fiu]].push_back(nod);
l[nod]=l[fiu];
for (i=0;i<v[nod].size();i++){
vecin=v[nod][i];
if (vecin!=tt[nod] && vecin!=fiu)
up[l[vecin]]=nod; /// din lantul vecinului trecem in lantul nodului
}
}
v[nod].clear();
}
void build_aint (int lant , int p , int st , int dr){
int mid = (st + dr)/2;
if (st == dr){
idx_aint[w[lant][st]] = p;
return;
}
build_aint(lant , 2 * p , st , mid);
build_aint(lant , 2 * p + 1 , mid + 1 , dr);
}
void update_aint (int lant , int p , int st , int dr , int l , int r , int len , int val , int sens){
int mid , rest;
if (st == dr){
aint[lant][p][len * 100 + curr] += val;
// printf ("%d %d %d\n", w[lant][st] , len , curr);
curr++;
return;
}
mid=(st+dr)/2;
if (sens == -1){
if (l <= mid)
update_aint(lant , 2 * p , st , mid , l , r , len , val , sens);
if (mid + 1 <= r)
update_aint(lant , 2 * p + 1 , mid + 1 , dr , l , r , len , val , sens);
}
else {
if (mid + 1 <= r)
update_aint(lant , 2 * p + 1 , mid + 1 , dr , l , r , len , val , sens);
if (l <= mid)
update_aint(lant , 2 * p , st , mid , l , r , len , val , sens);
}
for (rest = 0 ; rest < len ; rest++)
aint[lant][p][len * 100 + rest] = aint[lant][2 * p][len * 100 + rest] + aint[lant][2 * p + 1][len * 100 + rest];
}
void update (int x , int y , int len , int val){
if (l[x]!=l[y]){ /// avansam
if (lvl[up[l[x]]]>lvl[up[l[y]]]){
update_aint (l[x] , 1 , 0 , w[l[x]].size()-1 , 0 , poz[x] , len , val , 1);
update ( up[l[x]] , y , len , val);
}
else{
update ( x , up[l[y]] , len , val );
update_aint( l[y] , 1 , 0 , w[l[y]].size()-1 , 0 , poz[y] , len , val , -1 );
}
}
else {
if (poz[x] <= poz[y])
update_aint( l[x] , 1 , 0 , w[l[x]].size()-1 , poz[x] , poz[y] , len , val , -1 );
else
update_aint( l[x] , 1 , 0 , w[l[x]].size()-1 , poz[y] , poz[x] , len , val , 1 );
}
}
long long query_aint (int lant , int p , int st , int dr , int px , int py , int t1 , int t2){
int mid , len , rest;
long long sol = 0;
if (px <= st && dr <= py){
for (len = 1 ; len <= 20 ; len ++){
for (rest = 0 ; rest < len ; rest++){
sol += 1LL * aint[lant][p][len * 100 + rest] * ((t2 / len) + (t2 % len >= rest) - ((t1 - 1) / len) - ((t1 - 1) % len >= rest));
}
}
return sol;
}
mid = (st + dr)/2;
if (px <= mid)
sol = sol + query_aint(lant , 2 * p , st , mid , px , py , t1 , t2);
if (mid+1 <= py)
sol = sol + query_aint(lant , 2 * p + 1 , mid + 1 , dr , px , py , t1 , t2);
return sol;
}
long long query (int x , int y , int t1 , int t2){
if (l[x] != l[y]){ /// avansam
if (lvl[up[l[x]]]>lvl[up[l[y]]])
return query(up[l[x]] , y , t1 , t2) + query_aint(l[x] , 1 , 0 , w[l[x]].size()-1 , 0 , poz[x] , t1 , t2);
else{
return query(x , up[l[y]] , t1 , t2) + query_aint(l[y] , 1 , 0 , w[l[y]].size()-1 , 0 , poz[y] , t1 , t2);
}
}
else{
return query_aint(l[x] , 1 , 0 , w[l[x]].size()-1 , min(poz[x],poz[y]) , max(poz[x],poz[y]) , t1 , t2);
}
}
int adauga (int x , int y , int val , int op){
int lca , nod , poz , len , i;
nod = x;
for (i = 0 ; i < 20 ; i++){
f[nod] = op;
nod = tt[nod];
}
nod = y;
for (i = 0 ; i < 20 ; i++){
if (f[nod] == op){
lca = nod;
break;
}
f[nod] = op;
nod = tt[nod];
}
return lvl[x] + lvl[y] - 2 * lvl[lca] + 1;
}
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int n , i , x , y , tip , k , q , t1 , t2 , p , vecin , len;
fscanf (fin,"%d",&n);
for (i = 1 ; i < n ; i++){
fscanf (fin,"%d%d",&x,&y);
v[x].push_back(y);
v[y].push_back(x);
}
lvl[1] = 1;
dfs_lant(1 , 0);
/// fiecare nod al catelea e
for (i=1;i<=lnt;i++){
reverse(w[i].begin(),w[i].end());
p=0;
for (vector <int> :: iterator j=w[i].begin();j!=w[i].end();j++){
/// pozitia lui din lantul curent
vecin=*j;
poz[vecin]=p;
p++;
}
aint[i].resize(w[i].size()*4);
build_aint(i , 1 , 0 , w[i].size() - 1);
}
fscanf (fin,"%d",&k);
int op = 1;
for (i = 1 ; i <= k ; i++){
fscanf (fin,"%d%d",&x,&y);
len = adauga(x , y , 1 , ++op);
curr = 0;
update(x , y , len , 1);
}
fscanf (fin,"%d",&q);
for (i = 1 ; i <= q ; i++){
fscanf (fin,"%d",&tip);
if (tip == 1){
fscanf (fin,"%d%d",&x,&y);
len = adauga(x , y , 1 , ++op);
curr = 0;
update (x , y , len , 1);
}
else if (tip == 2){
fscanf (fin,"%d%d",&x,&y);
len = adauga(x , y , -1 , ++op);
curr = 0;
update (x , y , len , -1);
}
else {
fscanf (fin,"%d%d%d%d",&x,&y,&t1,&t2);
fprintf (fout,"%lld\n",query (x , y , t1 , t2));
}
}
return 0;
}
Compilation message
traffickers.cpp: In function 'void dfs_lant(int, int)':
traffickers.cpp:15:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i=0;i<v[nod].size();i++){
~^~~~~~~~~~~~~~
traffickers.cpp:35:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i=0;i<v[nod].size();i++){
~^~~~~~~~~~~~~~
traffickers.cpp: In function 'int adauga(int, int, int, int)':
traffickers.cpp:133:21: warning: unused variable 'poz' [-Wunused-variable]
int lca , nod , poz , len , i;
^~~
traffickers.cpp:133:27: warning: unused variable 'len' [-Wunused-variable]
int lca , nod , poz , len , i;
^~~
traffickers.cpp: In function 'int main()':
traffickers.cpp:156:12: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
fscanf (fin,"%d",&n);
~~~~~~~^~~~~~~~~~~~~
traffickers.cpp:158:16: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
fscanf (fin,"%d%d",&x,&y);
~~~~~~~^~~~~~~~~~~~~~~~~~
traffickers.cpp:181:12: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
fscanf (fin,"%d",&k);
~~~~~~~^~~~~~~~~~~~~
traffickers.cpp:184:16: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
fscanf (fin,"%d%d",&x,&y);
~~~~~~~^~~~~~~~~~~~~~~~~~
traffickers.cpp:190:12: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
fscanf (fin,"%d",&q);
~~~~~~~^~~~~~~~~~~~~
traffickers.cpp:192:16: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
fscanf (fin,"%d",&tip);
~~~~~~~^~~~~~~~~~~~~~~
traffickers.cpp:194:20: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
fscanf (fin,"%d%d",&x,&y);
~~~~~~~^~~~~~~~~~~~~~~~~~
traffickers.cpp:200:20: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
fscanf (fin,"%d%d",&x,&y);
~~~~~~~^~~~~~~~~~~~~~~~~~
traffickers.cpp:206:20: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
fscanf (fin,"%d%d%d%d",&x,&y,&t1,&t2);
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
traffickers.cpp: In function 'int adauga(int, int, int, int)':
traffickers.cpp:149:41: warning: 'lca' may be used uninitialized in this function [-Wmaybe-uninitialized]
return lvl[x] + lvl[y] - 2 * lvl[lca] + 1;
~~~~~~~^
traffickers.cpp: In function 'int main()':
traffickers.cpp:149:41: warning: 'lca' may be used uninitialized in this function [-Wmaybe-uninitialized]
return lvl[x] + lvl[y] - 2 * lvl[lca] + 1;
~~~~~~~^
traffickers.cpp:133:9: note: 'lca' was declared here
int lca , nod , poz , len , i;
^~~
traffickers.cpp:149:41: warning: 'lca' may be used uninitialized in this function [-Wmaybe-uninitialized]
return lvl[x] + lvl[y] - 2 * lvl[lca] + 1;
~~~~~~~^
traffickers.cpp:133:9: note: 'lca' was declared here
int lca , nod , poz , len , i;
^~~
traffickers.cpp:149:41: warning: 'lca' may be used uninitialized in this function [-Wmaybe-uninitialized]
return lvl[x] + lvl[y] - 2 * lvl[lca] + 1;
~~~~~~~^
traffickers.cpp:133:9: note: 'lca' was declared here
int lca , nod , poz , len , i;
^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
13 ms |
8064 KB |
Output is correct |
| 2 |
Correct |
83 ms |
18296 KB |
Output is correct |
| 3 |
Correct |
80 ms |
18168 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1074 ms |
128632 KB |
Output is correct |
| 2 |
Correct |
1004 ms |
103224 KB |
Output is correct |
| 3 |
Correct |
1081 ms |
133496 KB |
Output is correct |
| 4 |
Correct |
1074 ms |
124408 KB |
Output is correct |
| 5 |
Correct |
1010 ms |
113144 KB |
Output is correct |
| 6 |
Correct |
1031 ms |
118776 KB |
Output is correct |
| 7 |
Correct |
1057 ms |
123640 KB |
Output is correct |
| 8 |
Correct |
1110 ms |
137080 KB |
Output is correct |
| 9 |
Correct |
1010 ms |
113656 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
3608 ms |
353144 KB |
Time limit exceeded |
| 2 |
Execution timed out |
3592 ms |
405880 KB |
Time limit exceeded |
| 3 |
Execution timed out |
3605 ms |
433144 KB |
Time limit exceeded |
| 4 |
Execution timed out |
3579 ms |
256308 KB |
Time limit exceeded |
| 5 |
Execution timed out |
3599 ms |
253792 KB |
Time limit exceeded |
| 6 |
Execution timed out |
3589 ms |
421648 KB |
Time limit exceeded |
| 7 |
Execution timed out |
3584 ms |
440380 KB |
Time limit exceeded |
| 8 |
Execution timed out |
3608 ms |
448888 KB |
Time limit exceeded |
