oj.uz

Submission #713331

# Submission time Handle Problem Language Result Execution time Memory
713331 2023-03-21T17:12:58 Z Spade1 Race (IOI11_race) C++14
21 / 100
 3000 ms 18040 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;
vector<int> path(maxL, INT_MAX), tmp(maxL, INT_MAX);
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);
    }
    path = tmp;
    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]});
    }
    tmp[0] = 0;
    path = tmp;
    decom();
    return (mn == INT_MAX ? -1 : mn);
}

Compilation message

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 12756 KB Output is correct
2 Correct 55 ms 12852 KB Output is correct
3 Correct 46 ms 12880 KB Output is correct
4 Correct 42 ms 12848 KB Output is correct
5 Correct 42 ms 12844 KB Output is correct
6 Correct 41 ms 12756 KB Output is correct
7 Correct 39 ms 12756 KB Output is correct
8 Correct 35 ms 12852 KB Output is correct
9 Correct 45 ms 12844 KB Output is correct
10 Correct 41 ms 12756 KB Output is correct
11 Correct 44 ms 12756 KB Output is correct
12 Correct 43 ms 12756 KB Output is correct
13 Correct 47 ms 12756 KB Output is correct
14 Correct 50 ms 12844 KB Output is correct
15 Correct 39 ms 12756 KB Output is correct
16 Correct 44 ms 12756 KB Output is correct
17 Correct 43 ms 12756 KB Output is correct
18 Correct 36 ms 12756 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 12756 KB Output is correct
2 Correct 55 ms 12852 KB Output is correct
3 Correct 46 ms 12880 KB Output is correct
4 Correct 42 ms 12848 KB Output is correct
5 Correct 42 ms 12844 KB Output is correct
6 Correct 41 ms 12756 KB Output is correct
7 Correct 39 ms 12756 KB Output is correct
8 Correct 35 ms 12852 KB Output is correct
9 Correct 45 ms 12844 KB Output is correct
10 Correct 41 ms 12756 KB Output is correct
11 Correct 44 ms 12756 KB Output is correct
12 Correct 43 ms 12756 KB Output is correct
13 Correct 47 ms 12756 KB Output is correct
14 Correct 50 ms 12844 KB Output is correct
15 Correct 39 ms 12756 KB Output is correct
16 Correct 44 ms 12756 KB Output is correct
17 Correct 43 ms 12756 KB Output is correct
18 Correct 36 ms 12756 KB Output is correct
19 Correct 14 ms 12816 KB Output is correct
20 Correct 41 ms 12756 KB Output is correct
21 Correct 394 ms 12892 KB Output is correct
22 Correct 346 ms 12900 KB Output is correct
23 Correct 388 ms 12888 KB Output is correct
24 Correct 346 ms 12896 KB Output is correct
25 Correct 411 ms 12892 KB Output is correct
26 Correct 335 ms 12896 KB Output is correct
27 Correct 369 ms 12892 KB Output is correct
28 Correct 323 ms 12896 KB Output is correct
29 Correct 371 ms 12896 KB Output is correct
30 Correct 332 ms 12892 KB Output is correct
31 Correct 410 ms 12892 KB Output is correct
32 Correct 324 ms 12892 KB Output is correct
33 Correct 407 ms 12888 KB Output is correct
34 Correct 331 ms 12896 KB Output is correct
35 Correct 320 ms 12900 KB Output is correct
36 Correct 325 ms 12900 KB Output is correct
37 Correct 330 ms 12896 KB Output is correct
38 Correct 331 ms 12884 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 12756 KB Output is correct
2 Correct 55 ms 12852 KB Output is correct
3 Correct 46 ms 12880 KB Output is correct
4 Correct 42 ms 12848 KB Output is correct
5 Correct 42 ms 12844 KB Output is correct
6 Correct 41 ms 12756 KB Output is correct
7 Correct 39 ms 12756 KB Output is correct
8 Correct 35 ms 12852 KB Output is correct
9 Correct 45 ms 12844 KB Output is correct
10 Correct 41 ms 12756 KB Output is correct
11 Correct 44 ms 12756 KB Output is correct
12 Correct 43 ms 12756 KB Output is correct
13 Correct 47 ms 12756 KB Output is correct
14 Correct 50 ms 12844 KB Output is correct
15 Correct 39 ms 12756 KB Output is correct
16 Correct 44 ms 12756 KB Output is correct
17 Correct 43 ms 12756 KB Output is correct
18 Correct 36 ms 12756 KB Output is correct
19 Execution timed out 3083 ms 18040 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 12756 KB Output is correct
2 Correct 55 ms 12852 KB Output is correct
3 Correct 46 ms 12880 KB Output is correct
4 Correct 42 ms 12848 KB Output is correct
5 Correct 42 ms 12844 KB Output is correct
6 Correct 41 ms 12756 KB Output is correct
7 Correct 39 ms 12756 KB Output is correct
8 Correct 35 ms 12852 KB Output is correct
9 Correct 45 ms 12844 KB Output is correct
10 Correct 41 ms 12756 KB Output is correct
11 Correct 44 ms 12756 KB Output is correct
12 Correct 43 ms 12756 KB Output is correct
13 Correct 47 ms 12756 KB Output is correct
14 Correct 50 ms 12844 KB Output is correct
15 Correct 39 ms 12756 KB Output is correct
16 Correct 44 ms 12756 KB Output is correct
17 Correct 43 ms 12756 KB Output is correct
18 Correct 36 ms 12756 KB Output is correct
19 Correct 14 ms 12816 KB Output is correct
20 Correct 41 ms 12756 KB Output is correct
21 Correct 394 ms 12892 KB Output is correct
22 Correct 346 ms 12900 KB Output is correct
23 Correct 388 ms 12888 KB Output is correct
24 Correct 346 ms 12896 KB Output is correct
25 Correct 411 ms 12892 KB Output is correct
26 Correct 335 ms 12896 KB Output is correct
27 Correct 369 ms 12892 KB Output is correct
28 Correct 323 ms 12896 KB Output is correct
29 Correct 371 ms 12896 KB Output is correct
30 Correct 332 ms 12892 KB Output is correct
31 Correct 410 ms 12892 KB Output is correct
32 Correct 324 ms 12892 KB Output is correct
33 Correct 407 ms 12888 KB Output is correct
34 Correct 331 ms 12896 KB Output is correct
35 Correct 320 ms 12900 KB Output is correct
36 Correct 325 ms 12900 KB Output is correct
37 Correct 330 ms 12896 KB Output is correct
38 Correct 331 ms 12884 KB Output is correct
39 Execution timed out 3083 ms 18040 KB Time limit exceeded
40 Halted 0 ms 0 KB -