結果

問題 No.1647 Travel in Mitaru city 2
ユーザー haruki_Kharuki_K
提出日時 2021-08-13 21:57:58
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 140 ms / 2,500 ms
コード長 7,447 bytes
コンパイル時間 2,269 ms
コンパイル使用メモリ 223,040 KB
実行使用メモリ 32,360 KB
最終ジャッジ日時 2024-10-13 03:15:22
合計ジャッジ時間 9,781 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 1 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 3 ms
5,248 KB
testcase_05 AC 1 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 3 ms
5,248 KB
testcase_08 AC 118 ms
29,860 KB
testcase_09 AC 107 ms
27,500 KB
testcase_10 AC 123 ms
30,056 KB
testcase_11 AC 86 ms
22,904 KB
testcase_12 AC 93 ms
22,704 KB
testcase_13 AC 91 ms
23,500 KB
testcase_14 AC 126 ms
30,804 KB
testcase_15 AC 125 ms
30,428 KB
testcase_16 AC 112 ms
28,960 KB
testcase_17 AC 89 ms
23,812 KB
testcase_18 AC 95 ms
23,436 KB
testcase_19 AC 103 ms
29,056 KB
testcase_20 AC 106 ms
27,128 KB
testcase_21 AC 109 ms
29,716 KB
testcase_22 AC 130 ms
31,332 KB
testcase_23 AC 129 ms
31,580 KB
testcase_24 AC 107 ms
27,956 KB
testcase_25 AC 115 ms
29,476 KB
testcase_26 AC 125 ms
31,556 KB
testcase_27 AC 131 ms
31,764 KB
testcase_28 AC 127 ms
32,356 KB
testcase_29 AC 127 ms
32,228 KB
testcase_30 AC 124 ms
30,408 KB
testcase_31 AC 137 ms
32,360 KB
testcase_32 AC 114 ms
30,680 KB
testcase_33 AC 118 ms
28,444 KB
testcase_34 AC 133 ms
32,356 KB
testcase_35 AC 122 ms
29,408 KB
testcase_36 AC 140 ms
32,352 KB
testcase_37 AC 132 ms
32,224 KB
testcase_38 AC 118 ms
27,232 KB
testcase_39 AC 102 ms
24,420 KB
testcase_40 AC 124 ms
26,896 KB
testcase_41 AC 108 ms
24,896 KB
testcase_42 AC 115 ms
27,236 KB
testcase_43 AC 2 ms
5,248 KB
testcase_44 AC 5 ms
7,936 KB
testcase_45 AC 78 ms
19,840 KB
testcase_46 AC 79 ms
20,148 KB
testcase_47 AC 81 ms
19,968 KB
testcase_48 AC 87 ms
19,968 KB
testcase_49 AC 83 ms
19,800 KB
testcase_50 AC 82 ms
19,948 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> constexpr auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> constexpr auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > (T)y) { x = (T)y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class T> vector<T> &operator--(vector<T> &v) { for (T &x : v) --x; return v; }
template <class T> vector<T> &operator++(vector<T> &v) { for (T &x : v) ++x; return v; }
// <<<
// >>> find cycle (undirected graph)
#ifndef EDGE_INFO
#define EDGE_INFO
constexpr int dest(int v) { return v; }
template <class E, class = decltype(declval<E>().to)>
constexpr int dest(E const& e) { return e.to; }
constexpr int cost(int) { return 1; }
template <class E, class = decltype(declval<E>().cost)>
constexpr auto cost(E const& e) { return e.cost; }
template <class E> using cost_t = decltype(cost(declval<E>()));
#endif
// returns empty if not found
template <class E>
vector<int> find_cycle(vector<vector<E>> const& g) {
    const int n = g.size();
    vector<bool> used(n);
    vector<int> path, cycle;
    auto dfs = [&](auto dfs, int x, int p) -> bool {
        path.push_back(x);
        used[x] = true;
        for (auto const& e : g[x]) {
            const int y = dest(e);
            if (y == p) continue;
            if (used[y]) {
                do {
                    assert(path.size());
                    cycle.push_back(path.back());
                    path.pop_back();
                } while (cycle.back() != y);
                reverse(cycle.begin(), cycle.end());
                return true;
            } else if (dfs(dfs, y, x)) {
                return true;
            }
        }
        path.pop_back();
        return false;
    };
    rep (i, n) if (not used[i] and dfs(dfs, i, -1)) return cycle;
    return {};
}
// <<<

int32_t main() {
    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];

    vector<vector<int>> g(h+w);
    rep (i, n) {
        int a = x[i], b = y[i] + h;
        g[a].eb(b);
        g[b].eb(a);
    }

    auto cyc = find_cycle(g);

    vector<int> ans;
    map<pair<int, int>, int> id;
    rep (i, n) id[pair(x[i], y[i])] = i;
    rep (i, cyc.size()) {
        int j = (i+1) % cyc.size();
        int x = cyc[i], y = cyc[j];
        if (y >= h) {
            y -= h;
            ans.eb(id[pair(x, y)]);
        } else {
            x -= h;
            ans.eb(id[pair(y, x)]);
        }
    }

    if (sz(ans) < 4) quit(-1);
    if (y[ans[0]] != y[ans[1]]) rotate(ans.begin(), ans.begin() + 1, ans.end());

    cout << ans.size() << '\n';
    cout << ++ans << '\n';


}
0