제출 #888726

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
888726		vjudge1	Two Currencies (JOI23_currencies)	C++17	10 / 100	240 ms	40324 KiB

currencies

#include <bits/stdc++.h>
using namespace std;/*
<<<<It's never too late for a new beginning in your life>>>>
Today is hard
  tomorrow will worse
  but the day after tomorrow will be the sunshine..
 
HARD WORK BEATS TALENT WHEN TALENT DOESN'T WORK HARD............
Never give up  */
//The most CHALISHKANCHIK
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define int long long
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vii;
const int N = 100005;
vi g[N];
map<pii, vi> mp;
int t;
int pre[N];
int n, q, timer;
int tin[N], tout[N];
int up[20][N];
int num[N]{};
void dfs(int v, int pr){
    tin[v] = ++timer;
    up[0][v] = pr;
    for (int i = 1; i <= 17; i++) {
        up[i][v] = up[i - 1][ up[i - 1][v] ];
    }
    for (int to : g[v]) {
        if (to == pr) continue;
        dfs(to, v);
    }
    tout[v] = timer;
}
void sukfe(int v, int pr){
    for (int to : g[v]) {
        if (to == pr) continue;
        num[to] = num[v] + mp[{v, to}].size();
        dfs(to, v);
    }
}
void dfs2(int v, int pr){
    for (int to : g[v]) {
        if (to == pr) continue;
        pre[to] = v;
        dfs2(to, v);
    }
}
bool upper(int a, int b) {
    return tin[a] <= tin[b] && tout[a] >= tout[b];
}

int lca(int a, int b) {
    if (upper(a, b)) return a;
    if (upper(b, a)) return b;
    for (int i = 17; i >= 0; i--) {
        if (!upper(up[i][a], b)) {
            a = up[i][a];
        }
    }
    return up[0][a];
}

void solve(){
	int n, m, q;
	cin >> n >> m >> q;
	vii cui;
	int cc = 0;
	for(int i = 0; i < n-1; i++){
		int a, b;
		cin >> a >> b;
		g[a].pb(b);
		g[b].pb(a);
		cui.pb({a, b});
	}
	for(int i = 0; i < m; i++){
		int j, c;
		cin >> j >> c;j--;
		mp[cui[j]].pb(c);
		mp[{cui[j].ss, cui[j].ff}].pb(c);
		cc = c;
	}
	if(n > 2000){
		dfs(1, -1);
		sukfe(1, -1);
		while(q--){
			int a, b, x, y;
			cin >> a >> b >> x >> y;
			int cnt = num[a] + num[b] - (2 * num[lca(a, b)]);
			int l = 1, r = cnt, ans = 0;
			while(l < r){
				int m = (l+r)>>1;
				if(cc*m <= y){
					l = m+1;
					ans = m;
				}else r = m;
			}
			x = (x - (cnt-ans));
			cout << (x < 0 ? -1 : x) << '\n';
		}
	}else{
		vi pas;
		while(q--){
			int s, x, y;
			cin >> s >> t >> x >> y;
			dfs2(s, -1);
			int r = t;
			while(r!=s){
				for(auto i:mp[{r, pre[r]}])pas.pb(i);
				r = pre[r];
			}
			sort(all(pas));
			for(auto i:pas){
				if(i <= y)y -= i;
				else x--;
			}pas.clear();
			cout << (x<0?-1:x) << '\n';
		}
	}
	
}
main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int t = 1;
	//~ cin >> t;
	while(t--){
		solve();
	}
}

컴파일 시 표준 에러 (stderr) 메시지

currencies.cpp:127:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  127 | main(){
      | ^~~~

• Subtask 1: 10 / 10
• Subtask 2: 0 / 28
• Subtask 3: 0 / 30
• Subtask 4: 0 / 32