結果
問題 | No.340 雪の足跡 |
ユーザー | heno239 |
提出日時 | 2020-08-31 12:46:18 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 166 ms / 1,000 ms |
コード長 | 4,494 bytes |
コンパイル時間 | 1,416 ms |
コンパイル使用メモリ | 126,216 KB |
実行使用メモリ | 15,232 KB |
最終ジャッジ日時 | 2024-04-27 16:30:08 |
合計ジャッジ時間 | 6,212 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 3 ms
6,944 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 2 ms
6,944 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 3 ms
6,940 KB |
testcase_12 | AC | 3 ms
6,940 KB |
testcase_13 | AC | 3 ms
6,944 KB |
testcase_14 | AC | 9 ms
6,944 KB |
testcase_15 | AC | 11 ms
6,940 KB |
testcase_16 | AC | 9 ms
6,940 KB |
testcase_17 | AC | 14 ms
6,940 KB |
testcase_18 | AC | 11 ms
6,948 KB |
testcase_19 | AC | 13 ms
6,940 KB |
testcase_20 | AC | 119 ms
15,104 KB |
testcase_21 | AC | 70 ms
6,944 KB |
testcase_22 | AC | 13 ms
15,104 KB |
testcase_23 | AC | 130 ms
15,104 KB |
testcase_24 | AC | 102 ms
15,104 KB |
testcase_25 | AC | 113 ms
15,104 KB |
testcase_26 | AC | 19 ms
6,940 KB |
testcase_27 | AC | 5 ms
6,944 KB |
testcase_28 | AC | 17 ms
6,940 KB |
testcase_29 | AC | 123 ms
10,240 KB |
testcase_30 | AC | 84 ms
8,704 KB |
testcase_31 | AC | 141 ms
14,208 KB |
testcase_32 | AC | 165 ms
15,232 KB |
testcase_33 | AC | 135 ms
15,232 KB |
testcase_34 | AC | 166 ms
15,232 KB |
testcase_35 | AC | 137 ms
15,232 KB |
testcase_36 | AC | 138 ms
15,232 KB |
ソースコード
#include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<bitset> #include<stack> #include<unordered_map> #include<utility> #include<cassert> #include<complex> #include<numeric> #include<array> using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 1000000007; const ll INF = mod * mod; typedef pair<int, int>P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair<ll, ll> LP; typedef long double ld; typedef pair<ld, ld> LDP; const ld eps = 1e-12; const ld pi = acosl(-1.0); ll mod_pow(ll x, ll n, ll m = mod) { ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } const int max_n = 1000; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } int gcd(int a, int b) { if (a < b)swap(a, b); while (b) { int r = a % b; a = b; b = r; } return a; } void solve() { int w, h, n; cin >> w >> h >> n; vector<vector<int>> cw(w,vector<int>(h)); vector<vector<int>> ch(h,vector<int>(w)); rep(i, n) { int len; cin >> len; vector<int> x(len+1), y(len+1); rep(j, len+1) { int z; cin >> z; x[j] = z / w; y[j] = z % w; } rep(j, len) { if (x[j] == x[j + 1]) { int ly = y[j], ry = y[j + 1]; if (ly > ry)swap(ly, ry); ch[x[j]][ly]++; ch[x[j]][ry]--; } else { int lx = x[j], rx = x[j + 1]; if (lx > rx)swap(lx, rx); cw[y[j]][lx]++; cw[y[j]][rx]--; } } } rep(j, w)rep(i, h - 1)cw[j][i + 1] += cw[j][i]; rep(i, h)rep(j, w - 1)ch[i][j + 1] += ch[i][j]; vector<vector<int>> dist(h, vector<int>(w, mod)); dist[0][0] = 0; queue<P> q; q.push({ 0,0 }); while (!q.empty()) { P p = q.front(); q.pop(); int x = p.first, y = p.second; if (x + 1 < h && cw[y][x] > 0) { if (dist[x + 1][y] > dist[x][y] + 1) { dist[x + 1][y] = dist[x][y] + 1; q.push({ x + 1,y }); } } if (y + 1 < w && ch[x][y] > 0) { if (dist[x][y + 1] > dist[x][y] + 1) { dist[x][y + 1] = dist[x][y] + 1; q.push({ x,y + 1 }); } } if (x > 0 && cw[y][x-1] > 0) { if (dist[x - 1][y] > dist[x][y] + 1) { dist[x - 1][y] = dist[x][y] + 1; q.push({ x - 1,y }); } } if (y > 0 && ch[x][y - 1] > 0) { if (dist[x][y - 1] > dist[x][y] + 1) { dist[x][y - 1] = dist[x][y] + 1; q.push({ x,y - 1 }); } } } int ans = dist[h - 1][w - 1]; if (ans == mod) { cout << "Odekakedekinai.." << "\n"; } else { cout << ans << "\n"; } //cout << ch[0][0] << " " << cw[1][0] << " " << cw[1][1] << " " << ch[2][1] << "\n"; } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(15); //init_f(); //init(); //expr(); //int t; cin >> t; rep(i, t) solve(); return 0; }