結果
問題 | No.867 避難経路 |
ユーザー | hitonanode |
提出日時 | 2019-08-16 23:40:08 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 5,566 ms / 6,000 ms |
コード長 | 5,355 bytes |
コンパイル時間 | 2,143 ms |
コンパイル使用メモリ | 182,708 KB |
実行使用メモリ | 156,924 KB |
最終ジャッジ日時 | 2024-09-23 01:40:18 |
合計ジャッジ時間 | 136,600 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 7 ms
6,812 KB |
testcase_01 | AC | 8 ms
6,940 KB |
testcase_02 | AC | 8 ms
6,940 KB |
testcase_03 | AC | 8 ms
5,376 KB |
testcase_04 | AC | 8 ms
5,376 KB |
testcase_05 | AC | 8 ms
5,376 KB |
testcase_06 | AC | 8 ms
5,376 KB |
testcase_07 | AC | 8 ms
5,376 KB |
testcase_08 | AC | 8 ms
5,376 KB |
testcase_09 | AC | 8 ms
5,376 KB |
testcase_10 | AC | 8 ms
5,376 KB |
testcase_11 | AC | 8 ms
5,376 KB |
testcase_12 | AC | 8 ms
5,376 KB |
testcase_13 | AC | 8 ms
5,376 KB |
testcase_14 | AC | 8 ms
5,376 KB |
testcase_15 | AC | 5,273 ms
156,792 KB |
testcase_16 | AC | 5,146 ms
156,920 KB |
testcase_17 | AC | 5,231 ms
156,664 KB |
testcase_18 | AC | 5,161 ms
156,796 KB |
testcase_19 | AC | 5,097 ms
156,924 KB |
testcase_20 | AC | 5,223 ms
156,788 KB |
testcase_21 | AC | 5,566 ms
156,792 KB |
testcase_22 | AC | 5,033 ms
156,664 KB |
testcase_23 | AC | 5,245 ms
156,668 KB |
testcase_24 | AC | 5,184 ms
156,792 KB |
testcase_25 | AC | 5,010 ms
156,920 KB |
testcase_26 | AC | 4,989 ms
156,752 KB |
testcase_27 | AC | 5,100 ms
156,796 KB |
testcase_28 | AC | 5,142 ms
156,656 KB |
testcase_29 | AC | 4,961 ms
156,780 KB |
testcase_30 | AC | 4,354 ms
156,780 KB |
testcase_31 | AC | 4,340 ms
156,792 KB |
testcase_32 | AC | 4,393 ms
156,796 KB |
testcase_33 | AC | 4,463 ms
156,792 KB |
testcase_34 | AC | 4,345 ms
155,344 KB |
testcase_35 | AC | 4,485 ms
155,472 KB |
testcase_36 | AC | 4,472 ms
153,056 KB |
testcase_37 | AC | 4,156 ms
146,032 KB |
testcase_38 | AC | 4,134 ms
145,784 KB |
testcase_39 | AC | 4,241 ms
145,920 KB |
testcase_40 | AC | 4,107 ms
145,832 KB |
testcase_41 | AC | 3 ms
5,376 KB |
testcase_42 | AC | 4 ms
5,376 KB |
testcase_43 | AC | 4 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using lint = long long int; using pint = pair<int, int>; using plint = pair<lint, lint>; struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((lint)(x).size()) #define POW2(n) (1LL << (n)) #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++) #define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); } template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); } template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; } template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; } template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); } template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); } template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; } ///// This part below is only for debug, not used ///// template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; } template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; } template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; } template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } #define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl; ///// END ///// /* #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #include <ext/pb_ds/tag_and_trait.hpp> using namespace __gnu_pbds; // find_by_order(), order_of_key() template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>; template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>; */ using wedges = vector<vector<plint>>; // (to, weight) vector<lint> dijkstra(int N, int s, const wedges &w) { vector<lint> dist(N, 1e18); dist[s] = 0; priority_queue<plint, vector<plint>, greater<plint>> pq; pq.emplace(0, s); while (!pq.empty()) { plint p = pq.top(); pq.pop(); int v = p.second; if (dist[v] < p.first) continue; for (auto nx : w[v]) { lint dnx = p.first + nx.second; if (dist[nx.first] > dnx) { dist[nx.first] = dnx; pq.emplace(dnx, nx.first); } } } return dist; // (distance, previous_node) } int main() { int H, W; cin >> H >> W; int gx, gy; cin >> gx >> gy; gx--, gy--; vector<vector<lint>> A; ndarray(A, H, W); cin >> A; vector<vector<lint>> dijs(300); REP(d, 300) { wedges edge(H * W); REP(i, H) REP(j, W) { if (j) edge[i * W + j - 1].emplace_back(i * W + j, A[i][j] + d * d); if (j + 1 < W) edge[i * W + j + 1].emplace_back(i * W + j, A[i][j] + d * d); if (i) edge[(i - 1) * W + j].emplace_back(i * W + j, A[i][j] + d * d); if (i + 1 < H) edge[(i + 1) * W + j].emplace_back(i * W + j, A[i][j] + d * d); } dijs[d] = dijkstra(H * W, gx * W + gy, edge); } int Q; cin >> Q; REP(i, Q) { lint x, y, k; cin >> x >> y >> k; x--, y--; if (k < 299) { printf("%lld\n", dijs[k][x * W + y] + k * k + A[gx][gy]); } else { lint r1 = dijs[298][x * W + y], r2 = dijs[299][x * W + y]; lint dr = (r2 - r1) / (299 * 299 - 298 * 298); printf("%lld\n", r1 + dr * (k * k - 298 * 298) + k * k + A[gx][gy]); } } }