oj.uz

Submission #856757

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

namespace Solve
{
    const int M = 1e5 + 1;
    const int Srt = 600;

    typedef tuple<long long, int, int> 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;
    bool vis[2000001];
    vector<int> list[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)
    {
        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);
            }
        }
    }

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14940 KB Output is correct
2 Correct 2 ms 14940 KB Output is correct
3 Correct 2 ms 10844 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 8 ms 15308 KB Output is correct
6 Correct 10 ms 15192 KB Output is correct
7 Correct 10 ms 15296 KB Output is correct
8 Correct 11 ms 15196 KB Output is correct
9 Correct 11 ms 15196 KB Output is correct
10 Correct 11 ms 15192 KB Output is correct
11 Correct 11 ms 15196 KB Output is correct
12 Correct 11 ms 15352 KB Output is correct
13 Correct 10 ms 15504 KB Output is correct
14 Correct 9 ms 15452 KB Output is correct
15 Correct 9 ms 15196 KB Output is correct
16 Correct 10 ms 15196 KB Output is correct
17 Correct 10 ms 15376 KB Output is correct
18 Correct 11 ms 15196 KB Output is correct
19 Correct 10 ms 15356 KB Output is correct
20 Correct 10 ms 15356 KB Output is correct
21 Correct 13 ms 15204 KB Output is correct
22 Correct 13 ms 15196 KB Output is correct
23 Correct 4 ms 15356 KB Output is correct
24 Correct 4 ms 15196 KB Output is correct
25 Correct 4 ms 15196 KB Output is correct
26 Correct 4 ms 15192 KB Output is correct
27 Correct 4 ms 15184 KB Output is correct
28 Correct 6 ms 15196 KB Output is correct
29 Correct 5 ms 15196 KB Output is correct
30 Correct 12 ms 15196 KB Output is correct
31 Correct 18 ms 15196 KB Output is correct
32 Correct 11 ms 15352 KB Output is correct
33 Correct 9 ms 15452 KB Output is correct
34 Correct 10 ms 15532 KB Output is correct
35 Correct 10 ms 15516 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14940 KB Output is correct
2 Correct 11 ms 15352 KB Output is correct
3 Correct 11 ms 15352 KB Output is correct
4 Correct 11 ms 15196 KB Output is correct
5 Correct 1489 ms 30080 KB Output is correct
6 Correct 1355 ms 31440 KB Output is correct
7 Correct 1010 ms 27712 KB Output is correct
8 Correct 861 ms 25808 KB Output is correct
9 Correct 946 ms 28548 KB Output is correct
10 Correct 1789 ms 32560 KB Output is correct
11 Correct 1799 ms 32904 KB Output is correct
12 Correct 1798 ms 33520 KB Output is correct
13 Correct 1772 ms 33788 KB Output is correct
14 Correct 1777 ms 32560 KB Output is correct
15 Correct 1401 ms 41212 KB Output is correct
16 Correct 1498 ms 40940 KB Output is correct
17 Correct 849 ms 39984 KB Output is correct
18 Correct 1686 ms 33212 KB Output is correct
19 Correct 1662 ms 31928 KB Output is correct
20 Correct 1659 ms 33584 KB Output is correct
21 Correct 1390 ms 31220 KB Output is correct
22 Correct 1342 ms 32944 KB Output is correct
23 Correct 1367 ms 33532 KB Output is correct
24 Correct 1395 ms 33672 KB Output is correct
25 Correct 289 ms 33092 KB Output is correct
26 Correct 230 ms 31796 KB Output is correct
27 Correct 148 ms 31792 KB Output is correct
28 Correct 111 ms 32852 KB Output is correct
29 Correct 111 ms 33076 KB Output is correct
30 Correct 1369 ms 33712 KB Output is correct
31 Correct 1385 ms 33408 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 9 ms 15372 KB Output is correct
3 Correct 10 ms 15448 KB Output is correct
4 Correct 9 ms 15452 KB Output is correct
5 Correct 509 ms 34568 KB Output is correct
6 Correct 446 ms 34544 KB Output is correct
7 Correct 898 ms 35468 KB Output is correct
8 Correct 949 ms 41264 KB Output is correct
9 Correct 948 ms 41268 KB Output is correct
10 Correct 990 ms 42576 KB Output is correct
11 Correct 237 ms 40624 KB Output is correct
12 Correct 265 ms 40928 KB Output is correct
13 Correct 258 ms 41432 KB Output is correct
14 Correct 106 ms 42488 KB Output is correct
15 Correct 112 ms 41300 KB Output is correct
16 Correct 549 ms 42148 KB Output is correct
17 Correct 549 ms 42564 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14940 KB Output is correct
2 Correct 2 ms 14940 KB Output is correct
3 Correct 2 ms 10844 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 8 ms 15308 KB Output is correct
6 Correct 10 ms 15192 KB Output is correct
7 Correct 10 ms 15296 KB Output is correct
8 Correct 11 ms 15196 KB Output is correct
9 Correct 11 ms 15196 KB Output is correct
10 Correct 11 ms 15192 KB Output is correct
11 Correct 11 ms 15196 KB Output is correct
12 Correct 11 ms 15352 KB Output is correct
13 Correct 10 ms 15504 KB Output is correct
14 Correct 9 ms 15452 KB Output is correct
15 Correct 9 ms 15196 KB Output is correct
16 Correct 10 ms 15196 KB Output is correct
17 Correct 10 ms 15376 KB Output is correct
18 Correct 11 ms 15196 KB Output is correct
19 Correct 10 ms 15356 KB Output is correct
20 Correct 10 ms 15356 KB Output is correct
21 Correct 13 ms 15204 KB Output is correct
22 Correct 13 ms 15196 KB Output is correct
23 Correct 4 ms 15356 KB Output is correct
24 Correct 4 ms 15196 KB Output is correct
25 Correct 4 ms 15196 KB Output is correct
26 Correct 4 ms 15192 KB Output is correct
27 Correct 4 ms 15184 KB Output is correct
28 Correct 6 ms 15196 KB Output is correct
29 Correct 5 ms 15196 KB Output is correct
30 Correct 12 ms 15196 KB Output is correct
31 Correct 18 ms 15196 KB Output is correct
32 Correct 11 ms 15352 KB Output is correct
33 Correct 9 ms 15452 KB Output is correct
34 Correct 10 ms 15532 KB Output is correct
35 Correct 10 ms 15516 KB Output is correct
36 Correct 2 ms 14940 KB Output is correct
37 Correct 11 ms 15352 KB Output is correct
38 Correct 11 ms 15352 KB Output is correct
39 Correct 11 ms 15196 KB Output is correct
40 Correct 1489 ms 30080 KB Output is correct
41 Correct 1355 ms 31440 KB Output is correct
42 Correct 1010 ms 27712 KB Output is correct
43 Correct 861 ms 25808 KB Output is correct
44 Correct 946 ms 28548 KB Output is correct
45 Correct 1789 ms 32560 KB Output is correct
46 Correct 1799 ms 32904 KB Output is correct
47 Correct 1798 ms 33520 KB Output is correct
48 Correct 1772 ms 33788 KB Output is correct
49 Correct 1777 ms 32560 KB Output is correct
50 Correct 1401 ms 41212 KB Output is correct
51 Correct 1498 ms 40940 KB Output is correct
52 Correct 849 ms 39984 KB Output is correct
53 Correct 1686 ms 33212 KB Output is correct
54 Correct 1662 ms 31928 KB Output is correct
55 Correct 1659 ms 33584 KB Output is correct
56 Correct 1390 ms 31220 KB Output is correct
57 Correct 1342 ms 32944 KB Output is correct
58 Correct 1367 ms 33532 KB Output is correct
59 Correct 1395 ms 33672 KB Output is correct
60 Correct 289 ms 33092 KB Output is correct
61 Correct 230 ms 31796 KB Output is correct
62 Correct 148 ms 31792 KB Output is correct
63 Correct 111 ms 32852 KB Output is correct
64 Correct 111 ms 33076 KB Output is correct
65 Correct 1369 ms 33712 KB Output is correct
66 Correct 1385 ms 33408 KB Output is correct
67 Correct 2 ms 10840 KB Output is correct
68 Correct 9 ms 15372 KB Output is correct
69 Correct 10 ms 15448 KB Output is correct
70 Correct 9 ms 15452 KB Output is correct
71 Correct 509 ms 34568 KB Output is correct
72 Correct 446 ms 34544 KB Output is correct
73 Correct 898 ms 35468 KB Output is correct
74 Correct 949 ms 41264 KB Output is correct
75 Correct 948 ms 41268 KB Output is correct
76 Correct 990 ms 42576 KB Output is correct
77 Correct 237 ms 40624 KB Output is correct
78 Correct 265 ms 40928 KB Output is correct
79 Correct 258 ms 41432 KB Output is correct
80 Correct 106 ms 42488 KB Output is correct
81 Correct 112 ms 41300 KB Output is correct
82 Correct 549 ms 42148 KB Output is correct
83 Correct 549 ms 42564 KB Output is correct
84 Correct 1547 ms 29748 KB Output is correct
85 Correct 1386 ms 29408 KB Output is correct
86 Correct 849 ms 25240 KB Output is correct
87 Correct 1982 ms 32772 KB Output is correct
88 Correct 1933 ms 32436 KB Output is correct
89 Correct 1940 ms 32532 KB Output is correct
90 Correct 1937 ms 33324 KB Output is correct
91 Correct 1962 ms 33068 KB Output is correct
92 Correct 1138 ms 38784 KB Output is correct
93 Correct 998 ms 40312 KB Output is correct
94 Correct 1986 ms 32292 KB Output is correct
95 Correct 2079 ms 33088 KB Output is correct
96 Correct 2037 ms 32316 KB Output is correct
97 Correct 1919 ms 32568 KB Output is correct
98 Correct 1828 ms 32312 KB Output is correct
99 Correct 1825 ms 33784 KB Output is correct
100 Correct 1785 ms 33036 KB Output is correct
101 Correct 1850 ms 33392 KB Output is correct
102 Correct 180 ms 32776 KB Output is correct
103 Correct 194 ms 32816 KB Output is correct
104 Correct 476 ms 32048 KB Output is correct
105 Correct 126 ms 33024 KB Output is correct
106 Correct 108 ms 33076 KB Output is correct
107 Correct 1497 ms 33768 KB Output is correct
108 Correct 1487 ms 32376 KB Output is correct