結果
問題 | No.1647 Travel in Mitaru city 2 |
ユーザー | rniya |
提出日時 | 2021-08-13 23:20:01 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 198 ms / 2,500 ms |
コード長 | 6,765 bytes |
コンパイル時間 | 2,638 ms |
コンパイル使用メモリ | 215,024 KB |
実行使用メモリ | 24,316 KB |
最終ジャッジ日時 | 2024-04-21 04:56:45 |
合計ジャッジ時間 | 12,400 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 3 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 3 ms
5,376 KB |
testcase_08 | AC | 161 ms
22,872 KB |
testcase_09 | AC | 147 ms
21,700 KB |
testcase_10 | AC | 154 ms
22,716 KB |
testcase_11 | AC | 107 ms
19,888 KB |
testcase_12 | AC | 125 ms
20,100 KB |
testcase_13 | AC | 116 ms
20,256 KB |
testcase_14 | AC | 166 ms
23,300 KB |
testcase_15 | AC | 171 ms
23,084 KB |
testcase_16 | AC | 148 ms
22,056 KB |
testcase_17 | AC | 114 ms
20,096 KB |
testcase_18 | AC | 119 ms
20,608 KB |
testcase_19 | AC | 136 ms
22,844 KB |
testcase_20 | AC | 170 ms
22,272 KB |
testcase_21 | AC | 143 ms
23,168 KB |
testcase_22 | AC | 166 ms
23,784 KB |
testcase_23 | AC | 168 ms
23,864 KB |
testcase_24 | AC | 144 ms
22,528 KB |
testcase_25 | AC | 170 ms
23,268 KB |
testcase_26 | AC | 173 ms
23,736 KB |
testcase_27 | AC | 178 ms
23,940 KB |
testcase_28 | AC | 172 ms
24,316 KB |
testcase_29 | AC | 177 ms
24,188 KB |
testcase_30 | AC | 174 ms
23,544 KB |
testcase_31 | AC | 170 ms
24,316 KB |
testcase_32 | AC | 156 ms
23,452 KB |
testcase_33 | AC | 148 ms
22,784 KB |
testcase_34 | AC | 184 ms
24,312 KB |
testcase_35 | AC | 171 ms
23,080 KB |
testcase_36 | AC | 192 ms
24,184 KB |
testcase_37 | AC | 198 ms
24,188 KB |
testcase_38 | AC | 175 ms
21,992 KB |
testcase_39 | AC | 135 ms
20,884 KB |
testcase_40 | AC | 174 ms
22,016 KB |
testcase_41 | AC | 152 ms
21,160 KB |
testcase_42 | AC | 169 ms
21,760 KB |
testcase_43 | AC | 2 ms
5,376 KB |
testcase_44 | AC | 6 ms
9,312 KB |
testcase_45 | AC | 122 ms
19,776 KB |
testcase_46 | AC | 148 ms
19,684 KB |
testcase_47 | AC | 115 ms
19,712 KB |
testcase_48 | AC | 119 ms
19,748 KB |
testcase_49 | AC | 109 ms
19,552 KB |
testcase_50 | AC | 116 ms
19,552 KB |
ソースコード
#define LOCAL #include <bits/stdc++.h> using namespace std; #pragma region Macros typedef long long ll; typedef __int128_t i128; typedef unsigned int uint; typedef unsigned long long ull; #define ALL(x) (x).begin(), (x).end() template <typename T> istream& operator>>(istream& is, vector<T>& v) { for (T& x : v) is >> x; return is; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? "" : " "); } return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << '(' << p.first << ',' << p.second << ')'; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) { os << '{'; for (auto itr = m.begin(); itr != m.end();) { os << '(' << itr->first << ',' << itr->second << ')'; if (++itr != m.end()) os << ','; } os << '}'; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) { os << '{'; for (auto itr = m.begin(); itr != m.end();) { os << '(' << itr->first << ',' << itr->second << ')'; if (++itr != m.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const set<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? "" : " "); } return os; } template <int i, typename T> void print_tuple(ostream&, const T&) {} template <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) { if (i) os << ','; os << get<i>(t); print_tuple<i + 1, T, Args...>(os, t); } template <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) { os << '{'; print_tuple<0, tuple<Args...>, Args...>(os, t); return os << '}'; } void debug_out() { cerr << '\n'; } template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) { cerr << head; if (sizeof...(Tail) > 0) cerr << ", "; debug_out(move(tail)...); } #ifdef LOCAL #define debug(...) \ cerr << " "; \ cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \ cerr << " "; \ debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; } template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; } int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); } int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); } int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); } int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); } int popcount(signed t) { return __builtin_popcount(t); } int popcount(long long t) { return __builtin_popcountll(t); } bool ispow2(int i) { return i && (i & -i) == i; } template <class T> T ceil(T x, T y) { assert(y >= 1); return (x > 0 ? (x + y - 1) / y : x / y); } template <class T> T floor(T x, T y) { assert(y >= 1); return (x > 0 ? x / y : (x - y + 1) / y); } template <class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } template <class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; } #pragma endregion /** * @brief Cycle Detection * @docs docs/graph/CycleDetection.md */ template <bool directed> struct CycleDetection { vector<vector<int>> G; vector<int> seen, finished; stack<int> hist; int pos; CycleDetection(int n) : G(n), seen(n, 0), finished(n, 0), pos(-1) {} void add_edge(int u, int v) { G[u].emplace_back(v); } void dfs(int v, int p) { seen[v] = 1; hist.emplace(v); for (int u : G[v]) { if (!directed && u == p) continue; if (finished[u]) continue; if (seen[u] && !finished[u]) { pos = u; return; } dfs(u, v); if (~pos) return; } finished[v] = 1; hist.pop(); } vector<int> build() { for (int v = 0; v < (int)G.size(); v++) { if (!seen[v]) dfs(v, -1); if (~pos) break; } vector<int> res; while (!hist.empty()) { int t = hist.top(); hist.pop(); res.emplace_back(t); if (t == pos) break; } return res; } }; const int INF = 1e9; const long long IINF = 1e18; const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; const char dir[4] = {'D', 'R', 'U', 'L'}; const long long MOD = 1000000007; // const long long MOD = 998244353; int main() { cin.tie(0); ios::sync_with_stdio(false); int H, W, N; cin >> H >> W >> N; CycleDetection<false> CD(H + W); map<pair<int, int>, int> mp; for (int i = 0; i < N; i++) { int x, y; cin >> x >> y; x--, y--; CD.add_edge(x, y + H); CD.add_edge(y + H, x); mp[{x, y}] = i; } auto res = CD.build(); if (res.empty()) { cout << -1 << '\n'; return 0; } deque<int> v; for (int& x : res) v.emplace_back(x); if (v.front() >= H) { v.emplace_back(v.front()); v.pop_front(); } int n = v.size(); v.emplace_back(v.front()); vector<int> ans; for (int i = 0; i < n; i++) { int x, y; if (i & 1) x = v[i + 1], y = v[i] - H; else x = v[i], y = v[i + 1] - H; assert(mp.count({x, y})); ans.emplace_back(mp[{x, y}] + 1); } cout << n << '\n'; cout << ans << '\n'; return 0; }