結果
問題 | No.2403 "Eight" Bridges of Königsberg |
ユーザー | sgfc |
提出日時 | 2023-08-04 22:47:54 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 31 ms / 2,000 ms |
コード長 | 3,558 bytes |
コンパイル時間 | 3,696 ms |
コンパイル使用メモリ | 239,596 KB |
実行使用メモリ | 16,948 KB |
最終ジャッジ日時 | 2024-11-26 17:51:22 |
合計ジャッジ時間 | 5,221 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 15 ms
5,248 KB |
testcase_05 | AC | 27 ms
5,248 KB |
testcase_06 | AC | 31 ms
5,248 KB |
testcase_07 | AC | 17 ms
5,248 KB |
testcase_08 | AC | 20 ms
5,248 KB |
testcase_09 | AC | 31 ms
5,248 KB |
testcase_10 | AC | 28 ms
5,248 KB |
testcase_11 | AC | 23 ms
5,248 KB |
testcase_12 | AC | 29 ms
5,248 KB |
testcase_13 | AC | 21 ms
5,248 KB |
testcase_14 | AC | 1 ms
5,248 KB |
testcase_15 | AC | 2 ms
5,248 KB |
testcase_16 | AC | 2 ms
5,248 KB |
testcase_17 | AC | 2 ms
5,248 KB |
testcase_18 | AC | 2 ms
5,248 KB |
testcase_19 | AC | 20 ms
16,948 KB |
testcase_20 | AC | 5 ms
5,888 KB |
testcase_21 | AC | 11 ms
10,240 KB |
testcase_22 | AC | 17 ms
15,360 KB |
testcase_23 | AC | 16 ms
14,976 KB |
testcase_24 | AC | 14 ms
12,928 KB |
testcase_25 | AC | 13 ms
12,160 KB |
testcase_26 | AC | 2 ms
5,248 KB |
testcase_27 | AC | 19 ms
16,092 KB |
testcase_28 | AC | 15 ms
13,440 KB |
testcase_29 | AC | 5 ms
5,376 KB |
testcase_30 | AC | 8 ms
8,704 KB |
testcase_31 | AC | 20 ms
16,256 KB |
testcase_32 | AC | 2 ms
5,248 KB |
testcase_33 | AC | 8 ms
7,296 KB |
testcase_34 | AC | 5 ms
5,248 KB |
ソースコード
#include "bits/stdc++.h"#include <unordered_map>#include <unordered_set>#include <stdio.h>#include <math.h>#include <cassert>#pragma warning(push)#pragma warning(disable:26498 26450 26451 26812)#include "atcoder/all"#pragma warning(pop)//#include <boost/multiprecision/cpp_int.hpp>//using namespace boost::multiprecision;// std::fixed << std::setprecision(10) <<using namespace std;using namespace atcoder;using ll = long long;using ull = unsigned long long;using mint = modint998244353;using mint2 = modint1000000007;const double eps = 1e-9;#define REP(i, n) for (ll i = 0; i < ll(n); ++i)#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)#define REPD(i, init) for (ll i = init; i >=0; --i)#define REPDI(i, init, n) for (ll i = init; i >=n; --i)#define REPE(i, c) for (const auto& i : c)using vl = vector<ll>;#define VL(a, n) vector<ll> a; a.assign(n, 0);#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;using vvl = vector<vector<ll>>;#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);using pl = pair<ll, ll>;struct uv { ll u; ll v; ll c; };#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }template <class T = long long> using pql = priority_queue<T>;template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;using vm = vector<mint>;using vvm = vector<vm>;const char* YES = "Yes";const char* NO = "No";void yn(bool f) { std::cout << (f ? YES : NO) << endl; };template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値template<class T, class U> bool chmin(T& a, const U& b) { a = min(a, b); return b == a; }template<class T, class U> bool chmax(T& a, const U& b) { a = max(a, b); return b == a; }template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };int main() {cin.tie(nullptr);ios::sync_with_stdio(false);ll n, m;cin >> n >> m;vl a(n);vl b(n);dsu uf(n);REP(i, m) {ll u, v;cin >> u >> v;u--; v--;a[u]++;a[v]--;b[u]++;b[v]++;uf.merge(u, v);}ll single = 0;ll ans = 0;multiset<ll> x;REPE(e, uf.groups()) {if (e.size() == 1 && b[e[0]] == 0) {continue;}ll t = 0;REPE(v, e) {if (a[v] > 0) t += a[v];}if (t > 1) x.insert(t);else single++;}while (x.size() > 1) {auto it1 = x.begin();auto it2 = x.end();it2--;ll nv = *it1 + *it2 - 1;ans++;x.erase(it2);x.erase(x.begin());x.insert(nv);}if (x.size() > 0) ans += *(x.begin());ans += single - 1;cout << ans << endl;return 0;}