結果
| 問題 | No.1813 Magical Stones |
| ユーザー |
 ei1333333
|
| 提出日時 | 2022-01-14 21:48:38 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,197 bytes |
| コンパイル時間 | 2,352 ms |
| コンパイル使用メモリ | 211,588 KB |
| 最終ジャッジ日時 | 2025-01-27 11:16:34 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 WA * 1 |
| other | AC * 34 WA * 6 |
ソースコード
#include <bits/stdc++.h>using namespace std;using int64 = long long;const int mod = 1e9 + 7;// const int mod = 998244353;const int64 infll = (1LL << 62) - 1;const int inf = (1 << 30) - 1;struct IoSetup {IoSetup() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(10);cerr << fixed << setprecision(10);}} iosetup;template< typename T1, typename T2 >ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {os << p.first << " " << p.second;return os;}template< typename T1, typename T2 >istream &operator>>(istream &is, pair< T1, T2 > &p) {is >> p.first >> p.second;return is;}template< typename T >ostream &operator<<(ostream &os, const vector< T > &v) {for(int i = 0; i < (int) v.size(); i++) {os << v[i] << (i + 1 != v.size() ? " " : "");}return os;}template< typename T >istream &operator>>(istream &is, vector< T > &v) {for(T &in: v) is >> in;return is;}template< typename T1, typename T2 >inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }template< typename T1, typename T2 >inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }template< typename T = int64 >vector< T > make_v(size_t a) {return vector< T >(a);}template< typename T, typename... Ts >auto make_v(size_t a, Ts... ts) {return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));}template< typename T, typename V >typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {t = v;}template< typename T, typename V >typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {for(auto &e: t) fill_v(e, v);}template< typename F >struct FixPoint : F {FixPoint(F &&f) : F(forward< F >(f)) {}template< typename... Args >decltype(auto) operator()(Args &&... args) const {return F::operator()(*this, forward< Args >(args)...);}};template< typename F >inline decltype(auto) MFP(F &&f) {return FixPoint< F >{forward< F >(f)};}/*** @brief Graph Template(グラフテンプレート)*/template< typename T = int >struct Edge {int from, to;T cost;int idx;Edge() = default;Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}operator int() const { return to; }};template< typename T = int >struct Graph {vector< vector< Edge< T > > > g;int es;Graph() = default;explicit Graph(int n) : g(n), es(0) {}size_t size() const {return g.size();}void add_directed_edge(int from, int to, T cost = 1) {g[from].emplace_back(from, to, cost, es++);}void add_edge(int from, int to, T cost = 1) {g[from].emplace_back(from, to, cost, es);g[to].emplace_back(to, from, cost, es++);}void read(int M, int padding = -1, bool weighted = false, bool directed = false) {for(int i = 0; i < M; i++) {int a, b;cin >> a >> b;a += padding;b += padding;T c = T(1);if(weighted) cin >> c;if(directed) add_directed_edge(a, b, c);else add_edge(a, b, c);}}inline vector< Edge< T > > &operator[](const int &k) {return g[k];}inline const vector< Edge< T > > &operator[](const int &k) const {return g[k];}};template< typename T = int >using Edges = vector< Edge< T > >;/*** @brief Strongly-Connected-Components(強連結成分分解)*/template< typename T = int >struct StronglyConnectedComponents : Graph< T > {public:using Graph< T >::Graph;using Graph< T >::g;vector< int > comp;Graph< T > dag;vector< vector< int > > group;void build() {rg = Graph< T >(g.size());for(int i = 0; i < g.size(); i++) {for(auto &e: g[i]) {rg.add_directed_edge(e.to, e.from, e.cost);}}comp.assign(g.size(), -1);used.assign(g.size(), 0);for(int i = 0; i < g.size(); i++) dfs(i);reverse(begin(order), end(order));int ptr = 0;for(int i: order) if(comp[i] == -1) rdfs(i, ptr), ptr++;dag = Graph< T >(ptr);for(int i = 0; i < g.size(); i++) {for(auto &e: g[i]) {int x = comp[e.from], y = comp[e.to];if(x == y) continue;dag.add_directed_edge(x, y, e.cost);}}group.resize(ptr);for(int i = 0; i < g.size(); i++) {group[comp[i]].emplace_back(i);}}int operator[](int k) const {return comp[k];}private:vector< int > order, used;Graph< T > rg;void dfs(int idx) {if(exchange(used[idx], true)) return;for(auto &to: g[idx]) dfs(to);order.push_back(idx);}void rdfs(int idx, int cnt) {if(comp[idx] != -1) return;comp[idx] = cnt;for(auto &to: rg.g[idx]) rdfs(to, cnt);}};/*** @brief Union-Find* @docs docs/union-find.md*/struct UnionFind {vector< int > data;UnionFind() = default;explicit UnionFind(size_t sz) : data(sz, -1) {}bool unite(int x, int y) {x = find(x), y = find(y);if(x == y) return false;if(data[x] > data[y]) swap(x, y);data[x] += data[y];data[y] = x;return true;}int find(int k) {if(data[k] < 0) return (k);return data[k] = find(data[k]);}int size(int k) {return -data[find(k)];}bool same(int x, int y) {return find(x) == find(y);}vector< vector< int > > groups() {int n = (int) data.size();vector< vector< int > > ret(n);for(int i = 0; i < n; i++) {ret[find(i)].emplace_back(i);}ret.erase(remove_if(begin(ret), end(ret), [&](const vector< int > &v) {return v.empty();}));return ret;}};int main() {int N, M;cin >> N >> M;StronglyConnectedComponents<> g(N);UnionFind uf(N);for(int i = 0; i < M; i++) {int a, b;cin >> a >> b;--a, --b;uf.unite(a, b);g.add_directed_edge(b, a);}g.build();N = (int) g.dag.size();vector< int > in(N), out(N);for(int i = 0; i < N; i++) {for(auto j: g.dag[i]) {in[j]++;out[i]++;}}int a = 0, b = 0;for(int i = 0; i < N; i++) {a += in[i] == 0;b += out[i] == 0;}cout << max(a, b) << "\n";}