結果
問題 | No.2099 [Cherry Alpha B] Time Machine |
ユーザー | a16784542 |
提出日時 | 2022-10-14 22:12:33 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,611 bytes |
コンパイル時間 | 4,231 ms |
コンパイル使用メモリ | 261,264 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-26 14:56:33 |
合計ジャッジ時間 | 16,027 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 138 ms
5,248 KB |
testcase_01 | AC | 138 ms
5,376 KB |
testcase_02 | AC | 137 ms
5,376 KB |
testcase_03 | AC | 138 ms
5,376 KB |
testcase_04 | AC | 103 ms
5,376 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 138 ms
5,376 KB |
testcase_09 | AC | 138 ms
5,376 KB |
testcase_10 | AC | 136 ms
5,376 KB |
testcase_11 | WA | - |
testcase_12 | AC | 136 ms
5,376 KB |
testcase_13 | AC | 136 ms
5,376 KB |
testcase_14 | AC | 103 ms
5,376 KB |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 135 ms
5,376 KB |
testcase_19 | AC | 136 ms
5,376 KB |
testcase_20 | AC | 136 ms
5,376 KB |
testcase_21 | WA | - |
testcase_22 | AC | 138 ms
5,376 KB |
testcase_23 | WA | - |
testcase_24 | AC | 135 ms
5,376 KB |
testcase_25 | AC | 137 ms
5,376 KB |
testcase_26 | AC | 136 ms
5,376 KB |
testcase_27 | AC | 137 ms
5,376 KB |
testcase_28 | AC | 136 ms
5,376 KB |
testcase_29 | AC | 103 ms
5,376 KB |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | AC | 136 ms
5,376 KB |
testcase_34 | AC | 104 ms
5,376 KB |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | AC | 136 ms
5,376 KB |
testcase_39 | AC | 137 ms
5,376 KB |
testcase_40 | WA | - |
testcase_41 | AC | 137 ms
5,376 KB |
testcase_42 | AC | 135 ms
5,376 KB |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | AC | 137 ms
5,376 KB |
testcase_46 | WA | - |
testcase_47 | AC | 137 ms
5,376 KB |
testcase_48 | AC | 137 ms
5,376 KB |
testcase_49 | AC | 103 ms
5,376 KB |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | AC | 104 ms
5,376 KB |
testcase_54 | AC | 120 ms
5,376 KB |
testcase_55 | AC | 136 ms
5,376 KB |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | WA | - |
testcase_62 | WA | - |
testcase_63 | WA | - |
testcase_64 | WA | - |
testcase_65 | WA | - |
testcase_66 | WA | - |
testcase_67 | WA | - |
testcase_68 | WA | - |
testcase_69 | WA | - |
testcase_70 | WA | - |
testcase_71 | WA | - |
ソースコード
#if !__INCLUDE_LEVEL__ #include __FILE__ struct Solver { void solve() { int t,x,a,y,b; cin>>t>>x>>a>>y>>b; ll ans=INFL; int z=0; if(t<0){ z=(-t+b-1)/b; } rep(i,z,MAX2){ int nt=t+i*b; ll ans1=i*y; ans1+=(nt/a)*x; ans1+=nt-(nt/a)*a; chmin(ans,ans1); } cout<<ans<<endl; return ; }}; signed main() { int ts = 1; // scanf("%lld",&ts); rep(ti,ts) { Solver solver; solver.solve(); } return 0; } #else #include <bits/stdc++.h> #include <atcoder/all> using namespace atcoder; // #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/tree_policy.hpp> // using namespace __gnu_pbds; using namespace std; // #define int ll using ll=long long; using ld = long double; using uint = unsigned; using ull = unsigned long long; using P=pair<int,int>; using TP=tuple<int,int,int>; template <class T> using V = vector<T>; template <class T> using max_heap = priority_queue<T>; template <class T> using min_heap = priority_queue<T, vector<T>, greater<>>; #define FOR1(a) for (ll _ = 0; _ < ll(a); ++_) #define FOR2(i, a) for (ll i = 0; i < ll(a); ++i) #define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i) #define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c)) #define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i) #define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c)) #define overload4(a, b, c, d, e, ...) e #define rep(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__) #define rrep(...) overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__) #define fore(i,a) for(auto &i:a) #define all(x) x.begin(),x.end() #define sz(x) ((int)(x).size()) #define bp(x) (__builtin_popcountll((long long)(x))) #define elif else if #define mpa make_pair #define bit(n) (1LL<<(n)) #define LB(c, x) distance((c).begin(), lower_bound(all(c), (x))) #define UB(c, x) distance((c).begin(), upper_bound(all(c), (x))) #define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end()) template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } template<typename T>istream& operator>>(istream&i,vector<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 vector<T>&v){if(sz(v))o<<join(v," ");return o;} template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;} template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;} template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){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 vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;} template<typename T>ll suma(const V<V<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(vector<T>&a,const T&x){a.insert(a.begin(),x);} const int INF = 1001001001; const ll INFL = 3e18; const int MAX = 2e7+5; const int MAX2 = 4e7+11; #endif