結果

問題 No.340 雪の足跡
ユーザー 37kt_37kt_
提出日時 2016-01-29 23:37:22
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 396 ms / 1,000 ms
コード長 4,176 bytes
コンパイル時間 1,310 ms
コンパイル使用メモリ 168,604 KB
実行使用メモリ 70,016 KB
最終ジャッジ日時 2024-09-21 18:47:10
合計ジャッジ時間 7,552 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 22 ms
38,596 KB
testcase_01 AC 24 ms
38,656 KB
testcase_02 AC 26 ms
38,528 KB
testcase_03 AC 24 ms
38,784 KB
testcase_04 AC 24 ms
38,724 KB
testcase_05 AC 30 ms
38,728 KB
testcase_06 AC 28 ms
38,724 KB
testcase_07 AC 26 ms
38,784 KB
testcase_08 AC 25 ms
38,528 KB
testcase_09 AC 26 ms
38,720 KB
testcase_10 AC 25 ms
38,728 KB
testcase_11 AC 27 ms
38,784 KB
testcase_12 AC 25 ms
38,724 KB
testcase_13 AC 27 ms
38,728 KB
testcase_14 AC 44 ms
41,024 KB
testcase_15 AC 46 ms
41,160 KB
testcase_16 AC 37 ms
39,808 KB
testcase_17 AC 55 ms
41,540 KB
testcase_18 AC 48 ms
41,668 KB
testcase_19 AC 49 ms
41,472 KB
testcase_20 AC 174 ms
44,800 KB
testcase_21 AC 118 ms
38,724 KB
testcase_22 AC 25 ms
38,724 KB
testcase_23 AC 245 ms
69,956 KB
testcase_24 AC 137 ms
39,040 KB
testcase_25 AC 190 ms
52,224 KB
testcase_26 AC 54 ms
39,040 KB
testcase_27 AC 37 ms
38,784 KB
testcase_28 AC 55 ms
40,320 KB
testcase_29 AC 251 ms
56,960 KB
testcase_30 AC 191 ms
52,608 KB
testcase_31 AC 354 ms
67,456 KB
testcase_32 AC 396 ms
70,016 KB
testcase_33 AC 365 ms
69,888 KB
testcase_34 AC 392 ms
70,016 KB
testcase_35 AC 361 ms
70,016 KB
testcase_36 AC 375 ms
70,016 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘std::ostream& operator<<(std::ostream&, const std::tuple<_Tps ...>&)’:
main.cpp:163:1: warning: no return statement in function returning non-void [-Wreturn-type]
  163 | }
      | ^
main.cpp: In function ‘ll in()’:
main.cpp:121:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  121 |         scanf("%lld", &x);
      |         ~~~~~^~~~~~~~~~~~

ソースコード

diff # 

// template {{{
#include <bits/stdc++.h>
using namespace std;

// #define int long long

#define GET_MACRO(a, b, c, d, NAME, ...) NAME
#define REP2(i, n) REP3(i, 0, n)
#define REP3(i, a, b) REP4(i, a, b, 1)
#define REP4(i, a, b, s) for (ll i = (a); i < (ll)(b); i += s)
#define RREP2(i, n) RREP3(i, 0, n)
#define RREP3(i, a, b) for (ll i = (b) - 1; i >= (ll)(a); i--)

#define rep(...) GET_MACRO(__VA_ARGS__, REP4, REP3, REP2)(__VA_ARGS__)
#define rrep(...) GET_MACRO(__VA_ARGS__,, RREP3, RREP2)(__VA_ARGS__)
#define eb emplace_back
#define ef emplace_front
#define pb pop_back
#define pf pop_front
#define all(c) begin(c), end(c)
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define popcnt __builtin_popcountll

#ifdef DEBUG
	#define dump(x) cerr << "line " << __LINE__ << " : " << #x " = " << x << endl;
#else
	#define dump(x)
#endif

using uint = unsigned;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;

template<typename T>
using maxheap = priority_queue<T, vector<T>, less<T>>;

template<typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

const int INF = 1e9 + 10;
const ll LLINF = 1e18 + 10;

const int dx[] = {-1, 0, 1, 0, -1, 1, 1, -1};
const int dy[] = {0, -1, 0, 1, -1, -1, 1, 1};

template<typename T>
inline T sq(T x){
	return x * x;
}

template<typename T, typename U>
inline bool chmax(T &x, U y){
	if (x >= y) return false;
	x = y;
	return true;
}

template<typename T, typename U>
inline bool chmin(T &x, U y){
	if (x <= y) return false;
	x = y;
	return true;
}

template<typename T>
inline T& sort(T &c){
	sort(all(c));
	return c;
}

template<typename T>
inline T& reverse(T &c){
	reverse(all(c));
	return c;
}

template<typename T>
inline T& unique(T &c){
	sort(all(c));
	c.erase(unique(all(c)), end(c));
	return c;
}

template<typename T>
inline T sorted(const T &c){
	T d = c;
	return move(sort(d));
}

template<typename T>
inline T reversed(const T &c){
	T d = c;
	return move(reverse(d));
}

template<typename T>
inline T uniqued(const T &c){
	T d = c;
	return move(unique(d));
}

ll modpow(ll x, ll e, ll mod = 1000000007){
	ll res = 1;
	e %= mod - 1;
	while (e){
		if (e & 1) res = res * x;
		x = x * x;
		e >>= 1;
	}
	return res;
}

inline ll in(){
	ll x;
	scanf("%lld", &x);
	return x;
}

inline double inD(){
	double x;
	scanf("%lf", &x);
	return x;
}

inline string inS(){
	static char s[1024];
	scanf("%s", s);
	return s;
}

pair<ll, ll> rot45(ll x, ll y){
	return mp(x + y, x - y);
}

pair<ll, ll> rot45inv(ll u, ll v){
	return mp((u + v) / 2, (u - v) / 2);
}

template<typename T, size_t N>
struct print_tuple {
	static void print(const T &t, ostream &os){
		print_tuple<T, N - 1>::print(t, os);
		os << " " << get<N - 1>(t);
	}
};

template<typename T>
struct print_tuple<T, 1> {
	static void print(const T &t, ostream &os){
		os << get<0>(t);
	}
};

template<typename ...Args>
ostream& operator<<(ostream &os, const tuple<Args...> &t){
	print_tuple<tuple<Args...>, tuple_size<tuple<Args...>>::value>::print(t, os);
}
// }}}

vector<int> g[1000000];
int a[1010][1010], b[1010][1010];
int dist[1000000];

int main()
{
	int w = in(), h = in(), n = in();
	rep(i, n){
		int m = in();
		vector<int> bb(m + 1);
		rep(j, m + 1) bb[j] = in();
		rep(j, m){
			int x = bb[j] / w, y = bb[j] % w;
			int xx = bb[j + 1] / w, yy = bb[j + 1] % w;
			if (mt(x, y) > mt(xx, yy)){
				swap(x, xx);
				swap(y, yy);
			}
			if (x == xx){
				a[x][y]++;
				a[xx][yy]--;
			}
			else {
				b[x][y]++;
				b[xx][yy]--;
			}
		}
	}
	rep(i, 1000) rep(j, 1000){
		if (a[i][j]){
			int s = i * w + j;
			int t = i * w + j + 1;
			g[s].eb(t);
			g[t].eb(s);
		}
		if (b[i][j]){
			int s = i * w + j;
			int t = (i + 1) * w + j;
			g[s].eb(t);
			g[t].eb(s);
		}
		a[i][j + 1] += a[i][j];
		b[i + 1][j] += b[i][j];
	}

	memset(dist, -1, sizeof(dist));
	queue<int> q;
	dist[0] = 0;
	q.push(0);
	while (q.size()){
		int v = q.front(); q.pop();
		for (int to : g[v]){
			if (~dist[to]) continue;
			dist[to] = dist[v] + 1;
			q.push(to);
		}
	}
	
	if (~dist[w * h - 1]) cout << dist[w * h - 1] << endl;
	else cout << "Odekakedekinai..\n";
}
0