oj.uz

답안 #867050

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
867050 2023-10-27T15:28:23 Z Ahmed_Solyman The Xana coup (BOI21_xanadu) C++14
100 / 100
 50 ms 20560 KB 
/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include <bits/stdc++.h>
#include <ext/rope>
 
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define fil(arr,x) memset(arr,x,sizeof(arr))
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
    return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
const int N=1e5+5;
vector<int>adj[N],color(N);
ll n,dp[N][2][2];
ll solve(int i,int c,int rev,int p){
	ll &ret=dp[i][c][rev];
	if(~ret)return ret;
	if(adj[i].size()==1 && i!=1){
		if(c==1){
			return ret=1e9;
		}
		else{
			return ret=rev;
		}
	}
	int opt=0;
	bool flag=0;
	ll sum=rev;
	for(auto ch:adj[i]){
		if(ch!=p){
			ll a=solve(ch,rev^color[ch],0,i);
			ll b=solve(ch,1^rev^color[ch],1,i);
			sum+=min(a,b);
			if(a==b){
				flag=1;
			}
			else if(a>b){
				++opt;
			}
		}
	}
	ret=1e9;
	for(auto ch:adj[i]){
		if(ch!=p){
			ll a=solve(ch,rev^color[ch],0,i);
			ll b=solve(ch,1^rev^color[ch],1,i);
			int u=opt-(a>b);
			if((c^(u&1))==0){
				ret=min(ret,sum-min(a,b)+a);
			}
			else{
				ret=min(ret,sum-min(a,b)+b);
			}
		}
	}
	return ret;
}
int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    #ifndef ONLINE_JUDGE
    //freopen("input.in", "r", stdin);
    //freopen("output.out", "w", stdout);
    #endif
    fast
    fil(dp,-1);
    int n;cin>>n;
    for(int i=0;i<n-1;i++){
    	int u,v;cin>>u>>v;
    	adj[u].push_back(v);
    	adj[v].push_back(u);
    }
    for(int i=1;i<=n;i++)cin>>color[i];
    ll ans=min(solve(1,color[1],0,0),solve(1,!color[1],1,0));
	if(ans>=1e9){
		cout<<"impossible"<<endl;
	}
    else{
    	cout<<ans<<endl;
    }
    return 0;
}

Compilation message

xanadu.cpp: In function 'll solve(int, int, int, int)':
xanadu.cpp:53:7: warning: variable 'flag' set but not used [-Wunused-but-set-variable]
   53 |  bool flag=0;
      |       ^~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 20252 KB Output is correct
2 Correct 44 ms 20060 KB Output is correct
3 Correct 44 ms 20364 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 20560 KB Output is correct
2 Correct 49 ms 20104 KB Output is correct
3 Correct 43 ms 20316 KB Output is correct
4 Correct 37 ms 8968 KB Output is correct
5 Correct 41 ms 9308 KB Output is correct
6 Correct 46 ms 9308 KB Output is correct
7 Correct 2 ms 6232 KB Output is correct
8 Correct 15 ms 7260 KB Output is correct
9 Correct 40 ms 9300 KB Output is correct
10 Correct 41 ms 9556 KB Output is correct
11 Correct 39 ms 10072 KB Output is correct
12 Correct 43 ms 10324 KB Output is correct
13 Correct 35 ms 9048 KB Output is correct
14 Correct 43 ms 9304 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6236 KB Output is correct
2 Correct 1 ms 6236 KB Output is correct
3 Correct 2 ms 6236 KB Output is correct
4 Correct 1 ms 6236 KB Output is correct
5 Correct 1 ms 6236 KB Output is correct
6 Correct 1 ms 6236 KB Output is correct
7 Correct 2 ms 6236 KB Output is correct
8 Correct 1 ms 6236 KB Output is correct
9 Correct 2 ms 6236 KB Output is correct
10 Correct 1 ms 6236 KB Output is correct
11 Correct 1 ms 6236 KB Output is correct
12 Correct 1 ms 6236 KB Output is correct
13 Correct 1 ms 6236 KB Output is correct
14 Correct 1 ms 6236 KB Output is correct
15 Correct 1 ms 6236 KB Output is correct
16 Correct 1 ms 6236 KB Output is correct
17 Correct 46 ms 20252 KB Output is correct
18 Correct 44 ms 20060 KB Output is correct
19 Correct 44 ms 20364 KB Output is correct
20 Correct 50 ms 20560 KB Output is correct
21 Correct 49 ms 20104 KB Output is correct
22 Correct 43 ms 20316 KB Output is correct
23 Correct 37 ms 8968 KB Output is correct
24 Correct 41 ms 9308 KB Output is correct
25 Correct 46 ms 9308 KB Output is correct
26 Correct 2 ms 6232 KB Output is correct
27 Correct 15 ms 7260 KB Output is correct
28 Correct 40 ms 9300 KB Output is correct
29 Correct 41 ms 9556 KB Output is correct
30 Correct 39 ms 10072 KB Output is correct
31 Correct 43 ms 10324 KB Output is correct
32 Correct 35 ms 9048 KB Output is correct
33 Correct 43 ms 9304 KB Output is correct
34 Correct 2 ms 6236 KB Output is correct
35 Correct 1 ms 6236 KB Output is correct
36 Correct 1 ms 6232 KB Output is correct
37 Correct 1 ms 6236 KB Output is correct
38 Correct 3 ms 6236 KB Output is correct
39 Correct 1 ms 6236 KB Output is correct
40 Correct 2 ms 6236 KB Output is correct
41 Correct 2 ms 6236 KB Output is correct
42 Correct 2 ms 6236 KB Output is correct
43 Correct 1 ms 6236 KB Output is correct
44 Correct 1 ms 6236 KB Output is correct
45 Correct 42 ms 20200 KB Output is correct
46 Correct 42 ms 20096 KB Output is correct
47 Correct 42 ms 20304 KB Output is correct
48 Correct 37 ms 9048 KB Output is correct
49 Correct 41 ms 9308 KB Output is correct
50 Correct 46 ms 9308 KB Output is correct
51 Correct 2 ms 6232 KB Output is correct
52 Correct 14 ms 7260 KB Output is correct
53 Correct 40 ms 9308 KB Output is correct
54 Correct 43 ms 9484 KB Output is correct
55 Correct 42 ms 10132 KB Output is correct
56 Correct 41 ms 10324 KB Output is correct
57 Correct 36 ms 9048 KB Output is correct
58 Correct 38 ms 9252 KB Output is correct
59 Correct 15 ms 7260 KB Output is correct
60 Correct 38 ms 9092 KB Output is correct
61 Correct 41 ms 9304 KB Output is correct
62 Correct 45 ms 9560 KB Output is correct
63 Correct 43 ms 9556 KB Output is correct
64 Correct 43 ms 9432 KB Output is correct
65 Correct 37 ms 9808 KB Output is correct
66 Correct 38 ms 9816 KB Output is correct
67 Correct 38 ms 9680 KB Output is correct
68 Correct 41 ms 9680 KB Output is correct
69 Correct 40 ms 9684 KB Output is correct
70 Correct 37 ms 9680 KB Output is correct