oj.uz

Submission #713329

# Submission time Handle Problem Language Result Execution time Memory
713329 2023-03-21T17:11:15 Z Spade1 Race (IOI11_race) C++14
21 / 100
 3000 ms 15628 KB 
#include <bits/stdc++.h>
#include "race.h"
//#include "grader.cpp"
#define pii pair<int, int>
#define pb push_back
#define st first
#define nd second
using namespace std;

const int maxN = 2e5 + 10;
const int maxL = 1e6 + 10;

vector<pii> adj[maxN];
int sz[maxN], mn = INT_MAX, k, path[maxL];
bool mark[maxN];

int dfs(int i, int prt=0) {
    sz[i] = 1;
    for (auto [j, w] : adj[i]) {
        if (j == prt || mark[j]) continue;
        sz[i] += dfs(j, i);
    }
    return sz[i];
}

int find_centroid(int i, int n, int prt=0) {
    for (auto [j, w] : adj[i]) {
        if (j == prt || mark[j]) continue;
        if (sz[j] > n/2) return find_centroid(j, n, i);
    }
    return i;
}

void dfs2(int i, int prt, bool filling, int dis, int cnt=1) {
    if (dis > k) return;
    if (filling) path[dis] = min(path[dis], cnt);
    else if (path[k-dis] != INT_MAX) mn = min(mn, cnt+path[k-dis]);
    for (auto [j, w] : adj[i]) {
        if (j == prt || mark[j]) continue;
        dfs2(j, i, filling, dis+w, cnt+1);
    }
}

void decom(int x=0) {
    int cen = find_centroid(x, dfs(x));
    mark[cen] = 1;

    for (auto [j, w] : adj[cen]) {
        if (mark[j]) continue;
        dfs2(j, cen, 0, w);
        dfs2(j, cen, 1, w);
    }
    for (int i = 1; i < maxL; ++i) path[i] = INT_MAX;
    for (auto [j, w] : adj[cen]) {
        if (!mark[j]) decom(j);
    }
}

int best_path(int N, int K, int H[][2], int L[]) {
    k = K;
    for (int i = 0; i < N-1; ++i) {
        adj[H[i][0]].pb({H[i][1], L[i]});
        adj[H[i][1]].pb({H[i][0], L[i]});
    }
    for (int i = 1; i < maxL; ++i) path[i] = INT_MAX;
    path[0] = 0;
    decom();
    return (mn == INT_MAX ? -1 : mn);
}
/*
11 12
0 1 3
0 2 4
2 3 5
3 4 4
4 5 6
0 6 3
6 7 2
6 8 5
8 9 6
8 10 7
2
*/

Compilation message

race.cpp: In function 'int dfs(int, int)':
race.cpp:19:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   19 |     for (auto [j, w] : adj[i]) {
      |               ^
race.cpp: In function 'int find_centroid(int, int, int)':
race.cpp:27:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   27 |     for (auto [j, w] : adj[i]) {
      |               ^
race.cpp: In function 'void dfs2(int, int, bool, int, int)':
race.cpp:38:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   38 |     for (auto [j, w] : adj[i]) {
      |               ^
race.cpp: In function 'void decom(int)':
race.cpp:48:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   48 |     for (auto [j, w] : adj[cen]) {
      |               ^
race.cpp:54:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   54 |     for (auto [j, w] : adj[cen]) {
      |               ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 8916 KB Output is correct
2 Correct 41 ms 8848 KB Output is correct
3 Correct 45 ms 8924 KB Output is correct
4 Correct 55 ms 8848 KB Output is correct
5 Correct 48 ms 8916 KB Output is correct
6 Correct 45 ms 8940 KB Output is correct
7 Correct 42 ms 8928 KB Output is correct
8 Correct 41 ms 8920 KB Output is correct
9 Correct 45 ms 8924 KB Output is correct
10 Correct 45 ms 8932 KB Output is correct
11 Correct 42 ms 8920 KB Output is correct
12 Correct 38 ms 8916 KB Output is correct
13 Correct 41 ms 8916 KB Output is correct
14 Correct 39 ms 8940 KB Output is correct
15 Correct 47 ms 8916 KB Output is correct
16 Correct 67 ms 8916 KB Output is correct
17 Correct 44 ms 8916 KB Output is correct
18 Correct 39 ms 8928 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 8916 KB Output is correct
2 Correct 41 ms 8848 KB Output is correct
3 Correct 45 ms 8924 KB Output is correct
4 Correct 55 ms 8848 KB Output is correct
5 Correct 48 ms 8916 KB Output is correct
6 Correct 45 ms 8940 KB Output is correct
7 Correct 42 ms 8928 KB Output is correct
8 Correct 41 ms 8920 KB Output is correct
9 Correct 45 ms 8924 KB Output is correct
10 Correct 45 ms 8932 KB Output is correct
11 Correct 42 ms 8920 KB Output is correct
12 Correct 38 ms 8916 KB Output is correct
13 Correct 41 ms 8916 KB Output is correct
14 Correct 39 ms 8940 KB Output is correct
15 Correct 47 ms 8916 KB Output is correct
16 Correct 67 ms 8916 KB Output is correct
17 Correct 44 ms 8916 KB Output is correct
18 Correct 39 ms 8928 KB Output is correct
19 Correct 9 ms 8916 KB Output is correct
20 Correct 52 ms 8920 KB Output is correct
21 Correct 403 ms 9108 KB Output is correct
22 Correct 425 ms 8916 KB Output is correct
23 Correct 373 ms 9036 KB Output is correct
24 Correct 384 ms 8916 KB Output is correct
25 Correct 370 ms 8988 KB Output is correct
26 Correct 372 ms 9104 KB Output is correct
27 Correct 404 ms 8980 KB Output is correct
28 Correct 354 ms 9036 KB Output is correct
29 Correct 375 ms 9036 KB Output is correct
30 Correct 353 ms 8984 KB Output is correct
31 Correct 373 ms 8980 KB Output is correct
32 Correct 374 ms 8984 KB Output is correct
33 Correct 376 ms 8988 KB Output is correct
34 Correct 332 ms 8988 KB Output is correct
35 Correct 351 ms 8992 KB Output is correct
36 Correct 294 ms 8992 KB Output is correct
37 Correct 295 ms 8988 KB Output is correct
38 Correct 367 ms 8916 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 8916 KB Output is correct
2 Correct 41 ms 8848 KB Output is correct
3 Correct 45 ms 8924 KB Output is correct
4 Correct 55 ms 8848 KB Output is correct
5 Correct 48 ms 8916 KB Output is correct
6 Correct 45 ms 8940 KB Output is correct
7 Correct 42 ms 8928 KB Output is correct
8 Correct 41 ms 8920 KB Output is correct
9 Correct 45 ms 8924 KB Output is correct
10 Correct 45 ms 8932 KB Output is correct
11 Correct 42 ms 8920 KB Output is correct
12 Correct 38 ms 8916 KB Output is correct
13 Correct 41 ms 8916 KB Output is correct
14 Correct 39 ms 8940 KB Output is correct
15 Correct 47 ms 8916 KB Output is correct
16 Correct 67 ms 8916 KB Output is correct
17 Correct 44 ms 8916 KB Output is correct
18 Correct 39 ms 8928 KB Output is correct
19 Execution timed out 3034 ms 15628 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 8916 KB Output is correct
2 Correct 41 ms 8848 KB Output is correct
3 Correct 45 ms 8924 KB Output is correct
4 Correct 55 ms 8848 KB Output is correct
5 Correct 48 ms 8916 KB Output is correct
6 Correct 45 ms 8940 KB Output is correct
7 Correct 42 ms 8928 KB Output is correct
8 Correct 41 ms 8920 KB Output is correct
9 Correct 45 ms 8924 KB Output is correct
10 Correct 45 ms 8932 KB Output is correct
11 Correct 42 ms 8920 KB Output is correct
12 Correct 38 ms 8916 KB Output is correct
13 Correct 41 ms 8916 KB Output is correct
14 Correct 39 ms 8940 KB Output is correct
15 Correct 47 ms 8916 KB Output is correct
16 Correct 67 ms 8916 KB Output is correct
17 Correct 44 ms 8916 KB Output is correct
18 Correct 39 ms 8928 KB Output is correct
19 Correct 9 ms 8916 KB Output is correct
20 Correct 52 ms 8920 KB Output is correct
21 Correct 403 ms 9108 KB Output is correct
22 Correct 425 ms 8916 KB Output is correct
23 Correct 373 ms 9036 KB Output is correct
24 Correct 384 ms 8916 KB Output is correct
25 Correct 370 ms 8988 KB Output is correct
26 Correct 372 ms 9104 KB Output is correct
27 Correct 404 ms 8980 KB Output is correct
28 Correct 354 ms 9036 KB Output is correct
29 Correct 375 ms 9036 KB Output is correct
30 Correct 353 ms 8984 KB Output is correct
31 Correct 373 ms 8980 KB Output is correct
32 Correct 374 ms 8984 KB Output is correct
33 Correct 376 ms 8988 KB Output is correct
34 Correct 332 ms 8988 KB Output is correct
35 Correct 351 ms 8992 KB Output is correct
36 Correct 294 ms 8992 KB Output is correct
37 Correct 295 ms 8988 KB Output is correct
38 Correct 367 ms 8916 KB Output is correct
39 Execution timed out 3034 ms 15628 KB Time limit exceeded
40 Halted 0 ms 0 KB -