結果
問題 | No.2227 King Kraken's Attack |
ユーザー | t98slider |
提出日時 | 2023-02-24 22:24:02 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,466 bytes |
コンパイル時間 | 1,587 ms |
コンパイル使用メモリ | 163,944 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-04-10 09:28:47 |
合計ジャッジ時間 | 18,359 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 86 ms
6,812 KB |
testcase_01 | AC | 80 ms
6,944 KB |
testcase_02 | AC | 66 ms
6,940 KB |
testcase_03 | AC | 391 ms
6,940 KB |
testcase_04 | WA | - |
testcase_05 | AC | 63 ms
6,940 KB |
testcase_06 | AC | 375 ms
6,940 KB |
testcase_07 | AC | 383 ms
6,940 KB |
testcase_08 | AC | 393 ms
6,940 KB |
testcase_09 | AC | 191 ms
6,944 KB |
testcase_10 | AC | 66 ms
6,940 KB |
testcase_11 | AC | 368 ms
6,940 KB |
testcase_12 | AC | 338 ms
6,944 KB |
testcase_13 | AC | 275 ms
6,940 KB |
testcase_14 | AC | 729 ms
6,940 KB |
testcase_15 | AC | 774 ms
6,940 KB |
testcase_16 | AC | 722 ms
6,948 KB |
testcase_17 | AC | 416 ms
6,940 KB |
testcase_18 | AC | 60 ms
6,944 KB |
testcase_19 | AC | 783 ms
6,944 KB |
testcase_20 | AC | 674 ms
6,940 KB |
testcase_21 | AC | 589 ms
6,940 KB |
testcase_22 | AC | 404 ms
6,944 KB |
testcase_23 | AC | 304 ms
6,940 KB |
testcase_24 | AC | 703 ms
6,940 KB |
testcase_25 | AC | 346 ms
6,944 KB |
testcase_26 | AC | 829 ms
6,940 KB |
testcase_27 | AC | 74 ms
6,944 KB |
testcase_28 | AC | 472 ms
6,944 KB |
testcase_29 | AC | 472 ms
6,944 KB |
testcase_30 | AC | 501 ms
6,944 KB |
testcase_31 | AC | 500 ms
6,940 KB |
testcase_32 | AC | 383 ms
6,940 KB |
testcase_33 | AC | 411 ms
6,940 KB |
testcase_34 | AC | 408 ms
6,940 KB |
testcase_35 | AC | 412 ms
6,944 KB |
testcase_36 | AC | 460 ms
6,940 KB |
testcase_37 | AC | 85 ms
6,940 KB |
testcase_38 | AC | 73 ms
6,944 KB |
testcase_39 | AC | 93 ms
6,940 KB |
testcase_40 | AC | 106 ms
6,940 KB |
testcase_41 | AC | 66 ms
6,940 KB |
testcase_42 | AC | 75 ms
6,940 KB |
testcase_43 | AC | 72 ms
6,940 KB |
testcase_44 | AC | 74 ms
6,940 KB |
testcase_45 | AC | 122 ms
6,940 KB |
ソースコード
#include <bits/stdc++.h> #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define rep(i,n) for(int i=0;i<(int)(n);i++) #define codefor int test;cin>>test;while(test--) #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__)) #define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__))) using namespace std; template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>; template<class T> istream& operator>>(istream& is, vector<T>& vec) {for(T& x : vec)is >> x;return is;} template<class T> ostream& operator<<(ostream& os, const vector<T>& vec) {if(vec.empty())return os;os << vec[0];for(auto it = vec.begin(); ++it!= vec.end();)os << ' ' << *it;return os;} void in(){} template <class Head, class... Tail> void in(Head& head, Tail&... tail){cin >> head;in(tail...);} void out(){cout << '\n';} template<class T>void out(const T& a){cout << a << '\n';} template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){cout << head << ' ';out(tail...);} const int INF = 1 << 30; const long long INF2 = 1ll << 60; template<class T> void chmax(T &a,const T b){if(b>a)a=b;} template<class T> void chmin(T &a,const T b){if(b<a)a=b;} using ll = long long; template<typename T> T MUL(T a, T b){ T res; return __builtin_mul_overflow(a, b, &res)? std::numeric_limits<T>::max() : res; } int main(){ //clock_t finish = clock() + CLOCKS_PER_SEC / 1000 * 1960; ios::sync_with_stdio(false); cin.tie(0); LL(h, w, la, lb, ka, kb); ll v = h * w, S = la * lb, ans = 1ll << 60; for(ll i = 0; i <= 2000000; i++){ ll rem = v - ka * i; ll ng = -1, ok = v, mid; if(kb >= 1) ok = v / kb + 1; while(ng + 1 < ok){ mid = (ok + ng) / 2; if(min(h, MUL(la, i)) * min(w, MUL(lb, mid)) + kb * mid >= rem) ok = mid; else ng = mid; } chmin(ans, i + ok); } for(ll i = 0; i <= 2000000; i++){ ll rem = v - kb * i; ll ng = -1, ok = v, mid; if(ka >= 1) ok = v / ka + 1; while(ng + 1 < ok){ mid = (ok + ng) / 2; if(min(h, MUL(la, mid)) * min(w, MUL(lb, i)) + ka * mid >= rem) ok = mid; else ng = mid; } chmin(ans, i + ok); } out(ans); }