結果
問題 | No.1283 Extra Fee |
ユーザー | sak |
提出日時 | 2020-11-30 06:01:30 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 423 ms / 2,000 ms |
コード長 | 3,323 bytes |
コンパイル時間 | 2,299 ms |
コンパイル使用メモリ | 217,224 KB |
実行使用メモリ | 80,900 KB |
最終ジャッジ日時 | 2023-08-10 06:25:26 |
合計ジャッジ時間 | 9,034 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,388 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 1 ms
4,384 KB |
testcase_10 | AC | 1 ms
4,384 KB |
testcase_11 | AC | 16 ms
7,348 KB |
testcase_12 | AC | 20 ms
7,764 KB |
testcase_13 | AC | 15 ms
6,296 KB |
testcase_14 | AC | 68 ms
16,600 KB |
testcase_15 | AC | 108 ms
24,572 KB |
testcase_16 | AC | 22 ms
7,552 KB |
testcase_17 | AC | 274 ms
73,660 KB |
testcase_18 | AC | 379 ms
73,788 KB |
testcase_19 | AC | 400 ms
77,120 KB |
testcase_20 | AC | 374 ms
72,260 KB |
testcase_21 | AC | 384 ms
73,432 KB |
testcase_22 | AC | 342 ms
65,776 KB |
testcase_23 | AC | 322 ms
79,468 KB |
testcase_24 | AC | 396 ms
79,348 KB |
testcase_25 | AC | 419 ms
79,588 KB |
testcase_26 | AC | 418 ms
79,604 KB |
testcase_27 | AC | 421 ms
79,448 KB |
testcase_28 | AC | 423 ms
79,632 KB |
testcase_29 | AC | 300 ms
80,900 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll> p_ll; template<class T> void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; } #define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++) #define all(vec) vec.begin(), vec.end() #define rep(i,N) repr(i,0,N) #define per(i,N) for (int i=(int)N-1; i>=0; i--) const ll MOD = pow(10,9)+7; const ll LLINF = pow(2,61)-1; const int INF = pow(2,30)-1; vector<ll> fac; void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; } ll modpow(ll x, ll p) { ll result = 1, now = 1, pm = x; while (now<=p) { if (p&now) { result = result * pm % MOD; } now*=2; pm = pm*pm % MOD; } return result; } ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; } ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; } ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); } ll lcm(ll a, ll b) { return a/gcd(a,b)*b; } // ---------------------------------------------------------------------- // ---------------------------------------------------------------------- struct dijkstra { ll N; struct edge { ll to, d; }; vector<vector<edge>> adj; vector<ll> minlen; dijkstra(ll n) { N = n; adj.resize(N); minlen.assign(N,LLINF); } ll operator[](const ll &x) const { return minlen[x]; } void add_edge(ll from, ll to, ll d){ adj[from].push_back({to,d}); } vector<ll> calc(ll n=0) { auto c = [](const p_ll &x, const p_ll &y){return x.second>y.second;}; priority_queue<p_ll, vector<p_ll>, decltype(c)> q(c); minlen[n] = 0; q.push(make_pair(n,0)); while(q.size()) { p_ll now = q.top(); q.pop(); ll np = now.first, nd = now.second; if (nd>minlen[np]) continue; for (auto x: adj[np]) { if (minlen[x.to]<=minlen[np]+x.d) continue; q.push(make_pair(x.to, minlen[np]+x.d)); minlen[x.to] = minlen[np]+x.d; } } return minlen; } }; // ---------------------------------------------------------------------- // ---------------------------------------------------------------------- int main() { ll N, M; cin >> N >> M; ll fee[N][N] = {}; rep(i,M) { ll h, w, c; cin >> h >> w >> c; h--; w--; fee[h][w] = c; } dijkstra d(N*N*2); rep(i,N) rep(j,N) { if (i!=0) { d.add_edge(i*N+j , (i-1)*N+j ,fee[i-1][j]+1); d.add_edge(i*N+j+N*N, (i-1)*N+j+N*N,fee[i-1][j]+1); d.add_edge(i*N+j , (i-1)*N+j+N*N, 1); } if (i!=N-1) { d.add_edge(i*N+j , (i+1)*N+j ,fee[i+1][j]+1); d.add_edge(i*N+j+N*N, (i+1)*N+j+N*N,fee[i+1][j]+1); d.add_edge(i*N+j , (i+1)*N+j+N*N, 1); } if (j!=0) { d.add_edge(i*N+j , i*N+(j-1) ,fee[i][j-1]+1); d.add_edge(i*N+j+N*N, i*N+(j-1)+N*N,fee[i][j-1]+1); d.add_edge(i*N+j , i*N+(j-1)+N*N, 1); } if (j!=N-1) { d.add_edge(i*N+j , i*N+(j+1) ,fee[i][j+1]+1); d.add_edge(i*N+j+N*N, i*N+(j+1)+N*N,fee[i][j+1]+1); d.add_edge(i*N+j , i*N+(j+1)+N*N, 1); } } vector<ll> dres = d.calc(); ll result = dres[2*N*N-1]; cout << result << endl; return 0; }