oj.uz

Submission #856753

# Submission time Handle Problem Language Result Execution time Memory
856753 2023-10-04T12:43:17 Z bkhanh Two Currencies (JOI23_currencies) C++14
100 / 100
 3167 ms 49900 KB 
#include<bits/stdc++.h>
using namespace std;    

namespace Solve
{
    #define int long long
    const int M = 1e5 + 1;
    const int Srt = 300;

    typedef tuple<long long, long long, long long> ox;
    vector<ox> idVal;

    long long ans[M];
    
    struct Node
    {
        int nxt, id;
    };

    struct Query
    {
        long long Comp, id, x, y, z, w;

        bool operator < (const Query that)
        {
            if(Comp != that.Comp) return Comp < that.Comp;
            if(y != that.y) return y < that.y;
            return x < that.x;
        }
    };

    vector<Query> List;
    int vis[2000001];
    vector<int> list[M];
    int h[M], par[M][21];
    int timeIn[M], timeOut[M];
    vector<long long> valRag;
    int timeDFS;

    long long Sum[2000001];
    long long node[2000001];
    int pos[M];

    vector<Node> adj[M];

    void DFS(int u, int par)
    {
        h[u] = h[par] + 1;
        timeIn[u] = timeDFS++;
        pos[u] = valRag.size();

        for(auto info: adj[u])
        {
            if(info.nxt != par)
            {
                for(auto c: list[info.id]) valRag.push_back(c);
                DFS(info.nxt, u);
                for(auto c: list[info.id]) valRag.push_back(c);
            }
        }

        timeOut[u] = timeDFS;
    }

    void Update(int pos, long long val)
    {
        pos += (1 << 17);

        while(pos)
        {
            Sum[pos] += val;
            node[pos] += val > 0 ? 1 : -1;
            pos >>= 1;
        }
    }

    void Up(int id)
    {
        if(!vis[id])
        {
            Update(id, get<0>(idVal[id]));
        }
        else
        {
            Update(id, -get<0>(idVal[id]));
        }

        vis[id] ^= 1;
    }

    long long cal(int id, long long val)
    {
        if(id >= (1 << 17))
        {
            return 0;
        }

        if(Sum[id * 2] <= val) return cal(id * 2 + 1, val - Sum[2 * id]) + node[2 * id];
        else return cal(id * 2, val);
    }

    void solve()
    {
        int n, m, q;
        cin >> n >> m >> q;

        for(int i = 1; i < n; i++)
        {
            int u, v;
            cin >> u >> v;
            adj[u].push_back({v, i});
            adj[v].push_back({u, i});
        }

        for(int i = 1; i <= m; i++)
        {
            long long id, c;
            cin >> id >> c;

            idVal.push_back({c, id, list[id].size()});
            list[id].push_back(c);
        }

        idVal.push_back({0, -1, -1});
        sort(idVal.begin(), idVal.end());

        for(int i = 1; i < idVal.size(); i++)
        {
            auto t = idVal[i];
            list[get<1>(t)][get<2>(t)] = i;
        }

        DFS(1, 1);

        for(int i = 1; i <= q; i++)
        {
            int x, y, z, w;
            cin >> x >> y >> z >> w;

            x = pos[x];
            y = pos[y];

            if(x > y) swap(x, y);

            List.push_back({x / Srt, i, x, y, z, w});
        }

        memset(ans, -1, sizeof ans);
        sort(List.begin(), List.end());

        int l = 0, r = 0;

        for(auto info: List)
        {
            while(l < info.x)
            {
                Up(valRag[l]);
                l++;
            }

            while(info.x < l)
            {
                l--;
                Up(valRag[l]);
            }

            while(r < info.y)
            {
                Up(valRag[r]);
                r++;
            }

            while(info.y < r)
            {
                r--;
                Up(valRag[r]);
            }

            long long Val = cal(1, info.w);

            if(node[1] > info.z + Val)
            {
                ans[info.id] = -1;
            }
            else
            {
                ans[info.id] = info.z + Val - node[1];
            }
        }

        
        for(int i = 1; i <= q; i++) cout << ans[i] << '\n';
    }
}

main()
{
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cout.tie(NULL);

    Solve::solve();
}

Compilation message

currencies.cpp: In function 'void Solve::solve()':
currencies.cpp:127:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::tuple<long long int, long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  127 |         for(int i = 1; i < idVal.size(); i++)
      |                        ~~^~~~~~~~~~~~~~
currencies.cpp: At global scope:
currencies.cpp:196:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  196 | main()
      | ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19032 KB Output is correct
2 Correct 2 ms 19036 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 3 ms 19032 KB Output is correct
5 Correct 7 ms 19292 KB Output is correct
6 Correct 9 ms 19548 KB Output is correct
7 Correct 7 ms 19312 KB Output is correct
8 Correct 9 ms 19384 KB Output is correct
9 Correct 9 ms 19548 KB Output is correct
10 Correct 8 ms 19548 KB Output is correct
11 Correct 9 ms 19544 KB Output is correct
12 Correct 8 ms 19548 KB Output is correct
13 Correct 8 ms 19548 KB Output is correct
14 Correct 8 ms 19548 KB Output is correct
15 Correct 7 ms 19632 KB Output is correct
16 Correct 8 ms 19608 KB Output is correct
17 Correct 8 ms 19548 KB Output is correct
18 Correct 8 ms 19608 KB Output is correct
19 Correct 8 ms 19496 KB Output is correct
20 Correct 8 ms 19548 KB Output is correct
21 Correct 8 ms 19548 KB Output is correct
22 Correct 8 ms 19548 KB Output is correct
23 Correct 5 ms 19452 KB Output is correct
24 Correct 5 ms 19440 KB Output is correct
25 Correct 5 ms 19544 KB Output is correct
26 Correct 5 ms 19544 KB Output is correct
27 Correct 5 ms 19548 KB Output is correct
28 Correct 6 ms 19548 KB Output is correct
29 Correct 6 ms 19548 KB Output is correct
30 Correct 9 ms 19548 KB Output is correct
31 Correct 9 ms 19548 KB Output is correct
32 Correct 8 ms 19548 KB Output is correct
33 Correct 8 ms 19760 KB Output is correct
34 Correct 7 ms 19548 KB Output is correct
35 Correct 8 ms 19548 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19032 KB Output is correct
2 Correct 9 ms 19548 KB Output is correct
3 Correct 9 ms 19420 KB Output is correct
4 Correct 9 ms 19548 KB Output is correct
5 Correct 2305 ms 34884 KB Output is correct
6 Correct 1960 ms 36532 KB Output is correct
7 Correct 1396 ms 37300 KB Output is correct
8 Correct 1239 ms 34252 KB Output is correct
9 Correct 1399 ms 33076 KB Output is correct
10 Correct 2905 ms 37488 KB Output is correct
11 Correct 2902 ms 37492 KB Output is correct
12 Correct 2878 ms 39616 KB Output is correct
13 Correct 2906 ms 37524 KB Output is correct
14 Correct 2909 ms 37588 KB Output is correct
15 Correct 2179 ms 47412 KB Output is correct
16 Correct 2332 ms 48448 KB Output is correct
17 Correct 1022 ms 47416 KB Output is correct
18 Correct 2642 ms 39472 KB Output is correct
19 Correct 2651 ms 37960 KB Output is correct
20 Correct 2691 ms 37600 KB Output is correct
21 Correct 2066 ms 38188 KB Output is correct
22 Correct 2072 ms 38540 KB Output is correct
23 Correct 2080 ms 37464 KB Output is correct
24 Correct 2082 ms 37692 KB Output is correct
25 Correct 426 ms 37240 KB Output is correct
26 Correct 354 ms 36980 KB Output is correct
27 Correct 189 ms 36964 KB Output is correct
28 Correct 114 ms 37496 KB Output is correct
29 Correct 118 ms 37292 KB Output is correct
30 Correct 2390 ms 37880 KB Output is correct
31 Correct 2429 ms 39032 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16984 KB Output is correct
2 Correct 7 ms 19548 KB Output is correct
3 Correct 8 ms 19572 KB Output is correct
4 Correct 7 ms 19768 KB Output is correct
5 Correct 531 ms 43648 KB Output is correct
6 Correct 419 ms 44644 KB Output is correct
7 Correct 962 ms 40248 KB Output is correct
8 Correct 1160 ms 47944 KB Output is correct
9 Correct 1114 ms 49356 KB Output is correct
10 Correct 1145 ms 49900 KB Output is correct
11 Correct 354 ms 47476 KB Output is correct
12 Correct 401 ms 49528 KB Output is correct
13 Correct 413 ms 48256 KB Output is correct
14 Correct 110 ms 47980 KB Output is correct
15 Correct 112 ms 48908 KB Output is correct
16 Correct 867 ms 47984 KB Output is correct
17 Correct 877 ms 48620 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19032 KB Output is correct
2 Correct 2 ms 19036 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 3 ms 19032 KB Output is correct
5 Correct 7 ms 19292 KB Output is correct
6 Correct 9 ms 19548 KB Output is correct
7 Correct 7 ms 19312 KB Output is correct
8 Correct 9 ms 19384 KB Output is correct
9 Correct 9 ms 19548 KB Output is correct
10 Correct 8 ms 19548 KB Output is correct
11 Correct 9 ms 19544 KB Output is correct
12 Correct 8 ms 19548 KB Output is correct
13 Correct 8 ms 19548 KB Output is correct
14 Correct 8 ms 19548 KB Output is correct
15 Correct 7 ms 19632 KB Output is correct
16 Correct 8 ms 19608 KB Output is correct
17 Correct 8 ms 19548 KB Output is correct
18 Correct 8 ms 19608 KB Output is correct
19 Correct 8 ms 19496 KB Output is correct
20 Correct 8 ms 19548 KB Output is correct
21 Correct 8 ms 19548 KB Output is correct
22 Correct 8 ms 19548 KB Output is correct
23 Correct 5 ms 19452 KB Output is correct
24 Correct 5 ms 19440 KB Output is correct
25 Correct 5 ms 19544 KB Output is correct
26 Correct 5 ms 19544 KB Output is correct
27 Correct 5 ms 19548 KB Output is correct
28 Correct 6 ms 19548 KB Output is correct
29 Correct 6 ms 19548 KB Output is correct
30 Correct 9 ms 19548 KB Output is correct
31 Correct 9 ms 19548 KB Output is correct
32 Correct 8 ms 19548 KB Output is correct
33 Correct 8 ms 19760 KB Output is correct
34 Correct 7 ms 19548 KB Output is correct
35 Correct 8 ms 19548 KB Output is correct
36 Correct 3 ms 19032 KB Output is correct
37 Correct 9 ms 19548 KB Output is correct
38 Correct 9 ms 19420 KB Output is correct
39 Correct 9 ms 19548 KB Output is correct
40 Correct 2305 ms 34884 KB Output is correct
41 Correct 1960 ms 36532 KB Output is correct
42 Correct 1396 ms 37300 KB Output is correct
43 Correct 1239 ms 34252 KB Output is correct
44 Correct 1399 ms 33076 KB Output is correct
45 Correct 2905 ms 37488 KB Output is correct
46 Correct 2902 ms 37492 KB Output is correct
47 Correct 2878 ms 39616 KB Output is correct
48 Correct 2906 ms 37524 KB Output is correct
49 Correct 2909 ms 37588 KB Output is correct
50 Correct 2179 ms 47412 KB Output is correct
51 Correct 2332 ms 48448 KB Output is correct
52 Correct 1022 ms 47416 KB Output is correct
53 Correct 2642 ms 39472 KB Output is correct
54 Correct 2651 ms 37960 KB Output is correct
55 Correct 2691 ms 37600 KB Output is correct
56 Correct 2066 ms 38188 KB Output is correct
57 Correct 2072 ms 38540 KB Output is correct
58 Correct 2080 ms 37464 KB Output is correct
59 Correct 2082 ms 37692 KB Output is correct
60 Correct 426 ms 37240 KB Output is correct
61 Correct 354 ms 36980 KB Output is correct
62 Correct 189 ms 36964 KB Output is correct
63 Correct 114 ms 37496 KB Output is correct
64 Correct 118 ms 37292 KB Output is correct
65 Correct 2390 ms 37880 KB Output is correct
66 Correct 2429 ms 39032 KB Output is correct
67 Correct 2 ms 16984 KB Output is correct
68 Correct 7 ms 19548 KB Output is correct
69 Correct 8 ms 19572 KB Output is correct
70 Correct 7 ms 19768 KB Output is correct
71 Correct 531 ms 43648 KB Output is correct
72 Correct 419 ms 44644 KB Output is correct
73 Correct 962 ms 40248 KB Output is correct
74 Correct 1160 ms 47944 KB Output is correct
75 Correct 1114 ms 49356 KB Output is correct
76 Correct 1145 ms 49900 KB Output is correct
77 Correct 354 ms 47476 KB Output is correct
78 Correct 401 ms 49528 KB Output is correct
79 Correct 413 ms 48256 KB Output is correct
80 Correct 110 ms 47980 KB Output is correct
81 Correct 112 ms 48908 KB Output is correct
82 Correct 867 ms 47984 KB Output is correct
83 Correct 877 ms 48620 KB Output is correct
84 Correct 2639 ms 35040 KB Output is correct
85 Correct 2163 ms 33396 KB Output is correct
86 Correct 1157 ms 33500 KB Output is correct
87 Correct 3100 ms 38652 KB Output is correct
88 Correct 3090 ms 37956 KB Output is correct
89 Correct 3123 ms 38436 KB Output is correct
90 Correct 3118 ms 39540 KB Output is correct
91 Correct 3167 ms 37424 KB Output is correct
92 Correct 1401 ms 44036 KB Output is correct
93 Correct 1209 ms 47160 KB Output is correct
94 Correct 3031 ms 38756 KB Output is correct
95 Correct 3095 ms 38204 KB Output is correct
96 Correct 3077 ms 38232 KB Output is correct
97 Correct 3096 ms 39304 KB Output is correct
98 Correct 3065 ms 36740 KB Output is correct
99 Correct 2877 ms 38464 KB Output is correct
100 Correct 2902 ms 38456 KB Output is correct
101 Correct 2981 ms 36744 KB Output is correct
102 Correct 241 ms 37000 KB Output is correct
103 Correct 307 ms 36976 KB Output is correct
104 Correct 852 ms 37008 KB Output is correct
105 Correct 115 ms 37456 KB Output is correct
106 Correct 113 ms 37492 KB Output is correct
107 Correct 2664 ms 37748 KB Output is correct
108 Correct 2677 ms 38732 KB Output is correct