oj.uz

Submission #590300

# Submission time Handle Problem Language Result Execution time Memory
590300 2022-07-05T19:06:51 Z Lobo The Xana coup (BOI21_xanadu) C++17
100 / 100
 276 ms 105924 KB 
#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

const int maxn = 1e5+10;

int n, a[maxn];
vector<int> g[maxn], mark[maxn][2][2], dp[maxn][2][2];

int sol(int u, int qtdtr, int tr, int id, int ant) {
    if(mark[u][qtdtr][tr][id]) return dp[u][qtdtr][tr][id];
    mark[u][qtdtr][tr][id] = 1;

    if(id == (int) g[u].size()) {
        if((qtdtr^a[u]) == 0) dp[u][qtdtr][tr][id] = 0;
        else dp[u][qtdtr][tr][id] = inf;
        // cout << u << " " << qtdtr << " " << tr << " " << id << "  " << ant << " " << dp[u][qtdtr][tr][id] << endl;
        return dp[u][qtdtr][tr][id];
    }
    int v = g[u][id];
    if(v == ant) return dp[u][qtdtr][tr][id] = sol(u,qtdtr,tr,id+1,ant);
    int ans = inf;
    dp[u][qtdtr][tr][id] = inf;

    //nao troco o v
    dp[u][qtdtr][tr][id] = min(dp[u][qtdtr][tr][id],sol(u,qtdtr,tr,id+1,ant)+sol(v,tr,0,0,u));
    //troco o v
    dp[u][qtdtr][tr][id] = min(dp[u][qtdtr][tr][id],sol(u,qtdtr^1,tr,id+1,ant)+sol(v,tr^1,1,0,u)+1);
    // cout << u << " " << qtdtr << " " << tr << " " << id << "  " << dp[u][qtdtr][tr][id] << endl;
    return dp[u][qtdtr][tr][id];
}

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

    for(int i = 1; i <= n; i++) {
        for(int j1 = 0; j1 <= 1; j1++) {
            for(int j2 = 0; j2 <= 1; j2++) {
                mark[i][j1][j2].pb({});
                dp[i][j1][j2].pb({});
                for(int k = 0; k <= (int) g[i].size()+3; k++) {
                    mark[i][j1][j2].pb(0);
                    dp[i][j1][j2].pb(0);
                }
            }
        }
    }

    int ans = min(sol(1,0,0,0,0),sol(1,1,1,0,0)+1);
    if(ans >= n+1) cout << "impossible" << endl;
    else cout << ans << endl;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    // freopen("out.out", "w", stdout);
    int tt = 1;
    // cin >> tt;
    while(tt--) {
        solve();
    }

}

Compilation message

xanadu.cpp: In function 'long long int sol(long long int, long long int, long long int, long long int, long long int)':
xanadu.cpp:32:9: warning: unused variable 'ans' [-Wunused-variable]
   32 |     int ans = inf;
      |         ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 21600 KB Output is correct
2 Correct 10 ms 21472 KB Output is correct
3 Correct 14 ms 21468 KB Output is correct
4 Correct 11 ms 21464 KB Output is correct
5 Correct 10 ms 21460 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 21600 KB Output is correct
2 Correct 10 ms 21472 KB Output is correct
3 Correct 14 ms 21468 KB Output is correct
4 Correct 11 ms 21464 KB Output is correct
5 Correct 10 ms 21460 KB Output is correct
6 Correct 12 ms 21400 KB Output is correct
7 Correct 12 ms 21464 KB Output is correct
8 Correct 12 ms 21372 KB Output is correct
9 Correct 13 ms 21432 KB Output is correct
10 Correct 11 ms 21500 KB Output is correct
11 Correct 10 ms 21460 KB Output is correct
12 Correct 10 ms 21460 KB Output is correct
13 Correct 10 ms 21472 KB Output is correct
14 Correct 11 ms 21460 KB Output is correct
15 Correct 11 ms 21460 KB Output is correct
16 Correct 12 ms 21472 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 242 ms 102984 KB Output is correct
2 Correct 223 ms 101988 KB Output is correct
3 Correct 220 ms 103372 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 103008 KB Output is correct
2 Correct 228 ms 102000 KB Output is correct
3 Correct 222 ms 103404 KB Output is correct
4 Correct 210 ms 82828 KB Output is correct
5 Correct 238 ms 88784 KB Output is correct
6 Correct 217 ms 90168 KB Output is correct
7 Correct 14 ms 21788 KB Output is correct
8 Correct 87 ms 44152 KB Output is correct
9 Correct 248 ms 88936 KB Output is correct
10 Correct 224 ms 90004 KB Output is correct
11 Correct 256 ms 89524 KB Output is correct
12 Correct 261 ms 91592 KB Output is correct
13 Correct 203 ms 86076 KB Output is correct
14 Correct 220 ms 90464 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 21600 KB Output is correct
2 Correct 10 ms 21472 KB Output is correct
3 Correct 14 ms 21468 KB Output is correct
4 Correct 11 ms 21464 KB Output is correct
5 Correct 10 ms 21460 KB Output is correct
6 Correct 12 ms 21400 KB Output is correct
7 Correct 12 ms 21464 KB Output is correct
8 Correct 12 ms 21372 KB Output is correct
9 Correct 13 ms 21432 KB Output is correct
10 Correct 11 ms 21500 KB Output is correct
11 Correct 10 ms 21460 KB Output is correct
12 Correct 10 ms 21460 KB Output is correct
13 Correct 10 ms 21472 KB Output is correct
14 Correct 11 ms 21460 KB Output is correct
15 Correct 11 ms 21460 KB Output is correct
16 Correct 12 ms 21472 KB Output is correct
17 Correct 242 ms 102984 KB Output is correct
18 Correct 223 ms 101988 KB Output is correct
19 Correct 220 ms 103372 KB Output is correct
20 Correct 275 ms 103008 KB Output is correct
21 Correct 228 ms 102000 KB Output is correct
22 Correct 222 ms 103404 KB Output is correct
23 Correct 210 ms 82828 KB Output is correct
24 Correct 238 ms 88784 KB Output is correct
25 Correct 217 ms 90168 KB Output is correct
26 Correct 14 ms 21788 KB Output is correct
27 Correct 87 ms 44152 KB Output is correct
28 Correct 248 ms 88936 KB Output is correct
29 Correct 224 ms 90004 KB Output is correct
30 Correct 256 ms 89524 KB Output is correct
31 Correct 261 ms 91592 KB Output is correct
32 Correct 203 ms 86076 KB Output is correct
33 Correct 220 ms 90464 KB Output is correct
34 Correct 11 ms 21460 KB Output is correct
35 Correct 11 ms 21460 KB Output is correct
36 Correct 12 ms 21460 KB Output is correct
37 Correct 14 ms 21456 KB Output is correct
38 Correct 10 ms 21460 KB Output is correct
39 Correct 11 ms 21460 KB Output is correct
40 Correct 11 ms 21468 KB Output is correct
41 Correct 11 ms 21460 KB Output is correct
42 Correct 13 ms 21472 KB Output is correct
43 Correct 11 ms 21468 KB Output is correct
44 Correct 11 ms 21460 KB Output is correct
45 Correct 221 ms 102992 KB Output is correct
46 Correct 214 ms 101900 KB Output is correct
47 Correct 225 ms 103412 KB Output is correct
48 Correct 199 ms 82864 KB Output is correct
49 Correct 225 ms 88868 KB Output is correct
50 Correct 223 ms 90220 KB Output is correct
51 Correct 14 ms 21708 KB Output is correct
52 Correct 78 ms 44156 KB Output is correct
53 Correct 222 ms 88836 KB Output is correct
54 Correct 227 ms 90068 KB Output is correct
55 Correct 231 ms 89424 KB Output is correct
56 Correct 241 ms 91488 KB Output is correct
57 Correct 221 ms 86068 KB Output is correct
58 Correct 217 ms 90432 KB Output is correct
59 Correct 96 ms 45392 KB Output is correct
60 Correct 216 ms 86136 KB Output is correct
61 Correct 237 ms 92476 KB Output is correct
62 Correct 237 ms 93976 KB Output is correct
63 Correct 245 ms 93932 KB Output is correct
64 Correct 242 ms 94032 KB Output is correct
65 Correct 276 ms 97416 KB Output is correct
66 Correct 245 ms 97356 KB Output is correct
67 Correct 250 ms 105760 KB Output is correct
68 Correct 243 ms 105924 KB Output is correct
69 Correct 232 ms 105776 KB Output is correct
70 Correct 253 ms 105732 KB Output is correct