oj.uz

Submission #1050006

# Submission time Handle Problem Language Result Execution time Memory
1050006 2024-08-09T06:46:42 Z otarius Race (IOI11_race) C++17
100 / 100
 269 ms 111696 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;

#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()

// #define int long long
// #define int unsigned long long

// #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>

void open_file(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

// const ll mod = 1e9 + 7;
// const ll mod = 998244353;

const ll inf = 1e9;
const ll biginf = 1e18;
const int maxN = 5 * 1e5 + 5;

vector<pii> g[maxN];
map<int, int> dp[maxN];
int n, k, dep[maxN], sum[maxN], ans = inf;
void dfs(int v, int par, int len, int val) {
    dep[v] = len; sum[v] = val;
    dp[v][sum[v]] = dep[v];
    for (pii u : g[v]) {
        if (u.ff == par) continue;
        dfs(u.ff, v, len + 1, val + u.sc);
        if (dp[u.ff].size() > dp[v].size())
            swap(dp[u.ff], dp[v]);
        for (auto x : dp[u.ff]) {
            if (dp[v].find(k + 2 * sum[v] - x.ff) != dp[v].end()) {
                ans = min(ans, dp[v][k + 2 * sum[v] - x.ff] + x.sc - 2 * dep[v]);
            }
        } for (auto x : dp[u.ff]) {
            if (dp[v].find(x.ff) == dp[v].end())
                dp[v][x.ff] = x.sc;
            else dp[v][x.ff] = min(dp[v][x.ff], x.sc);
        }
    }
}
int best_path(int _n, int _k, int h[][2], int l[]) {
    n = _n; k = _k;
    for (int i = 0; i < n - 1; i++) {
        g[h[i][0]].pb({h[i][1], l[i]});
        g[h[i][1]].pb({h[i][0], l[i]});
    } dfs(0, -1, 0, 0);
    return (ans == inf ? -1 : ans);
}
// int main() {
//     int _n, _k;
//     cin >> _n >> _k;
//     int h[_n][2], l[_n];
//     for (int i = 0; i < _n - 1; i++) {
//         cin >> h[i][0] >> h[i][1];
//     } for (int i = 0; i < _n - 1; i++) cin >> l[i];
//     cout << best_path(_n, _k, h, l);
// }

Compilation message

race.cpp: In function 'void open_file(std::string)':
race.cpp:26:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
race.cpp:27:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 43100 KB Output is correct
2 Correct 5 ms 43196 KB Output is correct
3 Correct 5 ms 43180 KB Output is correct
4 Correct 5 ms 43176 KB Output is correct
5 Correct 6 ms 43100 KB Output is correct
6 Correct 6 ms 43100 KB Output is correct
7 Correct 6 ms 43100 KB Output is correct
8 Correct 5 ms 43100 KB Output is correct
9 Correct 5 ms 43100 KB Output is correct
10 Correct 6 ms 43100 KB Output is correct
11 Correct 5 ms 43212 KB Output is correct
12 Correct 6 ms 43100 KB Output is correct
13 Correct 5 ms 43100 KB Output is correct
14 Correct 5 ms 43100 KB Output is correct
15 Correct 6 ms 43100 KB Output is correct
16 Correct 5 ms 43196 KB Output is correct
17 Correct 5 ms 43100 KB Output is correct
18 Correct 5 ms 43100 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 43100 KB Output is correct
2 Correct 5 ms 43196 KB Output is correct
3 Correct 5 ms 43180 KB Output is correct
4 Correct 5 ms 43176 KB Output is correct
5 Correct 6 ms 43100 KB Output is correct
6 Correct 6 ms 43100 KB Output is correct
7 Correct 6 ms 43100 KB Output is correct
8 Correct 5 ms 43100 KB Output is correct
9 Correct 5 ms 43100 KB Output is correct
10 Correct 6 ms 43100 KB Output is correct
11 Correct 5 ms 43212 KB Output is correct
12 Correct 6 ms 43100 KB Output is correct
13 Correct 5 ms 43100 KB Output is correct
14 Correct 5 ms 43100 KB Output is correct
15 Correct 6 ms 43100 KB Output is correct
16 Correct 5 ms 43196 KB Output is correct
17 Correct 5 ms 43100 KB Output is correct
18 Correct 5 ms 43100 KB Output is correct
19 Correct 5 ms 43212 KB Output is correct
20 Correct 6 ms 43100 KB Output is correct
21 Correct 6 ms 43356 KB Output is correct
22 Correct 7 ms 43352 KB Output is correct
23 Correct 7 ms 43356 KB Output is correct
24 Correct 6 ms 43356 KB Output is correct
25 Correct 6 ms 43428 KB Output is correct
26 Correct 7 ms 43228 KB Output is correct
27 Correct 6 ms 43356 KB Output is correct
28 Correct 6 ms 43456 KB Output is correct
29 Correct 6 ms 43356 KB Output is correct
30 Correct 7 ms 43356 KB Output is correct
31 Correct 6 ms 43236 KB Output is correct
32 Correct 7 ms 43352 KB Output is correct
33 Correct 6 ms 43432 KB Output is correct
34 Correct 6 ms 43436 KB Output is correct
35 Correct 6 ms 43432 KB Output is correct
36 Correct 6 ms 43356 KB Output is correct
37 Correct 6 ms 43356 KB Output is correct
38 Correct 6 ms 43356 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 43100 KB Output is correct
2 Correct 5 ms 43196 KB Output is correct
3 Correct 5 ms 43180 KB Output is correct
4 Correct 5 ms 43176 KB Output is correct
5 Correct 6 ms 43100 KB Output is correct
6 Correct 6 ms 43100 KB Output is correct
7 Correct 6 ms 43100 KB Output is correct
8 Correct 5 ms 43100 KB Output is correct
9 Correct 5 ms 43100 KB Output is correct
10 Correct 6 ms 43100 KB Output is correct
11 Correct 5 ms 43212 KB Output is correct
12 Correct 6 ms 43100 KB Output is correct
13 Correct 5 ms 43100 KB Output is correct
14 Correct 5 ms 43100 KB Output is correct
15 Correct 6 ms 43100 KB Output is correct
16 Correct 5 ms 43196 KB Output is correct
17 Correct 5 ms 43100 KB Output is correct
18 Correct 5 ms 43100 KB Output is correct
19 Correct 74 ms 62136 KB Output is correct
20 Correct 65 ms 62032 KB Output is correct
21 Correct 64 ms 61784 KB Output is correct
22 Correct 65 ms 61544 KB Output is correct
23 Correct 96 ms 71252 KB Output is correct
24 Correct 73 ms 64080 KB Output is correct
25 Correct 52 ms 64084 KB Output is correct
26 Correct 38 ms 71772 KB Output is correct
27 Correct 109 ms 70228 KB Output is correct
28 Correct 164 ms 107860 KB Output is correct
29 Correct 157 ms 105908 KB Output is correct
30 Correct 106 ms 70228 KB Output is correct
31 Correct 107 ms 70248 KB Output is correct
32 Correct 128 ms 70228 KB Output is correct
33 Correct 125 ms 73552 KB Output is correct
34 Correct 208 ms 98648 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 43100 KB Output is correct
2 Correct 5 ms 43196 KB Output is correct
3 Correct 5 ms 43180 KB Output is correct
4 Correct 5 ms 43176 KB Output is correct
5 Correct 6 ms 43100 KB Output is correct
6 Correct 6 ms 43100 KB Output is correct
7 Correct 6 ms 43100 KB Output is correct
8 Correct 5 ms 43100 KB Output is correct
9 Correct 5 ms 43100 KB Output is correct
10 Correct 6 ms 43100 KB Output is correct
11 Correct 5 ms 43212 KB Output is correct
12 Correct 6 ms 43100 KB Output is correct
13 Correct 5 ms 43100 KB Output is correct
14 Correct 5 ms 43100 KB Output is correct
15 Correct 6 ms 43100 KB Output is correct
16 Correct 5 ms 43196 KB Output is correct
17 Correct 5 ms 43100 KB Output is correct
18 Correct 5 ms 43100 KB Output is correct
19 Correct 5 ms 43212 KB Output is correct
20 Correct 6 ms 43100 KB Output is correct
21 Correct 6 ms 43356 KB Output is correct
22 Correct 7 ms 43352 KB Output is correct
23 Correct 7 ms 43356 KB Output is correct
24 Correct 6 ms 43356 KB Output is correct
25 Correct 6 ms 43428 KB Output is correct
26 Correct 7 ms 43228 KB Output is correct
27 Correct 6 ms 43356 KB Output is correct
28 Correct 6 ms 43456 KB Output is correct
29 Correct 6 ms 43356 KB Output is correct
30 Correct 7 ms 43356 KB Output is correct
31 Correct 6 ms 43236 KB Output is correct
32 Correct 7 ms 43352 KB Output is correct
33 Correct 6 ms 43432 KB Output is correct
34 Correct 6 ms 43436 KB Output is correct
35 Correct 6 ms 43432 KB Output is correct
36 Correct 6 ms 43356 KB Output is correct
37 Correct 6 ms 43356 KB Output is correct
38 Correct 6 ms 43356 KB Output is correct
39 Correct 74 ms 62136 KB Output is correct
40 Correct 65 ms 62032 KB Output is correct
41 Correct 64 ms 61784 KB Output is correct
42 Correct 65 ms 61544 KB Output is correct
43 Correct 96 ms 71252 KB Output is correct
44 Correct 73 ms 64080 KB Output is correct
45 Correct 52 ms 64084 KB Output is correct
46 Correct 38 ms 71772 KB Output is correct
47 Correct 109 ms 70228 KB Output is correct
48 Correct 164 ms 107860 KB Output is correct
49 Correct 157 ms 105908 KB Output is correct
50 Correct 106 ms 70228 KB Output is correct
51 Correct 107 ms 70248 KB Output is correct
52 Correct 128 ms 70228 KB Output is correct
53 Correct 125 ms 73552 KB Output is correct
54 Correct 208 ms 98648 KB Output is correct
55 Correct 14 ms 45480 KB Output is correct
56 Correct 10 ms 44632 KB Output is correct
57 Correct 39 ms 59980 KB Output is correct
58 Correct 31 ms 54992 KB Output is correct
59 Correct 54 ms 76504 KB Output is correct
60 Correct 151 ms 106324 KB Output is correct
61 Correct 136 ms 72784 KB Output is correct
62 Correct 116 ms 70228 KB Output is correct
63 Correct 121 ms 70224 KB Output is correct
64 Correct 264 ms 111696 KB Output is correct
65 Correct 269 ms 110672 KB Output is correct
66 Correct 165 ms 101968 KB Output is correct
67 Correct 87 ms 66240 KB Output is correct
68 Correct 214 ms 83056 KB Output is correct
69 Correct 222 ms 86888 KB Output is correct
70 Correct 192 ms 81640 KB Output is correct