oj.uz

답안 #948809

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
948809 2024-03-18T14:39:54 Z lolismek Village (BOI20_village) C++14
50 / 100
 61 ms 16328 KB 
#include <algorithm>
#include <iostream>
#include <climits>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
 
#include <iomanip>
#include <cassert>
 
#include <random>
#include <chrono>
 
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
 
using ull = unsigned long long;
using ll = long long;
 
//#define int __int128
#define int ll
#define pii pair <int, int>
#define all(a) (a).begin(), (a).end()
#define fr first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
 
#define vt vector
#define FOR(a, b) for(int i = (a); i <= (b); i++)
#define FORr(a, b) for(int i = (a); i >= (b); i--)
#define sz(x) (int)(x).size()
 
#define YES cout << "YES\n"
#define NO cout << "NO\n"
 
using namespace std;
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
int rangerng(int l, int r){
    return uniform_int_distribution<>(l, r)(rng);
}
 
////////////////////////////////////////////////////////////////////////////////////
 
const int NMAX = 1e5;
 
int n;
vt <int> adj[NMAX + 1];
 
int minAns = 0;
int min_pos[NMAX + 1];
 
void dfs1(int node, int par){
    for(int vec : adj[node]){
        if(vec != par){
            dfs1(vec, node);
        }
    }
 
    if(min_pos[node] == node && node != 1){
        swap(min_pos[node], min_pos[par]);
        minAns += 2;
    }
}
 
int maxAns = 0;
int max_pos[NMAX + 1];
 
int big[NMAX + 1];
 
void dfs2(int node, int par){
    big[node] = 1;
    for(int vec : adj[node]){
        if(vec != par){
            dfs2(vec, node);
            big[node] += big[vec];
        }
    }
 
    maxAns += min(big[node], n - big[node]);
}
 
int get_centroid(int node, int par){
    for(int vec : adj[node]){
        if(vec != par && big[vec] > n / 2){
            return get_centroid(vec, node);
        }
    }
    return node;
}
 
vt <int> aux;
 
void dfs3(int node, int par){
    for(int vec : adj[node]){
        if(vec != par){
            dfs3(vec, node);
        }
    }
    aux.pb(node);
}
 
void solve(){
    cin >> n;
 
    for(int i = 1; i <= n - 1; i++){
        int a, b;
        cin >> a >> b;
        adj[a].pb(b);
        adj[b].pb(a);
    }
 
    for(int i = 1; i <= n; i++){
        min_pos[i] = i;
    }
    dfs1(1, 0);
 
    if(min_pos[1] == 1){
        int x = adj[1][0];
        swap(min_pos[x], min_pos[1]);
        minAns += 2;
    }
 
    dfs2(1, 0);
    int centroid = get_centroid(1, 0);
 
    for(int i = 1; i <= n; i++){
        max_pos[i] = i;
    }
 
    dfs3(centroid, 0);
 
    for(int i = 0; i < n / 2; i++){
        swap(max_pos[aux[i]], max_pos[aux[n / 2 + i]]);
    }
    // if(max_pos[centroid] == centroid){
    //     swap(max_pos[centroid], max_pos[adj[centroid][0]]);
    // }
 
    cout << minAns << ' ' << 2 * maxAns << '\n';
    for(int i = 1; i <= n; i++){
        cout << min_pos[i] << ' ';
    }
    cout << '\n';
    for(int i = 1; i <= n; i++){
        cout << max_pos[i] << ' ';
    }
    cout << '\n';
}
 
signed main(){
 
    ios_base::sync_with_stdio(false);
    cin.tie(0);
 
    int T;
    //cin >> T;
 
    T = 1;
 
    while(T--){
        solve();
    }
 
    return 0;
}
 
/*
4
1 2
2 3
3 4
 
7
4 2
5 7
3 4
6 3
1 3
4 5
 
 
*/

Subtask #1
6.0 / 12.0

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

Subtask #2
19.0 / 38.0

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

Subtask #3
25.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Partially correct 1 ms 4952 KB Partially correct
3 Correct 1 ms 4956 KB Output is correct
4 Partially correct 1 ms 4956 KB Partially correct
5 Partially correct 1 ms 4956 KB Partially correct
6 Partially correct 1 ms 4956 KB Partially correct
7 Partially correct 1 ms 4952 KB Partially correct
8 Correct 1 ms 4952 KB Output is correct
9 Partially correct 1 ms 4956 KB Partially correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 5208 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 1 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Partially correct 2 ms 4956 KB Partially correct
21 Correct 1 ms 4956 KB Output is correct
22 Partially correct 1 ms 4956 KB Partially correct
23 Partially correct 1 ms 4956 KB Partially correct
24 Correct 2 ms 4956 KB Output is correct
25 Partially correct 1 ms 4988 KB Partially correct
26 Partially correct 1 ms 4956 KB Partially correct
27 Correct 2 ms 4956 KB Output is correct
28 Correct 2 ms 4956 KB Output is correct
29 Correct 2 ms 4956 KB Output is correct
30 Partially correct 1 ms 4956 KB Partially correct
31 Correct 2 ms 4956 KB Output is correct
32 Correct 2 ms 4956 KB Output is correct
33 Correct 2 ms 5208 KB Output is correct
34 Partially correct 1 ms 4956 KB Partially correct
35 Partially correct 2 ms 4952 KB Partially correct
36 Correct 1 ms 4956 KB Output is correct
37 Correct 1 ms 4956 KB Output is correct
38 Correct 2 ms 4956 KB Output is correct
39 Partially correct 1 ms 4956 KB Partially correct
40 Correct 2 ms 4956 KB Output is correct
41 Correct 2 ms 4956 KB Output is correct
42 Correct 1 ms 4956 KB Output is correct
43 Correct 2 ms 4956 KB Output is correct
44 Partially correct 1 ms 4956 KB Partially correct
45 Correct 1 ms 4956 KB Output is correct
46 Partially correct 2 ms 4956 KB Partially correct
47 Correct 2 ms 4956 KB Output is correct
48 Partially correct 41 ms 10452 KB Partially correct
49 Partially correct 46 ms 10952 KB Partially correct
50 Correct 44 ms 10952 KB Output is correct
51 Partially correct 35 ms 9668 KB Partially correct
52 Partially correct 43 ms 10948 KB Partially correct
53 Correct 39 ms 10180 KB Output is correct
54 Correct 26 ms 10452 KB Output is correct
55 Correct 51 ms 16328 KB Output is correct
56 Correct 52 ms 13680 KB Output is correct
57 Partially correct 61 ms 12764 KB Partially correct
58 Correct 52 ms 11740 KB Output is correct
59 Correct 46 ms 10952 KB Output is correct
60 Correct 34 ms 11088 KB Output is correct
61 Correct 37 ms 11088 KB Output is correct
62 Correct 37 ms 11204 KB Output is correct
63 Partially correct 35 ms 10916 KB Partially correct
64 Correct 38 ms 11204 KB Output is correct
65 Correct 35 ms 11464 KB Output is correct
66 Partially correct 45 ms 10996 KB Partially correct
67 Correct 27 ms 9668 KB Output is correct
68 Partially correct 35 ms 10448 KB Partially correct
69 Correct 37 ms 11460 KB Output is correct
70 Correct 32 ms 11096 KB Output is correct
71 Correct 27 ms 9424 KB Output is correct
72 Partially correct 27 ms 10192 KB Partially correct
73 Partially correct 47 ms 11676 KB Partially correct
74 Partially correct 32 ms 10960 KB Partially correct
75 Correct 43 ms 11468 KB Output is correct
76 Correct 39 ms 10784 KB Output is correct
77 Correct 42 ms 11460 KB Output is correct
78 Correct 26 ms 9156 KB Output is correct
79 Partially correct 29 ms 9628 KB Partially correct
80 Partially correct 43 ms 11468 KB Partially correct
81 Correct 45 ms 11468 KB Output is correct
82 Partially correct 36 ms 10956 KB Partially correct