結果
| 問題 | No.2780 The Bottle Imp |
| ユーザー |
 iiljj
|
| 提出日時 | 2024-06-07 22:22:30 |
| 言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 15,627 bytes |
| コンパイル時間 | 2,093 ms |
| コンパイル使用メモリ | 192,424 KB |
| 実行使用メモリ | 23,168 KB |
| 最終ジャッジ日時 | 2024-06-08 10:33:08 |
| 合計ジャッジ時間 | 4,239 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
5,248 KB |
| testcase_01 | AC | 2 ms
5,376 KB |
| testcase_02 | AC | 1 ms
5,376 KB |
| testcase_03 | AC | 2 ms
5,376 KB |
| testcase_04 | AC | 1 ms
5,376 KB |
| testcase_05 | AC | 2 ms
5,376 KB |
| testcase_06 | AC | 1 ms
5,376 KB |
| testcase_07 | AC | 38 ms
13,568 KB |
| testcase_08 | AC | 37 ms
13,696 KB |
| testcase_09 | AC | 35 ms
13,568 KB |
| testcase_10 | AC | 34 ms
13,568 KB |
| testcase_11 | AC | 35 ms
13,568 KB |
| testcase_12 | AC | 61 ms
20,992 KB |
| testcase_13 | AC | 63 ms
21,120 KB |
| testcase_14 | AC | 27 ms
10,112 KB |
| testcase_15 | AC | 26 ms
10,240 KB |
| testcase_16 | AC | 25 ms
10,240 KB |
| testcase_17 | AC | 25 ms
10,112 KB |
| testcase_18 | AC | 25 ms
10,112 KB |
| testcase_19 | AC | 24 ms
10,240 KB |
| testcase_20 | AC | 25 ms
10,112 KB |
| testcase_21 | AC | 25 ms
10,112 KB |
| testcase_22 | AC | 15 ms
7,424 KB |
| testcase_23 | AC | 21 ms
8,960 KB |
| testcase_24 | AC | 30 ms
11,904 KB |
| testcase_25 | AC | 48 ms
17,024 KB |
| testcase_26 | AC | 29 ms
11,392 KB |
| testcase_27 | AC | 21 ms
13,140 KB |
| testcase_28 | AC | 20 ms
13,132 KB |
| testcase_29 | WA | - |
| testcase_30 | AC | 18 ms
10,712 KB |
| testcase_31 | AC | 37 ms
21,248 KB |
| testcase_32 | AC | 52 ms
9,216 KB |
| testcase_33 | AC | 47 ms
23,040 KB |
| testcase_34 | AC | 49 ms
23,168 KB |
| testcase_35 | AC | 14 ms
7,296 KB |
| testcase_36 | AC | 2 ms
5,376 KB |
| testcase_37 | WA | - |
| testcase_38 | AC | 13 ms
7,296 KB |
| testcase_39 | AC | 32 ms
17,984 KB |
| testcase_40 | AC | 30 ms
17,856 KB |
| testcase_41 | AC | 31 ms
17,856 KB |
| testcase_42 | AC | 2 ms
5,376 KB |
| testcase_43 | AC | 2 ms
5,376 KB |
ソースコード
/* #region Head */
// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath> // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;
#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))
#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))
#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))
#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))
#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))
#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define ISIZE(x) ((int)(x).size())
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))
#define endl '\n'
constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;
// 前方宣言
template <typename T> istream &operator>>(istream &is, vc<T> &vec);
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec);
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec);
template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr);
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr);
template <typename T, size_t _Nm> ostream &operator>>(ostream &os, const array<T, _Nm> &arr);
template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var);
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var);
template <class T> ostream &out_iter(ostream &os, const T &map_var);
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var);
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var);
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var);
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var);
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var);
template <typename T> ostream &operator<<(ostream &os, const queue<T> &queue_var);
template <typename T> ostream &operator<<(ostream &os, const stack<T> &stk_var);
template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
for (T &x : vec)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
os << "{";
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
return os;
}
template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
REP(i, 0, SIZE(arr)) is >> arr[i];
return is;
}
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)
os << "{";
REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
is >> pair_var.first >> pair_var.second;
return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
auto itrcp = itr;
if (++itrcp != map_var.end()) os << ", ";
}
return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {
return out_iter(os, map_var);
}
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {
os << "{";
REPI(itr, map_var) {
auto [key, value] = *itr;
os << "(" << key << ", " << value << ")";
auto itrcp = itr;
if (++itrcp != map_var.end()) os << ", ";
}
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
pq<T> pq_cp(pq_var);
os << "{";
if (!pq_cp.empty()) {
os << pq_cp.top(), pq_cp.pop();
while (!pq_cp.empty())
os << ", " << pq_cp.top(), pq_cp.pop();
}
return os << "}";
}
// tuple 出力
template <size_t N = 0, bool end_line = false, typename... Args> ostream &operator<<(ostream &os, tuple<Args...> &a) {
if constexpr (N < std::tuple_size_v<tuple<Args...>>) {
os << get<N>(a);
if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {
os << ' ';
} else if constexpr (end_line) {
os << '\n';
}
return operator<< <N + 1, end_line>(os, a);
}
return os;
}
template <typename... Args> void print_tuple(tuple<Args...> &a) { operator<< <0, true>(std::cout, a); }
void pprint() { std::cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {
std::cout << head;
if (sizeof...(Tail) > 0) std::cout << ' ';
pprint(move(tail)...);
}
// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) DUMPOUT << ", ";
dump_func(move(tail)...);
}
// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
if (comp(xmax, x)) {
xmax = x;
return true;
}
return false;
}
// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
if (comp(x, xmin)) {
xmin = x;
return true;
}
return false;
}
// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif
#ifndef MYLOCAL
#undef DEBUG_
#endif
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
#define VAR(type, ...) \
type __VA_ARGS__; \
assert((std::cin >> __VA_ARGS__));
template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }
struct AtCoderInitialize {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
AtCoderInitialize() {
ios_base::sync_with_stdio(false), std::cin.tie(nullptr), std::cout.tie(nullptr);
std::cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH) std::cout << unitbuf;
}
} ATCODER_INITIALIZE;
void Yn(bool p) { std::cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { std::cout << (p ? "YES" : "NO") << endl; }
template <typename T> constexpr void operator--(vc<T> &v, int) noexcept {
for (int i = 0; i < ISIZE(v); ++i)
v[i]--;
}
template <typename T> constexpr void operator++(vc<T> &v, int) noexcept {
for (int i = 0; i < ISIZE(v); ++i)
v[i]++;
}
/* #endregion */
// #include <atcoder/all>
// using namespace atcoder;
/* #region Graph */
// エッジ（本来エッジは双方向だが，ここでは単方向で管理）
template <class weight_t = int, class flow_t = int> struct Edge {
int src; // エッジ始点となる頂点
int dst; // エッジ終点となる頂点
weight_t weight; // 重み
flow_t cap;
Edge() : src(0), dst(0), weight(0) {}
Edge(int src, int dst, weight_t weight) : src(src), dst(dst), weight(weight) {}
Edge(int src, int dst, weight_t weight, flow_t cap) : src(src), dst(dst), weight(weight), cap(cap) {}
// Edge 標準出力
friend ostream &operator<<(ostream &os, Edge &edge) {
os << "(" << edge.src << " -> " << edge.dst << ", " << edge.weight << ")";
return os;
}
};
// 同じ頂点を始点とするエッジ集合
template <class weight_t = int, class flow_t = int> class Node : public vc<Edge<weight_t, flow_t>> {
public:
int idx;
Node() : vc<Edge<weight_t, flow_t>>() {}
// void add(int a, int b, weight_t w, flow_t cap) { this->emplace_back(a, b, w, cap); };
};
// graph[i] := 頂点 i を始点とするエッジ集合
template <class weight_t = int, class flow_t = int> class Graph : public vc<Node<weight_t, flow_t>> {
public:
Graph() : vc<Node<weight_t, flow_t>>() {}
Graph(int n) : vc<Node<weight_t, flow_t>>(n) { REP(i, 0, n)(*this)[i].idx = i; }
/** 単方向 */
void add_arc(int a, int b, weight_t w = 1, flow_t cap = 1) { (*this)[a].emplace_back(a, b, w, cap); }
/** 双方向 */
void add_edge(int a, int b, weight_t w = 1, flow_t cap = 1) { add_arc(a, b, w, cap), add_arc(b, a, w, cap); }
/** ノード追加 */
int add_node() {
int idx = (int)this->size();
this->emplace_back();
Node<weight_t, flow_t> &node = this->back();
node.idx = idx;
return idx;
}
};
// using Array = vc<Weight>;
// using Matrix = vc<Array>;
/* #endregion */
/* #region scc */
// 強連結成分分解
template <class weight_t = int, class flow_t = int> pair<int, vc<int>> scc(const Graph<weight_t, flow_t> &g) {
ll n = SIZE(g); // ノード数
Graph<weight_t, flow_t> rg(n); // 逆向きのグラフ
for (const Node<weight_t, flow_t> &es : g) {
for (Edge<weight_t, flow_t> e : es) {
// e はエッジのコピー
swap(e.src, e.dst);
rg[e.src].emplace_back(e);
}
}
vc<int> order;
order.reserve(n);
{ // dfs 1回目
vc<bool> visited(n), added(n);
REP(i, 0, n) {
if (visited[i]) continue;
stack<int> stk;
stk.push(i);
while (!stk.empty()) {
int cur = stk.top();
visited[cur] = true;
bool pushed = false;
for (const Edge<weight_t, flow_t> &e : g[cur])
if (!visited[e.dst]) stk.push(e.dst), pushed = true;
if (!pushed) { // カレントノードからは未訪問ノードへ到達できない
int t = stk.top();
stk.pop(); // 未訪問ノードへ到達できないノードは除いていく
if (!added[t]) added[t] = true, order.push_back(t);
}
}
}
reverse(ALL(order));
}
vc<int> group_indices(n, -1);
int groupnum = 0;
{ // dfs 2回目
for (int &v : order) {
if (group_indices[v] != -1) continue;
stack<int> stk;
stk.push(v);
while (!stk.empty()) {
int cur = stk.top();
stk.pop(), group_indices[cur] = groupnum;
for (Edge<weight_t, flow_t> &e : rg[cur])
if (group_indices[e.dst] == -1) stk.push(e.dst);
}
++groupnum;
}
}
return {groupnum, group_indices};
}
/* #endregion */
// Problem
void solve() {
VAR(ll, n);
vll m(n);
vvll a(n);
REP(i, 0, n) {
cin >> m[i];
a[i].resize(m[i]);
cin >> a[i];
a[i]--;
}
Graph<> graph(n);
REP(i, 0, n) REP(j, 0, m[i]) graph.add_arc(i, a[i][j]);
const auto [groupnum, group_indices] = scc(graph);
// dump(groupnum, group_indices);
if (groupnum == 1) {
Yn(true);
return;
}
// DAG を作ったときに，行き止まりノード（出次数が0）のノードが2つ以上あったらNG
vll in_deg(groupnum, 0);
vll out_deg(groupnum, 0);
REP(i, 0, n) REP(j, 0, m[i]) {
const ll src = group_indices[i];
const ll dst = group_indices[a[i][j]];
if (src == dst) continue;
out_deg[src]++;
in_deg[dst]++;
}
// dump(out_deg);
ll zero = 0;
for (const ll ° : out_deg) {
if (deg == 0) zero++;
}
if (zero >= 2) {
Yn(false);
return;
}
// 人1 のグループは出次数が正である必要がある
if (out_deg[group_indices[0]] == 0) {
Yn(false);
return;
}
// 人1 のグループ以外に，入次数が 0 のグループがあったらNG
REP(gi, 0, groupnum) {
if (gi == group_indices[0]) continue;
if (in_deg[gi] == 0) {
Yn(false);
return;
}
}
Yn(true);
}
// entry point
int main() {
solve();
return 0;
}