oj.uz

답안 #970222

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
970222 2024-04-26T08:34:21 Z rahidilbayramli 경주 (Race) (IOI11_race) C++17
100 / 100
 817 ms 204852 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

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 29784 KB Output is correct
2 Correct 8 ms 29788 KB Output is correct
3 Correct 8 ms 30040 KB Output is correct
4 Correct 8 ms 29884 KB Output is correct
5 Correct 7 ms 29788 KB Output is correct
6 Correct 8 ms 30040 KB Output is correct
7 Correct 8 ms 29920 KB Output is correct
8 Correct 7 ms 29788 KB Output is correct
9 Correct 7 ms 29788 KB Output is correct
10 Correct 7 ms 29904 KB Output is correct
11 Correct 8 ms 29788 KB Output is correct
12 Correct 7 ms 29788 KB Output is correct
13 Correct 7 ms 29784 KB Output is correct
14 Correct 7 ms 29788 KB Output is correct
15 Correct 7 ms 29788 KB Output is correct
16 Correct 7 ms 29784 KB Output is correct
17 Correct 7 ms 29788 KB Output is correct
18 Correct 8 ms 29788 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 29784 KB Output is correct
2 Correct 8 ms 29788 KB Output is correct
3 Correct 8 ms 30040 KB Output is correct
4 Correct 8 ms 29884 KB Output is correct
5 Correct 7 ms 29788 KB Output is correct
6 Correct 8 ms 30040 KB Output is correct
7 Correct 8 ms 29920 KB Output is correct
8 Correct 7 ms 29788 KB Output is correct
9 Correct 7 ms 29788 KB Output is correct
10 Correct 7 ms 29904 KB Output is correct
11 Correct 8 ms 29788 KB Output is correct
12 Correct 7 ms 29788 KB Output is correct
13 Correct 7 ms 29784 KB Output is correct
14 Correct 7 ms 29788 KB Output is correct
15 Correct 7 ms 29788 KB Output is correct
16 Correct 7 ms 29784 KB Output is correct
17 Correct 7 ms 29788 KB Output is correct
18 Correct 8 ms 29788 KB Output is correct
19 Correct 8 ms 29788 KB Output is correct
20 Correct 7 ms 29916 KB Output is correct
21 Correct 8 ms 30300 KB Output is correct
22 Correct 9 ms 30440 KB Output is correct
23 Correct 9 ms 30300 KB Output is correct
24 Correct 12 ms 30808 KB Output is correct
25 Correct 9 ms 30300 KB Output is correct
26 Correct 9 ms 30524 KB Output is correct
27 Correct 8 ms 30040 KB Output is correct
28 Correct 9 ms 30496 KB Output is correct
29 Correct 9 ms 30416 KB Output is correct
30 Correct 9 ms 30300 KB Output is correct
31 Correct 9 ms 30404 KB Output is correct
32 Correct 9 ms 30300 KB Output is correct
33 Correct 9 ms 30556 KB Output is correct
34 Correct 9 ms 30300 KB Output is correct
35 Correct 8 ms 30300 KB Output is correct
36 Correct 8 ms 30044 KB Output is correct
37 Correct 8 ms 30176 KB Output is correct
38 Correct 8 ms 30300 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 29784 KB Output is correct
2 Correct 8 ms 29788 KB Output is correct
3 Correct 8 ms 30040 KB Output is correct
4 Correct 8 ms 29884 KB Output is correct
5 Correct 7 ms 29788 KB Output is correct
6 Correct 8 ms 30040 KB Output is correct
7 Correct 8 ms 29920 KB Output is correct
8 Correct 7 ms 29788 KB Output is correct
9 Correct 7 ms 29788 KB Output is correct
10 Correct 7 ms 29904 KB Output is correct
11 Correct 8 ms 29788 KB Output is correct
12 Correct 7 ms 29788 KB Output is correct
13 Correct 7 ms 29784 KB Output is correct
14 Correct 7 ms 29788 KB Output is correct
15 Correct 7 ms 29788 KB Output is correct
16 Correct 7 ms 29784 KB Output is correct
17 Correct 7 ms 29788 KB Output is correct
18 Correct 8 ms 29788 KB Output is correct
19 Correct 200 ms 69408 KB Output is correct
20 Correct 227 ms 69968 KB Output is correct
21 Correct 199 ms 69460 KB Output is correct
22 Correct 193 ms 69136 KB Output is correct
23 Correct 298 ms 98128 KB Output is correct
24 Correct 228 ms 76904 KB Output is correct
25 Correct 126 ms 56816 KB Output is correct
26 Correct 62 ms 64084 KB Output is correct
27 Correct 276 ms 78844 KB Output is correct
28 Correct 340 ms 124244 KB Output is correct
29 Correct 372 ms 123936 KB Output is correct
30 Correct 257 ms 78932 KB Output is correct
31 Correct 285 ms 79340 KB Output is correct
32 Correct 370 ms 80068 KB Output is correct
33 Correct 336 ms 82696 KB Output is correct
34 Correct 582 ms 159828 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 29784 KB Output is correct
2 Correct 8 ms 29788 KB Output is correct
3 Correct 8 ms 30040 KB Output is correct
4 Correct 8 ms 29884 KB Output is correct
5 Correct 7 ms 29788 KB Output is correct
6 Correct 8 ms 30040 KB Output is correct
7 Correct 8 ms 29920 KB Output is correct
8 Correct 7 ms 29788 KB Output is correct
9 Correct 7 ms 29788 KB Output is correct
10 Correct 7 ms 29904 KB Output is correct
11 Correct 8 ms 29788 KB Output is correct
12 Correct 7 ms 29788 KB Output is correct
13 Correct 7 ms 29784 KB Output is correct
14 Correct 7 ms 29788 KB Output is correct
15 Correct 7 ms 29788 KB Output is correct
16 Correct 7 ms 29784 KB Output is correct
17 Correct 7 ms 29788 KB Output is correct
18 Correct 8 ms 29788 KB Output is correct
19 Correct 8 ms 29788 KB Output is correct
20 Correct 7 ms 29916 KB Output is correct
21 Correct 8 ms 30300 KB Output is correct
22 Correct 9 ms 30440 KB Output is correct
23 Correct 9 ms 30300 KB Output is correct
24 Correct 12 ms 30808 KB Output is correct
25 Correct 9 ms 30300 KB Output is correct
26 Correct 9 ms 30524 KB Output is correct
27 Correct 8 ms 30040 KB Output is correct
28 Correct 9 ms 30496 KB Output is correct
29 Correct 9 ms 30416 KB Output is correct
30 Correct 9 ms 30300 KB Output is correct
31 Correct 9 ms 30404 KB Output is correct
32 Correct 9 ms 30300 KB Output is correct
33 Correct 9 ms 30556 KB Output is correct
34 Correct 9 ms 30300 KB Output is correct
35 Correct 8 ms 30300 KB Output is correct
36 Correct 8 ms 30044 KB Output is correct
37 Correct 8 ms 30176 KB Output is correct
38 Correct 8 ms 30300 KB Output is correct
39 Correct 200 ms 69408 KB Output is correct
40 Correct 227 ms 69968 KB Output is correct
41 Correct 199 ms 69460 KB Output is correct
42 Correct 193 ms 69136 KB Output is correct
43 Correct 298 ms 98128 KB Output is correct
44 Correct 228 ms 76904 KB Output is correct
45 Correct 126 ms 56816 KB Output is correct
46 Correct 62 ms 64084 KB Output is correct
47 Correct 276 ms 78844 KB Output is correct
48 Correct 340 ms 124244 KB Output is correct
49 Correct 372 ms 123936 KB Output is correct
50 Correct 257 ms 78932 KB Output is correct
51 Correct 285 ms 79340 KB Output is correct
52 Correct 370 ms 80068 KB Output is correct
53 Correct 336 ms 82696 KB Output is correct
54 Correct 582 ms 159828 KB Output is correct
55 Correct 34 ms 35652 KB Output is correct
56 Correct 18 ms 32860 KB Output is correct
57 Correct 123 ms 65112 KB Output is correct
58 Correct 59 ms 51060 KB Output is correct
59 Correct 137 ms 78160 KB Output is correct
60 Correct 378 ms 123728 KB Output is correct
61 Correct 370 ms 86868 KB Output is correct
62 Correct 251 ms 79956 KB Output is correct
63 Correct 375 ms 79956 KB Output is correct
64 Correct 817 ms 204852 KB Output is correct
65 Correct 804 ms 201148 KB Output is correct
66 Correct 401 ms 120536 KB Output is correct
67 Correct 243 ms 71876 KB Output is correct
68 Correct 679 ms 118120 KB Output is correct
69 Correct 715 ms 126900 KB Output is correct
70 Correct 674 ms 114720 KB Output is correct