結果

問題 No.1283 Extra Fee
コンテスト
ユーザー Sooh317
提出日時 2020-11-07 11:54:32
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 295 ms / 2,000 ms
コード長 4,654 bytes
コンパイル時間 1,956 ms
コンパイル使用メモリ 185,080 KB
実行使用メモリ 77,640 KB
最終ジャッジ日時 2024-11-16 07:04:15
合計ジャッジ時間 7,157 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#include<bits/stdc++.h>
using namespace std;
#pragma region atcoder
/*#include <atcoder/all>
using namespace atcoder;*/
//using mint = modint998244353;
//using mint = modint1000000007;
#pragma endregion
#pragma region macros
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vs = vector<string>;
using vl = vector<ll>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, n) for(int i = n - 1; i >= 0; i--)
#define RREP(i, a, b) for(int i = b - 1; i >= a; i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#pragma endregion
#pragma region debug for var, v, vv
#define debug(var)  do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){cout << endl;int cnt = 0;for(const auto& v : vv){cout << cnt << "th : "; view(v); cnt++;} cout << endl;}
#pragma endregion
#pragma region int128
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
  std::ostream::sentry s(dest);
  if (s) {
    __uint128_t tmp = value < 0 ? -value : value;
    char buffer[128];
    char *d = std::end(buffer);
    do {
      --d;
      *d = "0123456789"[tmp % 10];
      tmp /= 10;
    } while (tmp != 0);
    if (value < 0) {
      --d;
      *d = '-';
    }
    int len = std::end(buffer) - d;
    if (dest.rdbuf()->sputn(d, len) != len) {
      dest.setstate(std::ios_base::badbit);
    }
  }
  return dest;
}
#pragma endregion
const ll mod = 1000000007;
const int inf = 1001001001;
const ll INF = 1001001001001001001;

int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
template<class T>bool chmax(T &a, const T b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T b) { if (b<a) { a=b; return 1; } return 0; }
ll rudiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } //  20 / 3 == 7
ll rddiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // -20 / 3 == -7
ll power(ll a, ll p){ll ret = 1; while(p){if(p & 1){ret = ret * a;} a = a * a; p >>= 1;} return ret;}
ll modpow(ll a, ll p){ll ret = 1; while(p){if(p & 1){ret = ret * a % mod;} a = a * a % mod; p >>= 1;} return ret;}

/*--------------------------------------------------------------------------------------------------------------------------------*/
struct Graph{
    struct Edge{
        int to; long long cost;
        Edge(int to, long long cost) : to(to), cost(cost) {}
    };
    ll num;
    vector<vector<Edge>> G;
    vector<ll> dist;
    // constructor for initialization
    Graph(int n) : num(n){
        G.resize(n), dist.resize(n);
    }
    // assembling a graph whose edge is coming from s to t
    void add_edge(ll s, ll t, ll cost, bool directed){
        G[s].emplace_back(t, cost);
        if(!directed) G[t].emplace_back(s, cost);
    }
    // dijkstra algorithm
    ll dijkstra(int s, int g){
        fill(dist.begin(), dist.end(), INF);
        using P = pair<ll, int>;
        priority_queue<P, vector<P>, greater<P>> que;
        que.push({dist[s] = 0, s});
        while(!que.empty()){
            pair<ll, ll> p = que.top(); que.pop();
            ll v = p.second;
            if(dist[v] < p.first) continue;
            for(auto e : G[v]){
                if(chmin(dist[e.to], dist[v] + e.cost)) que.push({dist[e.to], e.to});
            }
        }
        return dist[g];
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    //cout << fixed << setprecision(15);
    int n, m; cin >> n >> m;
    vvl c(n, vl(n));
    rep(i,m){
        int a, b, co; cin >> a >> b >> co;
        a--, b--;
        c[a][b] = co;
    }
    Graph G(2*n*n);
    rep(i,n){
        rep(j,n){
            rep(k,4){
                int nh = i + dx[k], nw = j + dy[k];
                if(nh < 0 || nh >= n || nw < 0 || nw >= n) continue;
                int s = i*n + j, t = nh*n + nw;
                ll cos = 1 + c[nh][nw];
                G.add_edge(s, t, cos, true), G.add_edge(n*n + s, n*n + t, cos, true), G.add_edge(s, n*n + t, 1, true); 
            }
        }
    }
    cout << G.dijkstra(0, 2*n*n - 1) << endl;
}
/*
   * review you code when you get WA (typo? index?)
   * int overflow, array bounds
   * special cases (n=1?)
*/
0