oj.uz

답안 #502315

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
502315 2022-01-05T18:28:59 Z ljuba The Xana coup (BOI21_xanadu) C++17
100 / 100
 62 ms 18404 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
typedef vector<int> vi;
typedef vector<ll> vll;
 
typedef vector<vi> vvi;
typedef vector<vll> vvll;
 
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
typedef vector<pii> vpii;
typedef vector<pll> vpll;
 
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
 
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define fi first
#define se second
 
template<class T> bool ckmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<class T> bool ckmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}
 
namespace debug {
    void __print(int x) {cerr << x;}
    void __print(long long x) {cerr << x;}
    void __print(double x) {cerr << x;}
    void __print(long double x) {cerr << x;}
    void __print(char x) {cerr << '\'' << x << '\'';}
    void __print(const string &x) {cerr << '\"' << x << '\"';}
    void __print(const char *x) {cerr << '\"' << x << '\"';}
    void __print(bool x) {cerr << (x ? "true" : "false");}
 
    template<typename T, typename V>
    void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
    template<typename T>
    void __print(const T &x) {int f = 0; cerr << '{'; for(auto z : x) cerr << (f++ ? "," : ""), __print(z); cerr << "}";}
    void _print() {cerr << "]\n";}
    template <typename T, typename... V>
    void _print(T t, V... v) {__print(t); if(sizeof...(v)) cerr << ", "; _print(v...);}
 
#ifdef ljuba
#define dbg(x...) cerr << "\e[91m" << "LINE(" << __LINE__ << ") -> " << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif
}
 
using namespace debug;
 
const char nl = '\n';
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
/*
погледај сампле тестове, пре него што имплементираш (можда имаш погрешну идеју) 
уместо да разматраш неке глупе случајеве на папиру, размишљај заправо о задатку
*/

const int mxN = 1e5 + 12;
vi adj[mxN];
ll dp[mxN][2][2];
int a[mxN];

const ll INF = 1e9 + 12;

void dfs(int s, int p = -1) {
    for(auto e : adj[s]) {
        if(e == p) continue;
        dfs(e, s);
    }

    for(int trenutni = 0; trenutni < 2; ++trenutni) {
        for(int roditelj = 0; roditelj < 2; ++roditelj) {
            ll parno = 0, neparno = INF;

            for(auto e : adj[s]) {
                if(e == p) continue;
                ll deteParno = dp[e][0][trenutni];
                ll deteNeparno = dp[e][1][trenutni];
                ll noviParno = min(parno+deteParno, neparno+deteNeparno);
                ll noviNeparno = min(neparno+deteParno, parno+deteNeparno);
                parno = noviParno;
                neparno = noviNeparno;
            }

            dp[s][trenutni][roditelj] = trenutni;
            if(!(a[s]^trenutni^roditelj)) {
                dp[s][trenutni][roditelj] += parno;
            } else {
                dp[s][trenutni][roditelj] += neparno;
            }
        }
    }
}

void solve() {
    int n;
    cin >> n;
    for(int i = 1; i < n; ++i) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        adj[u].pb(v);
        adj[v].pb(u);
    }

    for(int i = 0; i < n; ++i) cin >> a[i];
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < 2; ++j) {
            for(int k = 0; k < 2; ++k) {
                dp[i][j][k] = INF;
            }
        }
    }

    dfs(0);

    //for(int i = 0; i < n; ++i) {
        //for(int j = 0; j < 2; ++j) {
            //for(int k = 0; k < 2; ++k) {
                //dbg(i, j, k, dp[i][j][k]);
            //}
        //}
    //}
    ll ans = min(dp[0][0][0], dp[0][1][0]);

    cout << ((ans >= INF) ? "impossible" : to_string(ans)) << nl;
}
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int testCases = 1;
    //cin >> testCases;
    while(testCases--)
        solve();
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 1 ms 2676 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 1 ms 2636 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 17052 KB Output is correct
2 Correct 46 ms 16860 KB Output is correct
3 Correct 46 ms 17048 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 16968 KB Output is correct
2 Correct 47 ms 16864 KB Output is correct
3 Correct 48 ms 17008 KB Output is correct
4 Correct 40 ms 8480 KB Output is correct
5 Correct 47 ms 10372 KB Output is correct
6 Correct 57 ms 10692 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 14 ms 5252 KB Output is correct
9 Correct 51 ms 10600 KB Output is correct
10 Correct 52 ms 10740 KB Output is correct
11 Correct 52 ms 11076 KB Output is correct
12 Correct 56 ms 11336 KB Output is correct
13 Correct 43 ms 10044 KB Output is correct
14 Correct 48 ms 10644 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 1 ms 2676 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 1 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 1 ms 2636 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 1 ms 2636 KB Output is correct
11 Correct 2 ms 2672 KB Output is correct
12 Correct 1 ms 2668 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 1 ms 2668 KB Output is correct
16 Correct 1 ms 2636 KB Output is correct
17 Correct 54 ms 17052 KB Output is correct
18 Correct 46 ms 16860 KB Output is correct
19 Correct 46 ms 17048 KB Output is correct
20 Correct 47 ms 16968 KB Output is correct
21 Correct 47 ms 16864 KB Output is correct
22 Correct 48 ms 17008 KB Output is correct
23 Correct 40 ms 8480 KB Output is correct
24 Correct 47 ms 10372 KB Output is correct
25 Correct 57 ms 10692 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 14 ms 5252 KB Output is correct
28 Correct 51 ms 10600 KB Output is correct
29 Correct 52 ms 10740 KB Output is correct
30 Correct 52 ms 11076 KB Output is correct
31 Correct 56 ms 11336 KB Output is correct
32 Correct 43 ms 10044 KB Output is correct
33 Correct 48 ms 10644 KB Output is correct
34 Correct 1 ms 2636 KB Output is correct
35 Correct 2 ms 2764 KB Output is correct
36 Correct 1 ms 2636 KB Output is correct
37 Correct 2 ms 2636 KB Output is correct
38 Correct 2 ms 2672 KB Output is correct
39 Correct 1 ms 2636 KB Output is correct
40 Correct 1 ms 2636 KB Output is correct
41 Correct 2 ms 2672 KB Output is correct
42 Correct 2 ms 2676 KB Output is correct
43 Correct 2 ms 2636 KB Output is correct
44 Correct 2 ms 2636 KB Output is correct
45 Correct 50 ms 18280 KB Output is correct
46 Correct 47 ms 18140 KB Output is correct
47 Correct 48 ms 18404 KB Output is correct
48 Correct 42 ms 9796 KB Output is correct
49 Correct 56 ms 10484 KB Output is correct
50 Correct 49 ms 10580 KB Output is correct
51 Correct 2 ms 2636 KB Output is correct
52 Correct 14 ms 5296 KB Output is correct
53 Correct 51 ms 10596 KB Output is correct
54 Correct 51 ms 10736 KB Output is correct
55 Correct 49 ms 10996 KB Output is correct
56 Correct 62 ms 11460 KB Output is correct
57 Correct 46 ms 10080 KB Output is correct
58 Correct 48 ms 10652 KB Output is correct
59 Correct 14 ms 5324 KB Output is correct
60 Correct 42 ms 9796 KB Output is correct
61 Correct 47 ms 10564 KB Output is correct
62 Correct 49 ms 10652 KB Output is correct
63 Correct 55 ms 10712 KB Output is correct
64 Correct 59 ms 10820 KB Output is correct
65 Correct 42 ms 11140 KB Output is correct
66 Correct 41 ms 11196 KB Output is correct
67 Correct 35 ms 11052 KB Output is correct
68 Correct 36 ms 11068 KB Output is correct
69 Correct 37 ms 11044 KB Output is correct
70 Correct 37 ms 10980 KB Output is correct