結果
問題 | No.915 Plus Or Multiple Operation |
ユーザー | ganariya |
提出日時 | 2019-10-26 11:53:37 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 9,716 bytes |
コンパイル時間 | 1,807 ms |
コンパイル使用メモリ | 153,788 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-04-24 18:51:52 |
合計ジャッジ時間 | 2,422 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 1 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 1 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 1 ms
5,376 KB |
testcase_10 | AC | 1 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 1 ms
5,376 KB |
ソースコード
//include //------------------------------------------ #include <vector> #include <list> #include <map> #include <unordered_map> #include <climits> #include <set> #include <unordered_set> #include <deque> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <ctime> #include <queue> #include <random> #include <complex> #include <regex> #include <locale> #include <random> #include <type_traits> using namespace std; // typedef //------------------------------------------ typedef long long LL; typedef vector<int> VI; typedef vector<bool> VB; typedef vector<char> VC; typedef vector<double> VD; typedef vector<string> VS; typedef vector<LL> VLL; typedef vector<VI> VVI; typedef vector<VB> VVB; typedef vector<VS> VVS; typedef vector<VLL> VVLL; typedef vector<VVI> VVVI; typedef vector<VVLL> VVVLL; typedef pair<int, int> PII; typedef pair<LL, LL> PLL; typedef pair<int, string> PIS; typedef pair<string, int> PSI; typedef pair<string, string> PSS; typedef vector<PII> VPII; typedef vector<PLL> VPLL; typedef vector<VPII> VVPII; typedef vector<VPLL> VVPLL; typedef vector<VS> VVS; typedef map<int, int> MII; typedef map<LL, LL> MLL; typedef map<string, int> MSI; typedef map<int, string> MIS; typedef __int128 Lint; // to-method //------------------------------------------ inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; } inline LL toLongLong(string s) { LL v; istringstream sin(s); sin >> v; return v; } template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } inline VC toVC(string s) { VC data(s.begin(), s.end()); return data; } vector<string> SPRIT(const string &s, const string &delim) { vector<string> result; string::size_type pos = 0; while (pos != string::npos) { string::size_type p = s.find(delim, pos); if (p == string::npos) { result.push_back(s.substr(pos)); break; } else { result.push_back(s.substr(pos, p - pos)); } pos = p + delim.size(); } return result; } // container util //------------------------------------------ #define ALL(a) (a).begin(),(a).end() #define SZ(a) int((a).size()) #define EACH(i, arr) for(typeof((arr).begin()) i=(arr).begin(); i!=(arr).end(); ++i) #define EXIST(str, e) ((str).find(e)!=(str).end()) #define COUNT(arr, v) count((arr).begin(), (arr).end(), v) #define SEARCH(v, w) search((v).begin(), (v).end(), (w).begin(), (w).end()) #define SORT(c) sort((c).begin(),(c).end()) #define RSORT(c) sort((c).rbegin(),(c).rend()) #define REVERSE(c) reverse((c).begin(), (c).end()) #define ROTATE_LEFT(arr, c) rotate((arr).begin(), (arr).begin()+(c), (arr).end()) #define ROTATE_RIGHT(arr, c) rotate((arr).rbegin(), (arr).rbegin() + (c), (arr).rend()) #define SUMI(arr) accumulate((arr).begin(), (arr).end(), 0) #define SUMD(arr) accumulate((arr).begin(), (arr).end(), 0.) #define SUMLL(arr) accumulate((arr).begin(), (arr).end(), 0LL) #define SUMS(arr) accumulate((arr).begin(), (arr).end(), string()) #define MULD(arr) accumulate((arr).begin(), (arr).end(), 1., multiplies<double>()) #define MULLL(arr) accumulate((arr).begin(), (arr).end(), 1LL, multiplies<long long>()) #define UB(arr, n) upper_bound((arr).begin(), (arr).end(), n) #define LB(arr, n) lower_bound((arr).begin(), (arr).end(), n) #define OF_ALL(arr, func) all_of((arr).begin(), (arr).end(), (func)) #define OF_NONE(arr, func) none_of((arr).begin(), (arr).end(), (func)) #define OF_ANY(arr, func) any_of((arr).begin(), (arr).end(), (func)) #define PB push_back #define MP make_pair #define ft first #define sd second // input output //------------------------------------------ #define GL(s) getline(cin, (s)) #define INIT() std::ios::sync_with_stdio(false);std::cin.tie(0) #define OUT(d) std::cout<<(d) #define OUT_L(d) std::cout<<(d)<<endl #define FOUT(n, data) std::cout<<std::fixed<<std::setprecision(n)<<(data) #define FOUT_L(n, data) std::cout<<std::fixed<<std::setprecision(n)<<(data)<<"\n" #define EL() printf("\n") #define SHOW_VECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";} #define SHOW_MAP(v) {std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << " " << xxx.second << "\n";}} #define Yes() printf("Yes\n") #define No() printf("No\n") #define YES() printf("YES\n") #define NO() printf("NO\n") #define Yay() printf("Yay!\n") #define Nnn() printf(":(\n") template<typename T1, typename T2> istream &operator>>(istream &in, pair<T1, T2> &p) { in >> p.first >> p.second; return in; } template<typename T> istream &operator>>(istream &in, vector<T> &v) { for (auto &x: v) in >> x; return in; } istream &operator>>(istream &in, Lint &d) { string s; cin >> s; Lint tmp = 0; for (int i = 0; i < s.length(); i++)if ('0' <= s[i] && s[i] <= '9')tmp = 10 * tmp + s[i] - '0'; d = tmp; return in; } template<typename T1, typename T2> ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) { out << "[" << p.first << ", " << p.second << "]" << "\n"; return out; } //repetition //------------------------------------------ #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i) #define REP(i, n) FOR(i,0,n) #define RREP(i, n) for(int i = n-1;i >= 0;i--) #define FORLL(i, a, b) for(LL i=LL(a);i<LL(b);++i) #define RFORLL(i, a, b) for(LL i=LL(b)-1;i>=LL(a);--i) #define REPLL(i, n) for(LL i=0;i<LL(n);++i) #define RREPLL(i, n) for(LL i=LL(n)-1;i>=0;--i) #define FOREACH(x, arr) for(auto &(x) : (arr)) #define FORITER(x, arr) for(auto (x) = (arr).begin(); (x) != (arr).end(); ++(x)) //------------------------------------------ //------------------------------------------ template<class T> void chmin(T &a, const T b) { a = min(a, b); } template<class T> void chmax(T &a, const T b) { a = max(a, b); } //"1111011" → 123 int strbase_2to10(const std::string &s) { int out = 0; for (int i = 0, size = s.size(); i < size; ++i) { out *= 2; out += ((int) s[i] == 49) ? 1 : 0; } return out; } //"123" → 1111011 int strbase_10to2(const std::string &s) { int binary = toInt(s); int out = 0; for (int i = 0; binary > 0; i++) { out = out + (binary % 2) * pow(static_cast<int>(10), i); binary = binary / 2; } return out; } //"ABC" 2748 int strbase_16to10(const std::string &s) { int out = stoi(s, 0, 16); return out; } //1111011 → 123 int intbase_2to10(int in) { string str = toString(in); return strbase_2to10(str); } //123 → 1111011 int intbase_10to2(int in) { string str = toString(in); return strbase_10to2(str); } int intbase_16to10(int in) { string str = toString(in); return strbase_16to10(str); } //123→ "7B" string intbase_10to16(unsigned int val, bool lower = true) { if (!val) return std::string("0"); std::string str; const char hc = lower ? 'a' : 'A'; // 小文字 or 大文字表記 while (val != 0) { int d = val & 15; // 16進数一桁を取得 if (d < 10) str.insert(str.begin(), d + '0'); // 10未満の場合 else // 10以上の場合 str.insert(str.begin(), d - 10 + hc); val >>= 4; } return str; } vector<LL> long_base_10to_n(LL x, LL n) { vector<LL> bit; while (x > 0LL) { bit.push_back(x % n); x /= n; } reverse(bit.begin(), bit.end()); if (bit.size() == 0) bit.push_back(0); return bit; } int bitcount32(int bits) { bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555); bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333); bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f); bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff); return (bits & 0x0000ffff) + (bits >> 16 & 0x0000ffff); } LL bitcount64(LL bits) { bits = (bits & 0x5555555555555555) + (bits >> 1 & 0x5555555555555555); bits = (bits & 0x3333333333333333) + (bits >> 2 & 0x3333333333333333); bits = (bits & 0x0f0f0f0f0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f0f0f0f0f); bits = (bits & 0x00ff00ff00ff00ff) + (bits >> 8 & 0x00ff00ff00ff00ff); bits = (bits & 0x0000ffff0000ffff) + (bits >> 16 & 0x0000ffff0000ffff); return (bits & 0x00000000ffffffff) + (bits >> 32 & 0x00000000ffffffff); } int main() { int Q; cin >> Q; while (Q--) { LL A, B, C; cin >> A >> B >> C; if (C == 1) { cout << -1 << endl; continue; } auto bit = long_base_10to_n(A, C); int M = bit.size(); vector<LL> dp(M + 10, INT_MAX); vector<LL> sumV(M + 1, 0); vector<LL> powC(M, 1); for (int i = 0; i < M - 1; i++) powC[i + 1] = powC[i] * C; for (int i = 0; i < M; i++) { for (int j = 0; j <= i; j++) { sumV[i + 1] += bit[j] * powC[i - j]; } } dp[0] = 0; for (int i = 0; i < M; i++) { if (sumV[i + 1] == sumV[i] * C) chmin(dp[i + 1], dp[i] + 1); if (sumV[i + 1] <= sumV[i] + C - 1) chmin(dp[i + 1], dp[i] + 1); if (sumV[i + 1] <= sumV[i] * C + C - 1) chmin(dp[i + 1], dp[i] + 2); if (sumV[i + 2] <= sumV[i] + 2 * (C - 1) ) chmin(dp[i + 2], dp[i] + 2); } cout << dp[M] * B << endl; } return 0; }