oj.uz

Submission #888787

# Submission time Handle Problem Language Result Execution time Memory
888787 2023-12-18T07:49:04 Z vjudge1 Two Currencies (JOI23_currencies) C++17
10 / 100
 5000 ms 40796 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 = 1e5+5;
vi g[N];
map<pii, vi> mp;
map<pii, int> mp2;
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;
        num[to] = num[v];
        num[to] += mp2[{v, to}];
        dfs(to, v);
    }
    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 = 17; i >= 0; i--) {
        if (!upper(up[i][a], b)) {
            a = up[i][a];
        }
    }
    return up[0][a];
}

void dfs2(int v, int pr){
    for (int to : g[v]) {
        if (to == pr) continue;
        pre[to] = v;
        dfs2(to, v);
    }
}
set<int> st;
void solve(){
	int n, m, q;
	cin >> n >> m >> q;
	vii cui;
	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});
	}
	map<int,int> muka;
	bool f = 1;
	int c, j;
	for(int i = 0; i < m; i++){
		cin >> j >> c;
		j--;
		mp[cui[j]].pb(c);
		mp[{cui[j].ss, cui[j].ff}].pb(c);
		mp2[cui[j]]++;
		mp2[{cui[j].ss, cui[j].ff}]++;
		if(muka[c]!=1&&i>0)f=0;
	}
	if(f){
		dfs(1, -1);
		while(q--){
			int a, b, x, y;
			cin >> a >> b >> x >> y;
			int cnt = num[a] + num[b];
			int lc = lca(a, b);
			cnt -= num[lc] * 2;
			int ans = y/c;
			cnt -= ans;
			if(x - cnt < 0)cout << -1 << '\n';
			else cout << x - cnt << '\n';
		}
	}else{
		vi pas;
		while(q--){
			int s, t, 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();
	}
}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4952 KB Output is correct
5 Correct 28 ms 5468 KB Output is correct
6 Correct 44 ms 5720 KB Output is correct
7 Correct 24 ms 5464 KB Output is correct
8 Correct 47 ms 5736 KB Output is correct
9 Correct 53 ms 5772 KB Output is correct
10 Correct 47 ms 5724 KB Output is correct
11 Correct 49 ms 5756 KB Output is correct
12 Correct 56 ms 5760 KB Output is correct
13 Correct 251 ms 6100 KB Output is correct
14 Correct 251 ms 5980 KB Output is correct
15 Correct 135 ms 5792 KB Output is correct
16 Correct 118 ms 5792 KB Output is correct
17 Correct 106 ms 5776 KB Output is correct
18 Correct 147 ms 5792 KB Output is correct
19 Correct 18 ms 5724 KB Output is correct
20 Correct 18 ms 5720 KB Output is correct
21 Correct 20 ms 5744 KB Output is correct
22 Correct 18 ms 5724 KB Output is correct
23 Correct 86 ms 5600 KB Output is correct
24 Correct 89 ms 5716 KB Output is correct
25 Correct 81 ms 5624 KB Output is correct
26 Correct 26 ms 5692 KB Output is correct
27 Correct 26 ms 5704 KB Output is correct
28 Correct 29 ms 5724 KB Output is correct
29 Correct 28 ms 5468 KB Output is correct
30 Correct 49 ms 5628 KB Output is correct
31 Correct 46 ms 5464 KB Output is correct
32 Correct 45 ms 5720 KB Output is correct
33 Correct 156 ms 5724 KB Output is correct
34 Correct 158 ms 5840 KB Output is correct
35 Correct 161 ms 5836 KB Output is correct

Subtask #2
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 47 ms 5644 KB Output is correct
3 Correct 47 ms 5468 KB Output is correct
4 Correct 46 ms 5468 KB Output is correct
5 Execution timed out 5066 ms 31508 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 164 ms 5972 KB Output is correct
3 Correct 158 ms 5724 KB Output is correct
4 Correct 158 ms 5720 KB Output is correct
5 Execution timed out 5079 ms 40796 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4952 KB Output is correct
5 Correct 28 ms 5468 KB Output is correct
6 Correct 44 ms 5720 KB Output is correct
7 Correct 24 ms 5464 KB Output is correct
8 Correct 47 ms 5736 KB Output is correct
9 Correct 53 ms 5772 KB Output is correct
10 Correct 47 ms 5724 KB Output is correct
11 Correct 49 ms 5756 KB Output is correct
12 Correct 56 ms 5760 KB Output is correct
13 Correct 251 ms 6100 KB Output is correct
14 Correct 251 ms 5980 KB Output is correct
15 Correct 135 ms 5792 KB Output is correct
16 Correct 118 ms 5792 KB Output is correct
17 Correct 106 ms 5776 KB Output is correct
18 Correct 147 ms 5792 KB Output is correct
19 Correct 18 ms 5724 KB Output is correct
20 Correct 18 ms 5720 KB Output is correct
21 Correct 20 ms 5744 KB Output is correct
22 Correct 18 ms 5724 KB Output is correct
23 Correct 86 ms 5600 KB Output is correct
24 Correct 89 ms 5716 KB Output is correct
25 Correct 81 ms 5624 KB Output is correct
26 Correct 26 ms 5692 KB Output is correct
27 Correct 26 ms 5704 KB Output is correct
28 Correct 29 ms 5724 KB Output is correct
29 Correct 28 ms 5468 KB Output is correct
30 Correct 49 ms 5628 KB Output is correct
31 Correct 46 ms 5464 KB Output is correct
32 Correct 45 ms 5720 KB Output is correct
33 Correct 156 ms 5724 KB Output is correct
34 Correct 158 ms 5840 KB Output is correct
35 Correct 161 ms 5836 KB Output is correct
36 Correct 1 ms 4956 KB Output is correct
37 Correct 47 ms 5644 KB Output is correct
38 Correct 47 ms 5468 KB Output is correct
39 Correct 46 ms 5468 KB Output is correct
40 Execution timed out 5066 ms 31508 KB Time limit exceeded
41 Halted 0 ms 0 KB -