結果

問題 No.2780 The Bottle Imp
ユーザー ___Johniel___Johniel
提出日時 2024-06-07 21:55:59
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,705 bytes
コンパイル時間 3,645 ms
コンパイル使用メモリ 250,108 KB
実行使用メモリ 10,880 KB
最終ジャッジ日時 2024-06-08 10:29:44
合計ジャッジ時間 5,015 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
5,248 KB
testcase_01 AC 3 ms
5,376 KB
testcase_02 AC 3 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 3 ms
5,376 KB
testcase_07 AC 18 ms
5,760 KB
testcase_08 AC 20 ms
5,888 KB
testcase_09 AC 20 ms
6,016 KB
testcase_10 AC 21 ms
5,888 KB
testcase_11 AC 18 ms
5,760 KB
testcase_12 AC 27 ms
7,808 KB
testcase_13 AC 29 ms
7,808 KB
testcase_14 AC 14 ms
5,376 KB
testcase_15 AC 15 ms
5,376 KB
testcase_16 AC 16 ms
5,376 KB
testcase_17 AC 16 ms
5,376 KB
testcase_18 AC 15 ms
5,376 KB
testcase_19 AC 15 ms
5,376 KB
testcase_20 AC 15 ms
5,376 KB
testcase_21 AC 15 ms
5,376 KB
testcase_22 AC 10 ms
5,376 KB
testcase_23 AC 14 ms
5,376 KB
testcase_24 AC 18 ms
5,632 KB
testcase_25 AC 25 ms
6,784 KB
testcase_26 AC 16 ms
5,376 KB
testcase_27 AC 15 ms
5,888 KB
testcase_28 AC 15 ms
5,888 KB
testcase_29 WA -
testcase_30 AC 12 ms
5,760 KB
testcase_31 AC 25 ms
8,320 KB
testcase_32 AC 10 ms
5,376 KB
testcase_33 AC 28 ms
10,880 KB
testcase_34 AC 28 ms
10,624 KB
testcase_35 AC 9 ms
5,376 KB
testcase_36 AC 3 ms
5,376 KB
testcase_37 WA -
testcase_38 AC 9 ms
5,376 KB
testcase_39 AC 22 ms
7,936 KB
testcase_40 AC 23 ms
7,808 KB
testcase_41 AC 23 ms
7,808 KB
testcase_42 AC 3 ms
5,376 KB
testcase_43 AC 3 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// github.com/Johniel/contests
// yukicoder/2780/main.cpp

#include <bits/stdc++.h>

#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))

using namespace std;

template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p);
template<typename P, typename Q> istream& operator >> (istream& is, pair<P, Q>& p);
template<typename P, typename Q, typename R> ostream& operator << (ostream& os, tuple<P, Q, R> t) { os << "(" << get<0>(t) << "," << get<1>(t) << "," << get<2>(t) << ")"; return os; }
template<typename P, typename Q, typename R> istream& operator >> (istream& is, tuple<P, Q, R>& t) { is >> get<0>(t) >> get<1>(t) >> get<2>(t); return is; }
template<typename T> ostream& operator << (ostream& os, vector<T> v) { os << "("; for (auto& i: v) os << i << ","; os << ")"; return os; }
template<typename T> istream& operator >> (istream& is, vector<T>& v) { for (auto& i: v) is >> i; return is; }
template<typename T> ostream& operator << (ostream& os, set<T> s) { os << "set{"; for (auto& i: s) os << i << ","; os << "}"; return os; }
template<typename K, typename V> ostream& operator << (ostream& os, map<K, V> m) { os << "map{"; for (auto& i: m) os << i << ","; os << "}"; return os; }
template<typename E, size_t N> istream& operator >> (istream& is, array<E, N>& a) { for (auto& i: a) is >> i; return is; }
template<typename E, size_t N> ostream& operator << (ostream& os, array<E, N>& a) { os << "[" << N << "]{"; for (auto& i: a) os << i << ","; os << "}"; return os; }
template<typename T> ostream& operator << (ostream& os, stack<T> s) { os << "stack{"; while (s.size()) { os << s.top() << ","; s.pop(); } os << "}"; return os; }
template<typename T> ostream& operator << (ostream& os, queue<T> q) { os << "queue{"; while (q.size()) { os << q.front() << ","; q.pop(); } os << "}"; return os; }
template<typename T> ostream& operator << (ostream& os, deque<T> q) { os << "deque{"; for (int i = 0; i < q.size(); ++i) os << q[i] << ","; os << "}"; return os; }
template<typename T> ostream& operator << (ostream& os, priority_queue<T> q) { os << "heap{"; while (q.size()) { os << q.top() << ","; q.pop(); } os << "}"; return os; }
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << "," << p.second << ")"; return os; }
template<typename P, typename Q> istream& operator >> (istream& is, pair<P, Q>& p) { is >> p.first >> p.second; return is; }

template<typename T> inline T setmax(T& a, T b) { return a = std::max(a, b); }
template<typename T> inline T setmin(T& a, T b) { return a = std::min(a, b); }

__attribute__((constructor)) static void _____(void) { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.setf(ios_base::fixed); cout.precision(15); return ; }

using lli = long long int;
using ull = unsigned long long;
using str = string;
template<typename T> using vec = vector<T>;

// constexpr lli mod = 1e9 + 7;
constexpr lli mod = 998244353;

const int N = 1e5 + 3;
vec<int> g[N];
bool vis[N];

void rec(int curr)
{
  vis[curr] = true;
  each (next, g[curr]) {
    if (vis[next]) continue;
    rec(next);
  }
  return ;
}

int main(int argc, char *argv[])
{
  int n;
  while (cin >> n) {
    fill(g, g + n, vec<int>());
    for (int i = 0; i < n; ++i) {
      int m;
      cin >> m;
      for (int j = 0; j < m; ++j) {
        int x;
        cin >> x;
        --x;
        g[i].push_back(x);
      }
    }
    fill(vis, vis + n, false);
    rec(0);
    bool f = true;
    f = f && (count(vis, vis + n, true) == n);
    int leaf = 0;
    for (int i = 0; i < n; ++i) {
      leaf += g[i].empty();
    }
    f = f && (leaf <= 1);
    cout << (f ? "Yes" : "No") << endl;
  }
  return 0;
}
0