結果

問題 No.1283 Extra Fee
ユーザー heno239heno239
提出日時 2020-11-17 16:00:29
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 152 ms / 2,000 ms
コード長 4,406 bytes
コンパイル時間 1,848 ms
コンパイル使用メモリ 128,280 KB
実行使用メモリ 16,636 KB
最終ジャッジ日時 2024-11-16 07:13:09
合計ジャッジ時間 5,094 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
10,140 KB
testcase_01 AC 3 ms
9,044 KB
testcase_02 AC 5 ms
9,352 KB
testcase_03 AC 4 ms
9,336 KB
testcase_04 AC 5 ms
9,168 KB
testcase_05 AC 4 ms
8,660 KB
testcase_06 AC 5 ms
9,424 KB
testcase_07 AC 4 ms
8,612 KB
testcase_08 AC 4 ms
10,116 KB
testcase_09 AC 4 ms
9,400 KB
testcase_10 AC 4 ms
9,872 KB
testcase_11 AC 13 ms
12,544 KB
testcase_12 AC 13 ms
9,692 KB
testcase_13 AC 10 ms
9,380 KB
testcase_14 AC 28 ms
12,336 KB
testcase_15 AC 43 ms
12,524 KB
testcase_16 AC 12 ms
12,432 KB
testcase_17 AC 125 ms
16,636 KB
testcase_18 AC 138 ms
12,656 KB
testcase_19 AC 146 ms
12,528 KB
testcase_20 AC 138 ms
12,652 KB
testcase_21 AC 140 ms
12,532 KB
testcase_22 AC 125 ms
12,528 KB
testcase_23 AC 117 ms
12,400 KB
testcase_24 AC 132 ms
12,524 KB
testcase_25 AC 150 ms
12,524 KB
testcase_26 AC 152 ms
12,528 KB
testcase_27 AC 152 ms
12,656 KB
testcase_28 AC 152 ms
12,656 KB
testcase_29 AC 138 ms
16,508 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
#pragma GCC target ("sse4")

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
struct modint {
    ll n;
    modint() :n(0) { ; }
    modint(ll m) :n(m) {
        if (n >= mod)n %= mod;
        else if (n < 0)n = (n % mod + mod) % mod;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}

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

int cost[500][500];
ll dist[500][500][2];
struct ste {
    int x, y, id;
};
bool operator<(const ste& a, const ste& b) {
    if (a.x != b.x)return a.x < b.x;
    else if (a.y != b.y)return a.y < b.y;
    else return a.id < b.id;
}
using speP = pair<ll, ste>;
void solve() {
    int n, m; cin >> n >> m;
    rep(i, m) {
        int x, y, c; cin >> x >> y >> c;
        x--; y--;
        cost[x][y] = c;
    }
    priority_queue<speP, vector<speP>, greater<speP>> q;
    rep(i, n)rep(j, n)rep(k, 2)dist[i][j][k] = INF;
    dist[0][0][0] = 0;
    q.push({ 0,{0,0,0} });
    while (!q.empty()) {
        speP p = q.top(); q.pop();
        ste s = p.second;
        ll val = p.first;
        if (val > dist[s.x][s.y][s.id])continue;
        rep(d, 4) {
            int nx = s.x + dx[d];
            int ny = s.y + dy[d];
            if (nx < 0 || ny < 0 || nx == n || ny == n)continue;
            ll nd = val + 1 + cost[nx][ny];
            if (nd < dist[nx][ny][s.id]) {
                dist[nx][ny][s.id] = nd;
                q.push({ nd,{nx,ny,s.id} });
            }
            if (s.id == 0) {
                nd = val + 1;
                if (nd < dist[nx][ny][1]) {
                    dist[nx][ny][1] = nd;
                    q.push({ nd,{nx,ny,1} });
                }
            }
        }
    }
    ll ans = min(dist[n - 1][n - 1][0], dist[n - 1][n - 1][1]);
    cout << ans << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    // cout << fixed << setprecision(15);
     //init_f();
     //init();
     //expr();
     //int t; cin >> t; rep(i, t)
    solve();
    return 0;
}
0