結果
問題 | No.1647 Travel in Mitaru city 2 |
ユーザー | stoq |
提出日時 | 2021-08-13 22:25:08 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 176 ms / 2,500 ms |
コード長 | 6,847 bytes |
コンパイル時間 | 4,843 ms |
コンパイル使用メモリ | 272,236 KB |
実行使用メモリ | 37,960 KB |
最終ジャッジ日時 | 2024-04-21 04:52:14 |
合計ジャッジ時間 | 14,818 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
26,752 KB |
testcase_01 | AC | 70 ms
26,624 KB |
testcase_02 | AC | 69 ms
26,752 KB |
testcase_03 | AC | 68 ms
26,624 KB |
testcase_04 | AC | 68 ms
26,880 KB |
testcase_05 | AC | 68 ms
26,752 KB |
testcase_06 | AC | 128 ms
26,752 KB |
testcase_07 | AC | 70 ms
26,660 KB |
testcase_08 | AC | 176 ms
37,136 KB |
testcase_09 | AC | 158 ms
36,736 KB |
testcase_10 | AC | 153 ms
36,960 KB |
testcase_11 | AC | 119 ms
36,724 KB |
testcase_12 | AC | 126 ms
36,864 KB |
testcase_13 | AC | 119 ms
36,528 KB |
testcase_14 | AC | 133 ms
37,376 KB |
testcase_15 | AC | 151 ms
37,080 KB |
testcase_16 | AC | 124 ms
36,864 KB |
testcase_17 | AC | 116 ms
36,480 KB |
testcase_18 | AC | 120 ms
37,120 KB |
testcase_19 | AC | 151 ms
37,192 KB |
testcase_20 | AC | 141 ms
37,176 KB |
testcase_21 | AC | 129 ms
37,248 KB |
testcase_22 | AC | 136 ms
37,504 KB |
testcase_23 | AC | 135 ms
37,548 KB |
testcase_24 | AC | 128 ms
37,304 KB |
testcase_25 | AC | 134 ms
37,632 KB |
testcase_26 | AC | 138 ms
37,632 KB |
testcase_27 | AC | 131 ms
37,560 KB |
testcase_28 | AC | 131 ms
37,420 KB |
testcase_29 | AC | 137 ms
37,536 KB |
testcase_30 | AC | 125 ms
37,084 KB |
testcase_31 | AC | 136 ms
37,548 KB |
testcase_32 | AC | 127 ms
37,356 KB |
testcase_33 | AC | 127 ms
37,376 KB |
testcase_34 | AC | 144 ms
37,424 KB |
testcase_35 | AC | 122 ms
37,020 KB |
testcase_36 | AC | 133 ms
37,504 KB |
testcase_37 | AC | 142 ms
37,424 KB |
testcase_38 | AC | 129 ms
37,888 KB |
testcase_39 | AC | 128 ms
37,560 KB |
testcase_40 | AC | 131 ms
37,888 KB |
testcase_41 | AC | 129 ms
37,760 KB |
testcase_42 | AC | 131 ms
37,840 KB |
testcase_43 | AC | 71 ms
26,752 KB |
testcase_44 | AC | 72 ms
32,892 KB |
testcase_45 | AC | 105 ms
36,480 KB |
testcase_46 | AC | 118 ms
37,888 KB |
testcase_47 | AC | 116 ms
37,960 KB |
testcase_48 | AC | 107 ms
36,468 KB |
testcase_49 | AC | 112 ms
37,888 KB |
testcase_50 | AC | 112 ms
36,992 KB |
ソースコード
#define MOD_TYPE 2 #pragma region Macros #include <bits/stdc++.h> using namespace std; #include <atcoder/all> using namespace atcoder; #if 0 #include <boost/multiprecision/cpp_dec_float.hpp> #include <boost/multiprecision/cpp_int.hpp> using Int = boost::multiprecision::cpp_int; using lld = boost::multiprecision::cpp_dec_float_100; #endif #if 1 #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #endif using ll = long long int; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; using pld = pair<ld, ld>; template <typename Q_type> using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>; #if MOD_TYPE == 1 constexpr ll MOD = ll(1e9 + 7); #else #if MOD_TYPE == 2 constexpr ll MOD = 998244353; #else constexpr ll MOD = 1000003; #endif #endif using mint = static_modint<MOD>; constexpr int INF = (int)1e9 + 10; constexpr ll LINF = (ll)4e18; constexpr double PI = acos(-1.0); constexpr double EPS = 1e-11; constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0}; constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0}; #define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i) #define rep(i, n) REP(i, 0, n) #define REPI(i, m, n) for (int i = m; i < (int)(n); ++i) #define repi(i, n) REPI(i, 0, n) #define MP make_pair #define MT make_tuple #define YES(n) cout << ((n) ? "YES" : "NO") << "\n" #define Yes(n) cout << ((n) ? "Yes" : "No") << "\n" #define possible(n) cout << ((n) ? "possible" : "impossible") << "\n" #define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n" #define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n" #define all(v) v.begin(), v.end() #define NP(v) next_permutation(all(v)) #define dbg(x) cerr << #x << ":" << x << "\n"; struct io_init { io_init() { cin.tie(0); ios::sync_with_stdio(false); cout << setprecision(30) << setiosflags(ios::fixed); }; } io_init; template <typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template <typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; } template <typename A, size_t N, typename T> inline void Fill(A (&array)[N], const T &val) { fill((T *)array, (T *)(array + N), val); } template <typename T> vector<T> compress(vector<T> &v) { vector<T> val = v; sort(all(val)), val.erase(unique(all(val)), val.end()); for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin(); return val; } template <typename T, typename U> constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept { is >> p.first >> p.second; return is; } template <typename T, typename U> constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept { os << p.first << " " << p.second; return os; } ostream &operator<<(ostream &os, mint m) { os << m.val(); return os; } random_device seed_gen; mt19937_64 engine(seed_gen()); struct BiCoef { vector<mint> fact_, inv_, finv_; BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) { fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1); for (int i = 2; i < n; i++) { fact_[i] = fact_[i - 1] * i; inv_[i] = -inv_[MOD % i] * (MOD / i); finv_[i] = finv_[i - 1] * inv_[i]; } } mint C(ll n, ll k) const noexcept { if (n < k || n < 0 || k < 0) return 0; return fact_[n] * finv_[k] * finv_[n - k]; } mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; } mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); } mint Ch1(ll n, ll k) const noexcept { if (n < 0 || k < 0) return 0; mint res = 0; for (int i = 0; i < n; i++) res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1); return res; } mint fact(ll n) const noexcept { if (n < 0) return 0; return fact_[n]; } mint inv(ll n) const noexcept { if (n < 0) return 0; return inv_[n]; } mint finv(ll n) const noexcept { if (n < 0) return 0; return finv_[n]; } }; BiCoef bc(2000010); #pragma endregion struct UnionFind { public: UnionFind() : _n(0) {} UnionFind(int n) : _n(n), parent_or_size(n, -1) {} int unite(int a, int b) { assert(0 <= a && a < _n); assert(0 <= b && b < _n); int x = root(a), y = root(b); if (x == y) return x; if (-parent_or_size[x] < -parent_or_size[y]) swap(x, y); parent_or_size[x] += parent_or_size[y]; parent_or_size[y] = x; return x; } bool same(int a, int b) { assert(0 <= a && a < _n); assert(0 <= b && b < _n); return root(a) == root(b); } int root(int a) { assert(0 <= a && a < _n); if (parent_or_size[a] < 0) return a; return parent_or_size[a] = root(parent_or_size[a]); } int size(int a) { assert(0 <= a && a < _n); return -parent_or_size[root(a)]; } vector<vector<int>> groups() { vector<int> leader_buf(_n), group_size(_n); for (int i = 0; i < _n; i++) { leader_buf[i] = root(i); group_size[leader_buf[i]]++; } vector<vector<int>> result(_n); for (int i = 0; i < _n; i++) { result[i].reserve(group_size[i]); } for (int i = 0; i < _n; i++) { result[leader_buf[i]].push_back(i); } result.erase(remove_if(result.begin(), result.end(), [&](const vector<int> &v) { return v.empty(); }), result.end()); return result; } private: int _n; vector<int> parent_or_size; }; struct BFS { vector<int> d; vector<vector<pair<int, int>>> E; BFS(int V) : d(V, INF), E(V) {} void add_edge(int u, int v, int num, bool directed = true) { E[u].push_back({v, num}); if (!directed) E[v].push_back({u, num}); } void calc(int s) { d[s] = 0; queue<int> que; que.push(s); while (!que.empty()) { int u = que.front(); que.pop(); for (auto [v, num] : E[u]) { if (d[v] <= d[u] + 1) continue; d[v] = d[u] + 1; que.push(v); } } } }; void solve() { int h, w, n; cin >> h >> w >> n; vector<int> x(n), y(n); rep(i, n) { cin >> x[i] >> y[i]; x[i]--, y[i]--; } UnionFind uf(h + w); BFS bfs(h + w); int u = -1, v; vector<int> ans; rep(i, n) { if (uf.same(x[i], y[i] + h)) { u = x[i], v = y[i] + h; ans.push_back(i + 1); break; } uf.unite(x[i], y[i] + h); bfs.add_edge(x[i], y[i] + h, i + 1, false); } if (u == -1) { cout << -1 << "\n"; return; } bfs.calc(u); int cur = v; while (cur != u) { for (auto [t, num] : bfs.E[cur]) { if (bfs.d[t] + 1 == bfs.d[cur]) { ans.push_back(num); cur = t; break; } } } cout << ans.size() << "\n"; rep(i, ans.size()) cout << ans[i] << (i + 1 == ans.size() ? "\n" : " "); } int main() { solve(); }