結果

問題 No.9 モンスターのレベル上げ
ユーザー komori3komori3
提出日時 2018-03-08 07:03:33
言語 C++11
(gcc 8.5.0)
結果
AC  
実行時間 379 ms / 5,000 ms
コード長 4,351 bytes
コンパイル時間 2,126 ms
使用メモリ 3,624 KB
最終ジャッジ日時 2023-01-21 17:06:08
合計ジャッジ時間 5,447 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 1 ms
3,396 KB
testcase_01 AC 1 ms
3,400 KB
testcase_02 AC 379 ms
3,504 KB
testcase_03 AC 303 ms
3,544 KB
testcase_04 AC 158 ms
3,624 KB
testcase_05 AC 104 ms
3,528 KB
testcase_06 AC 35 ms
3,552 KB
testcase_07 AC 2 ms
3,468 KB
testcase_08 AC 47 ms
3,568 KB
testcase_09 AC 369 ms
3,600 KB
testcase_10 AC 2 ms
3,568 KB
testcase_11 AC 294 ms
3,552 KB
testcase_12 AC 230 ms
3,512 KB
testcase_13 AC 177 ms
3,568 KB
testcase_14 AC 371 ms
3,448 KB
testcase_15 AC 336 ms
3,552 KB
testcase_16 AC 6 ms
3,408 KB
testcase_17 AC 213 ms
3,596 KB
testcase_18 AC 178 ms
3,560 KB
testcase_19 AC 4 ms
3,556 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <random>

using namespace std;

//呪文
#define DUMPOUT cerr
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { ostr << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const stack<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } stack<_Ty> t(s); ostr << "{" << t.top(); t.pop(); while (!t.empty()) { ostr << ", " << t.top(); t.pop(); } ostr << "}";	return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const list<_Ty>& l) { if (l.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { istr >> m.first >> m.second; return istr; }
template <typename _Ty> istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) istr >> v[i]; return istr; }
namespace aux { // print tuple
	template<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } };
	template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& value) { os << get<N>(value); } };
}
template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys)-1>::print(os, t); os << "}"; return os; }

template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-11
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define fake false



int main()
{
	//clock_t start, end;
	//start = clock();

	cin.tie(0);
	ios::sync_with_stdio(false);

	int N;
	cin >> N;

	vector<int> A(N), B(N);
	cin >> A >> B;

	for (int i = 0; i < N; i++) B.push_back(B[i]);

	typedef priority_queue<pii, vector<pii>, greater<pii>> Queue;
	Queue pq;

	for (int i = 0; i < N; i++) pq.push(pii(A[i], 0));

	int minMaxBattleCount = INT_MAX;
	for (int begin = 0; begin < N; begin++) {
		Queue pq_tmp(pq);
		for (int i = begin; i < begin + N; i++) {
			int enemyLevel = B[i];
			pii monster = pq_tmp.top(); pq_tmp.pop();
			monster.first += enemyLevel / 2;
			monster.second++;
			pq_tmp.push(monster);
		}
		int maxBattleCount = 0;
		while (!pq_tmp.empty()) {
			pii p = pq_tmp.top(); pq_tmp.pop();

			maxBattleCount = max(maxBattleCount, p.second);
		}
		if (minMaxBattleCount > maxBattleCount) minMaxBattleCount = maxBattleCount;
	}

	cout << minMaxBattleCount << endl;

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}
0