結果
問題 | No.468 役に立つ競技プログラミング実践編 |
ユーザー | sekiya9311 |
提出日時 | 2016-12-18 01:05:52 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,345 bytes |
コンパイル時間 | 1,486 ms |
コンパイル使用メモリ | 123,676 KB |
実行使用メモリ | 18,696 KB |
最終ジャッジ日時 | 2024-12-14 07:30:33 |
合計ジャッジ時間 | 5,083 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,820 KB |
testcase_01 | AC | 2 ms
6,820 KB |
testcase_02 | AC | 2 ms
6,820 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 49 ms
14,976 KB |
testcase_35 | AC | 2 ms
6,820 KB |
testcase_36 | AC | 2 ms
6,820 KB |
ソースコード
#include <iostream> #include <string> #include <queue> #include <stack> #include <algorithm> #include <list> #include <vector> #include <complex> #include <utility> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <climits> #include <bitset> #include <ctime> #include <map> #include <unordered_map> #include <set> #include <unordered_set> #include <cassert> #include <cstddef> #include <iomanip> #include <numeric> #include <tuple> #include <sstream> #include <fstream> using namespace std; #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++) #define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++) #define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--) #define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--) #define DEBUG(C) cerr << #C << " = " << C << endl; using LL = long long; using VI = vector<int>; using VVI = vector<VI>; using VL = vector<LL>; using VVL = vector<VL>; using VD = vector<double>; using VVD = vector<VD>; using PII = pair<int, int>; using PDD = pair<double, double>; using PLL = pair<LL, LL>; using VPII = vector<PII>; template<typename T> using VT = vector<T>; #define ALL(a) begin((a)), end((a)) #define RALL(a) rbegin((a)), rend((a)) #define SORT(a) sort(ALL((a))) #define RSORT(a) sort(RALL((a))) #define REVERSE(a) reverse(ALL((a))) #define MP make_pair #define FORE(a, b) for (auto &&a : (b)) #define FIND(s, e) ((s).find(e) != (s).end()) #define EB emplace_back const int INF = 1e9; const int MOD = INF + 9; const LL LLINF = 1e18; int N, M; VT<VPII> g, grev; VI v, vrev; template<typename ctype = less<int>, typename ctype2 = less<PII>> int search(VT<VPII> &graph, VI &score, int st) { ctype comp; VT<bool> used(N, false); priority_queue<PII, VPII, ctype2> pq; pq.push(MP(0, st)); score[st] = 0; while (!pq.empty()) { int nowscore, nowpoint; tie(nowscore, nowpoint) = pq.top(); pq.pop(); if (used[nowpoint]) continue; used[nowpoint] = true; FORE(e, graph[nowpoint]) { int nextscore = nowscore + e.second; if (max(score[e.first], nextscore, comp) == score[e.first]) { continue; } score[e.first] = nextscore; pq.push(MP(nextscore, e.first)); } } //FORE(e, score) cout << e << " ";cout << endl; return score[N - 1]; } template<typename ctype = less<int>, typename ctype2 = less<PII>> int search2(const VT<VPII> &graph,VI &memoScore, const VI &score, int st) { ctype comp; VT<bool> used(N, false); priority_queue<PII, VPII, ctype2> pq; pq.push(MP(score[st], st)); memoScore[st] = score[st]; while (!pq.empty()) { int nowscore, nowpoint; tie(nowscore, nowpoint) = pq.top(); pq.pop(); if (used[nowpoint]) continue; used[nowpoint] = true; FORE(e, graph[nowpoint]) { int nextscore = nowscore + e.second; memoScore[e.first] = nextscore; pq.push(MP(score[e.first], e.first)); } } //FORE(e, memoScore) cout << e << " ";cout << endl; return score[N - 1]; } int main(void) { scanf("%d%d", &N, &M); g.resize(N); v.resize(N, 0); grev.resize(N); vrev.resize(N, INF); REP(i, M) { int a, b, c; scanf("%d%d%d", &a, &b, &c); g[a].EB(MP(b, c)); grev[b].EB(MP(a, -c)); } int n = search<less<int>, less<PII>>(g, v, 0); search2<greater<int>, greater<PII>>(grev, vrev, v, N - 1); int cnt = 0; REP(i, N) { cnt += v[i] != vrev[i]; } cout << n << " " << cnt << "/" << N << endl; return 0; }