oj.uz

Submission #971512

# Submission time Handle Problem Language Result Execution time Memory
971512 2024-04-28T17:30:23 Z CyberCow The Xana coup (BOI21_xanadu) C++17
100 / 100
 58 ms 16988 KB 
#include <random>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((x).size())
typedef long long ll;
using ull = unsigned long long;
using namespace std;
mt19937 rnd(348502);
ll mod1 = 998244353;
ll mod = 1e9 + 7;
const ll N = 100010;

vector<int> v[N];
ll dp[N][2][2];
int a[N];

void Dfs(int g, int p)
{
    for (auto to : v[g])
    {
        if (to != p)
        {
            Dfs(to, g);
        }
    }
    ll ans = 0, qan = 0, mipox = 1e9;
    for (auto to : v[g])
    {
        if (to != p)
        {
            mipox = min(mipox, abs(dp[to][0][0] - dp[to][0][1]));
            if (dp[to][0][0] < dp[to][0][1])
            {
                ans += dp[to][0][0];
            }
            else
            {
                ans += dp[to][0][1];
                qan++;
            }
        }
    }
    if ((qan + a[g]) % 2 == 0)
    {
        dp[g][0][0] = ans;
        dp[g][1][0] = ans + mipox;
    }
    else
    {
        dp[g][1][0] = ans;
        dp[g][0][0] = ans + mipox;
    }
    ans = 0, qan = 0, mipox = 1e9;
    for (auto to : v[g])
    {
        if (to != p)
        {
            mipox = min(mipox, abs(dp[to][1][0] - dp[to][1][1]));
            if (dp[to][1][0] < dp[to][1][1])
            {
                ans += dp[to][1][0];
            }
            else
            {
                ans += dp[to][1][1];
                qan++;
            }
        }
    }
    if ((qan + a[g] + 1) % 2 == 0)
    {
        dp[g][0][1] = ans + 1;
        dp[g][1][1] = ans + mipox + 1;
    }
    else
    {
        dp[g][1][1] = ans + 1;
        dp[g][0][1] = ans + mipox + 1;
    }
}

void solve()
{
    int n, i, j, x, y;
    cin >> n;
    for ( i = 0; i < n - 1; i++)
    {
        cin >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for ( i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    Dfs(1, -1);
    if (min(dp[1][0][1], dp[1][0][0]) >= 1e9)
    {
        cout << "impossible";
    }
    else
    {
        cout << min(dp[1][0][1], dp[1][0][0]);
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int tt = 1;
    //cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}

Compilation message

xanadu.cpp: In function 'void solve()':
xanadu.cpp:102:15: warning: unused variable 'j' [-Wunused-variable]
  102 |     int n, i, j, x, y;
      |               ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5976 KB Output is correct
2 Correct 1 ms 5980 KB Output is correct
3 Correct 1 ms 5980 KB Output is correct
4 Correct 2 ms 5980 KB Output is correct
5 Correct 1 ms 5980 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 16980 KB Output is correct
2 Correct 34 ms 16720 KB Output is correct
3 Correct 36 ms 16976 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 16952 KB Output is correct
2 Correct 38 ms 16732 KB Output is correct
3 Correct 35 ms 16980 KB Output is correct
4 Correct 31 ms 10072 KB Output is correct
5 Correct 35 ms 10588 KB Output is correct
6 Correct 39 ms 10596 KB Output is correct
7 Correct 2 ms 5980 KB Output is correct
8 Correct 12 ms 7772 KB Output is correct
9 Correct 34 ms 10720 KB Output is correct
10 Correct 36 ms 10844 KB Output is correct
11 Correct 35 ms 11092 KB Output is correct
12 Correct 37 ms 11348 KB Output is correct
13 Correct 39 ms 10508 KB Output is correct
14 Correct 33 ms 10836 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5976 KB Output is correct
2 Correct 1 ms 5980 KB Output is correct
3 Correct 1 ms 5980 KB Output is correct
4 Correct 2 ms 5980 KB Output is correct
5 Correct 1 ms 5980 KB Output is correct
6 Correct 2 ms 5980 KB Output is correct
7 Correct 2 ms 5980 KB Output is correct
8 Correct 2 ms 5980 KB Output is correct
9 Correct 2 ms 5976 KB Output is correct
10 Correct 2 ms 5980 KB Output is correct
11 Correct 1 ms 5980 KB Output is correct
12 Correct 2 ms 5980 KB Output is correct
13 Correct 1 ms 5980 KB Output is correct
14 Correct 2 ms 5980 KB Output is correct
15 Correct 2 ms 5980 KB Output is correct
16 Correct 2 ms 5980 KB Output is correct
17 Correct 38 ms 16980 KB Output is correct
18 Correct 34 ms 16720 KB Output is correct
19 Correct 36 ms 16976 KB Output is correct
20 Correct 51 ms 16952 KB Output is correct
21 Correct 38 ms 16732 KB Output is correct
22 Correct 35 ms 16980 KB Output is correct
23 Correct 31 ms 10072 KB Output is correct
24 Correct 35 ms 10588 KB Output is correct
25 Correct 39 ms 10596 KB Output is correct
26 Correct 2 ms 5980 KB Output is correct
27 Correct 12 ms 7772 KB Output is correct
28 Correct 34 ms 10720 KB Output is correct
29 Correct 36 ms 10844 KB Output is correct
30 Correct 35 ms 11092 KB Output is correct
31 Correct 37 ms 11348 KB Output is correct
32 Correct 39 ms 10508 KB Output is correct
33 Correct 33 ms 10836 KB Output is correct
34 Correct 2 ms 5976 KB Output is correct
35 Correct 2 ms 5976 KB Output is correct
36 Correct 2 ms 5980 KB Output is correct
37 Correct 2 ms 5980 KB Output is correct
38 Correct 1 ms 6084 KB Output is correct
39 Correct 2 ms 5976 KB Output is correct
40 Correct 2 ms 5980 KB Output is correct
41 Correct 2 ms 5980 KB Output is correct
42 Correct 2 ms 5980 KB Output is correct
43 Correct 2 ms 5980 KB Output is correct
44 Correct 2 ms 5980 KB Output is correct
45 Correct 36 ms 16944 KB Output is correct
46 Correct 40 ms 16724 KB Output is correct
47 Correct 36 ms 16988 KB Output is correct
48 Correct 37 ms 10488 KB Output is correct
49 Correct 34 ms 10632 KB Output is correct
50 Correct 35 ms 10588 KB Output is correct
51 Correct 2 ms 5980 KB Output is correct
52 Correct 12 ms 7792 KB Output is correct
53 Correct 35 ms 10588 KB Output is correct
54 Correct 34 ms 10772 KB Output is correct
55 Correct 35 ms 11140 KB Output is correct
56 Correct 46 ms 11348 KB Output is correct
57 Correct 30 ms 10324 KB Output is correct
58 Correct 34 ms 10580 KB Output is correct
59 Correct 12 ms 7768 KB Output is correct
60 Correct 30 ms 10196 KB Output is correct
61 Correct 35 ms 10580 KB Output is correct
62 Correct 35 ms 10844 KB Output is correct
63 Correct 35 ms 10836 KB Output is correct
64 Correct 58 ms 10816 KB Output is correct
65 Correct 29 ms 11224 KB Output is correct
66 Correct 30 ms 11352 KB Output is correct
67 Correct 28 ms 11220 KB Output is correct
68 Correct 28 ms 11044 KB Output is correct
69 Correct 28 ms 10956 KB Output is correct
70 Correct 28 ms 11220 KB Output is correct