oj.uz

Submission #810683

# Submission time Handle Problem Language Result Execution time Memory
810683 2023-08-06T14:06:00 Z RecursiveCo Network (BOI15_net) C++14
100 / 100
 445 ms 108636 KB 
// CF template, version 3.0

#include <bits/stdc++.h>

using namespace std;

#define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0)
#define getTest int t; cin >> t
#define eachTest for (int _var=0;_var<t;_var++)
#define get(name) int (name); cin >> (name)
#define out(o) cout << (o)
#define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
#define sortl(name) sort((name).begin(), (name).end())
#define rev(name) reverse((name).begin(), (name).end())
#define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
#define decision(b) if (b){out("YES");}else{out("NO");}

#define int long long int

vector<vector<int>> subleaves;
vector<bool> visited;
vector<bool> leaf;
vector<vector<int>> adjList;

void dfs(int v, int p) {
    visited[v] = true;
    if (p != -1 && leaf[v]) subleaves[p].push_back(v);
    for (int con: adjList[v]) {
        if (!visited[con]) {
            dfs(con, p == -1? con: p);
        }
    }
}

signed main() {
    improvePerformance;

    get(n);
    adjList.resize(n);
    forto(n - 1, i) {
        get(a);
        get(b);
        a--;
        b--;
        adjList[a].push_back(b);
        adjList[b].push_back(a);
    }
    leaf.resize(n, false);
    int leaves = 0;
    forto(n, i) {
        if (adjList[i].size() == 1) leaf[i] = true, leaves++;
    }
    // we choose to root the tree at some non-leaf
    int root = -1;
    forto(n, i) {
        if (adjList[i].size() != 1) {
            root = i;
            break;
        }
    }
    vector<pair<int, int>> edges;
    subleaves.resize(n);
    visited.resize(n, false);
    dfs(root, -1);
    vector<vector<int>> leafvecs;
    forto(n, i) {
        if (!subleaves[i].empty()) {
            leafvecs.push_back(subleaves[i]);
        }
    }
    vector<int> all;
    for (auto vec: leafvecs) {
        for (int node: vec) all.push_back(node);
    }
    forto(all.size() / 2, i) {
        edges.push_back({all[i], all[i + all.size() / 2]});
    }
    if (all.size() % 2) {
        edges.push_back({all[0], all.back()});
    }
    out(edges.size());
    for (auto edge: edges) {
        out("\n");
        out(edge.first + 1);
        out(" ");
        out(edge.second + 1);
    }
}

Compilation message

net.cpp: In function 'int main()':
net.cpp:10:23: warning: unnecessary parentheses in declaration of 'n' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
net.cpp:38:5: note: in expansion of macro 'get'
   38 |     get(n);
      |     ^~~
net.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
net.cpp:40:5: note: in expansion of macro 'forto'
   40 |     forto(n - 1, i) {
      |     ^~~~~
net.cpp:10:23: warning: unnecessary parentheses in declaration of 'a' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
net.cpp:41:9: note: in expansion of macro 'get'
   41 |         get(a);
      |         ^~~
net.cpp:10:23: warning: unnecessary parentheses in declaration of 'b' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
net.cpp:42:9: note: in expansion of macro 'get'
   42 |         get(b);
      |         ^~~
net.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
net.cpp:50:5: note: in expansion of macro 'forto'
   50 |     forto(n, i) {
      |     ^~~~~
net.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
net.cpp:55:5: note: in expansion of macro 'forto'
   55 |     forto(n, i) {
      |     ^~~~~
net.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
net.cpp:66:5: note: in expansion of macro 'forto'
   66 |     forto(n, i) {
      |     ^~~~~
net.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
net.cpp:75:5: note: in expansion of macro 'forto'
   75 |     forto(all.size() / 2, i) {
      |     ^~~~~
net.cpp:15:52: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                              ~~~~~~^~~~~~~~
net.cpp:75:5: note: in expansion of macro 'forto'
   75 |     forto(all.size() / 2, i) {
      |     ^~~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 320 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 324 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 316 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 0 ms 320 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 596 KB Output is correct

Subtask #3
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 320 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 324 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 316 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 0 ms 320 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 596 KB Output is correct
59 Correct 353 ms 61064 KB Output is correct
60 Correct 399 ms 67052 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 245 ms 54856 KB Output is correct
64 Correct 2 ms 980 KB Output is correct
65 Correct 8 ms 3668 KB Output is correct
66 Correct 81 ms 27248 KB Output is correct
67 Correct 445 ms 62976 KB Output is correct
68 Correct 413 ms 65600 KB Output is correct
69 Correct 5 ms 2400 KB Output is correct
70 Correct 64 ms 23404 KB Output is correct
71 Correct 426 ms 108636 KB Output is correct
72 Correct 265 ms 70628 KB Output is correct
73 Correct 60 ms 16948 KB Output is correct
74 Correct 360 ms 60908 KB Output is correct
75 Correct 16 ms 8116 KB Output is correct
76 Correct 292 ms 72424 KB Output is correct
77 Correct 330 ms 90764 KB Output is correct
78 Correct 19 ms 7380 KB Output is correct
79 Correct 394 ms 60588 KB Output is correct
80 Correct 2 ms 852 KB Output is correct
81 Correct 65 ms 22720 KB Output is correct
82 Correct 316 ms 67908 KB Output is correct
83 Correct 345 ms 60828 KB Output is correct
84 Correct 361 ms 60760 KB Output is correct
85 Correct 344 ms 60772 KB Output is correct
86 Correct 342 ms 67120 KB Output is correct
87 Correct 342 ms 67132 KB Output is correct