oj.uz

Submission #826967

# Submission time Handle Problem Language Result Execution time Memory
826967 2023-08-16T07:35:06 Z Hanksburger Two Currencies (JOI23_currencies) C++17
28 / 100
 215 ms 35568 KB 
#include <bits/stdc++.h>
using namespace std;
long long U[100005], V[100005], W[100005], par[100005][20], depth[100005], sum[100005];
vector<pair<long long, long long> > adj[100005];
void dfs(long long u, long long p)
{
    par[u][0]=p;
    for (long long i=1; i<20; i++)
        par[u][i]=par[par[u][i-1]][i-1];
    for (long long i=0; i<adj[u].size(); i++)
    {
        long long v=adj[u][i].first, w=adj[u][i].second;
        if (v==p)
            continue;
        depth[v]=depth[u]+1;
        sum[v]=sum[u]+w;
        dfs(v, u);
    }
 }
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    long long n, m, q, val;
    cin >> n >> m >> q;
    for (long long i=1; i<n; i++)
        cin >> U[i] >> V[i];
    for (long long i=1; i<=m; i++)
    {
        long long x, y;
        cin >> x >> y;
        W[x]++;
        val=y;
    }
    for (long long i=1; i<n; i++)
    {
        adj[U[i]].push_back({V[i], W[i]});
        adj[V[i]].push_back({U[i], W[i]});
    }
    dfs(1, 1);
    for (long long i=1; i<=q; i++)
    {
        long long a, b, c, d, curA, curB;
        cin >> a >> b >> c >> d;
        if (depth[a]<depth[b])
            swap(a, b);
        curA=a, curB=b;
        for (long long j=19; j>=0; j--)
            if ((depth[a]-depth[b])&(1<<j))
                curA=par[curA][j];
        for (long long j=19; j>=0; j--)
        {
            if (par[curA][j]!=par[curB][j])
            {
                curA=par[curA][j];
                curB=par[curB][j];
            }
        }
        if (curA!=curB)
        {
            curA=par[curA][0];
            curB=par[curB][0];
        }
        cout << max(-1LL, c-max(0LL, sum[a]+sum[b]-sum[curA]*2-d/val)) << '\n';
    }
}

Compilation message

currencies.cpp: In function 'void dfs(long long int, long long int)':
currencies.cpp:10:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for (long long i=0; i<adj[u].size(); i++)
      |                         ~^~~~~~~~~~~~~~
currencies.cpp: In function 'int main()':
currencies.cpp:65:65: warning: 'val' may be used uninitialized in this function [-Wmaybe-uninitialized]
   65 |         cout << max(-1LL, c-max(0LL, sum[a]+sum[b]-sum[curA]*2-d/val)) << '\n';
      |                                                                ~^~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 3 ms 3284 KB Output is correct
3 Correct 3 ms 3284 KB Output is correct
4 Correct 3 ms 3208 KB Output is correct
5 Correct 131 ms 28128 KB Output is correct
6 Correct 99 ms 19916 KB Output is correct
7 Correct 124 ms 23712 KB Output is correct
8 Correct 116 ms 24732 KB Output is correct
9 Correct 125 ms 24656 KB Output is correct
10 Correct 135 ms 28064 KB Output is correct
11 Correct 172 ms 28112 KB Output is correct
12 Correct 138 ms 28084 KB Output is correct
13 Correct 132 ms 28112 KB Output is correct
14 Correct 132 ms 28048 KB Output is correct
15 Correct 215 ms 35276 KB Output is correct
16 Correct 195 ms 35568 KB Output is correct
17 Correct 198 ms 34764 KB Output is correct
18 Correct 204 ms 29412 KB Output is correct
19 Correct 191 ms 29320 KB Output is correct
20 Correct 165 ms 29392 KB Output is correct
21 Correct 156 ms 28484 KB Output is correct
22 Correct 118 ms 28564 KB Output is correct
23 Correct 108 ms 28544 KB Output is correct
24 Correct 116 ms 28524 KB Output is correct
25 Correct 149 ms 29056 KB Output is correct
26 Correct 182 ms 29152 KB Output is correct
27 Correct 160 ms 29080 KB Output is correct
28 Correct 126 ms 29036 KB Output is correct
29 Correct 140 ms 28960 KB Output is correct
30 Correct 129 ms 28972 KB Output is correct
31 Correct 131 ms 29000 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -