fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define ll long long
  4. #define int long long int
  5. #define ld long double
  6. #define all(x) x.begin(), x.end()
  7. #define sortall(x) sort(all(x))
  8. #define endl '\n'
  9. #define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  10. template<class T>
  11. void printC (T Collection)
  12. {
  13.     for (auto&i:Collection)
  14.         cout << i << " \n";
  15.     cout << '\n';
  16. }
  17.  
  18. /*
  19.  * Think twice, code once
  20.  * Think of different approaches to tackle a problem: write them down.
  21.  * Think of different views of the problem. don't look from only one side.
  22.  * don't get stuck in one approach.
  23.  * common mistakes: - over_flow
  24.  *                  - out_of_bound index
  25.  *                  - infinite loop
  26.  *                  - corner cases
  27.  *                  - duplication counting.
  28. */
  29. bool good(int mid,int Bcnt,int Scnt,int Ccnt,int B,int S,int C,int Bshop,int Sshop,int Cshop,int pounds)
  30. {
  31.     int Bneed = Bcnt*mid, Sneed = Scnt*mid, Cneed = Ccnt*mid;
  32.  
  33.     if (B < Bneed)
  34.         pounds -= Bshop*(Bneed-B);
  35.     if (S < Sneed)
  36.         pounds -= Sshop*(Sneed-S);
  37.     if (C < Cneed)
  38.         pounds -= Cshop*(Cneed-C);
  39.  
  40.     return pounds >= 0;
  41. }
  42.  
  43. void solve()
  44. {
  45.     string s; cin >> s;
  46.     int Bcnt = 0, Scnt = 0, Ccnt = 0;
  47.     int B, S, C;
  48.     int Bshop, Sshop, Cshop;
  49.     int pounds;
  50.     for (int i = 0; i < s.size(); ++i)
  51.     {
  52.         if (s[i] == 'B')
  53.             Bcnt++;
  54.         else if (s[i] == 'S')
  55.             Scnt++;
  56.         else
  57.             Ccnt++;
  58.     }
  59.     cin >> B >> S >> C;
  60.     cin >> Bshop >> Sshop >> Cshop;
  61.     cin >> pounds;
  62.     int l = 0, r = 10e13, ans = 0;
  63.     while (l <= r)
  64.     {
  65.         int mid = (l+r)>>1;
  66.         if (good(mid, Bcnt, Scnt, Ccnt, B, S, C, Bshop, Sshop, Cshop, pounds))
  67.         {
  68.             ans = mid;
  69.             l = mid + 1;
  70.         }else
  71.             r = mid - 1;
  72.     }
  73.     cout << ans;
  74. }
  75.  
  76. int32_t main()
  77. {
  78. // #ifndef ONLINE_JUDGE
  79. //     freopen("input.txt", "r", stdin);
  80. //     freopen("output.txt", "w", stdout);
  81. //     freopen("Errors.txt", "w", stderr);
  82. // #endif
  83.     fast
  84.     int t = 1;
  85.     // cin >> t;
  86.     while (t--)
  87.     {
  88.         solve();
  89.         if (t) cout << '\n';
  90.     }
  91.     cout << '\n';
  92.     return 0;
  93. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
100000000000000
https://ideone.com/ILgzjF
language:
C++14 (gcc 8.3)
created:
10 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!