oj.uz

답안 #853800

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
853800 2023-09-25T09:14:45 Z TimDee Traffickers (RMI18_traffickers) C++17
0 / 100
 400 ms 524288 KB 
//  Esti <3

//\
     šťastia pre nás :)
//   you're already the best
//             _
//   ^ ^      //
// >(O_O)<___//
//   \ __ __  \
//    \\ \\ \\\\
 
#include <bits/stdc++.h>
using namespace std;
 
//#pragma GCC optimize("O3","unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
 
#pragma GCC optimize("O3")
#pragma GCC target("popcnt")

using ll = long long;
//#define int long long
#define forn(i,n) for(int i=0; i<(n); ++i)
#define pb push_back
#define pi pair<int,int>
#define f first
#define s second 
#define vii(a,n) vector<int> a(n); forn(i,n) cin>>a[i];
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
 
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const int inf = 1e18;
const int mod = 1e9+7;//998244353;
 
// \
\
:smiling_face_with_3_hearts: :smiling_face_with_3_hearts:  :smiling_face_with_3_hearts:  
 
//vidime sa veľmi skoro, moje slnko

const int N = 30005;

int t[21][21][N];

void add(int i, int j, int k, int x) {
	for(;k<N;k|=k+1) t[i][j][k]+=x;
}
int sum(int i, int j, int r) {
	int q=0;
	for(;r>=0;r=(r&(r+1))-1) q+=t[i][j][r];
	return q;
}

int par[N], top[N], sz[N], d[N];
int ind[N], inv[N];
int nxt=0;
vector<int> adj[N];

void dfs(int u, int p) {
	par[u]=p;
	sz[u]=1;
	for(auto&v:adj[u]) {
		if (v==p) continue;
		d[v]=d[u]+1;
		dfs(v,u);
		sz[u]+=sz[v];
	}
}
void dfs(int u, int p, int t) {
	ind[u]=nxt++;
	inv[ind[u]]=u;
	top[u]=t;
	int mx=-1;
	for(auto&v:adj[u]) {
		if (v==p) continue;
		if (mx==-1) mx=v;
		if (sz[v] > sz[mx]) v=mx;
	}
	if (mx==-1) return;
	dfs(mx,u,t);
	for(auto&v:adj[u]) {
		if (v==p || v==mx) continue;
		dfs(v,u,v);
	}
}

int lca(int u, int v) {
	while (top[u]!=top[v]) {
		if (d[top[u]] < d[top[v]]) swap(u,v);
		u=par[top[u]];
	}
	if (d[u]>d[v]) swap(u,v);
	return u;
}

void qadd(int u, int v, int z) {
	int l = lca(u,v);
	vector<int> f,s;
	while (u!=l) {
		f.pb(u); u=par[u];
	}
	f.pb(u);
	while (v!=l) {
		s.pb(v); v=par[v];
	}
	reverse(all(s));
	for(auto&x:s) f.pb(x);
	int k=f.size();
	return;
	forn(i,k) {
		int u = f[i];
		for (int j=i; j<k; ++j) add(k,j,ind[u],z);
		add(k,20,ind[u],z);
	}
}

ll qry(int u, int t) {
	ll ans=0;
	while (u>=0) {
		forn(i,20) {
			int x = sum(i+1,t%(i+1),ind[u]) - sum(i+1,t%(i+1),ind[top[u]]-1);
			ans+=x;
			int y = sum(i+1,20,ind[u]) - sum(i+1,20,ind[top[u]]-1);
			ans+=1ll*y*(t/(i+1));
		}
		u=par[top[u]];
	}
	return ans;
}
ll query(int u, int v, int t) {
	if (t<0) return 0;
	ll ans = 0;
	int l = lca(u,v);
	ans += qry(u,t);
	ans += qry(v,t);
	ans -= 2ll*qry(l,t);
	forn(i,20) {
		int x = sum(i+1,t%(i+1),ind[l]) - sum(i+1,t%(i+1),ind[l]-1);
		ans+=x;
		int y = sum(i+1,20,ind[l]) - sum(i+1,20,ind[l]-1);
		ans+=1ll*y*(t/(i+1));
	}
	return ans;
}

void solve() {

	int n; cin>>n;
	forn(i,n-1) {
		int u,v; cin>>u>>v; --u, --v;
		adj[u].pb(v);
		adj[v].pb(u);
	}
	dfs(0,-1);
	dfs(0,-1,0);
	int k; cin>>k;
	forn(i,k) {
		int u,v; cin>>u>>v; --u, --v;
		qadd(u,v,1);
	}
	exit(0);
	int q; cin>>q;
	forn(i,q) {
		int t; cin>>t;
		if (t==1) {
			int u,v; cin>>u>>v; --u, --v;
			qadd(u,v,1);
		} else if (t==2) {
			int u,v; cin>>u>>v; --u, --v;
			qadd(u,v,-1);
		} else {
			int u,v,a,b; cin>>u>>v>>a>>b; --u, --v;
			ll ans = query(u,v,b);
			ans -= query(u,v,a-1);
			cout<<ans<<'\n';
		}
	}

}

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t=1;
    //cin>>t;
    while (t--) solve();
    return 0;
}

Compilation message

traffickers.cpp:3:1: warning: multi-line comment [-Wcomment]
    3 | //\
      | ^
traffickers.cpp:9:1: warning: multi-line comment [-Wcomment]
    9 | //   \ __ __  \
      | ^
traffickers.cpp:36:1: warning: multi-line comment [-Wcomment]
   36 | // \
      | ^
traffickers.cpp:33:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   33 | const int inf = 1e18;
      |                 ^~~~

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2652 KB Output isn't correct
2 Incorrect 1 ms 2652 KB Output isn't correct
3 Runtime error 395 ms 524288 KB Execution killed with signal 9

Subtask #2
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 386 ms 524288 KB Execution killed with signal 9
2 Runtime error 388 ms 524288 KB Execution killed with signal 9
3 Runtime error 389 ms 524288 KB Execution killed with signal 9
4 Runtime error 400 ms 524288 KB Execution killed with signal 9
5 Runtime error 387 ms 524288 KB Execution killed with signal 9
6 Runtime error 394 ms 524288 KB Execution killed with signal 9
7 Runtime error 395 ms 524288 KB Execution killed with signal 9
8 Runtime error 388 ms 524288 KB Execution killed with signal 9
9 Incorrect 5 ms 3160 KB Output isn't correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 396 ms 524288 KB Execution killed with signal 9
2 Runtime error 391 ms 524288 KB Execution killed with signal 9
3 Runtime error 390 ms 524288 KB Execution killed with signal 9
4 Runtime error 399 ms 524288 KB Execution killed with signal 9
5 Runtime error 393 ms 524288 KB Execution killed with signal 9
6 Runtime error 396 ms 524288 KB Execution killed with signal 9
7 Incorrect 24 ms 4696 KB Output isn't correct
8 Incorrect 24 ms 4188 KB Output isn't correct