# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
604824 | M_W | The Xana coup (BOI21_xanadu) | C++17 | 67 ms | 7680 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int N;
const int inf = 1000000;
vector<int> adj[100001];
int dp[100001][2][2];
int st[100001];
int main(){
scanf("%d", &N);
for(int i = 1, u, v; i < N; i++){
scanf("%d %d", &u, &v);
adj[u].push_back(v);
adj[v].push_back(u);
}
for(int i = 1; i <= N; i++) scanf("%d", &st[i]);
for(int i = 1; i <= N; i++){
dp[i][0][0] = dp[i][0][1] = inf;
dp[i][1][0] = dp[i][1][1] = inf;
}
dp[2][st[2]][st[1]] = 0; dp[2][1 - st[2]][1 - st[1]] = 1;
for(int i = 3; i <= N; i++){
dp[i][st[i]][0] = min(dp[i][st[i]][0], dp[i - 1][0][1]);
dp[i][st[i]][1] = min(dp[i][st[i]][1], dp[i - 1][1][1]);
dp[i][1 - st[i]][0] = min(dp[i][1 - st[i]][0], dp[i - 1][1][0] + 1);
dp[i][1 - st[i]][1] = min(dp[i][1 - st[i]][1], dp[i - 1][0][0] + 1);
}
dp[N][1][1] = min({dp[N][1][1], dp[N][0][0] + 1});
if(dp[N][1][1] >= inf) printf("impossible");
else printf("%d", dp[N][1][1]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |