oj.uz

Submission #888704

# Submission time Handle Problem Language Result Execution time Memory
888704 2023-12-18T05:52:49 Z vjudge1 Two Currencies (JOI23_currencies) C++17
38 / 100
 306 ms 39768 KB 
/*

author : abushbandit
contest : ---

*/

#include "bits/stdc++.h"

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;

using namespace std;

#define int long long
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define ff first
#define ss second
#define pb push_back
#define rep(i,s,f) for(int i = s;i < f;i++)

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>

#pragma GCC optimize("Ofast,no-stack-protector,fast-math",3)

template <class type1>
	using ordered_multiset = tree <type1, null_type, less_equal <type1>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<pair<int,int>> vii;
typedef pair<int,int> pii;

const ll INF = 1e18;
const ll MOD7 = 1e9 + 7;
const ll MOD9 = 998244353;
const ld PI = acos(-1.0);
const int N = 1e5 + 6;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
    
}

int binpow (int a, int n) {
	int res = 1;
	while (n) {
		if (n & 1)
			res *= a;
		a *= a;
		n >>= 1;
	}
	return res;
}

void start_file(string file){
	freopen((file + ".in").c_str(),"r",stdin);
	freopen((file + ".out").c_str(),"w",stdout);
}

// for second subtask

vector<pair<int,int>> g[N];
int up[N][30];
int dp[N],dep[N];
int path[N];

// for first subtask

vector<vector<int>> wgt(N);

void dfs(int u,int pr,int de){
	dep[u] = de;
	for(auto x : g[u]){
		if(x.ff != pr){
			up[x.ff][0] = u;
			dp[x.ff] = dp[u] + path[x.ss];
			dfs(x.ff,u,de + 1);			
		}
	}
}
 
int lca(int a,int b){
	if(dep[a] < dep[b])
		swap(a,b);
	int dis = dep[a] - dep[b];
	for(int i = 29;i >= 0;i--)
		if(dis & (1 << i)){
			a = up[a][i];
		}
	if(a == b)
		return a;
	for(int i = 29;i >= 0;i--)
		if(up[a][i] != up[b][i]){
			a = up[a][i];
			b = up[b][i];
		}
	return up[a][0];
}

void clear(){
	for(int i = 0;i < N;i++){
		g[i].clear();
		path[i] = dep[i] = dp[i] = 0;
		for(int j = 0;j < 30;j++)
			up[i][j] = 0;
	}
	return;
}

void scndfs(int n,int p,vector<pair<int,vector<int>>> &pr){
//	cout << n << endl;
//	pair<int,vector<int>> q;
//	q.ff = p;
//	q.ss = v;
//	pr[n] = q;
	for(auto to : g[n]){
		if(to.ff != p){
			pr[to.ff] = {n,wgt[to.ss]};
//			cout << "ans" << endl;
			scndfs(to.ff,n,pr);
		}
	}
}

void solve(int tc){
	
	clear();
	int n,m,q;
    cin >> n >> m >> q;
    if(n <= 2000 && m <= 2000 && q <= 2000){
//    	int a[n],b[n];
    	for(int i = 0;i < n - 1;i++){
    		int a,b;
    		cin >> a >> b;
    		g[a].pb({b,i});
    		g[b].pb({a,i});
		}
		for(int i = 0;i < m;i++){
			int p,c;
			cin >> p >> c;
			wgt[p - 1].pb(c);
		}
		for(int i = 0;i < q;i++){
			int s,t,gold,sillver;
			cin >> s >> t >> gold >> sillver;
			vector<pair<int,vector<int>>> pr(n + 1);
//			vector<int> v;
			scndfs(s,0,pr);
			vector<int> ans;
			while(t != s){
				for(auto j : pr[t].ss){
					ans.pb(j);
				}
				t = pr[t].ff;
//				cout << "asd" << endl;
			}
			sort(all(ans));
			for(auto j : ans){
				if(sillver >= j){
					sillver -= j;
				} else{
					gold--;
				}
			}
			if(gold < 0){
				cout << "-1\n";
			} else{
				cout << gold << "\n";
			}
		}
		return;
	}
    for(int i = 0;i < n - 1;i++){
    	int a,b;
    	cin >> a >> b;
    	g[a].push_back({b,i});
    	g[b].push_back({a,i});
    }
    
    int cul;
    for(int i = 0;i < m;i++){
    	int u;
    	cin >> u >> cul;
    	path[u - 1]++;
    }
    dp[1] = 0;
    up[1][0] = 1;
    dfs(1,1,0);
    for(int j = 1;j < 30;j++)
    	for(int i = 1;i < n + 1;i++){
    		up[i][j] = up[up[i][j - 1]][j - 1];
    	}
    for(int i = 0;i < q;i++){
    	int a,b,g,s;
    	cin >> a >> b >> g >> s;
    	int lc = lca(a,b);
    	int dis = dp[a] + dp[b] - 2 * (dp[lc]);
    	int cnt = s / cul;
    	dis = max(0ll,dis - cnt);
    	dis = g - dis;
    	if(dis < 0)
    		dis = -1;
    	cout << dis << "\n";
    }
    
}

signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    
    //	start_file("");

	ios_base::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);

	int test_cases = 1;
//	cin >> test_cases ;
	for(int tc = 1;tc <= test_cases;++ tc){
		solve(tc);
	}
    
}

Compilation message

currencies.cpp: In function 'void start_file(std::string)':
currencies.cpp:75:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |  freopen((file + ".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
currencies.cpp:76:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |  freopen((file + ".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 30812 KB Output is correct
2 Correct 6 ms 30972 KB Output is correct
3 Correct 6 ms 30812 KB Output is correct
4 Correct 6 ms 30808 KB Output is correct
5 Correct 127 ms 31212 KB Output is correct
6 Correct 199 ms 31064 KB Output is correct
7 Correct 123 ms 31064 KB Output is correct
8 Correct 227 ms 31068 KB Output is correct
9 Correct 267 ms 31068 KB Output is correct
10 Correct 215 ms 31244 KB Output is correct
11 Correct 228 ms 31224 KB Output is correct
12 Correct 224 ms 31068 KB Output is correct
13 Correct 295 ms 31324 KB Output is correct
14 Correct 306 ms 31320 KB Output is correct
15 Correct 248 ms 31068 KB Output is correct
16 Correct 246 ms 31316 KB Output is correct
17 Correct 234 ms 31320 KB Output is correct
18 Correct 268 ms 31064 KB Output is correct
19 Correct 186 ms 31068 KB Output is correct
20 Correct 166 ms 31220 KB Output is correct
21 Correct 158 ms 31220 KB Output is correct
22 Correct 163 ms 31316 KB Output is correct
23 Correct 210 ms 31068 KB Output is correct
24 Correct 222 ms 31068 KB Output is correct
25 Correct 219 ms 31068 KB Output is correct
26 Correct 225 ms 31068 KB Output is correct
27 Correct 211 ms 31064 KB Output is correct
28 Correct 222 ms 31224 KB Output is correct
29 Correct 262 ms 31064 KB Output is correct
30 Correct 212 ms 31068 KB Output is correct
31 Correct 215 ms 31068 KB Output is correct
32 Correct 216 ms 31068 KB Output is correct
33 Correct 234 ms 31324 KB Output is correct
34 Correct 227 ms 31324 KB Output is correct
35 Correct 235 ms 31324 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 30808 KB Output is correct
2 Correct 217 ms 31316 KB Output is correct
3 Correct 217 ms 31224 KB Output is correct
4 Correct 263 ms 31068 KB Output is correct
5 Correct 101 ms 36356 KB Output is correct
6 Correct 88 ms 34640 KB Output is correct
7 Correct 93 ms 35412 KB Output is correct
8 Correct 84 ms 35664 KB Output is correct
9 Correct 91 ms 35668 KB Output is correct
10 Correct 123 ms 36372 KB Output is correct
11 Correct 114 ms 36376 KB Output is correct
12 Correct 115 ms 36180 KB Output is correct
13 Correct 116 ms 36428 KB Output is correct
14 Correct 132 ms 36180 KB Output is correct
15 Correct 174 ms 39564 KB Output is correct
16 Correct 168 ms 39768 KB Output is correct
17 Correct 159 ms 39464 KB Output is correct
18 Correct 139 ms 36580 KB Output is correct
19 Correct 146 ms 36432 KB Output is correct
20 Correct 146 ms 36924 KB Output is correct
21 Correct 97 ms 35780 KB Output is correct
22 Correct 98 ms 35704 KB Output is correct
23 Correct 111 ms 35780 KB Output is correct
24 Correct 98 ms 35744 KB Output is correct
25 Correct 107 ms 36632 KB Output is correct
26 Correct 114 ms 36456 KB Output is correct
27 Correct 110 ms 36392 KB Output is correct
28 Correct 91 ms 36372 KB Output is correct
29 Correct 91 ms 36132 KB Output is correct
30 Correct 93 ms 36312 KB Output is correct
31 Correct 111 ms 36376 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 30808 KB Output is correct
2 Correct 231 ms 31324 KB Output is correct
3 Correct 238 ms 31320 KB Output is correct
4 Correct 229 ms 31324 KB Output is correct
5 Incorrect 97 ms 38992 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 30812 KB Output is correct
2 Correct 6 ms 30972 KB Output is correct
3 Correct 6 ms 30812 KB Output is correct
4 Correct 6 ms 30808 KB Output is correct
5 Correct 127 ms 31212 KB Output is correct
6 Correct 199 ms 31064 KB Output is correct
7 Correct 123 ms 31064 KB Output is correct
8 Correct 227 ms 31068 KB Output is correct
9 Correct 267 ms 31068 KB Output is correct
10 Correct 215 ms 31244 KB Output is correct
11 Correct 228 ms 31224 KB Output is correct
12 Correct 224 ms 31068 KB Output is correct
13 Correct 295 ms 31324 KB Output is correct
14 Correct 306 ms 31320 KB Output is correct
15 Correct 248 ms 31068 KB Output is correct
16 Correct 246 ms 31316 KB Output is correct
17 Correct 234 ms 31320 KB Output is correct
18 Correct 268 ms 31064 KB Output is correct
19 Correct 186 ms 31068 KB Output is correct
20 Correct 166 ms 31220 KB Output is correct
21 Correct 158 ms 31220 KB Output is correct
22 Correct 163 ms 31316 KB Output is correct
23 Correct 210 ms 31068 KB Output is correct
24 Correct 222 ms 31068 KB Output is correct
25 Correct 219 ms 31068 KB Output is correct
26 Correct 225 ms 31068 KB Output is correct
27 Correct 211 ms 31064 KB Output is correct
28 Correct 222 ms 31224 KB Output is correct
29 Correct 262 ms 31064 KB Output is correct
30 Correct 212 ms 31068 KB Output is correct
31 Correct 215 ms 31068 KB Output is correct
32 Correct 216 ms 31068 KB Output is correct
33 Correct 234 ms 31324 KB Output is correct
34 Correct 227 ms 31324 KB Output is correct
35 Correct 235 ms 31324 KB Output is correct
36 Correct 6 ms 30808 KB Output is correct
37 Correct 217 ms 31316 KB Output is correct
38 Correct 217 ms 31224 KB Output is correct
39 Correct 263 ms 31068 KB Output is correct
40 Correct 101 ms 36356 KB Output is correct
41 Correct 88 ms 34640 KB Output is correct
42 Correct 93 ms 35412 KB Output is correct
43 Correct 84 ms 35664 KB Output is correct
44 Correct 91 ms 35668 KB Output is correct
45 Correct 123 ms 36372 KB Output is correct
46 Correct 114 ms 36376 KB Output is correct
47 Correct 115 ms 36180 KB Output is correct
48 Correct 116 ms 36428 KB Output is correct
49 Correct 132 ms 36180 KB Output is correct
50 Correct 174 ms 39564 KB Output is correct
51 Correct 168 ms 39768 KB Output is correct
52 Correct 159 ms 39464 KB Output is correct
53 Correct 139 ms 36580 KB Output is correct
54 Correct 146 ms 36432 KB Output is correct
55 Correct 146 ms 36924 KB Output is correct
56 Correct 97 ms 35780 KB Output is correct
57 Correct 98 ms 35704 KB Output is correct
58 Correct 111 ms 35780 KB Output is correct
59 Correct 98 ms 35744 KB Output is correct
60 Correct 107 ms 36632 KB Output is correct
61 Correct 114 ms 36456 KB Output is correct
62 Correct 110 ms 36392 KB Output is correct
63 Correct 91 ms 36372 KB Output is correct
64 Correct 91 ms 36132 KB Output is correct
65 Correct 93 ms 36312 KB Output is correct
66 Correct 111 ms 36376 KB Output is correct
67 Correct 5 ms 30808 KB Output is correct
68 Correct 231 ms 31324 KB Output is correct
69 Correct 238 ms 31320 KB Output is correct
70 Correct 229 ms 31324 KB Output is correct
71 Incorrect 97 ms 38992 KB Output isn't correct
72 Halted 0 ms 0 KB -