結果

問題 No.1647 Travel in Mitaru city 2
ユーザー kaikeykaikey
提出日時 2021-08-13 22:50:47
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,730 bytes
コンパイル時間 2,486 ms
コンパイル使用メモリ 238,700 KB
実行使用メモリ 27,020 KB
最終ジャッジ日時 2024-10-03 21:27:26
合計ジャッジ時間 10,708 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 WA -
testcase_03 AC 2 ms
6,816 KB
testcase_04 AC 2 ms
6,820 KB
testcase_05 AC 2 ms
6,820 KB
testcase_06 AC 2 ms
6,820 KB
testcase_07 AC 1 ms
6,816 KB
testcase_08 AC 128 ms
25,344 KB
testcase_09 AC 120 ms
23,812 KB
testcase_10 AC 133 ms
25,440 KB
testcase_11 AC 99 ms
19,728 KB
testcase_12 AC 129 ms
21,372 KB
testcase_13 AC 104 ms
19,576 KB
testcase_14 AC 140 ms
25,824 KB
testcase_15 AC 138 ms
25,520 KB
testcase_16 AC 123 ms
24,536 KB
testcase_17 AC 101 ms
19,400 KB
testcase_18 AC 115 ms
20,484 KB
testcase_19 AC 105 ms
20,876 KB
testcase_20 AC 108 ms
21,768 KB
testcase_21 AC 124 ms
21,896 KB
testcase_22 AC 145 ms
26,244 KB
testcase_23 AC 132 ms
26,508 KB
testcase_24 AC 127 ms
22,924 KB
testcase_25 AC 141 ms
24,964 KB
testcase_26 AC 165 ms
26,504 KB
testcase_27 AC 162 ms
26,632 KB
testcase_28 AC 150 ms
26,876 KB
testcase_29 AC 151 ms
26,888 KB
testcase_30 AC 105 ms
21,516 KB
testcase_31 AC 140 ms
26,888 KB
testcase_32 AC 124 ms
24,072 KB
testcase_33 AC 142 ms
24,068 KB
testcase_34 AC 173 ms
26,804 KB
testcase_35 AC 112 ms
22,284 KB
testcase_36 AC 146 ms
27,020 KB
testcase_37 AC 155 ms
26,768 KB
testcase_38 AC 132 ms
24,316 KB
testcase_39 AC 105 ms
22,648 KB
testcase_40 AC 125 ms
24,108 KB
testcase_41 AC 106 ms
22,896 KB
testcase_42 AC 118 ms
24,312 KB
testcase_43 AC 1 ms
6,820 KB
testcase_44 AC 4 ms
8,840 KB
testcase_45 AC 47 ms
15,524 KB
testcase_46 AC 93 ms
20,692 KB
testcase_47 AC 99 ms
20,440 KB
testcase_48 AC 52 ms
15,656 KB
testcase_49 AC 102 ms
20,328 KB
testcase_50 AC 65 ms
17,828 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
#include <random>
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>;
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 != v.size() ? " " : "");
	return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
	for (T& in : v) is >> in;
	return is;
}
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template <class T>
T div_floor(T a, T b) {
	if (b < 0) a *= -1, b *= -1;
	return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
	if (b < 0) a *= -1, b *= -1;
	return a > 0 ? (a - 1) / b + 1 : a / b;
}
template <class F> struct rec {
	F f;
	rec(F&& f_) : f(std::forward<F>(f_)) {}
	template <class... Args> auto operator()(Args &&... args) const {
		return f(*this, std::forward<Args>(args)...);
	}
};
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); }
lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); }
bool check_overflow(lint a, lint b, lint limit) { if (b == 0) return false; return a > limit / b; } // a * b > c => true
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 1e18;
lint dx[8] = { -1, 1, 0, 0, 1, -1, 1, -1 }, dy[8] = { 0, 0, 1, -1, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endl; return flag; }
struct Edge {
	lint from, to;
	string cost;
	Edge() {

	}
	Edge(lint u, lint v, string c) {
		cost = c;
		from = u;
		to = v;
	}
	bool operator<(const Edge& e) const {
		if (SZ(cost) != SZ(e.cost)) return SZ(cost) < SZ(e.cost);
		else return cost < e.cost;
	}
};
struct WeightedEdge {
	lint to;
	lint cost;
	WeightedEdge(lint v, lint c) {
		to = v;
		cost = c;
	}
	bool operator<(const WeightedEdge& e) const {
		return cost < e.cost;
	}
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<plint, lint> tlint;
typedef pair<plint, plint> qlint;
typedef pair<lint, string> valstr;

struct UnionFind {
public:
    UnionFind() : _n(0) {}
    UnionFind(int n) : _n(n), parent_or_size(n, -1) {}

    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        if (used_count) {
            if (count_in_set[x].size() < count_in_set[y].size()) {
                std::swap(count_in_set[x], count_in_set[y]);
            }
            for (auto p : count_in_set[y]) {
                count_in_set[x][p.first] += p.second;
            }
        }
        if (set_operate) {
            root_values[x] = f(root_values[y], root_values[x]);
        }
        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 leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }

    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::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(
            std::remove_if(result.begin(), result.end(),
                [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }
    //update root calc
    //set by set operations
    void set_operate_and_value(std::vector<lint> array, function<lint(lint, lint)> _f) {
        f = _f;
        root_values = array;
        set_operate = true;
    }
    lint get_set_value(int a) {
        return root_values[leader(a)];
    }

    //regist count
    void regist_count(int a, int label) {
        if (!used_count) {
            used_count = true;
            count_in_set.assign(_n, std::map<int, int>());
        }
        count_in_set[leader(a)][label]++;
    }

    int get_count(int a, int label) {
        if (!used_count) return -1;
        return count_in_set[leader(a)][label];
    }

private:
    int _n;
    std::vector<int> parent_or_size;
    std::vector<std::map<int, int>> count_in_set;
    bool used_count = false;
    std::vector<lint> root_values;
    function<lint(lint, lint)> f;
    bool set_operate = false;
};


int main() {
	lint H, W, N;
	cin >> H >> W >> N;
    UnionFind tree(H + W);
    map<plint, lint> idx;
    VVl to(H + W);
    V<plint> arr;
    REP(i, N) {
        lint x, y;
        cin >> x >> y; x--; y--;
        idx[{x, H + y}] = i + 1;
        arr.push_back({ x, y });
        if (tree.same(x, H + y)) {
            Vl ans;
            auto dfs = [&](auto&& dfs, lint curr, lint prv) -> bool {
                if (curr == H + y) {
                    ans.push_back(H + y);
                    return true;
                }
                for (lint nxt : to[curr]) {
                    if (prv == nxt) continue;
                    if (dfs(dfs, nxt, curr)) {
                        ans.push_back(curr);
                        return true;
                    }
                }
                return false;
            };

            dfs(dfs, x, -1);
            Vl _ans;
            REP(i, SZ(ans)) {
                lint a = ans[i], b = ans[(i + 1) % SZ(ans)];
                if (a > b) swap(a, b);
                _ans.push_back(idx[{a, b}]);
            }
            if (arr[_ans[0]].second != arr[_ans[1]].second) {
                Vl tmp;
                REP(i, SZ(ans)) tmp.push_back(_ans[(i + 1) % SZ(ans)]);
                _ans = tmp;
            }
            cout << SZ(_ans) << endk;
            cout << _ans << endk;
            return 0;
        }
        tree.merge(x, H + y);
        to[x].push_back(H + y);
        to[H + y].push_back(x);
    }
    cout << -1 << endk;
}
0