結果
問題 | No.1283 Extra Fee |
ユーザー | 👑 tute7627 |
提出日時 | 2020-11-06 21:46:14 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 307 ms / 2,000 ms |
コード長 | 3,630 bytes |
コンパイル時間 | 2,250 ms |
コンパイル使用メモリ | 218,384 KB |
実行使用メモリ | 77,640 KB |
最終ジャッジ日時 | 2024-11-16 06:36:29 |
合計ジャッジ時間 | 7,554 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,820 KB |
testcase_01 | AC | 2 ms
6,820 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | AC | 2 ms
6,820 KB |
testcase_04 | AC | 2 ms
6,820 KB |
testcase_05 | AC | 2 ms
6,820 KB |
testcase_06 | AC | 2 ms
6,816 KB |
testcase_07 | AC | 2 ms
6,816 KB |
testcase_08 | AC | 2 ms
6,816 KB |
testcase_09 | AC | 2 ms
6,816 KB |
testcase_10 | AC | 2 ms
6,816 KB |
testcase_11 | AC | 16 ms
7,296 KB |
testcase_12 | AC | 18 ms
7,680 KB |
testcase_13 | AC | 11 ms
6,820 KB |
testcase_14 | AC | 53 ms
15,872 KB |
testcase_15 | AC | 84 ms
23,424 KB |
testcase_16 | AC | 17 ms
7,424 KB |
testcase_17 | AC | 271 ms
70,868 KB |
testcase_18 | AC | 285 ms
70,240 KB |
testcase_19 | AC | 295 ms
73,284 KB |
testcase_20 | AC | 276 ms
68,856 KB |
testcase_21 | AC | 281 ms
69,792 KB |
testcase_22 | AC | 249 ms
62,864 KB |
testcase_23 | AC | 270 ms
75,492 KB |
testcase_24 | AC | 286 ms
75,520 KB |
testcase_25 | AC | 304 ms
75,680 KB |
testcase_26 | AC | 307 ms
75,572 KB |
testcase_27 | AC | 303 ms
75,436 KB |
testcase_28 | AC | 305 ms
75,472 KB |
testcase_29 | AC | 303 ms
77,640 KB |
ソースコード
//#define _GLIBCXX_DEBUG #include<bits/stdc++.h> using namespace std; #define endl '\n' #define lfs cout<<fixed<<setprecision(10) #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() #define spa << " " << #define fi first #define se second #define MP make_pair #define MT make_tuple #define PB push_back #define EB emplace_back #define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++) #define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--) using ll = long long; using ld = long double; const ll MOD1 = 1e9+7; const ll MOD9 = 998244353; const ll INF = 1e18; using P = pair<ll, ll>; template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;} template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;} ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});} void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;} void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;} void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;} template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}}; void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}}; template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;}; template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;} ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;} vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1}; template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);} template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));} template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;} template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;} //mt19937 mt(chrono::steady_clock::now().time_since_epoch().count()); int popcount(ll x){return __builtin_popcountll(x);}; int poplow(ll x){return __builtin_ctzll(x);}; int pophigh(ll x){return 63 - __builtin_clzll(x);}; struct edge { ll to,cost; edge(ll x,ll y):to(x),cost(y){}; }; vector<ll> dijkstra(vector<vector<edge>>&g,ll s = 0) { priority_queue<P, vector<P>, greater<P> > que; vector<ll>dist(g.size(),INF); dist[s] = 0; que.emplace(0, s); while (!que.empty()) { P p = que.top(); que.pop(); ll v = p.second; if (dist[v] < p.first) continue; for(auto e:g[v]) { if (dist[e.to] > dist[v] + e.cost) { dist[e.to] = dist[v] + e.cost; que.emplace(dist[e.to], e.to); } } } return dist; } int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll res=0,buf=0; bool judge = true; ll n,m;cin>>n>>m; auto c=vec(n,n,0LL); rep(i,0,m){ ll h,w,x;cin>>h>>w>>x;h--;w--; c[h][w]+=x; } vector<vector<edge>>g(2*n*n); auto f=[&](ll i,ll j){return i*n+j;}; rep(i,0,n)rep(j,0,n){ rep(o,0,4){ ll x=i+dx[o],y=j+dy[o]; if(x<0||y<0||x>=n||y>=n)continue; g[f(i,j)].EB(f(x,y),c[x][y]+1); g[f(i,j)+n*n].EB(f(x,y)+n*n,c[x][y]+1); g[f(i,j)].EB(f(x,y)+n*n,1); } } auto d=dijkstra(g,0); cout<<d[2*n*n-1]<<endl; return 0; }