oj.uz

Submission #970236

# Submission time Handle Problem Language Result Execution time Memory
970236 2024-04-26T08:53:29 Z rahidilbayramli Race (IOI11_race) C++17
100 / 100
 820 ms 203836 KB 
#pragma GCC optimize("-O3")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define p_b pop_back
#define f first
#define s second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int sz = 2e5+5;
vector<pii>g[sz];
set<int>st[sz];
map<int, int>mp[sz];
int vis[sz], val[sz], lev[sz], n, k, ans = INT_MAX;
void dfs(int node)
{
    vis[node] = 1;
    for(auto [u, w] : g[node])
    {
        if(vis[u])
            continue;
        lev[u] = lev[node] + 1;
        val[u] = val[node] + w;
        dfs(u);
    }
}
void dfs2(int node)
{
    vis[node] = 1;
    st[node].insert(val[node]);
    mp[node][val[node]] = lev[node];
    for(auto [u, w] : g[node])
    {
        if(vis[u])
            continue;
        dfs2(u);
        if(st[node].size() < st[u].size())
        {
            swap(st[node], st[u]);
            swap(mp[node], mp[u]);
        }
        for(auto h : st[u]){
            if(mp[node][k+2*val[node]-h] != 0)
                ans = min(ans, mp[node][k+2*val[node]-h] + mp[u][h] - 2 * lev[node]);
        }
        for(auto h : st[u])
        {
            st[node].insert(h);
            if(mp[node][h] == 0)
                mp[node][h] = mp[u][h];
            else
                mp[node][h] = min(mp[node][h], mp[u][h]);
        }
    }
    if(mp[node][val[node]+k] != 0)
        ans = min(ans, mp[node][val[node]+k] - lev[node]);
}
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);
    for(int i = 0; i < N; i++)
        vis[i] = 0;
    dfs2(0);
    if(ans == INT_MAX)
        return -1;
    else
        return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 29788 KB Output is correct
2 Correct 7 ms 29960 KB Output is correct
3 Correct 7 ms 29788 KB Output is correct
4 Correct 7 ms 29788 KB Output is correct
5 Correct 7 ms 29788 KB Output is correct
6 Correct 7 ms 29788 KB Output is correct
7 Correct 7 ms 29788 KB Output is correct
8 Correct 7 ms 29872 KB Output is correct
9 Correct 7 ms 29788 KB Output is correct
10 Correct 7 ms 29788 KB Output is correct
11 Correct 7 ms 29788 KB Output is correct
12 Correct 7 ms 29788 KB Output is correct
13 Correct 7 ms 29788 KB Output is correct
14 Correct 7 ms 29784 KB Output is correct
15 Correct 7 ms 29784 KB Output is correct
16 Correct 8 ms 29784 KB Output is correct
17 Correct 7 ms 29788 KB Output is correct
18 Correct 7 ms 29784 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 29788 KB Output is correct
2 Correct 7 ms 29960 KB Output is correct
3 Correct 7 ms 29788 KB Output is correct
4 Correct 7 ms 29788 KB Output is correct
5 Correct 7 ms 29788 KB Output is correct
6 Correct 7 ms 29788 KB Output is correct
7 Correct 7 ms 29788 KB Output is correct
8 Correct 7 ms 29872 KB Output is correct
9 Correct 7 ms 29788 KB Output is correct
10 Correct 7 ms 29788 KB Output is correct
11 Correct 7 ms 29788 KB Output is correct
12 Correct 7 ms 29788 KB Output is correct
13 Correct 7 ms 29788 KB Output is correct
14 Correct 7 ms 29784 KB Output is correct
15 Correct 7 ms 29784 KB Output is correct
16 Correct 8 ms 29784 KB Output is correct
17 Correct 7 ms 29788 KB Output is correct
18 Correct 7 ms 29784 KB Output is correct
19 Correct 7 ms 29788 KB Output is correct
20 Correct 7 ms 29960 KB Output is correct
21 Correct 8 ms 30148 KB Output is correct
22 Correct 9 ms 30540 KB Output is correct
23 Correct 8 ms 30296 KB Output is correct
24 Correct 9 ms 30428 KB Output is correct
25 Correct 9 ms 30300 KB Output is correct
26 Correct 10 ms 30300 KB Output is correct
27 Correct 7 ms 30044 KB Output is correct
28 Correct 9 ms 30296 KB Output is correct
29 Correct 9 ms 30300 KB Output is correct
30 Correct 9 ms 30300 KB Output is correct
31 Correct 9 ms 30416 KB Output is correct
32 Correct 8 ms 30300 KB Output is correct
33 Correct 9 ms 30300 KB Output is correct
34 Correct 8 ms 30300 KB Output is correct
35 Correct 8 ms 30300 KB Output is correct
36 Correct 8 ms 30164 KB Output is correct
37 Correct 8 ms 30284 KB Output is correct
38 Correct 8 ms 30296 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 29788 KB Output is correct
2 Correct 7 ms 29960 KB Output is correct
3 Correct 7 ms 29788 KB Output is correct
4 Correct 7 ms 29788 KB Output is correct
5 Correct 7 ms 29788 KB Output is correct
6 Correct 7 ms 29788 KB Output is correct
7 Correct 7 ms 29788 KB Output is correct
8 Correct 7 ms 29872 KB Output is correct
9 Correct 7 ms 29788 KB Output is correct
10 Correct 7 ms 29788 KB Output is correct
11 Correct 7 ms 29788 KB Output is correct
12 Correct 7 ms 29788 KB Output is correct
13 Correct 7 ms 29788 KB Output is correct
14 Correct 7 ms 29784 KB Output is correct
15 Correct 7 ms 29784 KB Output is correct
16 Correct 8 ms 29784 KB Output is correct
17 Correct 7 ms 29788 KB Output is correct
18 Correct 7 ms 29784 KB Output is correct
19 Correct 238 ms 68944 KB Output is correct
20 Correct 198 ms 68948 KB Output is correct
21 Correct 204 ms 68888 KB Output is correct
22 Correct 229 ms 67832 KB Output is correct
23 Correct 301 ms 96892 KB Output is correct
24 Correct 222 ms 75652 KB Output is correct
25 Correct 132 ms 55736 KB Output is correct
26 Correct 60 ms 63312 KB Output is correct
27 Correct 250 ms 77032 KB Output is correct
28 Correct 332 ms 122740 KB Output is correct
29 Correct 360 ms 121988 KB Output is correct
30 Correct 248 ms 77104 KB Output is correct
31 Correct 274 ms 77048 KB Output is correct
32 Correct 368 ms 77928 KB Output is correct
33 Correct 314 ms 80464 KB Output is correct
34 Correct 564 ms 157480 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 29788 KB Output is correct
2 Correct 7 ms 29960 KB Output is correct
3 Correct 7 ms 29788 KB Output is correct
4 Correct 7 ms 29788 KB Output is correct
5 Correct 7 ms 29788 KB Output is correct
6 Correct 7 ms 29788 KB Output is correct
7 Correct 7 ms 29788 KB Output is correct
8 Correct 7 ms 29872 KB Output is correct
9 Correct 7 ms 29788 KB Output is correct
10 Correct 7 ms 29788 KB Output is correct
11 Correct 7 ms 29788 KB Output is correct
12 Correct 7 ms 29788 KB Output is correct
13 Correct 7 ms 29788 KB Output is correct
14 Correct 7 ms 29784 KB Output is correct
15 Correct 7 ms 29784 KB Output is correct
16 Correct 8 ms 29784 KB Output is correct
17 Correct 7 ms 29788 KB Output is correct
18 Correct 7 ms 29784 KB Output is correct
19 Correct 7 ms 29788 KB Output is correct
20 Correct 7 ms 29960 KB Output is correct
21 Correct 8 ms 30148 KB Output is correct
22 Correct 9 ms 30540 KB Output is correct
23 Correct 8 ms 30296 KB Output is correct
24 Correct 9 ms 30428 KB Output is correct
25 Correct 9 ms 30300 KB Output is correct
26 Correct 10 ms 30300 KB Output is correct
27 Correct 7 ms 30044 KB Output is correct
28 Correct 9 ms 30296 KB Output is correct
29 Correct 9 ms 30300 KB Output is correct
30 Correct 9 ms 30300 KB Output is correct
31 Correct 9 ms 30416 KB Output is correct
32 Correct 8 ms 30300 KB Output is correct
33 Correct 9 ms 30300 KB Output is correct
34 Correct 8 ms 30300 KB Output is correct
35 Correct 8 ms 30300 KB Output is correct
36 Correct 8 ms 30164 KB Output is correct
37 Correct 8 ms 30284 KB Output is correct
38 Correct 8 ms 30296 KB Output is correct
39 Correct 238 ms 68944 KB Output is correct
40 Correct 198 ms 68948 KB Output is correct
41 Correct 204 ms 68888 KB Output is correct
42 Correct 229 ms 67832 KB Output is correct
43 Correct 301 ms 96892 KB Output is correct
44 Correct 222 ms 75652 KB Output is correct
45 Correct 132 ms 55736 KB Output is correct
46 Correct 60 ms 63312 KB Output is correct
47 Correct 250 ms 77032 KB Output is correct
48 Correct 332 ms 122740 KB Output is correct
49 Correct 360 ms 121988 KB Output is correct
50 Correct 248 ms 77104 KB Output is correct
51 Correct 274 ms 77048 KB Output is correct
52 Correct 368 ms 77928 KB Output is correct
53 Correct 314 ms 80464 KB Output is correct
54 Correct 564 ms 157480 KB Output is correct
55 Correct 29 ms 35672 KB Output is correct
56 Correct 19 ms 32856 KB Output is correct
57 Correct 122 ms 65104 KB Output is correct
58 Correct 73 ms 50116 KB Output is correct
59 Correct 128 ms 77136 KB Output is correct
60 Correct 391 ms 122200 KB Output is correct
61 Correct 309 ms 85076 KB Output is correct
62 Correct 247 ms 77904 KB Output is correct
63 Correct 367 ms 77936 KB Output is correct
64 Correct 820 ms 203836 KB Output is correct
65 Correct 798 ms 198232 KB Output is correct
66 Correct 428 ms 120348 KB Output is correct
67 Correct 248 ms 68864 KB Output is correct
68 Correct 648 ms 115792 KB Output is correct
69 Correct 693 ms 126896 KB Output is correct
70 Correct 651 ms 112240 KB Output is correct