Submission #73912973

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int N;
vector<int> A;
vector<vector<int>> tree;
vector<string> ans;
unordered_set<int> path_values;

void dfs(int u, int parent) {
    if (path_values.count(A[u])) {
        ans[u] = "Yes";
    } else {
        ans[u] = "No";
    }

    path_values.insert(A[u]);

    for (int v : tree[u]) {
        if (v != parent) {
            dfs(v, u);
        }
    }

    path_values.erase(A[u]); // 回溯
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N;
    A.resize(N+1);
    tree.resize(N+1);
    ans.resize(N+1);

    for (int i = 1; i <= N; i++) cin >> A[i];

    for (int i = 0; i < N-1; i++) {
        int u, v;
        cin >> u >> v;
        tree[u].push_back(v);
        tree[v].push_back(u);
    }

    dfs(1, 0);

    for (int i = 1; i <= N; i++) cout << ans[i] << "\n";

    return 0;
}

Submission Info

Submission Time
Task D - Integer-duplicated Path
User wmxw
Language C++23 (GCC 15.2.0)
Score 0
Code Size 924 Byte
Status WA
Exec Time 109 ms
Memory 52020 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
WA × 1
AC × 22
WA × 25
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 86 ms 38384 KiB
hack_02.txt AC 77 ms 38176 KiB
hack_03.txt AC 52 ms 24660 KiB
hack_04.txt AC 49 ms 24788 KiB
hack_05.txt WA 70 ms 36112 KiB
hack_06.txt WA 70 ms 36076 KiB
sample_01.txt AC 2 ms 6376 KiB
sample_02.txt AC 2 ms 6252 KiB
sample_03.txt WA 2 ms 6364 KiB
test_01.txt AC 2 ms 6268 KiB
test_02.txt AC 2 ms 6448 KiB
test_03.txt AC 109 ms 51868 KiB
test_04.txt WA 108 ms 51964 KiB
test_05.txt WA 108 ms 52020 KiB
test_06.txt WA 98 ms 47820 KiB
test_07.txt WA 76 ms 42912 KiB
test_08.txt AC 74 ms 42968 KiB
test_09.txt AC 52 ms 24832 KiB
test_10.txt AC 49 ms 24840 KiB
test_11.txt AC 49 ms 24888 KiB
test_12.txt WA 50 ms 24816 KiB
test_13.txt WA 48 ms 24860 KiB
test_14.txt WA 48 ms 24800 KiB
test_15.txt AC 69 ms 24184 KiB
test_16.txt AC 69 ms 24184 KiB
test_17.txt AC 70 ms 24168 KiB
test_18.txt WA 70 ms 23992 KiB
test_19.txt WA 65 ms 24132 KiB
test_20.txt WA 65 ms 24224 KiB
test_21.txt AC 63 ms 25692 KiB
test_22.txt AC 62 ms 24512 KiB
test_23.txt AC 59 ms 25152 KiB
test_24.txt WA 57 ms 25280 KiB
test_25.txt WA 61 ms 24648 KiB
test_26.txt WA 59 ms 25400 KiB
test_27.txt AC 97 ms 44000 KiB
test_28.txt AC 85 ms 32664 KiB
test_29.txt WA 95 ms 43532 KiB
test_30.txt WA 90 ms 40388 KiB
test_31.txt WA 72 ms 34320 KiB
test_32.txt WA 72 ms 36352 KiB
test_33.txt AC 83 ms 34484 KiB
test_34.txt WA 96 ms 44380 KiB
test_35.txt WA 92 ms 39532 KiB
test_36.txt WA 75 ms 26752 KiB
test_37.txt WA 74 ms 40056 KiB
test_38.txt WA 69 ms 28448 KiB