oj.uz

Submission #826987

# Submission time Handle Problem Language Result Execution time Memory
826987 2023-08-16T07:49:07 Z Hanksburger Two Currencies (JOI23_currencies) C++17
10 / 100
 5000 ms 21780 KB 
#include <bits/stdc++.h>
using namespace std;
long long depth[100005], par[100005], ind[100005];
vector<pair<long long, long long> > adj[100005];
vector<long long> vec[100005], res;
void dfs(long long u, long long p)
{
    par[u]=p;
    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;
        ind[v]=w;
        dfs(v, u);
    }
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    long long n, m, q;
    cin >> n >> m >> q;
    for (long long i=1; i<n; i++)
    {
        long long u, v;
        cin >> u >> v;
        adj[u].push_back({v, i});
        adj[v].push_back({u, i});
    }
    for (long long i=1; i<=m; i++)
    {
        long long x, y;
        cin >> x >> y;
        vec[x].push_back(y);
    }
    dfs(1, 1);
    for (long long i=1; i<=q; i++)
    {
        long long a, b, c, d, curA, curB, sum=0;
        cin >> a >> b >> c >> d;
        if (depth[a]<depth[b])
            swap(a, b);
        res.clear();
        curA=a, curB=b;
        for (long long j=1; j<=depth[a]-depth[b]; j++)
        {
            for (long long k=0; k<vec[ind[curA]].size(); k++)
                res.push_back(vec[ind[curA]][k]);
            curA=par[curA];
        }
        while (curA!=curB)
        {
            for (long long k=0; k<vec[ind[curA]].size(); k++)
                res.push_back(vec[ind[curA]][k]);
            curA=par[curA];
            for (long long k=0; k<vec[ind[curB]].size(); k++)
                res.push_back(vec[ind[curB]][k]);
            curB=par[curB];
        }
        sort(res.begin(), res.end());
        for (long long j=0; j<=res.size(); j++)
        {
            if (j<res.size() && sum+res[j]<=d)
                sum+=res[j];
            else
            {
                cout << max(-1LL, c-((long long)res.size()-j)) << '\n';
                break;
            }
        }
    }
}

Compilation message

currencies.cpp: In function 'void dfs(long long int, long long int)':
currencies.cpp:9: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]
    9 |     for (long long i=0; i<adj[u].size(); i++)
      |                         ~^~~~~~~~~~~~~~
currencies.cpp: In function 'int main()':
currencies.cpp:50:34: 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]
   50 |             for (long long k=0; k<vec[ind[curA]].size(); k++)
      |                                 ~^~~~~~~~~~~~~~~~~~~~~~
currencies.cpp:56:34: 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]
   56 |             for (long long k=0; k<vec[ind[curA]].size(); k++)
      |                                 ~^~~~~~~~~~~~~~~~~~~~~~
currencies.cpp:59:34: 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]
   59 |             for (long long k=0; k<vec[ind[curB]].size(); k++)
      |                                 ~^~~~~~~~~~~~~~~~~~~~~~
currencies.cpp:64:30: 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]
   64 |         for (long long j=0; j<=res.size(); j++)
      |                             ~^~~~~~~~~~~~
currencies.cpp:66:18: 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]
   66 |             if (j<res.size() && sum+res[j]<=d)
      |                 ~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 5028 KB Output is correct
3 Correct 2 ms 5028 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 5204 KB Output is correct
6 Correct 4 ms 5204 KB Output is correct
7 Correct 4 ms 5164 KB Output is correct
8 Correct 4 ms 5204 KB Output is correct
9 Correct 5 ms 5204 KB Output is correct
10 Correct 5 ms 5296 KB Output is correct
11 Correct 5 ms 5296 KB Output is correct
12 Correct 5 ms 5208 KB Output is correct
13 Correct 66 ms 5332 KB Output is correct
14 Correct 67 ms 5408 KB Output is correct
15 Correct 29 ms 5380 KB Output is correct
16 Correct 21 ms 5332 KB Output is correct
17 Correct 18 ms 5332 KB Output is correct
18 Correct 29 ms 5368 KB Output is correct
19 Correct 4 ms 5204 KB Output is correct
20 Correct 4 ms 5304 KB Output is correct
21 Correct 5 ms 5284 KB Output is correct
22 Correct 4 ms 5300 KB Output is correct
23 Correct 44 ms 5320 KB Output is correct
24 Correct 41 ms 5320 KB Output is correct
25 Correct 41 ms 5328 KB Output is correct
26 Correct 5 ms 5300 KB Output is correct
27 Correct 4 ms 5296 KB Output is correct
28 Correct 4 ms 5296 KB Output is correct
29 Correct 4 ms 5204 KB Output is correct
30 Correct 5 ms 5204 KB Output is correct
31 Correct 4 ms 5204 KB Output is correct
32 Correct 5 ms 5296 KB Output is correct
33 Correct 62 ms 5456 KB Output is correct
34 Correct 63 ms 5460 KB Output is correct
35 Correct 63 ms 5472 KB Output is correct

Subtask #2
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5032 KB Output is correct
2 Correct 4 ms 5204 KB Output is correct
3 Correct 4 ms 5204 KB Output is correct
4 Correct 4 ms 5320 KB Output is correct
5 Correct 104 ms 15168 KB Output is correct
6 Correct 136 ms 12536 KB Output is correct
7 Correct 118 ms 13520 KB Output is correct
8 Correct 99 ms 13832 KB Output is correct
9 Correct 107 ms 13764 KB Output is correct
10 Correct 141 ms 15300 KB Output is correct
11 Correct 171 ms 15376 KB Output is correct
12 Correct 181 ms 15300 KB Output is correct
13 Correct 148 ms 15392 KB Output is correct
14 Correct 138 ms 15292 KB Output is correct
15 Execution timed out 5020 ms 21780 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 63 ms 5468 KB Output is correct
3 Correct 65 ms 5472 KB Output is correct
4 Correct 64 ms 5468 KB Output is correct
5 Execution timed out 5045 ms 20968 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 5028 KB Output is correct
3 Correct 2 ms 5028 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 5204 KB Output is correct
6 Correct 4 ms 5204 KB Output is correct
7 Correct 4 ms 5164 KB Output is correct
8 Correct 4 ms 5204 KB Output is correct
9 Correct 5 ms 5204 KB Output is correct
10 Correct 5 ms 5296 KB Output is correct
11 Correct 5 ms 5296 KB Output is correct
12 Correct 5 ms 5208 KB Output is correct
13 Correct 66 ms 5332 KB Output is correct
14 Correct 67 ms 5408 KB Output is correct
15 Correct 29 ms 5380 KB Output is correct
16 Correct 21 ms 5332 KB Output is correct
17 Correct 18 ms 5332 KB Output is correct
18 Correct 29 ms 5368 KB Output is correct
19 Correct 4 ms 5204 KB Output is correct
20 Correct 4 ms 5304 KB Output is correct
21 Correct 5 ms 5284 KB Output is correct
22 Correct 4 ms 5300 KB Output is correct
23 Correct 44 ms 5320 KB Output is correct
24 Correct 41 ms 5320 KB Output is correct
25 Correct 41 ms 5328 KB Output is correct
26 Correct 5 ms 5300 KB Output is correct
27 Correct 4 ms 5296 KB Output is correct
28 Correct 4 ms 5296 KB Output is correct
29 Correct 4 ms 5204 KB Output is correct
30 Correct 5 ms 5204 KB Output is correct
31 Correct 4 ms 5204 KB Output is correct
32 Correct 5 ms 5296 KB Output is correct
33 Correct 62 ms 5456 KB Output is correct
34 Correct 63 ms 5460 KB Output is correct
35 Correct 63 ms 5472 KB Output is correct
36 Correct 2 ms 5032 KB Output is correct
37 Correct 4 ms 5204 KB Output is correct
38 Correct 4 ms 5204 KB Output is correct
39 Correct 4 ms 5320 KB Output is correct
40 Correct 104 ms 15168 KB Output is correct
41 Correct 136 ms 12536 KB Output is correct
42 Correct 118 ms 13520 KB Output is correct
43 Correct 99 ms 13832 KB Output is correct
44 Correct 107 ms 13764 KB Output is correct
45 Correct 141 ms 15300 KB Output is correct
46 Correct 171 ms 15376 KB Output is correct
47 Correct 181 ms 15300 KB Output is correct
48 Correct 148 ms 15392 KB Output is correct
49 Correct 138 ms 15292 KB Output is correct
50 Execution timed out 5020 ms 21780 KB Time limit exceeded
51 Halted 0 ms 0 KB -