結果
問題 | No.2403 "Eight" Bridges of Königsberg |
ユーザー | abc23 |
提出日時 | 2023-08-06 14:17:31 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 113 ms / 2,000 ms |
コード長 | 5,788 bytes |
コンパイル時間 | 5,008 ms |
コンパイル使用メモリ | 315,804 KB |
実行使用メモリ | 20,880 KB |
最終ジャッジ日時 | 2024-05-05 01:47:55 |
合計ジャッジ時間 | 7,182 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 46 ms
6,272 KB |
testcase_05 | AC | 91 ms
8,576 KB |
testcase_06 | AC | 105 ms
9,600 KB |
testcase_07 | AC | 59 ms
6,912 KB |
testcase_08 | AC | 69 ms
7,552 KB |
testcase_09 | AC | 113 ms
9,216 KB |
testcase_10 | AC | 105 ms
8,960 KB |
testcase_11 | AC | 79 ms
7,680 KB |
testcase_12 | AC | 109 ms
9,472 KB |
testcase_13 | AC | 74 ms
7,936 KB |
testcase_14 | AC | 1 ms
5,376 KB |
testcase_15 | AC | 1 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 1 ms
5,376 KB |
testcase_18 | AC | 1 ms
5,376 KB |
testcase_19 | AC | 22 ms
20,880 KB |
testcase_20 | AC | 5 ms
6,656 KB |
testcase_21 | AC | 11 ms
12,160 KB |
testcase_22 | AC | 19 ms
18,908 KB |
testcase_23 | AC | 18 ms
18,432 KB |
testcase_24 | AC | 16 ms
15,872 KB |
testcase_25 | AC | 15 ms
14,912 KB |
testcase_26 | AC | 2 ms
5,376 KB |
testcase_27 | AC | 23 ms
19,908 KB |
testcase_28 | AC | 19 ms
16,500 KB |
testcase_29 | AC | 6 ms
6,144 KB |
testcase_30 | AC | 10 ms
10,240 KB |
testcase_31 | AC | 23 ms
20,108 KB |
testcase_32 | AC | 3 ms
5,376 KB |
testcase_33 | AC | 9 ms
8,576 KB |
testcase_34 | AC | 5 ms
5,376 KB |
ソースコード
#if !__INCLUDE_LEVEL__ #include __FILE__ struct Solver { void solve() { int n,m;cin>>n>>m; V<int> ir(n),de(n); V<V<int>> g(n); dsu d(n); rep(i,m){ int a,b;cin>>a>>b; a--;b--; de[a]++; ir[b]++; d.merge(a,b); g[a].emplace_back(b); g[b].emplace_back(a); } int ans1=0,ans2=0; auto v=d.groups(); bool fl=0; rep(i,sz(v)){ int res1=0; int res2=0; for(auto j:v[i]){ res1+=max(0ll,ir[j]-de[j]); res2+=max(0ll,de[j]-ir[j]); } if(res1>res2)swap(res1,res2); // out(res1,res2); ans1+=max(0ll,res1+(res2-res1)-1); if(sz(g[v[i][0]])!=0){ if(fl)ans2++; fl=1; } } cout<<ans1+ans2<<endl; }}; signed main() { int ts = 1; // scanf("%lld",&ts); rep(ti,ts) { Solver solver; solver.solve(); } return 0; } #else #include <bits/stdc++.h> #include <atcoder/all> using namespace atcoder; // #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/tree_policy.hpp> // using namespace __gnu_pbds; using namespace std; #define int ll using ll=long long; using ld = long double; using uint = unsigned; using ull = unsigned long long; using P=pair<int,int>; using TP=tuple<int,int,int>; const int INF = 1001001001; const long long INFL = 3e18; const int MAX = 2e6+5; #define FOR1(a) for (ll _ = 0; _ < ll(a); ++_) #define FOR2(i, a) for (ll i = 0; i < ll(a); ++i) #define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i) #define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c)) #define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i) #define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c)) #define overload4(a, b, c, d, e, ...) e #define rep(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__) #define rrep(...) overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__) #define fore(i,a) for(auto &i:a) #define all(x) x.begin(),x.end() #define allr(x) x.rbegin(),x.rend() #define sz(x) ((int)(x).size()) #define bp(x) (__builtin_popcountll((long long)(x))) #define elif else if #define mpa make_pair #define bit(n) (1LL<<(n)) #define LB(c, x) distance((c).begin(), lower_bound(all(c), (x))) #define UB(c, x) distance((c).begin(), upper_bound(all(c), (x))) template<typename T> using V = vector<T>; template<typename T> using max_heap = priority_queue<T>; template<typename T> using min_heap = priority_queue<T, vector<T>, greater<>>; template<typename T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<typename T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();} template<typename T>ostream& operator<<(ostream&o,const vector<T>&v){if(sz(v))o<<join(v," ");return o;} template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;} template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;} template<typename T>ll suma(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;} template<typename T>ll suma(const V<V<T>>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;} template<typename T>void uni(T& a){sort(all(a));a.erase(unique(all(a)),a.end());} template<typename T>void prepend(vector<T>&a,const T&x){a.insert(a.begin(),x);} template<typename T>T vgcd(T m, T n) {return std::gcd(m, n);} template<typename T, typename... Args>T vgcd(T a, Args... args) {return vgcd(a, vgcd(args...));} void print(){ putchar(' '); } void print(bool a){ printf("%d", a); } // void print(int a){ printf("%d", a); } void print(unsigned a){ printf("%u", a); } void print(long a){ printf("%ld", a); } void print(long long a){ printf("%lld", a); } void print(unsigned long long a){ printf("%llu", a); } void print(char a){ printf("%c", a); } void print(char *a){ printf("%s", a); } void print(const char *a){ printf("%s", a); } void print(double a){ printf("%.15f", a); } void print(long double a){ printf("%.15Lf", a); } void print(const string& a){ for(auto&& i : a) print(i); } template<typename T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); } template<typename T> void print(const vector<T>&); template<typename T, size_t size> void print(const array<T, size>&); template<typename T, typename L> void print(const pair<T, L>& p); template<typename T, size_t size> void print(const T (&)[size]); template<typename T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template<typename T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template<typename T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } } template<typename T, typename L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); } template<typename T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } } template<typename T> void print(const T& a){ cout << a; } int out(){ putchar('\n'); return 0; } template<typename T> int out(const T& t){ print(t); putchar('\n'); return 0; } template<typename Head, typename... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; } ll binary_search(function<bool(ll)> check, ll ok, ll ng) { assert(check(ok)); while (abs(ok - ng) > 1) { auto x = (ng + ok) / 2; if (check(x)) ok = x; else ng = x; } return ok; } #endif