Submission #73907994

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,char> pic;
typedef vector<int> vi;
typedef vector<ll> vll;
#define SZ(x) ((int)x.size())
ll ksm(ll a,ll b,ll p){if (p == 1)return 0;if (b == 0)return 1%p;
ll ans = 1;	a %= p;while (b > 0){if (b&1){ans = ans*a%p;}a = (a*a)
%p;b >>= 1;}return ans;}
const int mod = 1e9+7;
const int P = 998244353;
const ll inf = (1LL << 50LL);
const ll N = 2e5 + 10;

ll n;
ll a[N];
map<ll,ll> b;
bool dist[N],ans[N];
vll edges[N];
inline void dfs(ll x,bool t){
	
	b[a[x]]++;
	if (b[a[x]] >= 2){
		t = true;
	}
	ans[x] = t;
	dist[x] = true;
	for (auto y : edges[x]){
		if (!dist[y]){
			dfs(y,t);
		}
	}
	b[a[x]]--;
}
int main(){
	scanf("%lld",&n);
	for (ll i = 1;i <= n;i++){
		scanf("%lld",&a[i]);
	}
	for (ll i = 1;i <= n-1;i++){
		ll u,v;
		scanf("%lld%lld",&u,&v);
		edges[u].push_back(v);
		edges[v].push_back(u);
	}
	dfs(1,false);
	for (ll i = 1;i <= n;i++){
		if (ans[i]){
			printf("Yes\n");
		}
		else {
			printf("No\n");
		}
	}
		
    return 0;
}

Submission Info

Submission Time
Task D - Integer-duplicated Path
User wuqize
Language C++23 (GCC 15.2.0)
Score 400
Code Size 1155 Byte
Status AC
Exec Time 325 ms
Memory 41732 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 47
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All hack_01.txt, hack_02.txt, hack_03.txt, hack_04.txt, hack_05.txt, hack_06.txt, sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt
Case Name Status Exec Time Memory
hack_01.txt AC 209 ms 29744 KiB
hack_02.txt AC 211 ms 29668 KiB
hack_03.txt AC 54 ms 18080 KiB
hack_04.txt AC 53 ms 17920 KiB
hack_05.txt AC 149 ms 26472 KiB
hack_06.txt AC 148 ms 26464 KiB
sample_01.txt AC 2 ms 3584 KiB
sample_02.txt AC 2 ms 3784 KiB
sample_03.txt AC 2 ms 3732 KiB
test_01.txt AC 2 ms 3700 KiB
test_02.txt AC 2 ms 3620 KiB
test_03.txt AC 309 ms 41660 KiB
test_04.txt AC 305 ms 41732 KiB
test_05.txt AC 303 ms 41612 KiB
test_06.txt AC 249 ms 36500 KiB
test_07.txt AC 96 ms 29224 KiB
test_08.txt AC 85 ms 29196 KiB
test_09.txt AC 180 ms 30372 KiB
test_10.txt AC 180 ms 30408 KiB
test_11.txt AC 183 ms 30412 KiB
test_12.txt AC 142 ms 22064 KiB
test_13.txt AC 59 ms 17968 KiB
test_14.txt AC 53 ms 17928 KiB
test_15.txt AC 225 ms 31360 KiB
test_16.txt AC 243 ms 31640 KiB
test_17.txt AC 234 ms 31508 KiB
test_18.txt AC 222 ms 29912 KiB
test_19.txt AC 80 ms 18976 KiB
test_20.txt AC 77 ms 19004 KiB
test_21.txt AC 234 ms 32312 KiB
test_22.txt AC 194 ms 30792 KiB
test_23.txt AC 197 ms 31132 KiB
test_24.txt AC 141 ms 21320 KiB
test_25.txt AC 74 ms 18844 KiB
test_26.txt AC 67 ms 19404 KiB
test_27.txt AC 300 ms 39240 KiB
test_28.txt AC 241 ms 34104 KiB
test_29.txt AC 286 ms 38968 KiB
test_30.txt AC 247 ms 32468 KiB
test_31.txt AC 86 ms 24432 KiB
test_32.txt AC 94 ms 25860 KiB
test_33.txt AC 264 ms 35092 KiB
test_34.txt AC 325 ms 39368 KiB
test_35.txt AC 293 ms 37112 KiB
test_36.txt AC 202 ms 25684 KiB
test_37.txt AC 97 ms 27548 KiB
test_38.txt AC 78 ms 20500 KiB