結果
問題 | No.2099 [Cherry Alpha B] Time Machine |
ユーザー | ei1333333 |
提出日時 | 2022-10-14 22:16:48 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,721 bytes |
コンパイル時間 | 2,100 ms |
コンパイル使用メモリ | 202,788 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-26 15:14:28 |
合計ジャッジ時間 | 21,922 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 272 ms
6,812 KB |
testcase_01 | AC | 267 ms
6,944 KB |
testcase_02 | AC | 270 ms
6,940 KB |
testcase_03 | AC | 142 ms
6,944 KB |
testcase_04 | AC | 273 ms
6,944 KB |
testcase_05 | AC | 273 ms
6,940 KB |
testcase_06 | AC | 257 ms
6,940 KB |
testcase_07 | AC | 135 ms
6,944 KB |
testcase_08 | AC | 273 ms
6,944 KB |
testcase_09 | AC | 270 ms
6,944 KB |
testcase_10 | AC | 269 ms
6,944 KB |
testcase_11 | AC | 270 ms
6,940 KB |
testcase_12 | AC | 268 ms
6,944 KB |
testcase_13 | AC | 140 ms
6,940 KB |
testcase_14 | AC | 267 ms
6,940 KB |
testcase_15 | AC | 266 ms
6,940 KB |
testcase_16 | AC | 255 ms
6,940 KB |
testcase_17 | AC | 131 ms
6,940 KB |
testcase_18 | AC | 270 ms
6,940 KB |
testcase_19 | AC | 273 ms
6,944 KB |
testcase_20 | AC | 269 ms
6,940 KB |
testcase_21 | AC | 267 ms
6,940 KB |
testcase_22 | AC | 267 ms
6,944 KB |
testcase_23 | AC | 265 ms
6,940 KB |
testcase_24 | AC | 265 ms
6,944 KB |
testcase_25 | AC | 268 ms
6,940 KB |
testcase_26 | AC | 266 ms
6,940 KB |
testcase_27 | AC | 267 ms
6,944 KB |
testcase_28 | AC | 137 ms
6,940 KB |
testcase_29 | AC | 266 ms
6,944 KB |
testcase_30 | AC | 264 ms
6,944 KB |
testcase_31 | AC | 250 ms
6,940 KB |
testcase_32 | AC | 131 ms
6,944 KB |
testcase_33 | AC | 138 ms
6,940 KB |
testcase_34 | AC | 270 ms
6,940 KB |
testcase_35 | AC | 265 ms
6,940 KB |
testcase_36 | AC | 254 ms
6,940 KB |
testcase_37 | AC | 131 ms
6,944 KB |
testcase_38 | AC | 267 ms
6,940 KB |
testcase_39 | AC | 263 ms
6,940 KB |
testcase_40 | AC | 268 ms
6,940 KB |
testcase_41 | AC | 267 ms
6,940 KB |
testcase_42 | AC | 264 ms
6,940 KB |
testcase_43 | AC | 267 ms
6,940 KB |
testcase_44 | AC | 266 ms
6,940 KB |
testcase_45 | AC | 270 ms
6,940 KB |
testcase_46 | AC | 270 ms
6,940 KB |
testcase_47 | AC | 269 ms
6,944 KB |
testcase_48 | AC | 135 ms
6,940 KB |
testcase_49 | AC | 267 ms
6,940 KB |
testcase_50 | AC | 265 ms
6,940 KB |
testcase_51 | AC | 256 ms
6,944 KB |
testcase_52 | AC | 130 ms
6,940 KB |
testcase_53 | AC | 264 ms
6,940 KB |
testcase_54 | AC | 263 ms
6,944 KB |
testcase_55 | WA | - |
testcase_56 | AC | 267 ms
6,940 KB |
testcase_57 | AC | 268 ms
6,940 KB |
testcase_58 | AC | 265 ms
6,940 KB |
testcase_59 | AC | 264 ms
6,944 KB |
testcase_60 | AC | 267 ms
6,944 KB |
testcase_61 | AC | 265 ms
6,940 KB |
testcase_62 | AC | 262 ms
6,940 KB |
testcase_63 | AC | 265 ms
6,944 KB |
testcase_64 | AC | 263 ms
6,940 KB |
testcase_65 | AC | 267 ms
6,944 KB |
testcase_66 | AC | 273 ms
6,944 KB |
testcase_67 | AC | 270 ms
6,944 KB |
testcase_68 | AC | 267 ms
6,944 KB |
testcase_69 | AC | 269 ms
6,940 KB |
testcase_70 | AC | 262 ms
6,940 KB |
testcase_71 | AC | 267 ms
6,940 KB |
ソースコード
#include<bits/stdc++.h> using namespace std; using int64 = long long; const int mod = 998244353; const int64 infll = (1LL << 62) - 1; const int inf = (1 << 30) - 1; struct IoSetup { IoSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup; template< typename T1, typename T2 > ostream &operator<<(ostream &os, const pair< T1, T2 > &p) { os << p.first << " " << p.second; return os; } template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; } template< typename T > ostream &operator<<(ostream &os, const vector< T > &v) { for (int i = 0; i < (int) v.size(); i++) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } template< typename T > istream &operator>>(istream &is, vector< T > &v) { for (T &in: v) is >> in; return is; } template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } template< typename T = int64 > vector< T > make_v(size_t a) { return vector< T >(a); } template< typename T, typename... Ts > auto make_v(size_t a, Ts... ts) { return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...)); } template< typename T, typename V > typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) { t = v; } template< typename T, typename V > typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) { for (auto &e: t) fill_v(e, v); } template< typename F > struct FixPoint: F { explicit FixPoint(F &&f): F(forward< F >(f)) {} template< typename... Args > decltype(auto) operator()(Args &&... args) const { return F::operator()(*this, forward< Args >(args)...); } }; template< typename F > inline decltype(auto) MFP(F &&f) { return FixPoint< F >{forward< F >(f)}; } int main() { int64 T, X, A, Y, B; cin >> T >> X >> A >> Y >> B; int64 ret = infll; for(int64 add = 0; add <= 10000000; add++) { int64 pos = A * add; if(pos <= T) { for(int64 sub : {0}) { if(sub < 0) continue; int64 new_pos = pos - B * sub; if(new_pos > T) continue; chmin(ret, X * add + Y * sub + T - new_pos); } } else { int64 d = (pos - T + B - 1) / B; for(int64 sub : {d - 3, d - 2, d - 1, d, d + 1, d + 2, d + 3, 0LL}) { if(sub < 0) continue; int64 new_pos = pos - B * sub; if(new_pos > T) continue; chmin(ret, X * add + Y * sub + T - new_pos); } } } cout << ret << endl; }