oj.uz

Submission #58653

# Submission time Handle Problem Language Result Execution time Memory
58653 2018-07-18T15:12:34 Z SpeedOfMagic Network (BOI15_net) C++17
100 / 100
 1079 ms 89248 KB 
/** MIT License Copyright (c) 2018 Vasilyev Daniil **/
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
template<typename T> using v = vector<T>;
#define int long long
typedef string str;
typedef vector<int> vint;
#define rep(a, l, r) for(int a = (l); a < (r); a++)
#define pb push_back
#define sz(a) ((int) a.size())
const long long inf = 4611686018427387903; //2^62 - 1
#if 0  //FileIO
const string fileName = "";
ifstream fin ((fileName == "" ? "input.txt"  : fileName + ".in" ));
ofstream fout((fileName == "" ? "output.txt" : fileName + ".out"));
#define get fin>>
#define put fout<<
#else
#define get cin>>
#define put cout<<
#endif
#define eol put endl
void read() {}     template<typename Arg,typename... Args> void read (Arg& arg,Args&... args){get (arg)     ;read(args...) ;}
void print(){}     template<typename Arg,typename... Args> void print(Arg  arg,Args...  args){put (arg)<<" ";print(args...);}
void debug(){eol;} template<typename Arg,typename... Args> void debug(Arg  arg,Args...  args){put (arg)<<" ";debug(args...);}
int getInt(){int a; get a; return a;}
//code goes here
const int N = 500001;
vint g[N];
v<pair<int, int>> ans;
vint dfs(int cur, int p = -1) {
    if (sz(g[cur]) == 1)
        return vint({cur});
    else {
        vint pos;
        for (int i : g[cur]) {
            if (i == p)
                continue;
            vint z = dfs(i, cur);

            if (sz(z) == 2 && sz(pos) == 1)
                for (int j : z)
                    if (pos.empty())
                        pos.pb(j);
                    else {
                        ans.pb({pos.back(), j});
                        pos.pop_back();
                    }
            else
                for (int j : z)
                    if (sz(pos) < 2)
                        pos.pb(j);
                    else {
                        ans.pb({pos.back(), j});
                        pos.pop_back();
                    }
        }

        if (p == -1) {
            if (sz(pos) == 2)
                ans.pb({pos[0], pos[1]});
            else if (g[pos[0]][0] != cur)
                ans.pb({pos[0], cur});
            else
                rep(i, 1, N)
                    if (pos[0] != i && g[pos[0]][0] != i) {
                        ans.pb({pos[0], i});
                        break;
                    }
        }

        return pos;
    }
}

void run() {
    int n;
    get n;
    n++;
    rep(i, 2, n) {
        int v, u;
        read(v, u);
        g[v].pb(u);
        g[u].pb(v);
    }

    rep(i, 1, n)
        if (sz(g[i]) != 1) {
            dfs(i);
            break;
        }

    put sz(ans);
    eol;
    for (auto i : ans)
        debug(i.first, i.second);
}

int32_t main() {srand(time(0)); ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); put fixed; put setprecision(15); run(); return 0;}

Subtask #1
18.0 / 18.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12024 KB Output is correct
2 Correct 13 ms 12268 KB Output is correct
3 Correct 12 ms 12332 KB Output is correct
4 Correct 14 ms 12332 KB Output is correct
5 Correct 13 ms 12332 KB Output is correct
6 Correct 14 ms 12332 KB Output is correct
7 Correct 14 ms 12332 KB Output is correct
8 Correct 13 ms 12332 KB Output is correct
9 Correct 13 ms 12332 KB Output is correct
10 Correct 12 ms 12332 KB Output is correct
11 Correct 12 ms 12408 KB Output is correct
12 Correct 14 ms 12408 KB Output is correct
13 Correct 14 ms 12408 KB Output is correct
14 Correct 13 ms 12408 KB Output is correct
15 Correct 13 ms 12408 KB Output is correct
16 Correct 13 ms 12408 KB Output is correct
17 Correct 15 ms 12408 KB Output is correct
18 Correct 15 ms 12408 KB Output is correct
19 Correct 13 ms 12408 KB Output is correct
20 Correct 15 ms 12408 KB Output is correct
21 Correct 16 ms 12408 KB Output is correct
22 Correct 17 ms 12472 KB Output is correct
23 Correct 19 ms 12500 KB Output is correct
24 Correct 18 ms 12540 KB Output is correct
25 Correct 20 ms 12576 KB Output is correct
26 Correct 17 ms 12576 KB Output is correct
27 Correct 18 ms 12648 KB Output is correct
28 Correct 18 ms 12684 KB Output is correct
29 Correct 17 ms 12684 KB Output is correct
30 Correct 14 ms 12684 KB Output is correct
31 Correct 21 ms 12684 KB Output is correct
32 Correct 17 ms 12684 KB Output is correct
33 Correct 13 ms 12684 KB Output is correct
34 Correct 17 ms 12684 KB Output is correct
35 Correct 15 ms 12684 KB Output is correct
36 Correct 15 ms 12684 KB Output is correct
37 Correct 16 ms 12708 KB Output is correct
38 Correct 15 ms 12844 KB Output is correct
39 Correct 15 ms 12844 KB Output is correct
40 Correct 13 ms 12844 KB Output is correct
41 Correct 14 ms 12844 KB Output is correct
42 Correct 13 ms 12844 KB Output is correct
43 Correct 13 ms 12844 KB Output is correct
44 Correct 14 ms 12844 KB Output is correct
45 Correct 14 ms 12844 KB Output is correct
46 Correct 16 ms 12844 KB Output is correct
47 Correct 17 ms 12844 KB Output is correct
48 Correct 15 ms 12844 KB Output is correct
49 Correct 17 ms 12844 KB Output is correct
50 Correct 15 ms 12844 KB Output is correct
51 Correct 15 ms 12844 KB Output is correct
52 Correct 17 ms 12844 KB Output is correct
53 Correct 15 ms 12844 KB Output is correct
54 Correct 17 ms 12844 KB Output is correct
55 Correct 15 ms 12844 KB Output is correct
56 Correct 13 ms 12844 KB Output is correct
57 Correct 14 ms 12844 KB Output is correct
58 Correct 17 ms 12844 KB Output is correct

Subtask #3
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12024 KB Output is correct
2 Correct 13 ms 12268 KB Output is correct
3 Correct 12 ms 12332 KB Output is correct
4 Correct 14 ms 12332 KB Output is correct
5 Correct 13 ms 12332 KB Output is correct
6 Correct 14 ms 12332 KB Output is correct
7 Correct 14 ms 12332 KB Output is correct
8 Correct 13 ms 12332 KB Output is correct
9 Correct 13 ms 12332 KB Output is correct
10 Correct 12 ms 12332 KB Output is correct
11 Correct 12 ms 12408 KB Output is correct
12 Correct 14 ms 12408 KB Output is correct
13 Correct 14 ms 12408 KB Output is correct
14 Correct 13 ms 12408 KB Output is correct
15 Correct 13 ms 12408 KB Output is correct
16 Correct 13 ms 12408 KB Output is correct
17 Correct 15 ms 12408 KB Output is correct
18 Correct 15 ms 12408 KB Output is correct
19 Correct 13 ms 12408 KB Output is correct
20 Correct 15 ms 12408 KB Output is correct
21 Correct 16 ms 12408 KB Output is correct
22 Correct 17 ms 12472 KB Output is correct
23 Correct 19 ms 12500 KB Output is correct
24 Correct 18 ms 12540 KB Output is correct
25 Correct 20 ms 12576 KB Output is correct
26 Correct 17 ms 12576 KB Output is correct
27 Correct 18 ms 12648 KB Output is correct
28 Correct 18 ms 12684 KB Output is correct
29 Correct 17 ms 12684 KB Output is correct
30 Correct 14 ms 12684 KB Output is correct
31 Correct 21 ms 12684 KB Output is correct
32 Correct 17 ms 12684 KB Output is correct
33 Correct 13 ms 12684 KB Output is correct
34 Correct 17 ms 12684 KB Output is correct
35 Correct 15 ms 12684 KB Output is correct
36 Correct 15 ms 12684 KB Output is correct
37 Correct 16 ms 12708 KB Output is correct
38 Correct 15 ms 12844 KB Output is correct
39 Correct 15 ms 12844 KB Output is correct
40 Correct 13 ms 12844 KB Output is correct
41 Correct 14 ms 12844 KB Output is correct
42 Correct 13 ms 12844 KB Output is correct
43 Correct 13 ms 12844 KB Output is correct
44 Correct 14 ms 12844 KB Output is correct
45 Correct 14 ms 12844 KB Output is correct
46 Correct 16 ms 12844 KB Output is correct
47 Correct 17 ms 12844 KB Output is correct
48 Correct 15 ms 12844 KB Output is correct
49 Correct 17 ms 12844 KB Output is correct
50 Correct 15 ms 12844 KB Output is correct
51 Correct 15 ms 12844 KB Output is correct
52 Correct 17 ms 12844 KB Output is correct
53 Correct 15 ms 12844 KB Output is correct
54 Correct 17 ms 12844 KB Output is correct
55 Correct 15 ms 12844 KB Output is correct
56 Correct 13 ms 12844 KB Output is correct
57 Correct 14 ms 12844 KB Output is correct
58 Correct 17 ms 12844 KB Output is correct
59 Correct 944 ms 38672 KB Output is correct
60 Correct 1046 ms 40844 KB Output is correct
61 Correct 14 ms 40844 KB Output is correct
62 Correct 13 ms 40844 KB Output is correct
63 Correct 797 ms 40844 KB Output is correct
64 Correct 19 ms 40844 KB Output is correct
65 Correct 32 ms 40844 KB Output is correct
66 Correct 285 ms 50848 KB Output is correct
67 Correct 877 ms 77920 KB Output is correct
68 Correct 841 ms 80348 KB Output is correct
69 Correct 35 ms 80348 KB Output is correct
70 Correct 275 ms 80348 KB Output is correct
71 Correct 891 ms 80348 KB Output is correct
72 Correct 959 ms 80348 KB Output is correct
73 Correct 278 ms 80348 KB Output is correct
74 Correct 883 ms 80348 KB Output is correct
75 Correct 83 ms 80348 KB Output is correct
76 Correct 799 ms 80348 KB Output is correct
77 Correct 937 ms 80348 KB Output is correct
78 Correct 71 ms 80348 KB Output is correct
79 Correct 757 ms 80348 KB Output is correct
80 Correct 20 ms 80348 KB Output is correct
81 Correct 343 ms 80348 KB Output is correct
82 Correct 914 ms 80348 KB Output is correct
83 Correct 965 ms 80348 KB Output is correct
84 Correct 1000 ms 80348 KB Output is correct
85 Correct 855 ms 80348 KB Output is correct
86 Correct 1006 ms 82640 KB Output is correct
87 Correct 1079 ms 89248 KB Output is correct