oj.uz

답안 #372916

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
372916 2021-03-02T09:26:18 Z ACmachine Village (BOI20_village) C++17
50 / 100
 91 ms 17628 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)

const double EPS = 1e-9;
const int MOD = 1e9+7;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

void DBG(){cout << "]" << endl;}
template<typename T, typename ...U> void DBG(const T& head, const U... args){ cout << head << "; "; DBG(args...); }
#define dbg(...) cout << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
#define chk() cout << "Check at line(" << __LINE__ << ") hit." << endl;

template<class T, unsigned int U>
ostream& operator<<(ostream& out, const array<T, U> &v){out << "[";  REP(i, U) out << v[i] << ", ";  out << "]"; return out;}
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}

template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }

int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
 	int n; cin >> n;
 	vector<vector<int>> g(n);
 	REP(i, n - 1){
 	    int u, v;
 	    cin >> u >> v;
 	    u--; v--;
 	    g[u].pb(v);
 	    g[v].pb(u);
 	}
 	auto solve_minimal = [&](){
 	    vector<int> ans(n, -1);
 	    REP(i, n) ans[i] = i; // v i-tom dome je ans[i]
 	    int res = 0;
 	    function<void(int, int)> dfs = [&](int v, int p){
 	        int cn = 0;
 	        for(int x : g[v]){
 	            if(x == p) continue;
 	            ++cn;
 	            dfs(x, v);
 	        }
 	        for(int x : g[v]){
 	            if(x == p) continue;
 	            if(ans[x] == x){
 	                swap(ans[x], ans[v]);
 	                res+=2;
 	            }
 	        }
 	        if(ans[v] == v){
 	            if(p != -1)
 	                return;
 	            else{
 	                for(int x : g[v]){
 	                    if(x == p) continue;
 	                    res += 2;
 	                    swap(ans[x], ans[v]);
 	                    break;
 	                }
 	            }
 	        }
 	    };
 	    dfs(0, -1);
 	    vector<int> rev_ans(n);
 	    REP(i, n) rev_ans[ans[i]] = i;
 	    return make_pair(res, rev_ans);
 	};
 	pair<int, vector<int>> ansf = solve_minimal();
 	cout << ansf.ff << " " << 1 << "\n";
 	REP(i, n) {
        cout << ansf.ss[i] + 1 << (i == (int) ansf.ss.size() - 1 ? "\n" : " ");
    }
    REP(i, n) {
        cout << ansf.ss[i] + 1 << (i == (int) ansf.ss.size() - 1 ? "\n" : " ");
    }
    return 0;
}

Subtask #1
6.0 / 12.0

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

Subtask #2
19.0 / 38.0

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

Subtask #3
25.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 364 KB Partially correct
2 Partially correct 0 ms 364 KB Partially correct
3 Partially correct 0 ms 364 KB Partially correct
4 Partially correct 0 ms 364 KB Partially correct
5 Partially correct 0 ms 364 KB Partially correct
6 Partially correct 1 ms 364 KB Partially correct
7 Partially correct 0 ms 364 KB Partially correct
8 Partially correct 1 ms 364 KB Partially correct
9 Partially correct 0 ms 364 KB Partially correct
10 Partially correct 1 ms 364 KB Partially correct
11 Partially correct 0 ms 364 KB Partially correct
12 Partially correct 1 ms 364 KB Partially correct
13 Partially correct 1 ms 364 KB Partially correct
14 Partially correct 1 ms 364 KB Partially correct
15 Partially correct 0 ms 364 KB Partially correct
16 Partially correct 0 ms 364 KB Partially correct
17 Partially correct 1 ms 364 KB Partially correct
18 Partially correct 1 ms 364 KB Partially correct
19 Partially correct 1 ms 364 KB Partially correct
20 Partially correct 1 ms 364 KB Partially correct
21 Partially correct 2 ms 364 KB Partially correct
22 Partially correct 1 ms 364 KB Partially correct
23 Partially correct 1 ms 364 KB Partially correct
24 Partially correct 1 ms 492 KB Partially correct
25 Partially correct 1 ms 364 KB Partially correct
26 Partially correct 1 ms 364 KB Partially correct
27 Partially correct 1 ms 492 KB Partially correct
28 Partially correct 1 ms 492 KB Partially correct
29 Partially correct 1 ms 364 KB Partially correct
30 Partially correct 1 ms 364 KB Partially correct
31 Partially correct 1 ms 364 KB Partially correct
32 Partially correct 1 ms 364 KB Partially correct
33 Partially correct 1 ms 364 KB Partially correct
34 Partially correct 1 ms 512 KB Partially correct
35 Partially correct 1 ms 364 KB Partially correct
36 Partially correct 1 ms 364 KB Partially correct
37 Partially correct 1 ms 364 KB Partially correct
38 Partially correct 1 ms 364 KB Partially correct
39 Partially correct 1 ms 364 KB Partially correct
40 Partially correct 1 ms 364 KB Partially correct
41 Partially correct 1 ms 364 KB Partially correct
42 Partially correct 1 ms 364 KB Partially correct
43 Partially correct 1 ms 364 KB Partially correct
44 Partially correct 1 ms 364 KB Partially correct
45 Partially correct 2 ms 364 KB Partially correct
46 Partially correct 2 ms 364 KB Partially correct
47 Partially correct 1 ms 364 KB Partially correct
48 Partially correct 67 ms 6948 KB Partially correct
49 Partially correct 71 ms 7516 KB Partially correct
50 Partially correct 72 ms 8668 KB Partially correct
51 Partially correct 60 ms 6796 KB Partially correct
52 Partially correct 73 ms 8548 KB Partially correct
53 Partially correct 67 ms 7732 KB Partially correct
54 Partially correct 41 ms 8676 KB Partially correct
55 Partially correct 91 ms 17628 KB Partially correct
56 Partially correct 89 ms 12912 KB Partially correct
57 Partially correct 80 ms 11364 KB Partially correct
58 Partially correct 85 ms 10204 KB Partially correct
59 Partially correct 72 ms 8796 KB Partially correct
60 Partially correct 59 ms 8916 KB Partially correct
61 Partially correct 62 ms 9120 KB Partially correct
62 Partially correct 63 ms 9052 KB Partially correct
63 Partially correct 57 ms 8588 KB Partially correct
64 Partially correct 73 ms 9052 KB Partially correct
65 Partially correct 64 ms 9208 KB Partially correct
66 Partially correct 63 ms 8608 KB Partially correct
67 Partially correct 43 ms 6692 KB Partially correct
68 Partially correct 66 ms 7944 KB Partially correct
69 Partially correct 65 ms 9180 KB Partially correct
70 Partially correct 60 ms 8588 KB Partially correct
71 Partially correct 40 ms 6468 KB Partially correct
72 Partially correct 49 ms 7292 KB Partially correct
73 Partially correct 61 ms 9180 KB Partially correct
74 Partially correct 57 ms 8348 KB Partially correct
75 Partially correct 72 ms 8540 KB Partially correct
76 Partially correct 70 ms 8540 KB Partially correct
77 Partially correct 65 ms 8716 KB Partially correct
78 Partially correct 42 ms 5980 KB Partially correct
79 Partially correct 48 ms 6924 KB Partially correct
80 Partially correct 75 ms 8540 KB Partially correct
81 Partially correct 64 ms 8844 KB Partially correct
82 Partially correct 62 ms 8932 KB Partially correct