oj.uz

Submission #856750

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

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

    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 << 18);

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

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

        vis[id] ^= 1;
    }

    long long cal(int id, long long val)
    {
        if(id >= (1 << 18))
        {
            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 23132 KB Output is correct
2 Correct 3 ms 23132 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 3 ms 23224 KB Output is correct
5 Correct 8 ms 23388 KB Output is correct
6 Correct 11 ms 23644 KB Output is correct
7 Correct 10 ms 23572 KB Output is correct
8 Correct 12 ms 23644 KB Output is correct
9 Correct 12 ms 23644 KB Output is correct
10 Correct 12 ms 23644 KB Output is correct
11 Correct 11 ms 23664 KB Output is correct
12 Correct 11 ms 23644 KB Output is correct
13 Correct 10 ms 23644 KB Output is correct
14 Correct 11 ms 23800 KB Output is correct
15 Correct 11 ms 23644 KB Output is correct
16 Correct 10 ms 23716 KB Output is correct
17 Correct 11 ms 23704 KB Output is correct
18 Correct 11 ms 23720 KB Output is correct
19 Correct 11 ms 23656 KB Output is correct
20 Correct 11 ms 23644 KB Output is correct
21 Correct 11 ms 23644 KB Output is correct
22 Correct 11 ms 23660 KB Output is correct
23 Correct 5 ms 23660 KB Output is correct
24 Correct 5 ms 23644 KB Output is correct
25 Correct 6 ms 23644 KB Output is correct
26 Correct 5 ms 23644 KB Output is correct
27 Correct 5 ms 23644 KB Output is correct
28 Correct 9 ms 23668 KB Output is correct
29 Correct 7 ms 23644 KB Output is correct
30 Correct 11 ms 23640 KB Output is correct
31 Correct 11 ms 23664 KB Output is correct
32 Correct 12 ms 23644 KB Output is correct
33 Correct 10 ms 23856 KB Output is correct
34 Correct 10 ms 23644 KB Output is correct
35 Correct 12 ms 23868 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 23384 KB Output is correct
2 Correct 11 ms 23472 KB Output is correct
3 Correct 11 ms 23664 KB Output is correct
4 Correct 11 ms 23484 KB Output is correct
5 Correct 2636 ms 37776 KB Output is correct
6 Correct 2230 ms 37704 KB Output is correct
7 Correct 1623 ms 36624 KB Output is correct
8 Correct 1395 ms 35400 KB Output is correct
9 Correct 1575 ms 36504 KB Output is correct
10 Correct 3291 ms 39784 KB Output is correct
11 Correct 3311 ms 39672 KB Output is correct
12 Correct 3398 ms 40264 KB Output is correct
13 Correct 3268 ms 40924 KB Output is correct
14 Correct 3287 ms 40104 KB Output is correct
15 Correct 2362 ms 50560 KB Output is correct
16 Correct 2594 ms 49996 KB Output is correct
17 Correct 1247 ms 49064 KB Output is correct
18 Correct 2994 ms 41260 KB Output is correct
19 Correct 3050 ms 40684 KB Output is correct
20 Correct 3068 ms 41412 KB Output is correct
21 Correct 2761 ms 39212 KB Output is correct
22 Correct 2763 ms 39076 KB Output is correct
23 Correct 2747 ms 38800 KB Output is correct
24 Correct 2733 ms 39380 KB Output is correct
25 Correct 535 ms 39028 KB Output is correct
26 Correct 469 ms 39336 KB Output is correct
27 Correct 212 ms 39020 KB Output is correct
28 Correct 127 ms 39368 KB Output is correct
29 Correct 121 ms 40312 KB Output is correct
30 Correct 2764 ms 39980 KB Output is correct
31 Correct 2746 ms 39980 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16988 KB Output is correct
2 Correct 10 ms 23644 KB Output is correct
3 Correct 10 ms 23644 KB Output is correct
4 Correct 13 ms 23824 KB Output is correct
5 Correct 618 ms 45668 KB Output is correct
6 Correct 493 ms 46504 KB Output is correct
7 Correct 1061 ms 43932 KB Output is correct
8 Correct 1230 ms 51368 KB Output is correct
9 Correct 1323 ms 50184 KB Output is correct
10 Correct 1360 ms 50004 KB Output is correct
11 Correct 357 ms 50292 KB Output is correct
12 Correct 407 ms 49828 KB Output is correct
13 Correct 422 ms 50308 KB Output is correct
14 Correct 108 ms 50032 KB Output is correct
15 Correct 113 ms 50292 KB Output is correct
16 Correct 893 ms 50120 KB Output is correct
17 Correct 952 ms 50340 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 23132 KB Output is correct
2 Correct 3 ms 23132 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 3 ms 23224 KB Output is correct
5 Correct 8 ms 23388 KB Output is correct
6 Correct 11 ms 23644 KB Output is correct
7 Correct 10 ms 23572 KB Output is correct
8 Correct 12 ms 23644 KB Output is correct
9 Correct 12 ms 23644 KB Output is correct
10 Correct 12 ms 23644 KB Output is correct
11 Correct 11 ms 23664 KB Output is correct
12 Correct 11 ms 23644 KB Output is correct
13 Correct 10 ms 23644 KB Output is correct
14 Correct 11 ms 23800 KB Output is correct
15 Correct 11 ms 23644 KB Output is correct
16 Correct 10 ms 23716 KB Output is correct
17 Correct 11 ms 23704 KB Output is correct
18 Correct 11 ms 23720 KB Output is correct
19 Correct 11 ms 23656 KB Output is correct
20 Correct 11 ms 23644 KB Output is correct
21 Correct 11 ms 23644 KB Output is correct
22 Correct 11 ms 23660 KB Output is correct
23 Correct 5 ms 23660 KB Output is correct
24 Correct 5 ms 23644 KB Output is correct
25 Correct 6 ms 23644 KB Output is correct
26 Correct 5 ms 23644 KB Output is correct
27 Correct 5 ms 23644 KB Output is correct
28 Correct 9 ms 23668 KB Output is correct
29 Correct 7 ms 23644 KB Output is correct
30 Correct 11 ms 23640 KB Output is correct
31 Correct 11 ms 23664 KB Output is correct
32 Correct 12 ms 23644 KB Output is correct
33 Correct 10 ms 23856 KB Output is correct
34 Correct 10 ms 23644 KB Output is correct
35 Correct 12 ms 23868 KB Output is correct
36 Correct 4 ms 23384 KB Output is correct
37 Correct 11 ms 23472 KB Output is correct
38 Correct 11 ms 23664 KB Output is correct
39 Correct 11 ms 23484 KB Output is correct
40 Correct 2636 ms 37776 KB Output is correct
41 Correct 2230 ms 37704 KB Output is correct
42 Correct 1623 ms 36624 KB Output is correct
43 Correct 1395 ms 35400 KB Output is correct
44 Correct 1575 ms 36504 KB Output is correct
45 Correct 3291 ms 39784 KB Output is correct
46 Correct 3311 ms 39672 KB Output is correct
47 Correct 3398 ms 40264 KB Output is correct
48 Correct 3268 ms 40924 KB Output is correct
49 Correct 3287 ms 40104 KB Output is correct
50 Correct 2362 ms 50560 KB Output is correct
51 Correct 2594 ms 49996 KB Output is correct
52 Correct 1247 ms 49064 KB Output is correct
53 Correct 2994 ms 41260 KB Output is correct
54 Correct 3050 ms 40684 KB Output is correct
55 Correct 3068 ms 41412 KB Output is correct
56 Correct 2761 ms 39212 KB Output is correct
57 Correct 2763 ms 39076 KB Output is correct
58 Correct 2747 ms 38800 KB Output is correct
59 Correct 2733 ms 39380 KB Output is correct
60 Correct 535 ms 39028 KB Output is correct
61 Correct 469 ms 39336 KB Output is correct
62 Correct 212 ms 39020 KB Output is correct
63 Correct 127 ms 39368 KB Output is correct
64 Correct 121 ms 40312 KB Output is correct
65 Correct 2764 ms 39980 KB Output is correct
66 Correct 2746 ms 39980 KB Output is correct
67 Correct 2 ms 16988 KB Output is correct
68 Correct 10 ms 23644 KB Output is correct
69 Correct 10 ms 23644 KB Output is correct
70 Correct 13 ms 23824 KB Output is correct
71 Correct 618 ms 45668 KB Output is correct
72 Correct 493 ms 46504 KB Output is correct
73 Correct 1061 ms 43932 KB Output is correct
74 Correct 1230 ms 51368 KB Output is correct
75 Correct 1323 ms 50184 KB Output is correct
76 Correct 1360 ms 50004 KB Output is correct
77 Correct 357 ms 50292 KB Output is correct
78 Correct 407 ms 49828 KB Output is correct
79 Correct 422 ms 50308 KB Output is correct
80 Correct 108 ms 50032 KB Output is correct
81 Correct 113 ms 50292 KB Output is correct
82 Correct 893 ms 50120 KB Output is correct
83 Correct 952 ms 50340 KB Output is correct
84 Correct 2952 ms 36936 KB Output is correct
85 Correct 2558 ms 35936 KB Output is correct
86 Correct 1318 ms 35444 KB Output is correct
87 Correct 3533 ms 41352 KB Output is correct
88 Correct 3519 ms 39964 KB Output is correct
89 Correct 3716 ms 39488 KB Output is correct
90 Correct 3559 ms 40076 KB Output is correct
91 Correct 3626 ms 41136 KB Output is correct
92 Correct 1512 ms 47096 KB Output is correct
93 Correct 1391 ms 50188 KB Output is correct
94 Correct 3356 ms 40856 KB Output is correct
95 Correct 3307 ms 40244 KB Output is correct
96 Correct 3357 ms 40868 KB Output is correct
97 Correct 3481 ms 40220 KB Output is correct
98 Correct 3452 ms 39524 KB Output is correct
99 Correct 3577 ms 38924 KB Output is correct
100 Correct 3609 ms 38956 KB Output is correct
101 Correct 3443 ms 41024 KB Output is correct
102 Correct 250 ms 40560 KB Output is correct
103 Correct 278 ms 40100 KB Output is correct
104 Correct 850 ms 39208 KB Output is correct
105 Correct 136 ms 39728 KB Output is correct
106 Correct 115 ms 39288 KB Output is correct
107 Correct 2950 ms 41496 KB Output is correct
108 Correct 2902 ms 39672 KB Output is correct