結果
問題 | No.468 役に立つ競技プログラミング実践編 |
ユーザー | koyumeishi |
提出日時 | 2016-12-18 00:21:19 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 300 ms / 2,000 ms |
コード長 | 4,978 bytes |
コンパイル時間 | 1,197 ms |
コンパイル使用メモリ | 113,192 KB |
実行使用メモリ | 29,668 KB |
最終ジャッジ日時 | 2023-08-20 22:08:17 |
合計ジャッジ時間 | 5,991 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,376 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 2 ms
4,376 KB |
testcase_12 | AC | 2 ms
4,380 KB |
testcase_13 | AC | 2 ms
4,376 KB |
testcase_14 | AC | 4 ms
4,380 KB |
testcase_15 | AC | 4 ms
4,376 KB |
testcase_16 | AC | 4 ms
4,376 KB |
testcase_17 | AC | 4 ms
4,380 KB |
testcase_18 | AC | 4 ms
4,376 KB |
testcase_19 | AC | 4 ms
4,376 KB |
testcase_20 | AC | 4 ms
4,380 KB |
testcase_21 | AC | 4 ms
4,380 KB |
testcase_22 | AC | 4 ms
4,380 KB |
testcase_23 | AC | 4 ms
4,376 KB |
testcase_24 | AC | 297 ms
26,104 KB |
testcase_25 | AC | 300 ms
25,848 KB |
testcase_26 | AC | 296 ms
25,680 KB |
testcase_27 | AC | 297 ms
26,140 KB |
testcase_28 | AC | 296 ms
26,076 KB |
testcase_29 | AC | 293 ms
26,020 KB |
testcase_30 | AC | 296 ms
25,892 KB |
testcase_31 | AC | 297 ms
26,096 KB |
testcase_32 | AC | 295 ms
25,980 KB |
testcase_33 | AC | 295 ms
25,872 KB |
testcase_34 | AC | 107 ms
29,668 KB |
testcase_35 | AC | 3 ms
4,376 KB |
testcase_36 | AC | 2 ms
4,376 KB |
ソースコード
#include <iostream> #include <vector> #include <cstdio> #include <sstream> #include <map> #include <string> #include <algorithm> #include <queue> #include <cmath> #include <functional> #include <set> #include <ctime> #include <random> #include <chrono> #include <cassert> #include <tuple> #include <utility> using namespace std; namespace { using Integer = long long; //__int128; template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;} template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;} template<class T> istream& operator , (istream& is, T& val){ return is >> val;} template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;} template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;} template<class T> ostream& operator , (ostream& os, const T& val){ return os << " " << val;} template<class H> void print(const H& head){ cout << head; } template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); } template<class ... T> void println(const T& ... values){ print(values...); cout << endl; } template<class H> void eprint(const H& head){ cerr << head; } template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); } template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; } class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator end(){ return range_iterator( end_, step_); } }; inline string operator "" _s (const char* str, size_t size){ return move(string(str)); } constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);} constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);} constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); } inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()); template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); } inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; } } constexpr long long mod = 9_ten + 7; void TopologicalSort_dfs(vector<vector<int> > &G, vector<int> &res, int node, vector<bool> &visit){ if(visit[node] == true) return; visit[node] = true; for(auto itr = G[node].rbegin(); itr != G[node].rend(); itr++){ TopologicalSort_dfs(G, res, *itr, visit); } /* for(int i=0; i<G[node].size(); i++){ TopologicalSort(G, res, G[node][i], visit); } */ res.push_back(node); } vector<int> TopologicalSort(vector<vector<int>> &G){ int n = G.size(); vector<int> ret; vector<bool> visit(n,false); for(int i=0; i<n; i++){ if(visit[i]) continue; TopologicalSort_dfs(G, ret, i, visit); } reverse(ret.begin(), ret.end()); return ret; } int main(){ int n,m; cin >> n,m; vector<int> a(m),b(m),c(m); for(auto i : range(m) ){ cin >> a[i],b[i],c[i]; } vector<vector<int>> G(n); vector<vector<int>> E(n); for(auto i : range(m) ){ G[ a[i] ].push_back( b[i] ); E[ a[i] ].push_back( c[i] ); } auto t = TopologicalSort(G); vector<int> d(n,0); vector<vector<int>> rG(n); for(int i=0; i<n; i++){ int v = t[i]; for(int j : range(G[v].size())){ int nx = G[v][j]; int cost = E[v][j]; if(d[nx] < d[v]+cost){ d[nx] = d[v]+cost; rG[nx] = {v}; }else if(d[nx] == d[v]+cost){ rG[nx].push_back(v); } } } vector<int> used(n, 0); function<void(int)> dfs = [&](int pos){ used[pos] = 1; for(int i : rG[pos]){ if( used[i] ) continue; dfs(i); } }; dfs(n-1); int cnt = count(used.begin(), used.end(), 1); cout << d[n-1] << " " << n-cnt << "/" << n << endl; return 0; }