結果

問題 No.2822 Lights Up! (Tree Edition)
ユーザー fuppy_kyoprofuppy_kyopro
提出日時 2024-07-26 22:04:37
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 47 ms / 2,000 ms
コード長 5,910 bytes
コンパイル時間 2,548 ms
コンパイル使用メモリ 214,276 KB
実行使用メモリ 12,032 KB
最終ジャッジ日時 2024-07-26 22:04:46
合計ジャッジ時間 7,028 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 47 ms
12,032 KB
testcase_03 AC 46 ms
11,964 KB
testcase_04 AC 46 ms
12,032 KB
testcase_05 AC 46 ms
12,032 KB
testcase_06 AC 46 ms
12,032 KB
testcase_07 AC 46 ms
11,988 KB
testcase_08 AC 26 ms
6,944 KB
testcase_09 AC 45 ms
11,520 KB
testcase_10 AC 36 ms
8,704 KB
testcase_11 AC 27 ms
8,320 KB
testcase_12 AC 29 ms
6,940 KB
testcase_13 AC 22 ms
6,940 KB
testcase_14 AC 29 ms
7,680 KB
testcase_15 AC 31 ms
7,552 KB
testcase_16 AC 3 ms
6,940 KB
testcase_17 AC 3 ms
6,940 KB
testcase_18 AC 6 ms
6,940 KB
testcase_19 AC 4 ms
6,940 KB
testcase_20 AC 4 ms
6,940 KB
testcase_21 AC 6 ms
6,940 KB
testcase_22 AC 5 ms
6,944 KB
testcase_23 AC 5 ms
6,940 KB
testcase_24 AC 5 ms
6,940 KB
testcase_25 AC 3 ms
6,940 KB
testcase_26 AC 5 ms
6,940 KB
testcase_27 AC 3 ms
6,944 KB
testcase_28 AC 5 ms
6,944 KB
testcase_29 AC 6 ms
6,944 KB
testcase_30 AC 5 ms
6,940 KB
testcase_31 AC 4 ms
6,940 KB
testcase_32 AC 6 ms
6,940 KB
testcase_33 AC 6 ms
6,944 KB
testcase_34 AC 6 ms
6,940 KB
testcase_35 AC 6 ms
6,944 KB
testcase_36 AC 6 ms
6,940 KB
testcase_37 AC 6 ms
6,940 KB
testcase_38 AC 6 ms
6,944 KB
testcase_39 AC 6 ms
6,940 KB
testcase_40 AC 6 ms
6,940 KB
testcase_41 AC 7 ms
6,940 KB
testcase_42 AC 6 ms
6,940 KB
testcase_43 AC 6 ms
6,940 KB
testcase_44 AC 7 ms
6,944 KB
testcase_45 AC 6 ms
6,944 KB
testcase_46 AC 6 ms
6,944 KB
testcase_47 AC 7 ms
6,940 KB
testcase_48 AC 3 ms
6,944 KB
testcase_49 AC 2 ms
6,944 KB
testcase_50 AC 2 ms
6,940 KB
testcase_51 AC 3 ms
6,940 KB
testcase_52 AC 3 ms
6,940 KB
testcase_53 AC 3 ms
6,944 KB
testcase_54 AC 2 ms
6,940 KB
testcase_55 AC 3 ms
6,944 KB
testcase_56 AC 3 ms
6,944 KB
testcase_57 AC 2 ms
6,940 KB
testcase_58 AC 3 ms
6,944 KB
testcase_59 AC 2 ms
6,940 KB
testcase_60 AC 3 ms
6,940 KB
testcase_61 AC 2 ms
6,944 KB
testcase_62 AC 2 ms
6,940 KB
testcase_63 AC 3 ms
6,948 KB
testcase_64 AC 2 ms
6,940 KB
testcase_65 AC 2 ms
6,940 KB
testcase_66 AC 2 ms
6,944 KB
testcase_67 AC 2 ms
6,944 KB
testcase_68 AC 2 ms
6,940 KB
testcase_69 AC 2 ms
6,944 KB
testcase_70 AC 2 ms
6,940 KB
testcase_71 AC 2 ms
6,944 KB
testcase_72 AC 2 ms
6,940 KB
testcase_73 AC 2 ms
6,944 KB
testcase_74 AC 2 ms
6,944 KB
testcase_75 AC 3 ms
6,940 KB
testcase_76 AC 2 ms
6,940 KB
testcase_77 AC 3 ms
6,940 KB
testcase_78 AC 2 ms
6,944 KB
testcase_79 AC 3 ms
6,944 KB
testcase_80 AC 2 ms
6,940 KB
testcase_81 AC 2 ms
6,940 KB
testcase_82 AC 2 ms
6,940 KB
testcase_83 AC 2 ms
6,940 KB
testcase_84 AC 2 ms
6,940 KB
testcase_85 AC 2 ms
6,940 KB
testcase_86 AC 2 ms
6,940 KB
testcase_87 AC 2 ms
6,940 KB
testcase_88 AC 2 ms
6,944 KB
testcase_89 AC 2 ms
6,940 KB
testcase_90 AC 2 ms
6,940 KB
testcase_91 AC 2 ms
6,940 KB
testcase_92 AC 2 ms
6,940 KB
testcase_93 AC 2 ms
6,944 KB
testcase_94 AC 2 ms
6,940 KB
testcase_95 AC 2 ms
6,940 KB
testcase_96 AC 2 ms
6,944 KB
testcase_97 AC 2 ms
6,940 KB
testcase_98 AC 2 ms
6,940 KB
testcase_99 AC 2 ms
6,944 KB
testcase_100 AC 2 ms
6,940 KB
testcase_101 AC 2 ms
6,944 KB
testcase_102 AC 2 ms
6,940 KB
testcase_103 AC 2 ms
6,944 KB
testcase_104 AC 2 ms
6,940 KB
testcase_105 AC 2 ms
6,940 KB
testcase_106 AC 2 ms
6,940 KB
testcase_107 AC 2 ms
6,944 KB
testcase_108 AC 2 ms
6,940 KB
testcase_109 AC 2 ms
6,944 KB
testcase_110 AC 3 ms
6,944 KB
testcase_111 AC 2 ms
6,944 KB
testcase_112 AC 2 ms
6,940 KB
testcase_113 AC 2 ms
6,944 KB
testcase_114 AC 2 ms
6,940 KB
testcase_115 AC 2 ms
6,940 KB
testcase_116 AC 2 ms
6,940 KB
testcase_117 AC 2 ms
6,948 KB
testcase_118 AC 2 ms
6,940 KB
testcase_119 AC 2 ms
6,944 KB
testcase_120 AC 2 ms
6,944 KB
testcase_121 AC 2 ms
6,944 KB
testcase_122 AC 2 ms
6,944 KB
testcase_123 AC 2 ms
6,944 KB
testcase_124 AC 3 ms
6,940 KB
testcase_125 AC 2 ms
6,944 KB
testcase_126 AC 2 ms
6,940 KB
testcase_127 AC 2 ms
6,940 KB
testcase_128 AC 2 ms
6,940 KB
testcase_129 AC 2 ms
6,940 KB
testcase_130 AC 2 ms
6,944 KB
testcase_131 AC 2 ms
6,940 KB
testcase_132 AC 2 ms
6,940 KB
testcase_133 AC 2 ms
6,940 KB
testcase_134 AC 2 ms
6,940 KB
testcase_135 AC 2 ms
6,940 KB
testcase_136 AC 2 ms
6,940 KB
testcase_137 AC 2 ms
6,940 KB
testcase_138 AC 2 ms
6,940 KB
testcase_139 AC 3 ms
6,944 KB
testcase_140 AC 3 ms
6,940 KB
testcase_141 AC 3 ms
6,944 KB
testcase_142 AC 2 ms
6,944 KB
testcase_143 AC 2 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/

// #include <atcoder/all>
#include <bits/stdc++.h>

using namespace std;
// using namespace atcoder;

// #define _GLIBCXX_DEBUG

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                        \
    cerr << #v << ":";                                      \
    for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
        cerr << " " << v[iiiiiiii];                         \
    cerr << endl;
#define DEBUG_MAT(v)                                \
    cerr << #v << endl;                             \
    for (int iv = 0; iv < v.size(); iv++) {         \
        for (int jv = 0; jv < v[iv].size(); jv++) { \
            cerr << v[iv][jv] << " ";               \
        }                                           \
        cerr << endl;                               \
    }
typedef long long ll;
// #define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
    return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
    cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
T ceil_div(T a, T b) {
    return (a + b - 1) / b;
}
template <class T>
T safe_mul(T a, T b) {
    if (a == 0 || b == 0) return 0;
    if (numeric_limits<T>::max() / a < b) return numeric_limits<T>::max();
    return a * b;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
vector<int> gen_perm(int n) {
    vector<int> ret(n);
    iota(all(ret), 0);
    return ret;
}
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0};
vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
        cerr << fixed << setprecision(25);
    }
} setup_io;
// constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
// #define mp make_pair

class UnionFind {
  private:
    vi par_;
    vi ran_;
    vi num_;
    vi edge_num_;

  public:
    int n;
    int g; // group

    UnionFind(int _n) {
        n = _n;
        g = n;
        par_.resize(n);
        ran_.resize(n);
        num_.resize(n);
        edge_num_.resize(n);
        for (int i = 0; i < n; i++) {
            par_[i] = i;
            ran_[i] = 0;
            num_[i] = 1;
            edge_num_[i] = 0;
        }
    }

    int find(int x) {
        if (par_[x] == x) {
            return x;
        } else {
            return par_[x] = find(par_[x]);
        }
    }

    void unite(int x, int y) {
        x = find(x);
        y = find(y);
        int numsum = num_[x] + num_[y];
        int edge_numsum = edge_num_[x] + edge_num_[y];
        if (x == y) {
            edge_num_[x]++;
            return;
        }
        if (ran_[x] < ran_[y]) {
            par_[x] = y;
        } else {
            par_[y] = x;
            if (ran_[x] == ran_[y]) {
                ran_[x]++;
            }
        }
        num_[x] = num_[y] = numsum;
        edge_num_[x] = edge_num_[y] = edge_numsum + 1;
        g--;
    }

    bool same(int x, int y) {
        return find(x) == find(y);
    }

    int num(int x) {
        return num_[find(x)];
    }

    int edge_num(int x) {
        return edge_num_[find(x)];
    }
};

signed main() {
    int n;
    cin >> n;
    vi p(n - 1);
    rep(i, n - 1) {
        cin >> p[i];
        p[i]--;
    }
    string s;
    cin >> s;

    vector<vector<pii>> G(n);
    rep(i, n - 1) {
        int u = p[i], v = i + 1;
        G[u].push_back({v, s[i] == '#'});
        G[v].push_back({u, s[i] == '#'});
    }

    vi col(n);
    rep(i, n) {
        for (auto [v, c] : G[i]) {
            col[i] += c;
        }
        col[i] %= 2;
    }
    // DEBUG_VEC(col);

    UnionFind uf(n);
    int k;
    cin >> k;
    rep(i, k) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        uf.unite(u, v);
    }

    vi r2c(n);
    rep(i, n) {
        r2c[uf.find(i)] += col[i];
    }

    rep(i, n) {
        if (r2c[i] % 2 == 1) {
            No();
            return 0;
        }
    }
    Yes();
}
0