結果
問題 | No.748 yuki国のお財布事情 |
ユーザー | jell |
提出日時 | 2018-11-27 19:10:08 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 50 ms / 2,000 ms |
コード長 | 5,621 bytes |
コンパイル時間 | 1,232 ms |
コンパイル使用メモリ | 122,956 KB |
実行使用メモリ | 5,156 KB |
最終ジャッジ日時 | 2023-09-06 03:45:31 |
合計ジャッジ時間 | 4,053 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,384 KB |
testcase_10 | AC | 2 ms
4,376 KB |
testcase_11 | AC | 2 ms
4,384 KB |
testcase_12 | AC | 2 ms
4,380 KB |
testcase_13 | AC | 7 ms
4,380 KB |
testcase_14 | AC | 11 ms
4,380 KB |
testcase_15 | AC | 8 ms
4,376 KB |
testcase_16 | AC | 20 ms
4,380 KB |
testcase_17 | AC | 39 ms
4,808 KB |
testcase_18 | AC | 47 ms
4,616 KB |
testcase_19 | AC | 50 ms
4,928 KB |
testcase_20 | AC | 45 ms
4,928 KB |
testcase_21 | AC | 43 ms
4,932 KB |
testcase_22 | AC | 2 ms
4,380 KB |
testcase_23 | AC | 2 ms
4,376 KB |
testcase_24 | AC | 2 ms
4,380 KB |
testcase_25 | AC | 36 ms
4,752 KB |
testcase_26 | AC | 43 ms
5,156 KB |
testcase_27 | AC | 41 ms
4,932 KB |
testcase_28 | AC | 34 ms
4,784 KB |
コンパイルメッセージ
main.cpp:120:26: 警告: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’ 120 | i64 bins(i64 ok, i64 ng, auto judge) { | ^~~~
ソースコード
/* #include <boost/functional/hash.hpp> #include <boost/multiprecision/cpp_int.hpp> typedef boost::multiprecision::cpp_int mlint; */ // #include <bits/stdc++.h> #include <deque> #include <queue> #include <vector> #include <algorithm> #include <iostream> #include <set> #include <cmath> #include <tuple> #include <string> #include <functional> #include <iterator> #include <random> #include <unordered_map> #include <unordered_set> #include <map> #include <bitset> #include <stack> #include <iomanip> using namespace std; typedef int64_t i64; typedef double db; typedef vector<vector<int64_t>> mat; typedef pair<int,int> pii; typedef pair<int64_t,int> pli; typedef pair<db,int> pdi; #define esc(x) cout << (x) << endl,exit(0) #define inf(T) (numeric_limits<T>::max() / 2 - 1) #define each(i,v) for(auto i = begin(v),end_copy = end(v); i != end_copy; ++i) #define reach(i,v) for(auto i = rbegin(v),rend_copy = rend(v); i != rend_copy; ++i) #define urep(i,s,t) for(int64_t i = (s),t_copy = (t); i <= t_copy; ++i) #define drep(i,s,t) for(int64_t i = (s),t_copy = (t); i >= t_copy; --i) #define rep(i,n) urep(i,0,(n) - 1) #define rep1(i,n) urep(i,1,(n)) #define rrep(i,n) drep(i,(n) - 1,0) #define all(v) begin(v),end(v) #define rall(v) rbegin(v),rend(v) #define vct vector #define prque priority_queue #define u_map unordered_map #define u_set unordered_set #define l_bnd lower_bound #define u_bnd upper_bound #define rsz resize #define ers erase #define emp emplace #define emf emplace_front #define emb emplace_back #define pof pop_front #define pob pop_back #define mkp make_pair #define mkt make_tuple #define fir first #define sec second struct setupper { setupper(uint8_t prec) { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(prec); } } setupper_obj(10); template <class T, class U> ostream& operator << (ostream& s, pair<T,U> p) { return s << p.fir << " " << p.sec; } template <class T> ostream& operator << (ostream& s, vector<T>& v) { for(auto i = v.begin(); i != v.end(); i++) { if(i != begin(v)) s << " "; s << *i; } return s; } template <class T> void hash_combine(size_t &seed, T const &key) { hash<T> hasher; seed ^= hasher(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2); } namespace std { template <class T, class U> struct hash<pair<T,U>> { size_t operator()(pair<T,U> const &p) const { size_t seed(0); hash_combine(seed,p.first); hash_combine(seed,p.second); return seed; } }; template <class T, class U, class V> struct hash<tuple<T,U,V>> { size_t operator()(tuple<T,U,V> const &t) const { size_t seed(0); hash_combine(seed,get<0>(t)); hash_combine(seed,get<1>(t)); hash_combine(seed,get<2>(t)); return seed; } }; } const auto add = [](auto &x, auto y) { x += y; }; const auto mul = [](auto &x, auto y) { x *= y; }; const auto lam_min = [](auto x, auto y) { return min(x,y); }; const auto lam_max = [](auto x, auto y) { return max(x,y); }; bool odd(i64 x) { return x & 1; } bool even(i64 x) { return !odd(x); } bool parity(i64 x, i64 y) { return odd(x) ^ even(y); } bool bit(i64 n, uint8_t e) { return n >> e & 1; } int ilog(i64 x, uint64_t b) { if(x) return ilog(x / b,b) + 1; return -1; } i64 qceil(i64 x, i64 y) { return x > 0 ? (x - 1) / y + 1 : x / y; } i64 gcd(i64 a, i64 b) { if(!b) return abs(a); return gcd(b, a % b); } i64 lcm(i64 a, i64 b) { if(a | b) return abs(a / gcd(a, b) * b); return 0; } i64 extgcd(i64 a, i64 b, i64 &x, i64 &y) { i64 d = a; if(b) { d = extgcd(b,a % b,y,x); y -= (a / b) * x; } else { x = 1,y = 0; } return d; } i64 bins(i64 ok, i64 ng, auto judge) { while(abs(ok - ng) > 1) { i64 mid = ok + ng >> 1; (judge(mid) ? ok : ng) = mid; } return ok; } template <class T, class U> bool chmax(T& m, U x) { if(m < x) { m = x; return 1; } return 0; } template <class T, class U> bool chmin(T& m, U x) { if(m > x) { m = x; return 1; } return 0; } template <class T> T cmprs(T& v) { T tmp = v,ret = v; sort(all(tmp)); tmp.erase(unique(all(tmp)),end(tmp)); each(i,ret) *i = l_bnd(all(tmp),*i) - begin(tmp) + 1; return ret; } const int dx[3] = {0,1,-1},dy[3] = {0,1,-1}; const i64 mod = 1e9 + 7; const db gold = (sqrt(5.0) + 1.0) * 0.5; const db eps = 1e-15; struct UnionFind { vector<int> par; vector<int> size; UnionFind(int n) { init(++n); } void init(int n) { par.resize(n); size.assign(n,1); for (int i = 0; i < n; ++i) par[i] = i; } int find(int x) { if (par[x] == x) { return x; } else { int r = find(par[x]); return par[x] = r; } } int scale(int x) { return size[find(x)]; } bool is_same(int x, int y) { return find(x) == find(y); } bool unite(int x, int y) { x = find(x); y = find(y); if (x == y) return false; if (size[x] < size[y]) swap(x,y); size[x] += size[y]; par[y] = x; return true; } }; int n,m,k; vct<pair<int,pii>> road; i64 ans=0; int main() { cin>>n>>m>>k; rep(i,m) { int a,b,c; cin>>a>>b>>c; road.emb(c,mkp(--a,--b)); ans+=c; } UnionFind uf(n); while(k--) { int e; cin>>e; auto p=road[e-1]; ans-=p.fir; uf.unite(p.sec.fir,p.sec.sec); road[e-1].fir=inf(int); } sort(all(road)); for(auto p:road) { if(p.fir==inf(int)) break; if(uf.is_same(p.sec.fir,p.sec.sec)) continue; uf.unite(p.sec.fir,p.sec.sec); ans-=p.fir; } esc(ans); }