結果
問題 | No.2403 "Eight" Bridges of Königsberg |
ユーザー | ebi_fly |
提出日時 | 2023-08-04 21:40:24 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 35 ms / 2,000 ms |
コード長 | 4,811 bytes |
コンパイル時間 | 1,606 ms |
コンパイル使用メモリ | 149,712 KB |
実行使用メモリ | 15,536 KB |
最終ジャッジ日時 | 2024-11-26 17:46:33 |
合計ジャッジ時間 | 3,191 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 16 ms
5,248 KB |
testcase_05 | AC | 29 ms
5,248 KB |
testcase_06 | AC | 33 ms
5,248 KB |
testcase_07 | AC | 21 ms
5,248 KB |
testcase_08 | AC | 23 ms
5,248 KB |
testcase_09 | AC | 35 ms
5,248 KB |
testcase_10 | AC | 30 ms
5,248 KB |
testcase_11 | AC | 24 ms
5,248 KB |
testcase_12 | AC | 34 ms
5,248 KB |
testcase_13 | AC | 24 ms
5,248 KB |
testcase_14 | AC | 2 ms
5,248 KB |
testcase_15 | AC | 1 ms
5,248 KB |
testcase_16 | AC | 2 ms
5,248 KB |
testcase_17 | AC | 2 ms
5,248 KB |
testcase_18 | AC | 1 ms
5,248 KB |
testcase_19 | AC | 22 ms
15,536 KB |
testcase_20 | AC | 5 ms
5,504 KB |
testcase_21 | AC | 12 ms
9,344 KB |
testcase_22 | AC | 20 ms
14,336 KB |
testcase_23 | AC | 18 ms
13,952 KB |
testcase_24 | AC | 15 ms
11,904 KB |
testcase_25 | AC | 14 ms
11,452 KB |
testcase_26 | AC | 1 ms
5,248 KB |
testcase_27 | AC | 21 ms
14,720 KB |
testcase_28 | AC | 17 ms
12,288 KB |
testcase_29 | AC | 5 ms
5,248 KB |
testcase_30 | AC | 10 ms
8,192 KB |
testcase_31 | AC | 21 ms
14,948 KB |
testcase_32 | AC | 2 ms
5,248 KB |
testcase_33 | AC | 8 ms
6,912 KB |
testcase_34 | AC | 4 ms
5,248 KB |
ソースコード
#include <algorithm>#include <bitset>#include <cassert>#include <chrono>#include <climits>#include <cmath>#include <complex>#include <cstddef>#include <cstdint>#include <cstdlib>#include <cstring>#include <functional>#include <iomanip>#include <iostream>#include <limits>#include <map>#include <memory>#include <numeric>#include <optional>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <type_traits>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>/* macro */#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)#define rrep(i, a, n) for (int i = ((int)(n)-1); i >= (int)(a); i--)#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)#define RRep(i, a, n) for (i64 i = ((i64)(n)-i64(1)); i >= (i64)(a); i--)#define all(v) (v).begin(), (v).end()#define rall(v) (v).rbegin(), (v).rend()/* macro end *//* template */namespace ebi {#ifdef LOCAL#define debug(...) \std::cerr << "LINE: " << __LINE__ << " [" << #__VA_ARGS__ << "]:", \debug_out(__VA_ARGS__)#else#define debug(...)#endifvoid debug_out() {std::cerr << std::endl;}template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {std::cerr << " " << h;if (sizeof...(t) > 0) std::cerr << " :";debug_out(t...);}template <typename T1, typename T2>std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {return os << pa.first << " " << pa.second;}template <typename T1, typename T2>std::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {return os >> pa.first >> pa.second;}template <typename T>std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");return os;}template <typename T>std::istream &operator>>(std::istream &os, std::vector<T> &vec) {for (T &e : vec) std::cin >> e;return os;}template <typename T>std::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {if (opt) {os << opt.value();} else {os << "invalid value";}return os;}using std::size_t;using i32 = std::int32_t;using u32 = std::uint32_t;using i64 = std::int64_t;using u64 = std::uint64_t;using i128 = __int128_t;using u128 = __uint128_t;template <class T> inline bool chmin(T &a, T b) {if (a > b) {a = b;return true;}return false;}template <class T> inline bool chmax(T &a, T b) {if (a < b) {a = b;return true;}return false;}template <class T> T pow(T x, i64 n) {T res = 1;while (n > 0) {if (n & 1) res = res * x;x = x * x;n >>= 1;}return res;}template <class T> struct Edge {int to;T cost;Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}};template <class T> struct Graph : std::vector<std::vector<Edge<T>>> {using std::vector<std::vector<Edge<T>>>::vector;void add_edge(int u, int v, T w, bool directed = false) {(*this)[u].emplace_back(v, w);if (directed) return;(*this)[v].emplace_back(u, w);}};struct graph : std::vector<std::vector<int>> {using std::vector<std::vector<int>>::vector;void add_edge(int u, int v, bool directed = false) {(*this)[u].emplace_back(v);if (directed) return;(*this)[v].emplace_back(u);}};constexpr i64 LNF = std::numeric_limits<i64>::max() / 4;constexpr int INF = std::numeric_limits<int>::max() / 2;const std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};const std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};} // namespace ebi#include <atcoder/dsu>namespace ebi {void main_() {int n,m;std::cin >> n >> m;atcoder::dsu uf(n);std::vector<int> in(n, 0), out(n, 0);rep(i,0,m) {int u,v;std::cin >> u >> v;u--; v--;uf.merge(u, v);out[u]++;in[v]++;}int ans = 0;bool is_start = true;for(auto vs: uf.groups()) {if(vs.size() == 1 && in[vs.back()] == 0) continue;int cnt = 0;for(auto v: vs) {if(in[v] < out[v]) cnt += out[v] - in[v];}ans += std::max(0, cnt - 1);if(is_start) {is_start = false;}else ans++;}std::cout << ans << '\n';}} // namespace ebiint main() {std::cout << std::fixed << std::setprecision(15);std::cin.tie(nullptr);std::ios::sync_with_stdio(false);int t = 1;// std::cin >> t;while (t--) {ebi::main_();}return 0;}