結果

問題 No.2146 2 Pows
ユーザー snukesnuke
提出日時 2023-02-10 17:53:20
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 106 ms / 3,000 ms
コード長 3,715 bytes
コンパイル時間 2,416 ms
コンパイル使用メモリ 209,416 KB
実行使用メモリ 12,292 KB
最終ジャッジ日時 2024-07-07 13:35:19
合計ジャッジ時間 7,243 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 70 ms
7,684 KB
testcase_06 AC 90 ms
7,556 KB
testcase_07 AC 66 ms
12,292 KB
testcase_08 AC 89 ms
8,708 KB
testcase_09 AC 106 ms
11,016 KB
testcase_10 AC 3 ms
6,940 KB
testcase_11 AC 3 ms
6,940 KB
testcase_12 AC 3 ms
6,940 KB
testcase_13 AC 3 ms
6,944 KB
testcase_14 AC 2 ms
6,940 KB
testcase_15 AC 6 ms
6,940 KB
testcase_16 AC 48 ms
6,944 KB
testcase_17 AC 57 ms
6,944 KB
testcase_18 AC 25 ms
6,940 KB
testcase_19 AC 85 ms
7,060 KB
testcase_20 AC 89 ms
8,228 KB
testcase_21 AC 28 ms
6,940 KB
testcase_22 AC 80 ms
11,176 KB
testcase_23 AC 52 ms
8,180 KB
testcase_24 AC 52 ms
6,944 KB
testcase_25 AC 70 ms
6,940 KB
testcase_26 AC 94 ms
7,468 KB
testcase_27 AC 62 ms
7,240 KB
testcase_28 AC 65 ms
6,944 KB
testcase_29 AC 21 ms
6,940 KB
testcase_30 AC 42 ms
6,940 KB
testcase_31 AC 64 ms
7,160 KB
testcase_32 AC 14 ms
6,940 KB
testcase_33 AC 58 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<typename T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<typename T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<typename T>void operator+=(vc<T>&a,T b){for(T&x:a)x+=b;}
template<typename T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(y<x){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define rtn(x) { cout<<(x)<<endl; return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

using LP = pair<ll,int>;
struct Solver {
  void solve() {
    int n,a,b,c;
    scanf("%d%d%d%d",&n,&a,&b,&c);
    vl dist(n*2,LINF);
    PQ<LP> q;
    auto push = [&](int i, ll d) {
      if (dist[i] <= d) return;
      dist[i] = d;
      q.emplace(d,i);
    };
    push(1,a+b);
    while (sz(q)) {
      auto [d,i] = q.top(); q.pop();
      push(i*2%n+n,d+c);
      if (i < n) {
        push((i+1)%n,d+a);
      } else {
        push(i-n,d+b);
      }
    }
    rep(i,n) {
      ll ans = min(dist[i], dist[n+i]);
      printf("%lld\n",ans);
    }
  }
};

int main() {
  // cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  // scanf("%d",&ts);
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}
0