oj.uz

답안 #1026124

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1026124 2024-07-17T15:33:33 Z vanea 경주 (Race) (IOI11_race) C++14
21 / 100
 3000 ms 24148 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int mxN = 2e5+10;
const int mxK = 1e6+10;
const int INF = 1e9+10;
int ans = INF, k, mx;
int d[mxK];

vector<array<int, 2>> adj[mxN];

bool vis[mxN];
int sz[mxN];

void get_sz(int node, int p) {
    sz[node] = 1;
    for(auto [it, w] : adj[node]) {
        if(it == p || vis[it]) continue;
        get_sz(it, node);
        sz[node] += sz[it];
    }
}

int get_c(int node, int p, int n) {
    for(auto [it, w] : adj[node]) {
        if(vis[it] || it == p) continue;
        if(sz[it] * 2 > n) return get_c(it, node, p);
    }
    return node;
}

void get_min(int node, int p, bool filling, int dist, int s) {
    if(s > k) return ;
    mx = max(mx, s);
    if(filling) {
        d[s] = min(d[s], dist);
    }
    else {
        ans = min(ans, dist+d[k-s]);
    }
    for(auto [it, w] : adj[node]) {
        if(it == p || vis[it]) continue;
        get_min(it, node, filling, dist+1, s+w);
    }
}

void build(int node) {
    get_sz(node, -1);
    int c = get_c(node, -1, sz[node]);
    vis[c] = true;
    mx = 0;
    for(auto [it, w] : adj[c]) {
        if(vis[it]) continue;
        get_min(it, c, 0, 1, w);
        get_min(it, c, 1, 1, w);
    }
    fill(d, d+mx+1, INF);
    d[0] = 0;
    for(auto [it, w] : adj[c]) {
        if(vis[it]) continue;
        build(it);
    }
}

int best_path(int n, int K, int h[][2], int l[]) {
    for(int i = 0; i < n-1; i++) {
        adj[h[i][0]].push_back({h[i][1], l[i]});
        adj[h[i][1]].push_back({h[i][0], l[i]});
    }
    fill(d, d+mxK, INF);
    d[0] = 0;
    k = K;
    build(0);
    return (ans == INF ? -1 : ans);
}
/*
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout << best_path(11, 12, {{0, 1}, {0, 2}, {2, 3}, {3, 4}, {4, 5}, {0, 6},
                      {6, 7}, {6, 8}, {8, 9}, {8, 10}},
                      {3, 4, 5, 4, 6, 3, 2, 5, 6, 7});
}*/

Compilation message

race.cpp: In function 'void get_sz(int, int)':
race.cpp:18:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   18 |     for(auto [it, w] : adj[node]) {
      |              ^
race.cpp: In function 'int get_c(int, int, int)':
race.cpp:26:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   26 |     for(auto [it, w] : adj[node]) {
      |              ^
race.cpp: In function 'void get_min(int, int, bool, int, int)':
race.cpp:42:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   42 |     for(auto [it, w] : adj[node]) {
      |              ^
race.cpp: In function 'void build(int)':
race.cpp:53:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   53 |     for(auto [it, w] : adj[c]) {
      |              ^
race.cpp:60:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   60 |     for(auto [it, w] : adj[c]) {
      |              ^

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 13660 KB Output is correct
2 Correct 2 ms 13660 KB Output is correct
3 Correct 2 ms 13660 KB Output is correct
4 Correct 2 ms 13660 KB Output is correct
5 Correct 2 ms 13660 KB Output is correct
6 Correct 3 ms 13660 KB Output is correct
7 Correct 2 ms 13660 KB Output is correct
8 Correct 2 ms 13660 KB Output is correct
9 Correct 2 ms 13660 KB Output is correct
10 Correct 2 ms 13660 KB Output is correct
11 Correct 2 ms 13660 KB Output is correct
12 Correct 2 ms 13660 KB Output is correct
13 Correct 2 ms 13660 KB Output is correct
14 Correct 2 ms 13660 KB Output is correct
15 Correct 2 ms 13660 KB Output is correct
16 Correct 3 ms 13660 KB Output is correct
17 Correct 2 ms 13656 KB Output is correct
18 Correct 2 ms 13660 KB Output is correct
19 Correct 2 ms 13660 KB Output is correct
20 Correct 2 ms 13660 KB Output is correct
21 Correct 2 ms 13660 KB Output is correct
22 Correct 117 ms 13692 KB Output is correct
23 Correct 84 ms 13656 KB Output is correct
24 Correct 101 ms 13656 KB Output is correct
25 Correct 18 ms 13656 KB Output is correct
26 Correct 41 ms 13656 KB Output is correct
27 Correct 3 ms 13656 KB Output is correct
28 Correct 16 ms 13660 KB Output is correct
29 Correct 22 ms 13660 KB Output is correct
30 Correct 16 ms 13660 KB Output is correct
31 Correct 18 ms 13708 KB Output is correct
32 Correct 18 ms 13660 KB Output is correct
33 Correct 26 ms 13716 KB Output is correct
34 Correct 59 ms 13692 KB Output is correct
35 Correct 64 ms 13660 KB Output is correct
36 Correct 73 ms 13712 KB Output is correct
37 Correct 20 ms 13660 KB Output is correct
38 Correct 11 ms 13716 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 13660 KB Output is correct
2 Correct 2 ms 13660 KB Output is correct
3 Correct 2 ms 13660 KB Output is correct
4 Correct 2 ms 13660 KB Output is correct
5 Correct 2 ms 13660 KB Output is correct
6 Correct 3 ms 13660 KB Output is correct
7 Correct 2 ms 13660 KB Output is correct
8 Correct 2 ms 13660 KB Output is correct
9 Correct 2 ms 13660 KB Output is correct
10 Correct 2 ms 13660 KB Output is correct
11 Correct 2 ms 13660 KB Output is correct
12 Correct 2 ms 13660 KB Output is correct
13 Correct 2 ms 13660 KB Output is correct
14 Correct 2 ms 13660 KB Output is correct
15 Correct 2 ms 13660 KB Output is correct
16 Correct 3 ms 13660 KB Output is correct
17 Correct 2 ms 13656 KB Output is correct
18 Correct 2 ms 13660 KB Output is correct
19 Correct 448 ms 19796 KB Output is correct
20 Correct 500 ms 20560 KB Output is correct
21 Correct 775 ms 20308 KB Output is correct
22 Correct 74 ms 21072 KB Output is correct
23 Correct 42 ms 21240 KB Output is correct
24 Correct 32 ms 20856 KB Output is correct
25 Execution timed out 3037 ms 24148 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 13660 KB Output is correct
2 Correct 2 ms 13660 KB Output is correct
3 Correct 2 ms 13660 KB Output is correct
4 Correct 2 ms 13660 KB Output is correct
5 Correct 2 ms 13660 KB Output is correct
6 Correct 3 ms 13660 KB Output is correct
7 Correct 2 ms 13660 KB Output is correct
8 Correct 2 ms 13660 KB Output is correct
9 Correct 2 ms 13660 KB Output is correct
10 Correct 2 ms 13660 KB Output is correct
11 Correct 2 ms 13660 KB Output is correct
12 Correct 2 ms 13660 KB Output is correct
13 Correct 2 ms 13660 KB Output is correct
14 Correct 2 ms 13660 KB Output is correct
15 Correct 2 ms 13660 KB Output is correct
16 Correct 3 ms 13660 KB Output is correct
17 Correct 2 ms 13656 KB Output is correct
18 Correct 2 ms 13660 KB Output is correct
19 Correct 2 ms 13660 KB Output is correct
20 Correct 2 ms 13660 KB Output is correct
21 Correct 2 ms 13660 KB Output is correct
22 Correct 117 ms 13692 KB Output is correct
23 Correct 84 ms 13656 KB Output is correct
24 Correct 101 ms 13656 KB Output is correct
25 Correct 18 ms 13656 KB Output is correct
26 Correct 41 ms 13656 KB Output is correct
27 Correct 3 ms 13656 KB Output is correct
28 Correct 16 ms 13660 KB Output is correct
29 Correct 22 ms 13660 KB Output is correct
30 Correct 16 ms 13660 KB Output is correct
31 Correct 18 ms 13708 KB Output is correct
32 Correct 18 ms 13660 KB Output is correct
33 Correct 26 ms 13716 KB Output is correct
34 Correct 59 ms 13692 KB Output is correct
35 Correct 64 ms 13660 KB Output is correct
36 Correct 73 ms 13712 KB Output is correct
37 Correct 20 ms 13660 KB Output is correct
38 Correct 11 ms 13716 KB Output is correct
39 Correct 448 ms 19796 KB Output is correct
40 Correct 500 ms 20560 KB Output is correct
41 Correct 775 ms 20308 KB Output is correct
42 Correct 74 ms 21072 KB Output is correct
43 Correct 42 ms 21240 KB Output is correct
44 Correct 32 ms 20856 KB Output is correct
45 Execution timed out 3037 ms 24148 KB Time limit exceeded
46 Halted 0 ms 0 KB -