結果
問題 | No.340 雪の足跡 |
ユーザー | n_knuu |
提出日時 | 2016-02-07 13:06:15 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 523 ms / 1,000 ms |
コード長 | 2,689 bytes |
コンパイル時間 | 1,475 ms |
コンパイル使用メモリ | 165,892 KB |
実行使用メモリ | 70,144 KB |
最終ジャッジ日時 | 2024-09-21 21:29:34 |
合計ジャッジ時間 | 8,200 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 18 ms
26,880 KB |
testcase_01 | AC | 20 ms
27,008 KB |
testcase_02 | AC | 19 ms
27,008 KB |
testcase_03 | AC | 19 ms
27,136 KB |
testcase_04 | AC | 20 ms
26,880 KB |
testcase_05 | AC | 19 ms
27,008 KB |
testcase_06 | AC | 19 ms
26,880 KB |
testcase_07 | AC | 19 ms
26,880 KB |
testcase_08 | AC | 19 ms
26,880 KB |
testcase_09 | AC | 19 ms
27,008 KB |
testcase_10 | AC | 20 ms
27,008 KB |
testcase_11 | AC | 20 ms
27,136 KB |
testcase_12 | AC | 21 ms
27,136 KB |
testcase_13 | AC | 22 ms
27,264 KB |
testcase_14 | AC | 42 ms
30,208 KB |
testcase_15 | AC | 46 ms
30,336 KB |
testcase_16 | AC | 37 ms
28,416 KB |
testcase_17 | AC | 52 ms
30,848 KB |
testcase_18 | AC | 48 ms
30,976 KB |
testcase_19 | AC | 52 ms
30,976 KB |
testcase_20 | AC | 203 ms
44,672 KB |
testcase_21 | AC | 111 ms
27,136 KB |
testcase_22 | AC | 33 ms
34,688 KB |
testcase_23 | AC | 262 ms
70,144 KB |
testcase_24 | AC | 147 ms
39,040 KB |
testcase_25 | AC | 221 ms
50,432 KB |
testcase_26 | AC | 42 ms
27,520 KB |
testcase_27 | AC | 24 ms
27,008 KB |
testcase_28 | AC | 44 ms
28,928 KB |
testcase_29 | AC | 326 ms
51,968 KB |
testcase_30 | AC | 230 ms
45,952 KB |
testcase_31 | AC | 523 ms
66,176 KB |
testcase_32 | AC | 460 ms
70,016 KB |
testcase_33 | AC | 436 ms
69,888 KB |
testcase_34 | AC | 462 ms
69,888 KB |
testcase_35 | AC | 426 ms
70,016 KB |
testcase_36 | AC | 429 ms
70,016 KB |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:85:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 85 | scanf("%d%d%d", &W, &H, &N); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~ main.cpp:88:23: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 88 | int M, prev; scanf("%d%d", &M, &prev); | ~~~~~^~~~~~~~~~~~~~~~~~~ main.cpp:90:19: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 90 | int b; scanf("%d", &b); | ~~~~~^~~~~~~~~~
ソースコード
#include <bits/stdc++.h> using namespace std; typedef long long int ll; typedef pair<int, int> P; typedef pair<ll, ll> Pll; typedef vector<int> Vi; //typedef tuple<int, int, int> T; #define FOR(i,s,x) for(int i=s;i<(int)(x);i++) #define REP(i,x) FOR(i,0,x) #define ALL(c) c.begin(), c.end() #define DUMP( x ) cerr << #x << " = " << ( x ) << endl const int dr[4] = {-1, 0, 1, 0}; const int dc[4] = {0, 1, 0, -1}; #define INF 1000010 // graph by adjacency list struct Edge { int dst; Edge(int dst) : dst(dst) { } }; vector<Edge> E[1000010]; struct Graph { int V; Graph(int V) : V(V) { } void add_edge(int src, int dst) { E[src].push_back(Edge(dst)); } }; struct Node { int v, dist; Node(int v, int dist) : v(v), dist(dist) { }; bool operator < (const Node &n) const { return dist > n.dist; // reverse } }; int dist[1000010]; struct ShortestPath { const Graph g; int start; ShortestPath(const Graph g, int start) : g(g), start(start) { } inline void dijkstra(int goal) { queue<Node> que; dist[start] = 0; que.push(Node(start, 0)); while (!que.empty()) { Node n = que.front(); que.pop(); int v = n.v, cost = n.dist; if (v == goal) return ; if (dist[v] < cost) continue; cost++; REP(i, E[v].size()) { Edge e = E[v][i]; if (e.dst and not dist[e.dst]) { dist[e.dst] = cost; if (e.dst == goal) return ; que.push(Node(e.dst, cost)); } } } } }; int imos_w[1000010], imos_h[1000010]; int main() { int W, H, N; scanf("%d%d%d", &W, &H, &N); REP(i, N) { int M, prev; scanf("%d%d", &M, &prev); REP(i, M) { int b; scanf("%d", &b); int p1 = prev, p2 = b; if (p1 > p2) swap(p1, p2); int r1 = p1 / W, c1 = p1 % W, r2 = p2 / W, c2 = p2 % W; //cout << '(' << r1 << ',' << c1 << ')' << ' ' << '(' << r2 << ',' << c2 << ')' << endl; if (r1 == r2) { imos_w[p1]++, imos_w[p2]--; } else if (c1 == c2) { imos_h[c1 * H + r1]++, imos_h[c2 * H + r2]--; } prev = b; } } REP(i, W*H-1) imos_h[i+1] += imos_h[i], imos_w[i+1] += imos_w[i]; Graph g(H*W); REP(i, H*W) { if (imos_w[i]) g.add_edge(i, i+1), g.add_edge(i+1, i); if (imos_h[i]) { int p1 = (i%H)*W+i/H, p2 = p1 + W; g.add_edge(p1, p2), g.add_edge(p2, p1); } } /*REP(i, W*H) { cout << i << ':'; for (auto v : g.E[i]) cout << v.dst << ' '; cout << endl; }*/ ShortestPath sp(g, 0); sp.dijkstra(W*H-1); if (W*H-1 and dist[W*H-1] == 0) { printf("Odekakedekinai..\n"); } else { printf("%d\n", dist[W*H-1]); } //REP(i, g.V) cout << sp.dist[i] << (i == g.V-1 ? '\n' : ' '); return 0; }