結果
問題 | No.1647 Travel in Mitaru city 2 |
ユーザー | sash0 |
提出日時 | 2021-08-28 22:29:00 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 95 ms / 2,500 ms |
コード長 | 3,916 bytes |
コンパイル時間 | 4,237 ms |
コンパイル使用メモリ | 239,760 KB |
実行使用メモリ | 29,596 KB |
最終ジャッジ日時 | 2024-05-01 17:36:55 |
合計ジャッジ時間 | 11,631 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 3 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 4 ms
5,376 KB |
testcase_08 | AC | 82 ms
27,540 KB |
testcase_09 | AC | 77 ms
26,036 KB |
testcase_10 | AC | 88 ms
27,656 KB |
testcase_11 | AC | 76 ms
24,988 KB |
testcase_12 | AC | 72 ms
20,496 KB |
testcase_13 | AC | 86 ms
27,808 KB |
testcase_14 | AC | 85 ms
28,408 KB |
testcase_15 | AC | 87 ms
28,108 KB |
testcase_16 | AC | 78 ms
26,736 KB |
testcase_17 | AC | 83 ms
25,628 KB |
testcase_18 | AC | 75 ms
23,156 KB |
testcase_19 | AC | 71 ms
20,736 KB |
testcase_20 | AC | 73 ms
22,776 KB |
testcase_21 | AC | 74 ms
22,392 KB |
testcase_22 | AC | 88 ms
28,912 KB |
testcase_23 | AC | 87 ms
29,056 KB |
testcase_24 | AC | 83 ms
28,296 KB |
testcase_25 | AC | 87 ms
25,840 KB |
testcase_26 | AC | 94 ms
29,048 KB |
testcase_27 | AC | 88 ms
29,180 KB |
testcase_28 | AC | 91 ms
29,436 KB |
testcase_29 | AC | 94 ms
29,560 KB |
testcase_30 | AC | 75 ms
22,528 KB |
testcase_31 | AC | 88 ms
29,432 KB |
testcase_32 | AC | 82 ms
26,108 KB |
testcase_33 | AC | 85 ms
27,896 KB |
testcase_34 | AC | 94 ms
29,596 KB |
testcase_35 | AC | 82 ms
27,000 KB |
testcase_36 | AC | 91 ms
29,564 KB |
testcase_37 | AC | 95 ms
29,564 KB |
testcase_38 | AC | 85 ms
26,092 KB |
testcase_39 | AC | 72 ms
22,632 KB |
testcase_40 | AC | 87 ms
25,832 KB |
testcase_41 | AC | 82 ms
24,292 KB |
testcase_42 | AC | 85 ms
25,836 KB |
testcase_43 | AC | 2 ms
5,376 KB |
testcase_44 | AC | 6 ms
7,904 KB |
testcase_45 | AC | 67 ms
18,080 KB |
testcase_46 | AC | 77 ms
18,004 KB |
testcase_47 | AC | 69 ms
17,876 KB |
testcase_48 | AC | 75 ms
17,880 KB |
testcase_49 | AC | 71 ms
18,008 KB |
testcase_50 | AC | 71 ms
18,004 KB |
ソースコード
// clang-format off #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define mp make_pair #define fst first #define snd second #define forn(i,n) for (int i = 0; i < int(n); i++) #define forn1(i,n) for (int i = 1; i <= int(n); i++) #define popcnt __builtin_popcountll #define ffs __builtin_ffsll #define ctz __builtin_ctzll #define clz __builtin_clz #define clzll __builtin_clzll #define all(a) (a).begin(), (a).end() using namespace std; using namespace __gnu_pbds; using uint = unsigned int; using ll = long long; using ull = unsigned long long; using pii = pair<int,int>; using pli = pair<ll,int>; using pil = pair<int,ll>; using pll = pair<ll,ll>; template <typename T> using vec = vector<T>; using vi = vec<int>; using vl = vec<ll>; template <typename T> using que = queue<T>; template <typename T> using deq = deque<T>; template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; template <typename K, typename V> using ordered_map = tree<K, V, less<K>, rb_tree_tag, tree_order_statistics_node_update>; template <typename T> T id(T b) {return b;}; template <typename T> void chmax(T &x, T y) {if (x < y) x = y;} template <typename T> void chmin(T &x, T y) {if (x > y) x = y;} template <typename S, typename K> bool contains(S &s, K k) { return s.find(k) != s.end(); } template <typename T> bool getf(T flag, size_t i) { return (flag>>i) & 1; } template <typename T> T setf(T flag, size_t i) { return flag | (T(1)<<i); } template <typename T> T unsetf(T flag, size_t i) { return flag & ~(T(1)<<i); } void fastio() { ios_base::sync_with_stdio(false); cin.tie(nullptr); } constexpr ll TEN(int n) { if (n == 0) return 1LL; else return 10LL*TEN(n-1); } // clang-format on int main() { fastio(); int h, w, n; cin >> h >> w >> n; vec<vec<pii>> r(h), c(w); vec<pii> xy; forn(i, n) { int x, y; cin >> x >> y; x--, y--; r[x].emplace_back(y, i); c[y].emplace_back(x, i); xy.emplace_back(x, y); } for (auto& r : r) { sort(all(r)); } for (auto& c : c) { sort(all(c)); } vec<vi> g(n); forn(i, h) { for (int j = 0; j < int(r[i].size()) - 1; j++) { g[r[i][j].snd].push_back(r[i][j + 1].snd); g[r[i][j + 1].snd].push_back(r[i][j].snd); } } forn(i, w) { for (int j = 0; j < int(c[i].size()) - 1; j++) { g[c[i][j].snd].push_back(c[i][j + 1].snd); g[c[i][j + 1].snd].push_back(c[i][j].snd); } } vec<bool> in_path(n); vec<bool> vis(n); vi path; function<bool(int, int)> dfs = [&](int u, int p) { if (in_path[u]) { path.push_back(u); return true; } vis[u] = true; in_path[u] = true; path.push_back(u); for (auto v : g[u]) { if (v != p) { if (dfs(v, u)) return true; } } in_path[u] = false; path.pop_back(); return false; }; forn(i, n) { if (!vis[i]) if (dfs(i, -1)) break; } if (path.empty()) { cout << "-1\n"; return 0; } reverse(all(path)); while (path.back() != path.front()) { path.pop_back(); } path.pop_back(); vi ans; int len = path.size(); for (int i = 0; i < len; i++) { auto [px, py] = xy[path[(i - 1 + len) % len]]; auto [nx, ny] = xy[path[(i + 1) % len]]; if (ny != py and nx != px) { ans.push_back(path[i]); } } if (xy[ans[0]].snd != xy[ans[1]].snd) { auto v = ans.front(); ans.erase(ans.begin()); ans.push_back(v); } cout << ans.size() << "\n"; for (auto x : ans) { cout << x + 1 << " "; } cout << "\n"; return 0; }