#include <bits/stdc++.h>
#define debug cout << "CHECK" << '\n'
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC taraget("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;
const int mod=1e9+7;
const int modp=1999999973;
const int modulo=998244353;
const int nmax=30005;
int n,q,parinte[nmax],tin[nmax],tout[nmax],lca[nmax][23],aib[21][21][2*nmax],first[nmax],last[nmax],height[nmax];
vector<int>nod[nmax],euler;
void DFS(int s,int par,int &time,int lvl){
euler.push_back(s);
parinte[s]=par;
tin[s]=(++time);
height[s]=lvl;
for(auto it:nod[s]){
if(it!=par){
DFS(it,s,time,lvl+1);
euler.push_back(s);
}
}
tout[s]=(++time);
}
int findLCA(int x, int y){
if(height[x]<height[y]) swap(x, y);
int log1, log2;
for(log1 = 1; (1 << log1) < height[x]; ++log1);
for(log2 = 1; (1 << log2) < height[y]; ++log2);
for(int k = log1; k >= 0; --k)
if(height[x] - (1 << k) >= height[y])
x = lca[x][k];
if(x == y) return x;
for(int k = log2; k >= 0; --k)
if(lca[x][k] && lca[x][k] != lca[y][k])
x = lca[x][k],
y = lca[y][k];
return lca[x][0];
}
void update(int pos,int val,int aib[]){
while(pos<=euler.size()){
aib[pos]+=val;
pos+=(pos&-pos);
}
return;
}
int sum(int pos,int aib[]){
int rs=0;
while(pos){
rs+=aib[pos];
pos-=(pos&-pos);
}
return rs;
}
void query12(int x,int y,int type){
int lc=findLCA(x,y);
vector<int>path;
while(x!=lc){
path.push_back(x);
x=parinte[x];
}
vector<int>tz;
while(y!=lc){
tz.push_back(y);
y=parinte[y];
}
tz.push_back(y);
if(tz.size()) for(int i=tz.size()-1;i>=0;i--) path.push_back(tz[i]);
for(int i=0;i<=19;i++){
int nod = path[i%path.size()];
if(type==1){
update(first[nod],1,aib[i][path.size()]);
update(last[nod]+1,-1,aib[i][path.size()]);
}
else{
update(first[nod],-1,aib[i][path.size()]);
update(last[nod]+1,1,aib[i][path.size()]);
}
}
}
int query3(int x,int y,int t1,int t2){
int cnt[20];
int lc=findLCA(x,y);
for(int i=0;i<=19;i++) cnt[i]=0;
while(t1<t2 && t1%20!=0){
cnt[t1%20]++;
t1++;
}
while(t2>t1 && t2%20!=19){
cnt[t2%20]++;
t2--;
}
if(t1==t2){
cnt[t1%20]++;
}
else{
int curr=(t2-t1)/20;
for(int i=0;i<=19;i++) cnt[i]+=curr;
}
int ans=0;
for(int i=0;i<=19;i++){
for(int j=1;j<=20;j++){
int curr=cnt[i]*(sum(first[x],aib[i][j])+sum(first[y],aib[i][j])-sum(first[lc],aib[i][j])-sum(first[parinte[lc]],aib[i][j]));
ans+=curr;
}
}
return ans;
}
int32_t main(){
// ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
srand(chrono::steady_clock::now().time_since_epoch().count());
// ifstream cin("input.in");
cin >> n;
for(int i=1;i<n;i++){
int x,y;
cin >> x >> y;
nod[x].push_back(y);
nod[y].push_back(x);
}
int timp=0;
DFS(1,-1,timp,0);
int pop=0;
for(auto it:euler){
pop++;
if(first[it]==0){
first[it]=pop;
last[it]=pop;
}
else last[it]=pop;
}
for(int i=1;i<=n;i++) lca[i][0]=parinte[i];
for(int i=1;(1<<i)<=n;i++){
for(int j=1;j<=n;j++) lca[j][i]=lca[lca[j][i-1]][i-1];
}
parinte[1]=0;
cin >> q;
for(int i=1;i<=q;i++){
int x,y;
cin >> x >> y;
query12(x,y,1);
}
cin >> q;
int t=0;
for(int i=1;i<=q;i++){
cin >> t;
if(t==1 || t==2){
int x,y;
cin >> x >> y;
query12(x,y,t);
}
else{
int x,y,t1,t2;
cin >> x >> y >> t1 >> t2;
cout << query3(x,y,t1,t2) << '\n';
}
}
}
Compilation message
traffickers.cpp:8:0: warning: ignoring #pragma GCC taraget [-Wunknown-pragmas]
#pragma GCC taraget("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
traffickers.cpp: In function 'void update(long long int, long long int, long long int*)':
traffickers.cpp:61:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(pos<=euler.size()){
~~~^~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
7 ms |
3328 KB |
Output is correct |
| 2 |
Correct |
22 ms |
9472 KB |
Output is correct |
| 3 |
Correct |
22 ms |
9472 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
266 ms |
68492 KB |
Output isn't correct |
| 2 |
Incorrect |
283 ms |
61908 KB |
Output isn't correct |
| 3 |
Incorrect |
281 ms |
65524 KB |
Output isn't correct |
| 4 |
Incorrect |
276 ms |
68600 KB |
Output isn't correct |
| 5 |
Incorrect |
272 ms |
68472 KB |
Output isn't correct |
| 6 |
Incorrect |
265 ms |
68600 KB |
Output isn't correct |
| 7 |
Incorrect |
257 ms |
67320 KB |
Output isn't correct |
| 8 |
Incorrect |
265 ms |
68596 KB |
Output isn't correct |
| 9 |
Incorrect |
271 ms |
68724 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2856 ms |
198508 KB |
Output isn't correct |
| 2 |
Incorrect |
2782 ms |
199160 KB |
Output isn't correct |
| 3 |
Incorrect |
2724 ms |
198640 KB |
Output isn't correct |
| 4 |
Incorrect |
2914 ms |
198516 KB |
Output isn't correct |
| 5 |
Incorrect |
3060 ms |
198388 KB |
Output isn't correct |
| 6 |
Incorrect |
2766 ms |
198924 KB |
Output isn't correct |
| 7 |
Incorrect |
2944 ms |
199024 KB |
Output isn't correct |
| 8 |
Incorrect |
2929 ms |
199048 KB |
Output isn't correct |
