結果

問題 No.340 雪の足跡
ユーザー haruki_Kharuki_K
提出日時 2020-07-08 23:33:33
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,568 bytes
コンパイル時間 1,731 ms
コンパイル使用メモリ 179,304 KB
実行使用メモリ 97,252 KB
最終ジャッジ日時 2024-10-05 03:00:17
合計ジャッジ時間 8,728 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 1 ms
5,248 KB
testcase_03 AC 1 ms
5,248 KB
testcase_04 AC 1 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 1 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 WA -
testcase_09 AC 1 ms
5,248 KB
testcase_10 AC 1 ms
5,248 KB
testcase_11 AC 3 ms
5,248 KB
testcase_12 AC 2 ms
5,248 KB
testcase_13 AC 3 ms
5,248 KB
testcase_14 AC 23 ms
10,240 KB
testcase_15 AC 26 ms
10,496 KB
testcase_16 AC 16 ms
6,656 KB
testcase_17 AC 32 ms
11,776 KB
testcase_18 AC 29 ms
11,776 KB
testcase_19 AC 29 ms
11,776 KB
testcase_20 AC 180 ms
56,448 KB
testcase_21 AC 83 ms
5,248 KB
testcase_22 AC 37 ms
50,304 KB
testcase_23 AC 248 ms
81,408 KB
testcase_24 AC 138 ms
50,432 KB
testcase_25 AC 193 ms
64,872 KB
testcase_26 AC 23 ms
5,248 KB
testcase_27 AC 6 ms
5,248 KB
testcase_28 AC 27 ms
7,552 KB
testcase_29 AC 283 ms
57,832 KB
testcase_30 AC 203 ms
44,928 KB
testcase_31 AC 409 ms
88,832 KB
testcase_32 AC 487 ms
97,152 KB
testcase_33 AC 441 ms
97,252 KB
testcase_34 AC 466 ms
97,160 KB
testcase_35 AC 416 ms
97,088 KB
testcase_36 AC 421 ms
97,100 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 double ld
#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) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
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> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) 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 > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = 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(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
template <class Int> struct Random {
    mt19937_64 mt{random_device{}()};
    //mt19937_64 mt{(unsigned)time(0)};
    Int a,b; // [a,b]
    Random(Int a, Int b) : a(a), b(b) {}
    Int operator()() { return uniform_int_distribution<Int>(a,b)(mt); }
};
template <class Int> Int rand(Int a, Int b) { // [a,b]
    static mt19937_64 mt{random_device{}()};
    return uniform_int_distribution<Int>(a,b)(mt);
}
// <<<

int32_t main() {
    int n,m,k; cin >> n >> m >> k;
    auto hol = make_v<int,2>(n,m);
    auto ver = make_v<int,2>(n,m);
    rep (i,k) {
        int s; cin >> s;
        vector<int> a(s+1); cin >> a;
        rep (i,s) {
            int x = a[i], y = a[i+1];
            if (x > y) swap(x,y);
            if (x/m == y/m) {
                hol[x/m][x%m]++;
                hol[y/m][y%m]--;
            } else {
                ver[x/m][x%m]++;
                ver[y/m][y%m]--;
            }
        }
    }
    rep (i,n) rep (j,m-1) hol[i][j+1] += hol[i][j];
    rep (i,n-1) rep (j,m) ver[i+1][j] += ver[i][j];

    vector<vector<int>> g(n*m);
    auto id = [&](int i, int j) { return i*m+j; };
    auto add = [&](int x, int y) {
        g[x].eb(y);
        g[y].eb(x);
    };
    rep (i,n) rep (j,m-1) if (hol[i][j]) {
        add(id(i,j),id(i,j+1));
    }
    rep (i,n-1) rep (j,m) if (ver[i][j]) {
        add(id(i,j),id(i+1,j));
    }

    vector<int> d(n*m,INF);
    queue<int> q;
    d[0] = 0;
    q.push(0);
    while (q.size()) {
        int x = q.front(); q.pop();
        for (int y : g[x]) {
            if (chmin(d[y], d[x]+1)) {
                q.push(y);
            }
        }
    }

    if (d.back() < INF) {
        cout << d.back() << endl;
    } else {
        cout << "Odekakedekinai.." << endl;
    }
}
0