#637759 (C++11) No.1460 Max of Min

提出ソース

結果

問題	No.1460 Max of Min
ユーザー	leaf_1415
提出日時	2021-03-31 22:16:52
言語	C++11 (gcc 11.4.0)
結果	RE
実行時間	-
コード長	4,623 bytes
コンパイル時間	599 ms
コンパイル使用メモリ	84,596 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-05-09 08:21:44
合計ジャッジ時間	23,063 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	3 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	RE	-
testcase_04	RE	-
testcase_05	AC	2 ms 5,376 KB
testcase_06	RE	-
testcase_07	RE	-
testcase_08	WA	-
testcase_09	AC	3 ms 5,376 KB
testcase_10	RE	-
testcase_11	RE	-
testcase_12	RE	-
testcase_13	RE	-
testcase_14	RE	-
testcase_15	RE	-
testcase_16	RE	-
testcase_17	RE	-
testcase_18	WA	-
testcase_19	RE	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	RE	-
testcase_23	AC	21 ms 5,376 KB
testcase_24	RE	-
testcase_25	AC	20 ms 5,376 KB
testcase_26	RE	-
testcase_27	RE	-
testcase_28	AC	46 ms 5,376 KB
testcase_29	RE	-
testcase_30	RE	-
testcase_31	RE	-
testcase_32	AC	206 ms 5,376 KB
testcase_33	AC	117 ms 5,376 KB
testcase_34	AC	143 ms 5,376 KB
testcase_35	AC	85 ms 5,376 KB
testcase_36	AC	52 ms 5,376 KB
testcase_37	AC	168 ms 5,376 KB
testcase_38	AC	217 ms 5,376 KB
testcase_39	AC	122 ms 5,376 KB
testcase_40	AC	107 ms 5,376 KB
testcase_41	AC	87 ms 5,376 KB
testcase_42	AC	64 ms 5,376 KB
testcase_43	RE	-
testcase_44	RE	-
testcase_45	AC	35 ms 5,376 KB
testcase_46	AC	131 ms 5,376 KB
testcase_47	AC	153 ms 5,376 KB
testcase_48	RE	-
testcase_49	RE	-
testcase_50	AC	42 ms 5,376 KB
testcase_51	RE	-
testcase_52	RE	-
testcase_53	AC	168 ms 5,376 KB
testcase_54	AC	224 ms 5,376 KB
testcase_55	RE	-
testcase_56	AC	225 ms 5,376 KB
testcase_57	AC	227 ms 5,376 KB
testcase_58	RE	-
testcase_59	AC	223 ms 5,376 KB
testcase_60	AC	227 ms 5,376 KB
testcase_61	AC	223 ms 5,376 KB
testcase_62	AC	223 ms 5,376 KB
testcase_63	AC	225 ms 5,376 KB
testcase_64	AC	231 ms 5,376 KB
testcase_65	RE	-
testcase_66	AC	225 ms 5,376 KB
testcase_67	AC	223 ms 5,376 KB
testcase_68	AC	225 ms 5,376 KB
testcase_69	AC	234 ms 5,376 KB
testcase_70	AC	225 ms 5,376 KB
testcase_71	RE	-
testcase_72	AC	224 ms 5,376 KB
testcase_73	AC	225 ms 5,376 KB
testcase_74	AC	222 ms 5,376 KB
testcase_75	AC	222 ms 5,376 KB
testcase_76	AC	227 ms 5,376 KB
testcase_77	AC	223 ms 5,376 KB
testcase_78	AC	228 ms 5,376 KB
testcase_79	AC	224 ms 5,376 KB
testcase_80	AC	224 ms 5,376 KB
testcase_81	AC	222 ms 5,376 KB
testcase_82	AC	250 ms 5,376 KB
testcase_83	AC	224 ms 5,376 KB
testcase_84	RE	-
testcase_85	RE	-
testcase_86	RE	-
testcase_87	RE	-
testcase_88	RE	-
testcase_89	RE	-
testcase_90	RE	-
testcase_91	RE	-
testcase_92	RE	-
testcase_93	RE	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
const ll dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

const ll mod = 1000000007;
//const ll mod = 998244353;

struct mint{
	ll x = 0;
	mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}
	mint(const mint &ope) {x = ope.x;}
	
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){
		x += ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint &ope){
		x += mod - ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint &ope){
		x *= ope.x, x %= mod;
		return *this;
	}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){
			if(n & 1) *this *= mul;
			mul *= mul;
			n >>= 1;
		}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){
	ll t; is >> t, ope.x = t;
	return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "Yes" << endl; }
void no(){ cout << "No" << endl; }
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}

template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	for(int i = 0; i < vec.size(); i++) {
		os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
	for(int i = 0; i < deq.size(); i++) {
		os << deq[i] << (i + 1 == deq.size() ? "" : " ");
	}
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
	for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
		os << "(" << itr->first << ", " << itr->second << ")";
		itr++;
		if(itr != map_var.end()) os << ",";
		itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
	for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr;
		++itr;
		if(itr != set_var.end()) os << " ";
		itr--;
	}
	return os;
}
template<typename T>
void outa(T a[], ll s, ll t)
{
	for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}
	cout << endl;
}
void dump_func() {cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
	cout << head;
	if(sizeof...(Tail) > 0) cout << " ";
	dump_func(std::move(tail)...);
}

ll k, n;
ll a[100005], b[1005];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> k >> n;
	rep(i, 0, k-1) cin >> a[i];
	rep(i, 0, k-1) cin >> b[i];
	
	rep(i, k, 100000){
		a[i] = -inf;
		rep(j, 1, k) chmax(a[i], min(a[i-j], b[k-j]));
	}
	if(n <= 100000) outl(a[n]);
	else outl(a[k*k + n%k]);
	
	return 0;
}

yukicoder

結果

テストケース

ソースコード