oj.uz

Submission #888700

# Submission time Handle Problem Language Result Execution time Memory
888700 2023-12-18T05:49:27 Z vjudge1 Two Currencies (JOI23_currencies) C++17
10 / 100
 785 ms 54716 KB 
#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];
pii p[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, int cnt){
	num[v] = cnt;
    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;
        pre[to] = v;
        dfs(to, v, cnt+mp[{v, to}].size());
    }
    tout[v] = timer;
}

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 = 19; 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 >= 2006){
		dfs(1, -1, 0);
		while(q--){
			int a, b, x, y;
			cin >> a >> b >> x >> y;
			int cnt = num[a] + num[b] - (2*num[lca(a, b)]);
			cnt -= y/cc*cc;
			y -= y/cc*cc;
			x -= cnt;
			cout << (x < 0 ? -1 : x) << '\n';
		}
	}else{
		vi pas;
		while(q--){
			int s, x, y;
			cin >> s >> t >> x >> y;
			dfs(s, -1, 0);
			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();
	}
}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 20828 KB Output is correct
2 Correct 3 ms 20828 KB Output is correct
3 Correct 3 ms 20824 KB Output is correct
4 Correct 4 ms 20828 KB Output is correct
5 Correct 270 ms 21428 KB Output is correct
6 Correct 479 ms 21340 KB Output is correct
7 Correct 250 ms 21080 KB Output is correct
8 Correct 523 ms 21440 KB Output is correct
9 Correct 529 ms 21340 KB Output is correct
10 Correct 535 ms 21588 KB Output is correct
11 Correct 541 ms 21340 KB Output is correct
12 Correct 527 ms 21484 KB Output is correct
13 Correct 784 ms 21740 KB Output is correct
14 Correct 785 ms 21760 KB Output is correct
15 Correct 671 ms 21824 KB Output is correct
16 Correct 666 ms 21336 KB Output is correct
17 Correct 643 ms 21336 KB Output is correct
18 Correct 672 ms 21584 KB Output is correct
19 Correct 471 ms 21584 KB Output is correct
20 Correct 476 ms 21588 KB Output is correct
21 Correct 481 ms 21452 KB Output is correct
22 Correct 477 ms 21592 KB Output is correct
23 Correct 545 ms 21340 KB Output is correct
24 Correct 555 ms 21440 KB Output is correct
25 Correct 554 ms 21660 KB Output is correct
26 Correct 558 ms 21420 KB Output is correct
27 Correct 574 ms 21436 KB Output is correct
28 Correct 590 ms 21456 KB Output is correct
29 Correct 566 ms 21456 KB Output is correct
30 Correct 579 ms 21480 KB Output is correct
31 Correct 584 ms 21476 KB Output is correct
32 Correct 554 ms 21476 KB Output is correct
33 Correct 457 ms 21736 KB Output is correct
34 Correct 465 ms 21736 KB Output is correct
35 Correct 457 ms 21744 KB Output is correct

Subtask #2
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 20940 KB Output is correct
2 Correct 568 ms 21596 KB Output is correct
3 Correct 608 ms 21476 KB Output is correct
4 Correct 561 ms 21448 KB Output is correct
5 Incorrect 276 ms 45576 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 21080 KB Output is correct
2 Correct 493 ms 21992 KB Output is correct
3 Correct 457 ms 21596 KB Output is correct
4 Correct 460 ms 21748 KB Output is correct
5 Incorrect 142 ms 54716 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 20828 KB Output is correct
2 Correct 3 ms 20828 KB Output is correct
3 Correct 3 ms 20824 KB Output is correct
4 Correct 4 ms 20828 KB Output is correct
5 Correct 270 ms 21428 KB Output is correct
6 Correct 479 ms 21340 KB Output is correct
7 Correct 250 ms 21080 KB Output is correct
8 Correct 523 ms 21440 KB Output is correct
9 Correct 529 ms 21340 KB Output is correct
10 Correct 535 ms 21588 KB Output is correct
11 Correct 541 ms 21340 KB Output is correct
12 Correct 527 ms 21484 KB Output is correct
13 Correct 784 ms 21740 KB Output is correct
14 Correct 785 ms 21760 KB Output is correct
15 Correct 671 ms 21824 KB Output is correct
16 Correct 666 ms 21336 KB Output is correct
17 Correct 643 ms 21336 KB Output is correct
18 Correct 672 ms 21584 KB Output is correct
19 Correct 471 ms 21584 KB Output is correct
20 Correct 476 ms 21588 KB Output is correct
21 Correct 481 ms 21452 KB Output is correct
22 Correct 477 ms 21592 KB Output is correct
23 Correct 545 ms 21340 KB Output is correct
24 Correct 555 ms 21440 KB Output is correct
25 Correct 554 ms 21660 KB Output is correct
26 Correct 558 ms 21420 KB Output is correct
27 Correct 574 ms 21436 KB Output is correct
28 Correct 590 ms 21456 KB Output is correct
29 Correct 566 ms 21456 KB Output is correct
30 Correct 579 ms 21480 KB Output is correct
31 Correct 584 ms 21476 KB Output is correct
32 Correct 554 ms 21476 KB Output is correct
33 Correct 457 ms 21736 KB Output is correct
34 Correct 465 ms 21736 KB Output is correct
35 Correct 457 ms 21744 KB Output is correct
36 Correct 4 ms 20940 KB Output is correct
37 Correct 568 ms 21596 KB Output is correct
38 Correct 608 ms 21476 KB Output is correct
39 Correct 561 ms 21448 KB Output is correct
40 Incorrect 276 ms 45576 KB Output isn't correct
41 Halted 0 ms 0 KB -