oj.uz

답안 #805144

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
805144 2023-08-03T13:23:19 Z TB_ Village (BOI20_village) C++17
100 / 100
 78 ms 19264 KB 
#include <bits/stdc++.h>
using namespace std;

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(int i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;

vvl adj(100001);
int n, from, to;
int centroid = 0;
vector<pair<int, vi>> fromTree;


// hi

int dfs(int pos, int last = -1){
    int total = 1;
    for(auto v : adj[pos]){
        if(last == v) continue;
        total += dfs(v, pos);
    }
    if(total > n/2){
        centroid = pos;
        return 0;
    }
    return total;
}


void dfs2(int u, int last){
    fromTree[fromTree.size()-1].S.pb(u);
    fromTree[fromTree.size()-1].F++;
    for(auto v : adj[u]){
        if(v == last) continue;
        dfs2(v, u);
    }
}

pl dfsAns(int u, int last = -1){
    pl current = {1, 0}; // amount, travel
    for(auto v : adj[u]){
        if(v == last) continue;
        pl res = dfsAns(v, u);
        current.F += res.F;
        current.S += res.S+res.F*2LL;
    }
    return current;
}


// lo

vl loAns;

ll dfsLo(int u, int last = -1){
    ll res = 0;
    for(auto v : adj[u]){
        if(v == last) continue;
        res += dfsLo(v, u);
    }
    if(loAns[u] == u){
        res+=2;
        if(last == -1) last = adj[u][0];
        swap(loAns[u], loAns[last]);
    }
    return res;
} 


int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);

    cin >> n;
    fo(i, n-1){
        cin >> from >> to;
        adj[--from].pb(--to);
        adj[to].pb(from);
    }

    if(n == 2){
        cout << "2 2\n2 1\n2 1";
        exit(0);
    }

    dfs(0);
    vi hiAns(n);
    fo(i, n) loAns.pb(i);

    for(auto v : adj[centroid]){
        fromTree.pb({0, {}});
        dfs2(v, centroid);
    }
    sort(rall(fromTree));
    int last = centroid;
    int currentSum = 0;
    
    vl villages;
    for(auto subtree : fromTree){
        for(auto v : subtree.S) {
            villages.pb(v);
        }
    }
    villages.pb(centroid);

    
    fo(i, n){
        int current = villages[i/2+((i%2)^(n%2)?n/2:0)];
        hiAns[current] = last+1;
        last = current;
    }
    cout << dfsLo(0) << " " << dfsAns(centroid).S << "\n"; 
    fo(i, n) cout << loAns[i]+1 << " ";
    cout << "\n";
    fo(i, n) cout << hiAns[i] << " ";
    



    return 0;
}

Compilation message

Village.cpp: In function 'int main()':
Village.cpp:135:9: warning: unused variable 'currentSum' [-Wunused-variable]
  135 |     int currentSum = 0;
      |         ^~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct

Subtask #2
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2676 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 3 ms 2772 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2684 KB Output is correct
19 Correct 2 ms 2772 KB Output is correct
20 Correct 2 ms 2772 KB Output is correct
21 Correct 2 ms 2772 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 2 ms 2684 KB Output is correct
24 Correct 2 ms 2644 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 2 ms 2772 KB Output is correct
30 Correct 2 ms 2680 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2676 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 3 ms 2772 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2772 KB Output is correct
28 Correct 2 ms 2772 KB Output is correct
29 Correct 2 ms 2772 KB Output is correct
30 Correct 2 ms 2772 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 2 ms 2772 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 2 ms 2684 KB Output is correct
36 Correct 2 ms 2772 KB Output is correct
37 Correct 2 ms 2772 KB Output is correct
38 Correct 2 ms 2772 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 2 ms 2684 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 2 ms 2772 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 2 ms 2644 KB Output is correct
46 Correct 2 ms 2772 KB Output is correct
47 Correct 2 ms 2680 KB Output is correct
48 Correct 46 ms 11504 KB Output is correct
49 Correct 62 ms 11468 KB Output is correct
50 Correct 52 ms 11564 KB Output is correct
51 Correct 37 ms 9480 KB Output is correct
52 Correct 50 ms 11204 KB Output is correct
53 Correct 43 ms 11428 KB Output is correct
54 Correct 28 ms 10392 KB Output is correct
55 Correct 78 ms 19264 KB Output is correct
56 Correct 64 ms 15808 KB Output is correct
57 Correct 56 ms 13612 KB Output is correct
58 Correct 55 ms 13528 KB Output is correct
59 Correct 49 ms 12520 KB Output is correct
60 Correct 63 ms 18012 KB Output is correct
61 Correct 47 ms 12692 KB Output is correct
62 Correct 41 ms 11796 KB Output is correct
63 Correct 40 ms 12212 KB Output is correct
64 Correct 42 ms 11752 KB Output is correct
65 Correct 40 ms 11992 KB Output is correct
66 Correct 37 ms 11304 KB Output is correct
67 Correct 32 ms 10092 KB Output is correct
68 Correct 36 ms 10476 KB Output is correct
69 Correct 42 ms 11928 KB Output is correct
70 Correct 35 ms 11376 KB Output is correct
71 Correct 27 ms 9160 KB Output is correct
72 Correct 36 ms 9936 KB Output is correct
73 Correct 40 ms 12108 KB Output is correct
74 Correct 35 ms 11128 KB Output is correct
75 Correct 56 ms 12740 KB Output is correct
76 Correct 46 ms 11376 KB Output is correct
77 Correct 42 ms 11704 KB Output is correct
78 Correct 28 ms 8828 KB Output is correct
79 Correct 34 ms 9664 KB Output is correct
80 Correct 52 ms 11936 KB Output is correct
81 Correct 41 ms 11724 KB Output is correct
82 Correct 62 ms 11644 KB Output is correct