結果
問題 | No.1647 Travel in Mitaru city 2 |
ユーザー | tnakao0123 |
提出日時 | 2021-08-15 13:27:02 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 182 ms / 2,500 ms |
コード長 | 2,420 bytes |
コンパイル時間 | 1,371 ms |
コンパイル使用メモリ | 111,408 KB |
実行使用メモリ | 22,144 KB |
最終ジャッジ日時 | 2024-04-21 05:03:46 |
合計ジャッジ時間 | 10,901 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
9,344 KB |
testcase_01 | AC | 4 ms
9,088 KB |
testcase_02 | AC | 4 ms
9,472 KB |
testcase_03 | AC | 4 ms
9,088 KB |
testcase_04 | AC | 5 ms
9,728 KB |
testcase_05 | AC | 4 ms
9,216 KB |
testcase_06 | AC | 5 ms
9,216 KB |
testcase_07 | AC | 7 ms
9,728 KB |
testcase_08 | AC | 162 ms
20,896 KB |
testcase_09 | AC | 151 ms
20,560 KB |
testcase_10 | AC | 163 ms
21,068 KB |
testcase_11 | AC | 116 ms
20,192 KB |
testcase_12 | AC | 143 ms
21,120 KB |
testcase_13 | AC | 127 ms
20,844 KB |
testcase_14 | AC | 169 ms
21,364 KB |
testcase_15 | AC | 163 ms
21,200 KB |
testcase_16 | AC | 152 ms
20,192 KB |
testcase_17 | AC | 124 ms
20,444 KB |
testcase_18 | AC | 136 ms
21,100 KB |
testcase_19 | AC | 140 ms
21,248 KB |
testcase_20 | AC | 144 ms
21,248 KB |
testcase_21 | AC | 146 ms
21,248 KB |
testcase_22 | AC | 177 ms
21,492 KB |
testcase_23 | AC | 171 ms
21,360 KB |
testcase_24 | AC | 153 ms
21,288 KB |
testcase_25 | AC | 160 ms
21,516 KB |
testcase_26 | AC | 165 ms
21,492 KB |
testcase_27 | AC | 172 ms
21,424 KB |
testcase_28 | AC | 178 ms
21,392 KB |
testcase_29 | AC | 169 ms
21,396 KB |
testcase_30 | AC | 164 ms
21,492 KB |
testcase_31 | AC | 172 ms
21,652 KB |
testcase_32 | AC | 150 ms
21,264 KB |
testcase_33 | AC | 152 ms
21,344 KB |
testcase_34 | AC | 175 ms
21,524 KB |
testcase_35 | AC | 163 ms
21,432 KB |
testcase_36 | AC | 182 ms
21,524 KB |
testcase_37 | AC | 176 ms
21,396 KB |
testcase_38 | AC | 156 ms
21,372 KB |
testcase_39 | AC | 140 ms
21,128 KB |
testcase_40 | AC | 156 ms
21,368 KB |
testcase_41 | AC | 145 ms
21,164 KB |
testcase_42 | AC | 158 ms
21,240 KB |
testcase_43 | AC | 4 ms
9,344 KB |
testcase_44 | AC | 4 ms
9,344 KB |
testcase_45 | AC | 125 ms
22,016 KB |
testcase_46 | AC | 136 ms
22,016 KB |
testcase_47 | AC | 126 ms
22,016 KB |
testcase_48 | AC | 130 ms
22,016 KB |
testcase_49 | AC | 128 ms
21,888 KB |
testcase_50 | AC | 129 ms
22,144 KB |
ソースコード
/* -*- coding: utf-8 -*- * * 1647.cc: No.1647 Travel in Mitaru city 2 - yukicoder */ #include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<iostream> #include<string> #include<vector> #include<map> #include<set> #include<stack> #include<list> #include<queue> #include<deque> #include<algorithm> #include<numeric> #include<utility> #include<complex> #include<functional> using namespace std; /* constant */ const int MAX_H = 100000; const int MAX_W = 100000; const int MAX_N = 100000; const int MAX_M = MAX_H + MAX_W; /* typedef */ typedef vector<int> vi; typedef deque<int> dqi; typedef pair<int,int> pii; typedef map<pii,int> mpii; /* global variables */ int xs[MAX_N], ys[MAX_N], uxs[MAX_N], uys[MAX_N]; mpii pmap; vi nbrs[MAX_M]; int ps[MAX_M], ds[MAX_M], cis[MAX_M]; /* subroutines */ /* main */ int main() { int h, w, n; scanf("%d%d%d", &h, &w, &n); for (int i = 0; i < n; i++) { scanf("%d%d", xs + i, ys + i); uxs[i] = xs[i], uys[i] = ys[i]; pmap[pii(xs[i], ys[i])] = i; } sort(uxs, uxs + n); sort(uys, uys + n); int xn = unique(uxs, uxs + n) - uxs; int yn = unique(uys, uys + n) - uys; for (int i = 0; i < n; i++) { int xi = lower_bound(uxs, uxs + xn, xs[i]) - uxs; int yi = lower_bound(uys, uys + yn, ys[i]) - uys; nbrs[xi].push_back(xn + yi); nbrs[xn + yi].push_back(xi); } int m = xn + yn; memset(ds, -1, sizeof(ds)); for (int st = 0; st < m; st++) if (ds[st] < 0) { ps[st] = -1, ds[st] = 0; vi pts; pts.push_back(st); for (int u = st; u >= 0;) { vi &nbru = nbrs[u]; int up = ps[u]; if (cis[u] < nbru.size()) { int v = nbru[cis[u]++]; if (v != up) { if (ds[v] < 0) { ps[v] = u, ds[v] = ds[u] + 1; pts.push_back(v); u = v; } else if (ds[v] < ds[u]) { dqi q; for (int i = ds[v]; i <= ds[u]; i++) q.push_back(pts[i]); if (q.front() >= xn) { q.push_back(q.front()); q.pop_front(); } int k = q.size(); printf("%d\n", k); for (int i = 0; i < k; i++) { int q0 = q[i], q1 = q[(i + 1) % k]; int xi, yi; if (q0 < xn) xi = q0, yi = q1 - xn; else xi = q1, yi = q0 - xn; int pi = pmap[pii(uxs[xi], uys[yi])]; printf("%d%c", pi + 1, (i + 1 < k) ? ' ' : '\n'); } return 0; } } } else { pts.pop_back(); u = up; } } } puts("-1"); return 0; }