結果
問題 | No.2146 2 Pows |
ユーザー | milkcoffee |
提出日時 | 2022-11-07 13:42:45 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 201 ms / 3,000 ms |
コード長 | 3,989 bytes |
コンパイル時間 | 4,638 ms |
コンパイル使用メモリ | 269,072 KB |
実行使用メモリ | 40,132 KB |
最終ジャッジ日時 | 2023-09-28 03:11:13 |
合計ジャッジ時間 | 12,977 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,352 KB |
testcase_01 | AC | 1 ms
4,356 KB |
testcase_02 | AC | 1 ms
4,356 KB |
testcase_03 | AC | 1 ms
4,356 KB |
testcase_04 | AC | 2 ms
4,356 KB |
testcase_05 | AC | 136 ms
35,444 KB |
testcase_06 | AC | 166 ms
36,568 KB |
testcase_07 | AC | 116 ms
39,456 KB |
testcase_08 | AC | 201 ms
40,132 KB |
testcase_09 | AC | 189 ms
38,832 KB |
testcase_10 | AC | 3 ms
4,352 KB |
testcase_11 | AC | 3 ms
4,352 KB |
testcase_12 | AC | 3 ms
4,356 KB |
testcase_13 | AC | 3 ms
4,352 KB |
testcase_14 | AC | 2 ms
4,352 KB |
testcase_15 | AC | 9 ms
5,668 KB |
testcase_16 | AC | 92 ms
24,836 KB |
testcase_17 | AC | 98 ms
26,288 KB |
testcase_18 | AC | 40 ms
13,896 KB |
testcase_19 | AC | 145 ms
30,236 KB |
testcase_20 | AC | 164 ms
31,608 KB |
testcase_21 | AC | 59 ms
15,628 KB |
testcase_22 | AC | 186 ms
35,708 KB |
testcase_23 | AC | 133 ms
31,396 KB |
testcase_24 | AC | 109 ms
25,408 KB |
testcase_25 | AC | 122 ms
27,424 KB |
testcase_26 | AC | 156 ms
35,656 KB |
testcase_27 | AC | 140 ms
30,928 KB |
testcase_28 | AC | 117 ms
26,504 KB |
testcase_29 | AC | 32 ms
12,112 KB |
testcase_30 | AC | 88 ms
23,528 KB |
testcase_31 | AC | 117 ms
31,488 KB |
testcase_32 | AC | 22 ms
7,844 KB |
testcase_33 | AC | 101 ms
27,608 KB |
ソースコード
#include <bits/stdc++.h> #if __has_include(<atcoder/all>) #include <atcoder/all> using namespace atcoder; #endif using namespace std; /* #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") */ #define ll long long #define rep(i, n) for (ll i = 0; i < n; ++i) #define rep_up(i, a, n) for (ll i = a; i < n; ++i) #define rep_down(i, a, n) for (ll i = a; i >= n; --i) #define P pair<ll, ll> #define pb push_back #define bit_count(x) __builtin_popcountll(x) #define gcd(a,b) __gcd(a,b) #define lcm(a,b) a / gcd(a,b) * b #define endl "\n" #define all(v) v.begin(), v.end() #define fi first #define se second #define vvvvll vector< vector <vector <vector<ll> > > > #define vvvll vector< vector< vector<ll> > > #define vvll vector< vector<ll> > #define vll vector<ll> #define pqll priority_queue<ll> #define pqllg priority_queue<ll, vector<ll>, greater<ll>> template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); } template <class T> using V = vector<T>; constexpr ll INF = (1ll << 60); //constexpr ll mod = 1000000007; constexpr ll mod = 998244353; constexpr double pi = 3.14159265358979323846; template <typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; } template <typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return 1; } return 0; } template <typename T> void pt(T val) { cout << val << "\n"; } template <typename T> void pt_vll(vector<T> &v) { ll vs = v.size(); rep(i, vs) { cout << v[i]; if (i == vs - 1) cout << "\n"; else cout << " "; } } ll mypow(ll a, ll n) { ll ret = 1; if (n == 0) return 1; if (a == 0) return 0; rep(i, n) { if (ret > (ll)(9e18 + 10) / a) return -1; ret *= a; } return ret; } long long modpow(long long a, long long n, long long mod) { long long res = 1; while (n > 0) { if (n & 1) res = res * a % mod; a = a * a % mod; n >>= 1; } return res; } long long modinv(long long a, long long m) { long long b = m, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= m; if (u < 0) u += m; return u; } //ここまでテンプレ struct Edge { long long to; long long cost; }; #define Graph vector<vector<Edge>> void dijkstra(const Graph &G, ll s, vector<ll> &dis) { ll N = G.size(); dis.resize(N, INF); priority_queue<P, vector<P>, greater<P>> pq; // 「仮の最短距離, 頂点」が小さい順に並ぶ dis[s] = 0; pq.emplace(dis[s], s); while (!pq.empty()) { P p = pq.top(); pq.pop(); ll v = p.second; if (dis[v] < p.first) { // 最短距離で無ければ無視 continue; } for (auto &e : G[v]) { if (dis[e.to] > dis[v] + e.cost) { // 最短距離候補なら priority_queue に追加 dis[e.to] = dis[v] + e.cost; pq.emplace(dis[e.to], e.to); } } } } void solve(){ ll n, m, k, cnt = 0, sum = 0, ans = 0; ll a,b,c; cin>>n>>a>>b>>c; assert(2<=n&&n<=200000); assert(1<=a&&a<=1000000000); assert(1<=b&&b<=1000000000); assert(1<=c&&c<=1000000000); Graph G(2*n); vll dist(2*n,INF); rep(i,n){ ll x=(i+1)%n; ll y=(2*i)%n; G[i].pb({x+n,a+b}); G[i+n].pb({x+n,a}); G[i].pb({y,c}); G[i+n].pb({y,c}); } dist[n+1]=0; dijkstra(G,n+1,dist); rep(i,n){ sum=min(dist[i],dist[i+n]); sum+=a+b; pt(sum); } } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); //cout << fixed << setprecision(16); //ll T; //cin>>T; //rep(ca,T) solve(); }