結果
| 問題 | No.340 雪の足跡 |
| ユーザー |
|
| 提出日時 | 2017-07-10 23:07:35 |
| 言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 4,924 bytes |
| コンパイル時間 | 3,135 ms |
| コンパイル使用メモリ | 203,468 KB |
| 最終ジャッジ日時 | 2024-04-16 12:36:31 |
| 合計ジャッジ時間 | 4,119 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In member function '{anonymous}::MaiScanner& {anonymous}::MaiScanner::operator>>(std::string&)':
main.cpp:62:9: warning: no return statement in function returning non-void [-Wreturn-type]
62 | }
| ^
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/string:43,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bitset:52,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/x86_64-pc-linux-gnu/bits/stdc++.h:52,
from main.cpp:3:
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/allocator.h: In destructor 'std::_Deque_base<long long int, std::allocator<long long int> >::_Deque_impl::~_Deque_impl()':
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/allocator.h:184:7: error: inlining failed in call to 'always_inline' 'std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = long long int]': target specific option mismatch
184 | ~allocator() _GLIBCXX_NOTHROW { }
| ^
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/deque:66,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/x86_64-pc-linux-gnu/bits/stdc++.h:139:
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/stl_deque.h:542:14: note: called from here
542 | struct _Deque_impl
| ^~~~~~~~~~~
ソースコード
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"
using namespace std;
typedef long long int ll;
#define debugv(v) {printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debugm(m) {printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}}
#define debuga(m,w) {printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}}
#define debugaar(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(l) for(auto cnt=0;cnt<(l);++cnt)
#define iterate(b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2>
ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
mt19937 mt(8901016);
inline int rand_int(int l, int h) {
return uniform_int_distribution<>(l, h)(mt);
}
#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiablechar(c) (0x21<=(c)&&(c)<=0x7E)
class MaiScanner {
public:
template<typename T> void input_integer(T& var) {
var = 0;
T sign = 1;
int cc = getchar_unlocked();
for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
if (cc == '-') sign = -1;
for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
var = (var << 3) + (var << 1) + cc - '0';
var = var*sign;
}
inline int c() { return getchar_unlocked(); }
inline MaiScanner& operator>>(int& var) {
input_integer<int>(var);
return *this;
}
inline MaiScanner& operator>>(long long& var) {
input_integer<long long>(var);
return *this;
}
inline MaiScanner& operator>>(string& var) {
int cc = getchar_unlocked();
for (; !isvisiablechar(cc); cc = getchar_unlocked());
for (; isvisiablechar(cc); cc = getchar_unlocked())
var.push_back(cc);
}
template<typename IT> void in(IT begin, IT end) {
for (auto it = begin; it != end; ++it) *this >> *it;
}
};
}
MaiScanner scanner;
int n, w, h;
int dp[1001][1001];
int vroad[1001][1001];
int hroad[1001][1001];
int vimos[1001][1001];
int himos[1001][1001];
int main() {
scanner >> w >> h >> n;
for (int i = 0; i<n; i++) {
int m, u1, u2;
scanner >> m >> u1;
for (int j = 1; j <= m; j++) {
scanner >> u2;
if (u1 - w >= u2) { // down(flip->up)
vimos[u2%w][u2 / w] = max(u1 / w - u2 / w, vimos[u2%w][u2 / w]);
}
else if (u1>u2) { // left
himos[u2%w][u2 / w] = max(u1 - u2, himos[u2%w][u2 / w]);
}
else if (u1 + w>u2) { // right
himos[u1%w][u1 / w] = max(u2 - u1, himos[u1%w][u1 / w]);
}
else { // up(flip->down)
vimos[u1%w][u1 / w] = max(u2 / w - u1 / w, vimos[u1%w][u1 / w]);
}
u1 = u2;
}
}
for (int x = 0; x<w; x++) {
int i = 0;
for (int y = 0; y<h; y++) {
if (i--<vimos[x][y] && vimos[x][y]) i = vimos[x][y] - 1;
vroad[x][y] = (0 <= i);
}
}
for (int y = 0; y<h; y++) {
int i = 0;
for (int x = 0; x<w; x++) {
if (i--<himos[x][y] && himos[x][y]) i = himos[x][y] - 1;
hroad[x][y] = (0 <= i);
}
}
queue<ll> q;
q.push(0);
while (!q.empty()) {
ll e = q.front(); q.pop();
ll x = e & 0xFFFF;
ll y = (e >> 16) & 0xFFFF;
ll d = dp[x][y];
if (x == w - 1 && y == h - 1) {
cout << d << endl;
return 0;
}
//printf("%d %d %d\n",x,y,d);
dp[x][y] = 1;
if (x != 0 && hroad[x - 1][y] && !dp[x - 1][y]) {
dp[x - 1][y] = d + 1;
q.push((x - 1) | ((y) << 16));
}
if (hroad[x][y] && !dp[x + 1][y]) {
dp[x + 1][y] = d+ 1;
q.push((x + 1) | ((y) << 16));
}
if (y != 0 && vroad[x][y - 1] && !dp[x][y - 1]) {
dp[x][y - 1] = d + 1;
q.push((x) | ((y - 1) << 16));
}
if (vroad[x][y] && !dp[x][y + 1]) {
dp[x][y + 1] = d + 1;
q.push((x) | ((y + 1) << 16));
}
}
cout << "Odekakedekinai.." << endl;
return 0;
}