#187842 (C++17) No.340 雪の足跡

• 問題: No.340 雪の足跡
• ユーザー: mai
• 提出日時: 2017-07-10 23:04:42
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 121 ms / 1,000 ms
• コード長: 4,827 bytes
• コンパイル時間: 3,252 ms
• コンパイル使用メモリ: 221,528 KB
• 実行使用メモリ: 23,040 KB
• 最終ジャッジ日時: 2024-11-14 20:06:28
• 合計ジャッジ時間: 6,451 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	3 ms; 7,516 KB
testcase_01	AC	3 ms; 7,656 KB
testcase_02	AC	3 ms; 7,632 KB
testcase_03	AC	3 ms; 7,636 KB
testcase_04	AC	3 ms; 7,652 KB
testcase_05	AC	3 ms; 7,632 KB
testcase_06	AC	3 ms; 7,528 KB
testcase_07	AC	3 ms; 7,508 KB
testcase_08	AC	2 ms; 7,652 KB
testcase_09	AC	3 ms; 7,652 KB
testcase_10	AC	2 ms; 7,656 KB
testcase_11	AC	3 ms; 7,956 KB
testcase_12	AC	4 ms; 8,512 KB
testcase_13	AC	4 ms; 8,048 KB
testcase_14	AC	11 ms; 11,108 KB
testcase_15	AC	13 ms; 12,772 KB
testcase_16	AC	9 ms; 9,916 KB
testcase_17	AC	14 ms; 15,224 KB
testcase_18	AC	12 ms; 13,176 KB
testcase_19	AC	14 ms; 15,092 KB
testcase_20	AC	49 ms; 15,580 KB
testcase_21	AC	19 ms; 15,236 KB
testcase_22	AC	12 ms; 12,916 KB
testcase_23	AC	63 ms; 15,076 KB
testcase_24	AC	32 ms; 15,224 KB
testcase_25	AC	45 ms; 14,636 KB
testcase_26	AC	9 ms; 10,192 KB
testcase_27	AC	4 ms; 8,256 KB
testcase_28	AC	11 ms; 11,812 KB
testcase_29	AC	75 ms; 17,064 KB
testcase_30	AC	59 ms; 21,252 KB
testcase_31	AC	118 ms; 22,920 KB
testcase_32	AC	121 ms; 23,008 KB
testcase_33	AC	121 ms; 23,004 KB
testcase_34	AC	117 ms; 23,040 KB
testcase_35	AC	95 ms; 21,136 KB
testcase_36	AC	99 ms; 21,116 KB

コンパイルメッセージ

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 |         }
      |         ^

ソースコード

#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 = (e >> 32); 
        if (dp[x][y]) continue;
        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]) {
            q.push((x - 1) | ((y) << 16) | ((d + 1) << 32));
        }
        if (hroad[x][y]) {
            q.push((x + 1) | ((y) << 16) | ((d + 1) << 32));
        }
        if (y != 0 && vroad[x][y - 1]) {
            q.push((x) | ((y - 1) << 16) | ((d + 1) << 32));
        }
        if (vroad[x][y]) {
            q.push((x) | ((y + 1) << 16) | ((d + 1) << 32));
        }
    }
    cout << "Odekakedekinai.." << endl;
    return 0;

}