oj.uz

Submission #803148

# Submission time Handle Problem Language Result Execution time Memory
803148 2023-08-02T23:42:29 Z TB_ Village (BOI20_village) C++17
50 / 100
 71 ms 17200 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;

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;
}

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);

    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){
        // deb(i/2+((i%2)^(n%2)?n/2:0));
        int current = villages[i/2+((i%2)^(n%2)?n/2:0)];
        hiAns[current] = last+1;
        last = current;
    }
    cout << "0 " << dfsAns(centroid).S << "\n"; 
    fo(i, n) cout << hiAns[i] << " ";
    cout << "\n";
    fo(i, n) cout << hiAns[i] << " ";
    



    return 0;
}

Compilation message

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

Subtask #1
6.0 / 12.0

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

Subtask #2
19.0 / 38.0

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

Subtask #3
25.0 / 50.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 2644 KB Partially correct
2 Partially correct 1 ms 2644 KB Partially correct
3 Correct 2 ms 2644 KB Output is correct
4 Partially correct 1 ms 2644 KB Partially correct
5 Partially correct 1 ms 2644 KB Partially correct
6 Partially correct 2 ms 2644 KB Partially correct
7 Partially correct 1 ms 2640 KB Partially correct
8 Partially correct 1 ms 2644 KB Partially correct
9 Partially correct 1 ms 2644 KB Partially correct
10 Partially correct 1 ms 2644 KB Partially correct
11 Partially correct 1 ms 2644 KB Partially correct
12 Partially correct 1 ms 2644 KB Partially correct
13 Partially correct 1 ms 2644 KB Partially correct
14 Partially correct 2 ms 2644 KB Partially correct
15 Partially correct 2 ms 2588 KB Partially correct
16 Partially correct 2 ms 2644 KB Partially correct
17 Partially correct 1 ms 2644 KB Partially correct
18 Partially correct 1 ms 2644 KB Partially correct
19 Partially correct 3 ms 2644 KB Partially correct
20 Partially correct 1 ms 2644 KB Partially correct
21 Partially correct 2 ms 2644 KB Partially correct
22 Partially correct 1 ms 2644 KB Partially correct
23 Partially correct 2 ms 2644 KB Partially correct
24 Partially correct 2 ms 2644 KB Partially correct
25 Partially correct 2 ms 2644 KB Partially correct
26 Partially correct 2 ms 2644 KB Partially correct
27 Partially correct 2 ms 2644 KB Partially correct
28 Partially correct 2 ms 2644 KB Partially correct
29 Partially correct 2 ms 2772 KB Partially correct
30 Partially correct 2 ms 2772 KB Partially correct
31 Partially correct 2 ms 2812 KB Partially correct
32 Partially correct 2 ms 2644 KB Partially correct
33 Partially correct 2 ms 2644 KB Partially correct
34 Partially correct 2 ms 2644 KB Partially correct
35 Partially correct 2 ms 2644 KB Partially correct
36 Partially correct 2 ms 2772 KB Partially correct
37 Partially correct 1 ms 2644 KB Partially correct
38 Partially correct 1 ms 2644 KB Partially correct
39 Partially correct 2 ms 2644 KB Partially correct
40 Partially correct 2 ms 2644 KB Partially correct
41 Partially correct 1 ms 2644 KB Partially correct
42 Partially correct 2 ms 2644 KB Partially correct
43 Partially correct 2 ms 2644 KB Partially correct
44 Partially correct 2 ms 2644 KB Partially correct
45 Partially correct 2 ms 2644 KB Partially correct
46 Partially correct 2 ms 2644 KB Partially correct
47 Partially correct 2 ms 2644 KB Partially correct
48 Partially correct 64 ms 8752 KB Partially correct
49 Partially correct 46 ms 9440 KB Partially correct
50 Partially correct 71 ms 9432 KB Partially correct
51 Partially correct 44 ms 7980 KB Partially correct
52 Partially correct 43 ms 9432 KB Partially correct
53 Partially correct 47 ms 8604 KB Partially correct
54 Partially correct 24 ms 8000 KB Partially correct
55 Partially correct 50 ms 13288 KB Partially correct
56 Partially correct 56 ms 12544 KB Partially correct
57 Partially correct 55 ms 11708 KB Partially correct
58 Partially correct 50 ms 11132 KB Partially correct
59 Partially correct 49 ms 10636 KB Partially correct
60 Partially correct 58 ms 17200 KB Partially correct
61 Partially correct 50 ms 11900 KB Partially correct
62 Partially correct 38 ms 10956 KB Partially correct
63 Partially correct 34 ms 10296 KB Partially correct
64 Partially correct 51 ms 11052 KB Partially correct
65 Partially correct 36 ms 11088 KB Partially correct
66 Partially correct 35 ms 10560 KB Partially correct
67 Partially correct 28 ms 9544 KB Partially correct
68 Partially correct 40 ms 9772 KB Partially correct
69 Partially correct 37 ms 11024 KB Partially correct
70 Partially correct 32 ms 10688 KB Partially correct
71 Partially correct 27 ms 8552 KB Partially correct
72 Partially correct 29 ms 9332 KB Partially correct
73 Partially correct 39 ms 11112 KB Partially correct
74 Partially correct 32 ms 10412 KB Partially correct
75 Partially correct 52 ms 11008 KB Partially correct
76 Partially correct 60 ms 10528 KB Partially correct
77 Partially correct 41 ms 10812 KB Partially correct
78 Partially correct 26 ms 8196 KB Partially correct
79 Partially correct 41 ms 8924 KB Partially correct
80 Partially correct 45 ms 11064 KB Partially correct
81 Partially correct 44 ms 10968 KB Partially correct
82 Partially correct 34 ms 10696 KB Partially correct