結果

問題 No.340 雪の足跡
ユーザー koyumeishi
提出日時 2016-01-29 23:21:24
言語 C++11（廃止可能性あり）
(gcc 13.3.0)
結果
AC  
実行時間 334 ms / 1,000 ms
コード長 2,519 bytes
コンパイル時間 1,122 ms
コンパイル使用メモリ 99,688 KB
実行使用メモリ 23,168 KB
最終ジャッジ日時 2024-09-21 18:40:22
合計ジャッジ時間 6,245 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 5
other AC * 32
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:30:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   30 |                 scanf("%d", &m);
      |                 ~~~~~^~~~~~~~~~
main.cpp:32:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   32 |                 scanf("%d", &pos);
      |                 ~~~~~^~~~~~~~~~~~
main.cpp:35:30: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   35 |                         scanf("%d", &next);
      |                         ~~~~~^~~~~~~~~~~~~

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
using namespace std;
template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
template<class T> istream& operator , (istream& is, T& val){ return is >> val;}
template<class T> ostream& operator << (ostream& os, vector<T>& vec){for(int i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"\n":" "
    );return os;}
template<class T> ostream& operator , (ostream& os, T& val){ return os << " " << val;}
template<class T> ostream& operator >> (ostream& os, T& val){ return os << " " << val;}
int main(){
    int w,h,n;
    cin >> w,h,n;
    vector<vector<int>> tate(2*h+1, vector<int>(w+1, 0));
    vector<vector<int>> yoko(h+1, vector<int>(2*w+1, 0));
    for(int i=0; i<n; i++){
        int m;
        scanf("%d", &m);
        int pos;
        scanf("%d", &pos);
        while(m--){
            int next;
            scanf("%d", &next);
            if(next%w == pos%w){ // tate
                int c = next%w;
                tate[2*min(pos/w, next/w)][c]++;
                tate[2*max(pos/w, next/w)+1][c]--;
            }else{ // yoko
                int r = next/w;
                yoko[r][2*min(pos%w, next%w)]++;
                yoko[r][2*max(pos%w, next%w)+1]--;
            }
            pos = next;
        }
    }
    for(int i=0; i<h; i++){
        int val = 0;
        for(int j=0; j<yoko[i].size(); j++){
            val += yoko[i][j];
            yoko[i][j] = val>0;
        }
    }
    for(int j=0; j<w; j++){
        int val = 0;
        for(int i=0; i<tate.size(); i++){
            val += tate[i][j];
            tate[i][j] = val>0;
        }
    }
    vector<vector<int>> dist(h+1, vector<int>(w+1, 10000000));
    dist[0][0] = 0;
    vector<int> dx = {0,0,1,-1};
    vector<int> dy = {1,-1,0,0};
    queue<pair<int,int>> q;
    q.push({0,0});
    while(q.size()){
        auto pos = q.front();
        q.pop();
        int x = pos.second;
        int y = pos.first;
        for(int k__=0; k__<4; k__++){
            int new_x = x + dx[k__];
            int new_y = y + dy[k__];
            if(new_x < 0 || new_x >= w || new_y < 0 || new_y >= h) continue;
            if(x==new_x){
                if(tate[y+new_y][x]){
                    if(dist[new_y][new_x] > dist[y][x] + 1){
                        dist[new_y][new_x] = dist[y][x]+1;
                        q.push({new_y, new_x});
                    }
                }
            }else if(y==new_y){
                if(yoko[y][x+new_x]){
                    if(dist[new_y][new_x] > dist[y][x] + 1){
                        dist[new_y][new_x] = dist[y][x]+1;
                        q.push({new_y, new_x});
                    }
                }
            }
        }
    }
    if(dist[h-1][w-1] != 10000000){
        cout << dist[h-1][w-1] << endl;
    }else{
        cout << "Odekakedekinai.." << endl;
    }
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0