답안 #778646

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
778646 2023-07-10T14:11:02 Z vjudge1 Deblo (COCI18_deblo) C++17
45 / 90
1000 ms 11524 KB
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#include<iostream>
#include <vector>
#include <bitset>
using namespace std;
#define lalala ios_base::sync_with_stdio(false);cin.tie(NULL);
#define endl "\n"
#define ll long long
#define pb push_back
#define N 100001
int arr[N];
vector<int> adj[N];
bitset<100001>isaret;
ll int dfs(int x,int once,int prevgel){
	ll int topla=0;
	if(isaret[x]==0)topla=prevgel^arr[x];
	for(auto u:adj[x]){
		if(u==once) continue;
		topla+=dfs(u,x,prevgel^arr[x]);
	}
	return topla;
}

vector<int> yol;
void uff(int x,int once){
	for(auto u:adj[x]){
		if(u!=once)uff(u,x);
	}
	yol.pb(x);
}
int main(){
	lalala;
	int n;cin>>n;
	for(int i=1;i<=n;i++)cin>>arr[i];
	for(int i=0;i<n-1;i++){
		int a,b;cin>>a>>b;
		adj[a].pb(b);
		adj[b].pb(a);
	}
	uff(1,0);
	ll int cev=0;
	for(int i=yol.size()-1;i>-1;i--){
		cev+=dfs(yol[i],-1,0);
		isaret[yol[i]]=1;
	}
	cout<<cev<<"\n";
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 9 ms 2748 KB Output is correct
5 Correct 9 ms 2736 KB Output is correct
6 Execution timed out 1038 ms 11460 KB Time limit exceeded
7 Execution timed out 1062 ms 11524 KB Time limit exceeded
8 Execution timed out 1060 ms 8272 KB Time limit exceeded
9 Execution timed out 1063 ms 7668 KB Time limit exceeded
10 Execution timed out 1065 ms 7384 KB Time limit exceeded