Submission #73919747

Source Code Expand

#include <bits/stdc++.h>
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 0
#endif
using namespace std;
using ll = long long;
using db = double;
const ll N = 2e5 + 5;
const ll md = 998244353;
const ll MOD = 1e9 + 7;
const ll INF = 0x3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db eps = 1e-6;
const db E = 2.718281828459045;
typedef pair<ll, ll> PLL;
#define fi first
#define se second
ll ans[N],a[N];
vector<vector<ll>> g(N);
int vis[N];
map<ll, ll> mp;
void dfs(ll u,ll f)
{

    for(auto v:g[u])
    {
        if(vis[v] == 1)
            continue;
        vis[v] = 1;
        ll ff = f;
        if(mp[a[v]] || ff==1)
            ans[v] = 1;
        if(ans[v]==1)
            ff = 1;
        // cout << v << ' ' << ans[v] << ' ' << f << '\n';
        mp[a[v]]++;
        dfs(v,ff);
        mp[a[v]]--;
    }
}
void solve()
{
    ll n;
    cin >> n;
    for(ll i=1;i<=n;i++)
    {
        cin >> a[i];
    }
    for(ll i=1;i<=n-1;i++)
    {
        ll u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    vis[1] = 1;
    mp[a[1]]++;
    dfs(1,0);
    for (ll i = 1; i <= n;i++)
    {
        if(ans[i])
            cout << "Yes\n";
        else
            cout << "No\n";
    }
}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T;
    T = 1;
    //cin>>T;
    while (T--)
    {
        solve();
    }
}

Submission Info

Submission Time
Task D - Integer-duplicated Path
User AChievedreaM
Language C++23 (GCC 15.2.0)
Score 400
Code Size 1456 Byte
Status AC
Exec Time 277 ms
Memory 49564 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 189 ms 34588 KiB
hack_02.txt AC 183 ms 34568 KiB
hack_03.txt AC 44 ms 18192 KiB
hack_04.txt AC 43 ms 18236 KiB
hack_05.txt AC 132 ms 31520 KiB
hack_06.txt AC 125 ms 31444 KiB
sample_01.txt AC 3 ms 7960 KiB
sample_02.txt AC 3 ms 8044 KiB
sample_03.txt AC 3 ms 8016 KiB
test_01.txt AC 3 ms 8024 KiB
test_02.txt AC 3 ms 8024 KiB
test_03.txt AC 254 ms 47800 KiB
test_04.txt AC 266 ms 49380 KiB
test_05.txt AC 264 ms 49564 KiB
test_06.txt AC 234 ms 44376 KiB
test_07.txt AC 87 ms 36920 KiB
test_08.txt AC 80 ms 36900 KiB
test_09.txt AC 153 ms 30596 KiB
test_10.txt AC 154 ms 30640 KiB
test_11.txt AC 157 ms 30724 KiB
test_12.txt AC 128 ms 22396 KiB
test_13.txt AC 51 ms 19844 KiB
test_14.txt AC 46 ms 19728 KiB
test_15.txt AC 199 ms 31416 KiB
test_16.txt AC 208 ms 31440 KiB
test_17.txt AC 201 ms 31416 KiB
test_18.txt AC 191 ms 30052 KiB
test_19.txt AC 71 ms 20452 KiB
test_20.txt AC 69 ms 20508 KiB
test_21.txt AC 204 ms 32312 KiB
test_22.txt AC 175 ms 30692 KiB
test_23.txt AC 188 ms 31296 KiB
test_24.txt AC 131 ms 21360 KiB
test_25.txt AC 62 ms 20408 KiB
test_26.txt AC 57 ms 21140 KiB
test_27.txt AC 249 ms 43840 KiB
test_28.txt AC 235 ms 36024 KiB
test_29.txt AC 252 ms 44984 KiB
test_30.txt AC 217 ms 38328 KiB
test_31.txt AC 77 ms 29336 KiB
test_32.txt AC 79 ms 31568 KiB
test_33.txt AC 218 ms 37524 KiB
test_34.txt AC 263 ms 45552 KiB
test_35.txt AC 277 ms 42212 KiB
test_36.txt AC 192 ms 27684 KiB
test_37.txt AC 91 ms 34580 KiB
test_38.txt AC 71 ms 23576 KiB