#458910 (C++14) No.9 モンスターのレベル上げ

• 問題: No.9 モンスターのレベル上げ
• ユーザー: fumiphys
• 提出日時: 2020-04-05 00:23:23
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 457 ms / 5,000 ms
• コード長: 3,551 bytes
• コンパイル時間: 1,642 ms
• コンパイル使用メモリ: 177,748 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-03 07:51:10
• 合計ジャッジ時間: 6,721 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	457 ms; 5,376 KB
testcase_03	AC	372 ms; 5,376 KB
testcase_04	AC	193 ms; 5,376 KB
testcase_05	AC	128 ms; 5,376 KB
testcase_06	AC	44 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	59 ms; 5,376 KB
testcase_09	AC	453 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	397 ms; 5,376 KB
testcase_12	AC	324 ms; 5,376 KB
testcase_13	AC	395 ms; 5,376 KB
testcase_14	AC	448 ms; 5,376 KB
testcase_15	AC	406 ms; 5,376 KB
testcase_16	AC	8 ms; 5,376 KB
testcase_17	AC	264 ms; 5,376 KB
testcase_18	AC	224 ms; 5,376 KB
testcase_19	AC	5 ms; 5,376 KB

ソースコード

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.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(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
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> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;


int main(int argc, char const* argv[])
{
  int n; cin >> n;
  vector<ll> a(n), b(n); cin >> a >> b;
  int res = inf;
  using p_t = pair<P, int>;
  rep(i, n){
    priority_queue<p_t, vector<p_t>, greater<p_t>> pq;
    rep(j, n)pq.push(mk(mk(a[j], 0), j));
    rep(j, n){
      int idx = (i + j) % n;
      auto p = pq.top(); pq.pop();
      p.first.second++;
      p.first.first += b[idx] / 2;
      pq.push(p);
    }
    int tmp = 0;
    while(!pq.empty()){
      auto p = pq.top(); pq.pop();
      chmax(tmp, p.first.second);
    }
    chmin(res, tmp);
  }
  cout << res << endl;
  return 0;
}