oj.uz

Submission #342999

# Submission time Handle Problem Language Result Execution time Memory
342999 2021-01-03T10:41:07 Z mjhmjh1104 Village (BOI20_village) C++14
25 / 100
 15 ms 748 KB 
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

const int MAX = 1006;

int n, maxDepth[MAX], depth[MAX], childs[MAX];
vector<int> adj[MAX], c[MAX];
int nextShort[MAX], e[MAX], resShort;
int nextLong[MAX], resLong;
bool visited[MAX];

void dfs(int x, int prev = -1) {
    for (auto &i: adj[x]) if (i != prev) {
        c[x].push_back(i);
        dfs(i, x);
    }
}

void dfsShort(int x) {
    e[x] = x;
    vector<int> zero;
    for (auto &i: c[x]) {
        if (!childs[i]) zero.push_back(i), e[x] = i;
        else {
            dfsShort(i);
            if (childs[i]) childs[x]--;
            else zero.push_back(i), e[x] = i;
        }
    }
    if (!childs[x]) return;
    if (zero.empty()) return;
    nextShort[x] = zero[0];
    for (int i = 0; i < (int)zero.size(); i++) {
        if (i != (int)zero.size() - 1) nextShort[zero[i]] = zero[i + 1];
        else nextShort[zero[i]] = x;
        resShort += 2;
    }
}

void depthFrom(int x, int prev = -1) {
    maxDepth[x] = depth[x];
    for (auto &i: adj[x]) if (i != prev && !visited[i]) {
        depth[i] = depth[x] + 1;
        depthFrom(i, x);
        maxDepth[x] = max(maxDepth[x], maxDepth[i]);
    }
}

pair<int, int> farthest(int x, int prev = -1) {
    for (auto &i: adj[x]) if (i != prev && !visited[i]) {
        if (maxDepth[i] == maxDepth[x]) {
            pair<int, int> t = farthest(i, x);
            return { t.first, t.second + 1 };
        }
    }
    return { x, 0 };
}

int main() {
    scanf("%d", &n);
    fill(nextShort, nextShort + n, -1);
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        scanf("%d%d", &u, &v);
        u--, v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    dfs(0);
    for (int i = 0; i < n; i++) childs[i] = (int)c[i].size();
    dfsShort(0);
    if (nextShort[0] == -1) {
        nextShort[0] = c[0][0];
        nextShort[e[c[0][0]]] = 0;
        resShort += 2;
    }
    visited[0] = true;
    int k = 0;
    for (int i = 0; i < n - 1; i++) {
        depth[k] = 0;
        depthFrom(k);
        pair<int, int> t = farthest(k);
        nextLong[k] = t.first;
        resLong += t.second;
        k = t.first;
        visited[k] = true;
    }
    for (int i = 0; i < n; i++) visited[i] = false;
    depth[k] = 0;
    depthFrom(k);
    nextLong[k] = 0;
    resLong += depth[0];
    printf("%d %d\n", resShort, resLong);
    for (int i = 0; i < n; i++) printf("%d ", nextShort[i] + 1);
    puts("");
    for (int i = 0; i < n; i++) printf("%d ", nextLong[i] + 1);
}

Compilation message

Village.cpp: In function 'int main()':
Village.cpp:62:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   62 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
Village.cpp:66:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   66 |         scanf("%d%d", &u, &v);
      |         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
6.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Partially correct 0 ms 364 KB Partially correct
5 Partially correct 0 ms 364 KB Partially correct
6 Partially correct 0 ms 364 KB Partially correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Partially correct 0 ms 364 KB Partially correct
11 Correct 1 ms 364 KB Output is correct
12 Partially correct 0 ms 364 KB Partially correct
13 Partially correct 1 ms 364 KB Partially correct
14 Correct 0 ms 364 KB Output is correct
15 Partially correct 0 ms 364 KB Partially correct
16 Partially correct 0 ms 364 KB Partially correct
17 Partially correct 0 ms 364 KB Partially correct

Subtask #2
19.0 / 38.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 364 KB Partially correct
2 Partially correct 3 ms 364 KB Partially correct
3 Correct 3 ms 364 KB Output is correct
4 Partially correct 11 ms 364 KB Partially correct
5 Partially correct 8 ms 364 KB Partially correct
6 Partially correct 11 ms 364 KB Partially correct
7 Partially correct 9 ms 492 KB Partially correct
8 Partially correct 13 ms 492 KB Partially correct
9 Partially correct 10 ms 492 KB Partially correct
10 Correct 15 ms 492 KB Output is correct
11 Correct 13 ms 492 KB Output is correct
12 Correct 8 ms 364 KB Output is correct
13 Correct 8 ms 364 KB Output is correct
14 Correct 8 ms 364 KB Output is correct
15 Correct 6 ms 364 KB Output is correct
16 Partially correct 2 ms 364 KB Partially correct
17 Partially correct 9 ms 364 KB Partially correct
18 Correct 8 ms 364 KB Output is correct
19 Correct 8 ms 364 KB Output is correct
20 Correct 8 ms 364 KB Output is correct
21 Correct 8 ms 364 KB Output is correct
22 Correct 8 ms 364 KB Output is correct
23 Partially correct 9 ms 364 KB Partially correct
24 Partially correct 9 ms 364 KB Partially correct
25 Partially correct 3 ms 364 KB Partially correct
26 Partially correct 11 ms 364 KB Partially correct
27 Correct 3 ms 364 KB Output is correct
28 Partially correct 10 ms 364 KB Partially correct
29 Correct 9 ms 364 KB Output is correct
30 Partially correct 6 ms 364 KB Partially correct

Subtask #3
0.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Partially correct 0 ms 364 KB Partially correct
5 Partially correct 0 ms 364 KB Partially correct
6 Partially correct 0 ms 364 KB Partially correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Partially correct 0 ms 364 KB Partially correct
11 Correct 1 ms 364 KB Output is correct
12 Partially correct 0 ms 364 KB Partially correct
13 Partially correct 1 ms 364 KB Partially correct
14 Correct 0 ms 364 KB Output is correct
15 Partially correct 0 ms 364 KB Partially correct
16 Partially correct 0 ms 364 KB Partially correct
17 Partially correct 0 ms 364 KB Partially correct
18 Partially correct 1 ms 364 KB Partially correct
19 Partially correct 3 ms 364 KB Partially correct
20 Correct 3 ms 364 KB Output is correct
21 Partially correct 11 ms 364 KB Partially correct
22 Partially correct 8 ms 364 KB Partially correct
23 Partially correct 11 ms 364 KB Partially correct
24 Partially correct 9 ms 492 KB Partially correct
25 Partially correct 13 ms 492 KB Partially correct
26 Partially correct 10 ms 492 KB Partially correct
27 Correct 15 ms 492 KB Output is correct
28 Correct 13 ms 492 KB Output is correct
29 Correct 8 ms 364 KB Output is correct
30 Correct 8 ms 364 KB Output is correct
31 Correct 8 ms 364 KB Output is correct
32 Correct 6 ms 364 KB Output is correct
33 Partially correct 2 ms 364 KB Partially correct
34 Partially correct 9 ms 364 KB Partially correct
35 Correct 8 ms 364 KB Output is correct
36 Correct 8 ms 364 KB Output is correct
37 Correct 8 ms 364 KB Output is correct
38 Correct 8 ms 364 KB Output is correct
39 Correct 8 ms 364 KB Output is correct
40 Partially correct 9 ms 364 KB Partially correct
41 Partially correct 9 ms 364 KB Partially correct
42 Partially correct 3 ms 364 KB Partially correct
43 Partially correct 11 ms 364 KB Partially correct
44 Correct 3 ms 364 KB Output is correct
45 Partially correct 10 ms 364 KB Partially correct
46 Correct 9 ms 364 KB Output is correct
47 Partially correct 6 ms 364 KB Partially correct
48 Runtime error 1 ms 748 KB Execution killed with signal 11 (could be triggered by violating memory limits)
49 Halted 0 ms 0 KB -