oj.uz

Submission #738500

# Submission time Handle Problem Language Result Execution time Memory
738500 2023-05-08T22:31:47 Z yeyso Two Currencies (JOI23_currencies) C++14
38 / 100
 5000 ms 86656 KB 
#include <bits/stdc++.h>
using namespace std;
//#define long long long long;
vector<vector<long long>> adj;
vector<vector<long long>> ddj;
vector<vector<long long>> rdj;
vector<vector<long long>> roads;
vector<vector<long long>> che;
// BRUTE FORCE
long long solve(long long s, long long t, long long x, long long y, long long n){
    // road, node, parent
    queue<vector<long long>> q;
    q.push({-1, s, s});
    vector<long long> v(n, 0);
    vector<long long> parents(n, 0);
    vector<long long> ru(n, 0);
    parents[s] = -1;
    long long node; long long road; long long parent;
    while(!q.empty()){
        node = q.front()[1]; road = q.front()[0]; parent = q.front()[2];
        q.pop();
        if(!v[node]){ 
            parents[node] = parent;
            ru[node] = road;
            v[node] = 1;
            for(long long i = 0; i < adj[node].size(); i ++){
                q.push({rdj[node][i], adj[node][i], node});
            }
        }
    }
    vector<long long> coins;
    node = t;
    while(parents[node] != node){
        if(ru[node] >= 0){
            for(long long i = 0; i < che[ru[node]].size(); i ++){
                coins.push_back(che[ru[node]][i]);
            }
        }
        node = parents[node];
    } 
    sort(coins.begin(), coins.end());
    for(long long i = 0; i < coins.size(); i ++){
        if(y - coins[i] >= 0){
            y -= coins[i];
        } else {
            x -= 1;
        }
    }
    if(x >= 0){
        return x;
    } else {
        return -1;
    }
} 
// LCA
vector<long long> visited;
vector<long long> euler;
vector<long long> first;
vector<long long> height;
vector<long long> prefix;
void dfs(long long u, long long h, long long r) {
    visited[u] = 1;
    euler.push_back(u);
    first[u] = euler.size() - 1;
    height[u] = h;
    /*if(r >= 0){
        prefix.push_back(che[r].size());
    }*/
    //cout << u;
    for (long long i = 0; i < adj[u].size(); i ++){
        if (!visited[adj[u][i]]){
            dfs(adj[u][i], h + 1, rdj[u][i]);
            /*if(r >= 0){
                prefix.push_back(che[r].size());
            }*/
            euler.push_back(u);
        }
    }
}
vector<long long> tolls;
void dfs2(long long u, long long p, long long delta) {
    visited[u] = 1;
    tolls[u] = tolls[p] + delta;
    for (long long i = 0; i < adj[u].size(); i ++){
        if (!visited[adj[u][i]]){
            dfs2(adj[u][i], u, che[rdj[u][i]].size());
        }
    }
}
vector<pair<long long, long long>> tree(800005, pair<long long, long long>());
void upd(long long i, long long val, long long node, long long lbound, long long rbound, long long j = 1){
    if(i < lbound || rbound < i){
        return;
    }
    if(lbound == rbound){
        tree[j] = {val, node};
        return;
    }
    long long mid = (lbound + rbound) / 2;
    upd(i, val, node, lbound, mid, j * 2);
    upd(i, val, node, mid+1, rbound, j * 2 + 1);
    tree[j] = min(tree[j * 2], tree[j * 2 + 1]);
}
pair<long long, long long> rangeq(long long ql, long long qr, long long lbound, long long rbound, long long j = 1){
    if(qr < lbound || rbound < ql){
        return {LONG_LONG_MAX / 2, 0};
    }
    if(ql <= lbound and rbound <= qr){
        return tree[j];
    }
    long long mid = (lbound + rbound) / 2;
    pair<long long, long long> left_value = rangeq(ql, qr, lbound, mid, j * 2);
    pair<long long, long long> right_value = rangeq(ql, qr, mid+1, rbound, j * 2 + 1);
    if(left_value.first < right_value.first){
        return left_value;
    } else {
        return right_value;
    }
}
int main(){
    long long n, m, queries; cin >> n >> m >> queries;
    vector<vector<long long>> adj0(n, vector<long long>());
    vector<vector<long long>> ddj0(n, vector<long long>()); 
    vector<vector<long long>> rdj0(n, vector<long long>());
    vector<vector<long long>> roads;
    map<pair<long long, long long>, long long> ab_to_road;
    long long subtask2 = 1;
    long long a, b, p, c;
    for(long long i = 0; i < n - 1; i ++){
        cin >> a >> b; a -= 1; b -= 1;
        roads.push_back({a, b});
        ab_to_road[{min(a, b), max(a, b)}] = i;
    }
    vector<vector<long long>> check(n-1, vector<long long>());
    long long pc = 0;
    for(long long i = 0; i < m; i ++){
        cin >> p >> c;
        if(i == 0){
            pc = c;
        } else {
            if(c != pc){
                subtask2 = 0;
            }
            pc = c;
        }
        p -= 1;
        check[p].push_back(c);
    }
    for(long long i = 0; i < roads.size(); i ++){
        adj0[roads[i][0]].push_back(roads[i][1]); adj0[roads[i][1]].push_back(roads[i][0]);
        ddj0[roads[i][0]].push_back(roads[i][2]); ddj0[roads[i][1]].push_back(roads[i][2]);
        rdj0[roads[i][0]].push_back(i); rdj0[roads[i][1]].push_back(i);
    }
    adj = adj0; ddj = ddj0; rdj = rdj0; che = check;
    vector<long long> v0(n, 0);
    visited = v0; first = v0; height = v0;
    long long s, t, x, y;
    vector<long long> res;
    dfs(0, 0, -1);
    visited = v0;
    tolls = v0;
    long long tc = 0;
    long long silver = 0;
    long long gold = 0;
    dfs2(0, 0, 0);
    for(long long i = 0; i < euler.size(); i ++){
        upd(i, height[euler[i]], euler[i], 0, euler.size()-1);
    }
    
    for(long long i = 0; i < queries; i ++){
        cin >> s >> t >> x >> y;
        s -= 1; t -= 1;
 
        if(!subtask2){
            res.push_back(solve(s, t, x, y, n));
        } else {
            tc = (tolls[s] + tolls[t] - 2 * tolls[rangeq(min(first[s], first[t]), max(first[s], first[t]), 0, euler.size()-1).second]);
            //silver = y / c;
            tc -= y / c;
            x -= max(0ll, tc);
 
            res.push_back(max(-1ll, x));
        }
    }
 
    for(long long i = 0; i < res.size(); i ++){
        cout << res[i] << "\n";
    }
    vector<long long> roadsfix(n-1, 0);
    vector<long long> prefix2;
    vector<long long> dp(n-1, 0);
    /*if(subtask2){
        //cout << 'FORTNITE';
        //cout << "|-";
 
        for(long long i = 0; i < euler.size(); i ++){
            cout << euler[i] + 1 << " ";
 
            /*if(i >= 1){
                prefix.push_back(ab_to_road[{min(euler[i], euler[i-1]), max(euler[i], euler[i-1])}]);
            }
        } cout << "\n";
        prefix2.push_back(0);
        for(long long i = 0; i < prefix.size(); i ++){
            if(!dp[prefix[i]]){
                //cout << prefix[i] + 1 << " ";
                prefix2.push_back(prefix2[i] + 1);
                dp[prefix[i]] = 1;
            } else {
                prefix2.push_back(prefix2[i] - 1);
                //cout << 0 << " ";
            }
        }
        for(long long i = 0; i < tolls.size(); i ++){
            cout << i + 1 << " ";
        } cout << "\n";
        for(long long i = 0; i < tolls.size(); i ++){
            cout << tolls[i] << " ";
        }
    }*/
}
/*
g++ -std=gnu++17 -O2 -pipe -o 7 7.cpp
 
5 4 3
1 2
1 3
2 4
2 5
2 9
2 4
3 5
4 7
3 4 2 11
5 3 4 5
2 3 1 1
 
10 7 9
1 8
6 3
5 9
7 9
3 1
3 4
10 1
2 6
5 6
9 4
7 4
7 4
2 4
7 4
7 4
1 4
8 6 5 3
3 9 8 0
4 7 6 15
7 4 9 3
6 4 8 0
9 10 5 16
5 3 2 4
2 8 4 3
6 1 3 3

*/

Compilation message

currencies.cpp:199:13: warning: "/*" within comment [-Wcomment]
  199 |             /*if(i >= 1){
      |              
currencies.cpp: In function 'long long int solve(long long int, long long int, long long int, long long int, long long int)':
currencies.cpp:26:36: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |             for(long long i = 0; i < adj[node].size(); i ++){
      |                                  ~~^~~~~~~~~~~~~~~~~~
currencies.cpp:35:36: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |             for(long long i = 0; i < che[ru[node]].size(); i ++){
      |                                  ~~^~~~~~~~~~~~~~~~~~~~~~
currencies.cpp:42:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for(long long i = 0; i < coins.size(); i ++){
      |                          ~~^~~~~~~~~~~~~~
currencies.cpp: In function 'void dfs(long long int, long long int, long long int)':
currencies.cpp:70:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |     for (long long i = 0; i < adj[u].size(); i ++){
      |                           ~~^~~~~~~~~~~~~~~
currencies.cpp: In function 'void dfs2(long long int, long long int, long long int)':
currencies.cpp:84:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     for (long long i = 0; i < adj[u].size(); i ++){
      |                           ~~^~~~~~~~~~~~~~~
currencies.cpp: In function 'int main()':
currencies.cpp:149:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  149 |     for(long long i = 0; i < roads.size(); i ++){
      |                          ~~^~~~~~~~~~~~~~
currencies.cpp:166:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  166 |     for(long long i = 0; i < euler.size(); i ++){
      |                          ~~^~~~~~~~~~~~~~
currencies.cpp:186:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  186 |     for(long long i = 0; i < res.size(); i ++){
      |                          ~~^~~~~~~~~~~~
currencies.cpp:163:15: warning: unused variable 'silver' [-Wunused-variable]
  163 |     long long silver = 0;
      |               ^~~~~~
currencies.cpp:164:15: warning: unused variable 'gold' [-Wunused-variable]
  164 |     long long gold = 0;
      |               ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12756 KB Output is correct
2 Correct 6 ms 12756 KB Output is correct
3 Correct 6 ms 12840 KB Output is correct
4 Correct 6 ms 12848 KB Output is correct
5 Correct 213 ms 14096 KB Output is correct
6 Correct 369 ms 14220 KB Output is correct
7 Correct 281 ms 13760 KB Output is correct
8 Correct 404 ms 14256 KB Output is correct
9 Correct 407 ms 14244 KB Output is correct
10 Correct 417 ms 14376 KB Output is correct
11 Correct 413 ms 14252 KB Output is correct
12 Correct 406 ms 14244 KB Output is correct
13 Correct 378 ms 14292 KB Output is correct
14 Correct 370 ms 14268 KB Output is correct
15 Correct 366 ms 14196 KB Output is correct
16 Correct 323 ms 14204 KB Output is correct
17 Correct 346 ms 14200 KB Output is correct
18 Correct 329 ms 14208 KB Output is correct
19 Correct 370 ms 14348 KB Output is correct
20 Correct 350 ms 14480 KB Output is correct
21 Correct 347 ms 14356 KB Output is correct
22 Correct 352 ms 14356 KB Output is correct
23 Correct 470 ms 14364 KB Output is correct
24 Correct 513 ms 14252 KB Output is correct
25 Correct 464 ms 14344 KB Output is correct
26 Correct 409 ms 14252 KB Output is correct
27 Correct 418 ms 14228 KB Output is correct
28 Correct 409 ms 14356 KB Output is correct
29 Correct 424 ms 14240 KB Output is correct
30 Correct 13 ms 14164 KB Output is correct
31 Correct 13 ms 14164 KB Output is correct
32 Correct 17 ms 14164 KB Output is correct
33 Correct 326 ms 14552 KB Output is correct
34 Correct 318 ms 14292 KB Output is correct
35 Correct 329 ms 14300 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12756 KB Output is correct
2 Correct 14 ms 14164 KB Output is correct
3 Correct 14 ms 14116 KB Output is correct
4 Correct 13 ms 14164 KB Output is correct
5 Correct 553 ms 81216 KB Output is correct
6 Correct 456 ms 61404 KB Output is correct
7 Correct 493 ms 69920 KB Output is correct
8 Correct 464 ms 71592 KB Output is correct
9 Correct 451 ms 71496 KB Output is correct
10 Correct 593 ms 82316 KB Output is correct
11 Correct 579 ms 82436 KB Output is correct
12 Correct 655 ms 82376 KB Output is correct
13 Correct 636 ms 82260 KB Output is correct
14 Correct 612 ms 82280 KB Output is correct
15 Correct 661 ms 86332 KB Output is correct
16 Correct 646 ms 86656 KB Output is correct
17 Correct 638 ms 86000 KB Output is correct
18 Correct 616 ms 80228 KB Output is correct
19 Correct 650 ms 80296 KB Output is correct
20 Correct 608 ms 80404 KB Output is correct
21 Correct 528 ms 83764 KB Output is correct
22 Correct 551 ms 84020 KB Output is correct
23 Correct 547 ms 83896 KB Output is correct
24 Correct 529 ms 83932 KB Output is correct
25 Correct 583 ms 82012 KB Output is correct
26 Correct 620 ms 81956 KB Output is correct
27 Correct 594 ms 81844 KB Output is correct
28 Correct 579 ms 82148 KB Output is correct
29 Correct 558 ms 82132 KB Output is correct
30 Correct 610 ms 82364 KB Output is correct
31 Correct 596 ms 82460 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12756 KB Output is correct
2 Correct 329 ms 14324 KB Output is correct
3 Correct 330 ms 14288 KB Output is correct
4 Correct 317 ms 14412 KB Output is correct
5 Execution timed out 5016 ms 80148 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12756 KB Output is correct
2 Correct 6 ms 12756 KB Output is correct
3 Correct 6 ms 12840 KB Output is correct
4 Correct 6 ms 12848 KB Output is correct
5 Correct 213 ms 14096 KB Output is correct
6 Correct 369 ms 14220 KB Output is correct
7 Correct 281 ms 13760 KB Output is correct
8 Correct 404 ms 14256 KB Output is correct
9 Correct 407 ms 14244 KB Output is correct
10 Correct 417 ms 14376 KB Output is correct
11 Correct 413 ms 14252 KB Output is correct
12 Correct 406 ms 14244 KB Output is correct
13 Correct 378 ms 14292 KB Output is correct
14 Correct 370 ms 14268 KB Output is correct
15 Correct 366 ms 14196 KB Output is correct
16 Correct 323 ms 14204 KB Output is correct
17 Correct 346 ms 14200 KB Output is correct
18 Correct 329 ms 14208 KB Output is correct
19 Correct 370 ms 14348 KB Output is correct
20 Correct 350 ms 14480 KB Output is correct
21 Correct 347 ms 14356 KB Output is correct
22 Correct 352 ms 14356 KB Output is correct
23 Correct 470 ms 14364 KB Output is correct
24 Correct 513 ms 14252 KB Output is correct
25 Correct 464 ms 14344 KB Output is correct
26 Correct 409 ms 14252 KB Output is correct
27 Correct 418 ms 14228 KB Output is correct
28 Correct 409 ms 14356 KB Output is correct
29 Correct 424 ms 14240 KB Output is correct
30 Correct 13 ms 14164 KB Output is correct
31 Correct 13 ms 14164 KB Output is correct
32 Correct 17 ms 14164 KB Output is correct
33 Correct 326 ms 14552 KB Output is correct
34 Correct 318 ms 14292 KB Output is correct
35 Correct 329 ms 14300 KB Output is correct
36 Correct 6 ms 12756 KB Output is correct
37 Correct 14 ms 14164 KB Output is correct
38 Correct 14 ms 14116 KB Output is correct
39 Correct 13 ms 14164 KB Output is correct
40 Correct 553 ms 81216 KB Output is correct
41 Correct 456 ms 61404 KB Output is correct
42 Correct 493 ms 69920 KB Output is correct
43 Correct 464 ms 71592 KB Output is correct
44 Correct 451 ms 71496 KB Output is correct
45 Correct 593 ms 82316 KB Output is correct
46 Correct 579 ms 82436 KB Output is correct
47 Correct 655 ms 82376 KB Output is correct
48 Correct 636 ms 82260 KB Output is correct
49 Correct 612 ms 82280 KB Output is correct
50 Correct 661 ms 86332 KB Output is correct
51 Correct 646 ms 86656 KB Output is correct
52 Correct 638 ms 86000 KB Output is correct
53 Correct 616 ms 80228 KB Output is correct
54 Correct 650 ms 80296 KB Output is correct
55 Correct 608 ms 80404 KB Output is correct
56 Correct 528 ms 83764 KB Output is correct
57 Correct 551 ms 84020 KB Output is correct
58 Correct 547 ms 83896 KB Output is correct
59 Correct 529 ms 83932 KB Output is correct
60 Correct 583 ms 82012 KB Output is correct
61 Correct 620 ms 81956 KB Output is correct
62 Correct 594 ms 81844 KB Output is correct
63 Correct 579 ms 82148 KB Output is correct
64 Correct 558 ms 82132 KB Output is correct
65 Correct 610 ms 82364 KB Output is correct
66 Correct 596 ms 82460 KB Output is correct
67 Correct 8 ms 12756 KB Output is correct
68 Correct 329 ms 14324 KB Output is correct
69 Correct 330 ms 14288 KB Output is correct
70 Correct 317 ms 14412 KB Output is correct
71 Execution timed out 5016 ms 80148 KB Time limit exceeded
72 Halted 0 ms 0 KB -