結果

問題 No.1460 Max of Min
ユーザー nok0nok0
提出日時 2021-03-31 22:47:47
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 958 ms / 2,000 ms
コード長 10,707 bytes
コンパイル時間 6,640 ms
コンパイル使用メモリ 304,424 KB
実行使用メモリ 26,804 KB
最終ジャッジ日時 2024-05-09 09:28:14
合計ジャッジ時間 55,430 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 21 ms
19,628 KB
testcase_01 AC 20 ms
19,808 KB
testcase_02 AC 27 ms
24,040 KB
testcase_03 AC 892 ms
19,348 KB
testcase_04 AC 892 ms
19,348 KB
testcase_05 AC 8 ms
7,396 KB
testcase_06 AC 945 ms
19,472 KB
testcase_07 AC 893 ms
19,476 KB
testcase_08 AC 28 ms
23,908 KB
testcase_09 AC 27 ms
24,040 KB
testcase_10 AC 918 ms
19,216 KB
testcase_11 AC 916 ms
19,340 KB
testcase_12 AC 430 ms
17,980 KB
testcase_13 AC 877 ms
18,660 KB
testcase_14 AC 174 ms
7,900 KB
testcase_15 AC 124 ms
9,436 KB
testcase_16 AC 881 ms
18,164 KB
testcase_17 AC 656 ms
26,328 KB
testcase_18 AC 42 ms
10,104 KB
testcase_19 AC 207 ms
8,604 KB
testcase_20 AC 55 ms
7,876 KB
testcase_21 AC 84 ms
7,484 KB
testcase_22 AC 682 ms
25,112 KB
testcase_23 AC 37 ms
9,596 KB
testcase_24 AC 731 ms
15,708 KB
testcase_25 AC 105 ms
26,452 KB
testcase_26 AC 297 ms
7,372 KB
testcase_27 AC 374 ms
15,772 KB
testcase_28 AC 74 ms
9,932 KB
testcase_29 AC 227 ms
9,396 KB
testcase_30 AC 301 ms
10,972 KB
testcase_31 AC 217 ms
9,048 KB
testcase_32 AC 796 ms
17,632 KB
testcase_33 AC 166 ms
7,552 KB
testcase_34 AC 198 ms
8,408 KB
testcase_35 AC 358 ms
15,256 KB
testcase_36 AC 81 ms
10,580 KB
testcase_37 AC 656 ms
26,488 KB
testcase_38 AC 277 ms
10,648 KB
testcase_39 AC 171 ms
7,728 KB
testcase_40 AC 438 ms
17,812 KB
testcase_41 AC 125 ms
9,708 KB
testcase_42 AC 282 ms
21,996 KB
testcase_43 AC 634 ms
24,900 KB
testcase_44 AC 821 ms
17,420 KB
testcase_45 AC 57 ms
8,236 KB
testcase_46 AC 541 ms
22,380 KB
testcase_47 AC 214 ms
8,756 KB
testcase_48 AC 827 ms
17,980 KB
testcase_49 AC 238 ms
9,496 KB
testcase_50 AC 69 ms
9,408 KB
testcase_51 AC 663 ms
25,868 KB
testcase_52 AC 332 ms
25,148 KB
testcase_53 AC 682 ms
26,804 KB
testcase_54 AC 958 ms
19,348 KB
testcase_55 AC 917 ms
19,480 KB
testcase_56 AC 909 ms
19,348 KB
testcase_57 AC 911 ms
19,476 KB
testcase_58 AC 303 ms
7,512 KB
testcase_59 AC 314 ms
7,384 KB
testcase_60 AC 910 ms
19,352 KB
testcase_61 AC 297 ms
7,520 KB
testcase_62 AC 297 ms
7,388 KB
testcase_63 AC 298 ms
7,516 KB
testcase_64 AC 295 ms
7,400 KB
testcase_65 AC 295 ms
7,388 KB
testcase_66 AC 896 ms
19,460 KB
testcase_67 AC 305 ms
7,260 KB
testcase_68 AC 314 ms
7,512 KB
testcase_69 AC 907 ms
19,476 KB
testcase_70 AC 891 ms
19,480 KB
testcase_71 AC 891 ms
19,476 KB
testcase_72 AC 892 ms
19,348 KB
testcase_73 AC 907 ms
19,436 KB
testcase_74 AC 297 ms
7,380 KB
testcase_75 AC 304 ms
7,384 KB
testcase_76 AC 888 ms
19,448 KB
testcase_77 AC 917 ms
19,316 KB
testcase_78 AC 312 ms
7,508 KB
testcase_79 AC 906 ms
19,188 KB
testcase_80 AC 297 ms
7,600 KB
testcase_81 AC 304 ms
7,512 KB
testcase_82 AC 915 ms
19,184 KB
testcase_83 AC 298 ms
7,484 KB
testcase_84 AC 928 ms
19,116 KB
testcase_85 AC 919 ms
19,160 KB
testcase_86 AC 305 ms
7,372 KB
testcase_87 AC 927 ms
19,444 KB
testcase_88 AC 932 ms
19,456 KB
testcase_89 AC 934 ms
19,324 KB
testcase_90 AC 306 ms
7,500 KB
testcase_91 AC 314 ms
7,564 KB
testcase_92 AC 926 ms
19,472 KB
testcase_93 AC 911 ms
19,024 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/**
 *	author: nok0
 *	created: 2021.03.31 21:48:40
**/
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif

#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif

#pragma region Macros
// rep macro
#define foa(v, a) for(auto &v : a)
#define REPname(a, b, c, d, e, ...) e
#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)
#define REP0(x) for(int i = 0; i < (x); ++i)
#define REP1(i, x) for(int i = 0; i < (x); ++i)
#define REP2(i, l, r) for(int i = (l); i < (r); ++i)
#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))
#define REPSname(a, b, c, ...) c
#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)
#define REPS0(x) for(int i = 1; i <= (x); ++i)
#define REPS1(i, x) for(int i = 1; i <= (x); ++i)
#define RREPname(a, b, c, d, e, ...) e
#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)
#define RREP0(x) for(int i = (x)-1; i >= 0; --i)
#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)
#define RREP2(i, r, l) for(int i = (r)-1; i >= (l); --i)
#define RREP3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))
#define RREPSname(a, b, c, ...) c
#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)
#define RREPS0(x) for(int i = (x); i >= 1; --i)
#define RREPS1(i, x) for(int i = (x); i >= 1; --i)

// name macro
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define popcnt(x) __builtin_popcountll(x)
template <class T = int>
using V = std::vector<T>;
template <class T = int>
using VV = std::vector<std::vector<T>>;
template <class T>
using pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;
using ll = long long;
using ld = long double;
using int128 = __int128_t;
using pii = std::pair<int, int>;
using pll = std::pair<long long, long long>;

// input macro
template <class T, class U>
std::istream &operator>>(std::istream &is, std::pair<T, U> &p) {
	is >> p.first >> p.second;
	return is;
}
template <class T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
	for(T &i : v) is >> i;
	return is;
}
std::istream &operator>>(std::istream &is, __int128_t &a) {
	std::string s;
	is >> s;
	__int128_t ret = 0;
	for(int i = 0; i < s.length(); i++)
		if('0' <= s[i] and s[i] <= '9')
			ret = 10 * ret + s[i] - '0';
	a = ret * (s[0] == '-' ? -1 : 1);
	return is;
}
#if __has_include(<atcoder/all>)
std::istream &operator>>(std::istream &is, atcoder::modint998244353 &a) {
	long long v;
	is >> v;
	a = v;
	return is;
}
std::istream &operator>>(std::istream &is, atcoder::modint1000000007 &a) {
	long long v;
	is >> v;
	a = v;
	return is;
}
template <int m>
std::istream &operator>>(std::istream &is, atcoder::static_modint<m> &a) {
	long long v;
	is >> v;
	a = v;
	return is;
}
template <int m>
std::istream &operator>>(std::istream &is, atcoder::dynamic_modint<m> &a) {
	long long v;
	is >> v;
	a = v;
	return is;
}
#endif
namespace scanner {
void scan(int &a) { std::cin >> a; }
void scan(long long &a) { std::cin >> a; }
void scan(std::string &a) { std::cin >> a; }
void scan(char &a) { std::cin >> a; }
void scan(char a[]) { std::scanf("%s", a); }
void scan(double &a) { std::cin >> a; }
void scan(long double &a) { std::cin >> a; }
template <class T, class U>
void scan(std::pair<T, U> &p) { std::cin >> p; }
template <class T>
void scan(std::vector<T> &a) { std::cin >> a; }
void INPUT() {}
template <class Head, class... Tail>
void INPUT(Head &head, Tail &... tail) {
	scan(head);
	INPUT(tail...);
}
}  // namespace scanner
#define VEC(type, name, size)     \
	std::vector<type> name(size); \
	scanner::INPUT(name)
#define VVEC(type, name, h, w)                                    \
	std::vector<std::vector<type>> name(h, std::vector<type>(w)); \
	scanner::INPUT(name)
#define INT(...)     \
	int __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)
#define LL(...)            \
	long long __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)
#define STR(...)             \
	std::string __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)
#define CHAR(...)     \
	char __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)
#define DOUBLE(...)     \
	double __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)
#define LD(...)              \
	long double __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)

// output-macro
template <class T, class U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {
	os << p.first << " " << p.second;
	return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {
	for(int i = 0; i < int(a.size()); ++i) {
		if(i) os << " ";
		os << a[i];
	}
	return os;
}
std::ostream &operator<<(std::ostream &dest, __int128_t &value) {
	std::ostream::sentry s(dest);
	if(s) {
		__uint128_t tmp = value < 0 ? -value : value;
		char buffer[128];
		char *d = std::end(buffer);
		do {
			--d;
			*d = "0123456789"[tmp % 10];
			tmp /= 10;
		} while(tmp != 0);
		if(value < 0) {
			--d;
			*d = '-';
		}
		int len = std::end(buffer) - d;
		if(dest.rdbuf()->sputn(d, len) != len) {
			dest.setstate(std::ios_base::badbit);
		}
	}
	return dest;
}
#if __has_include(<atcoder/all>)
std::ostream &operator<<(std::ostream &os, const atcoder::modint998244353 &a) { return os << a.val(); }
std::ostream &operator<<(std::ostream &os, const atcoder::modint1000000007 &a) { return os << a.val(); }
template <int m>
std::ostream &operator<<(std::ostream &os, const atcoder::static_modint<m> &a) { return os << a.val(); }
template <int m>
std::ostream &operator<<(std::ostream &os, const atcoder::dynamic_modint<m> &a) { return os << a.val(); }
#endif
template <class T>
void print(const T a) { std::cout << a << '\n'; }
template <class Head, class... Tail>
void print(Head H, Tail... T) {
	std::cout << H << ' ';
	print(T...);
}
template <class T>
void printel(const T a) { std::cout << a << '\n'; }
template <class T>
void printel(const std::vector<T> &a) {
	for(const auto &v : a)
		std::cout << v << '\n';
}
template <class Head, class... Tail>
void printel(Head H, Tail... T) {
	std::cout << H << '\n';
	printel(T...);
}
void Yes(const bool b = true) { std::cout << (b ? "Yes\n" : "No\n"); }
void No() { std::cout << "No\n"; }
void YES(const bool b = true) { std::cout << (b ? "YES\n" : "NO\n"); }
void NO() { std::cout << "NO\n"; }
void err(const bool b = true) {
	if(b) {
		std::cout << "-1\n", exit(0);
	}
}

//debug macro
namespace debugger {
template <class T>
void view(const std::vector<T> &a) {
	std::cerr << "{ ";
	for(const auto &v : a) {
		std::cerr << v << ", ";
	}
	std::cerr << "\b\b }";
}
template <class T>
void view(const std::vector<std::vector<T>> &a) {
	std::cerr << "{\n";
	for(const auto &v : a) {
		std::cerr << "\t";
		view(v);
		std::cerr << "\n";
	}
	std::cerr << "}";
}
template <class T, class U>
void view(const std::vector<std::pair<T, U>> &a) {
	std::cerr << "{\n";
	for(const auto &p : a) std::cerr << "\t(" << p.first << ", " << p.second << ")\n";
	std::cerr << "}";
}
template <class T, class U>
void view(const std::map<T, U> &m) {
	std::cerr << "{\n";
	for(const auto &p : m) std::cerr << "\t[" << p.first << "] : " << p.second << "\n";
	std::cerr << "}";
}
template <class T, class U>
void view(const std::pair<T, U> &p) { std::cerr << "(" << p.first << ", " << p.second << ")"; }
template <class T>
void view(const std::set<T> &s) {
	std::cerr << "{ ";
	for(auto &v : s) {
		view(v);
		std::cerr << ", ";
	}
	std::cerr << "\b\b }";
}

template <class T>
void view(const T &e) { std::cerr << e; }
}  // namespace debugger
#ifdef LOCAL
void debug_out() {}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
	debugger::view(H);
	std::cerr << ", ";
	debug_out(T...);
}
#define debug(...)                                                \
	do {                                                          \
		std::cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : ["; \
		debug_out(__VA_ARGS__);                                   \
		std::cerr << "\b\b]\n";                                   \
	} while(false)
#else
#define debug(...) (void(0))
#endif

// vector macro
template <class T>
int lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }
template <class T>
int ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }
template <class T>
void UNIQUE(std::vector<T> &a) {
	std::sort(a.begin(), a.end());
	a.erase(std::unique(a.begin(), a.end()), a.end());
}
template <class T>
std::vector<T> press(std::vector<T> &a) {
	auto res = a;
	UNIQUE(res);
	for(auto &v : a)
		v = lb(res, v);
	return res;
}
#define SORTname(a, b, c, ...) c
#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)
#define SORT0(a) std::sort((a).begin(), (a).end())
#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })
template <class T>
void ADD(std::vector<T> &a, const T x) {
	for(auto &v : a) v += x;
}
template <class T>
void SUB(std::vector<T> &a, const T x = 1) {
	for(auto &v : a) v -= x;
}
template <class T>
void MUL(std::vector<T> &a, const T x) {
	for(auto &v : a) v *= x;
}
template <class T>
void DIV(std::vector<T> &a, const T x) {
	for(auto &v : a) v /= x;
}

// math macro
template <class T, class U>
inline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }
template <class T, class U>
inline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }
template <class T>
T divup(T x, T y) { return (x + y - 1) / y; }
template <class T>
T POW(T a, long long n) {
	T ret = 1;
	while(n) {
		if(n & 1) ret *= a;
		a *= a;
		n >>= 1;
	}
	return ret;
}
// modpow
long long POW(long long a, long long n, const int mod) {
	long long ret = 1;
	while(n) {
		if(n & 1) (ret *= a) %= mod;
		(a *= a) %= mod;
		n >>= 1;
	}
	return ret;
}

// others
struct fast_io {
	fast_io() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} fast_io_;
const int inf = 1e9;
const ll INF = 2e18;
#pragma endregion

int sz = 500000;
void main_() {
	LL(k, n);
	VEC(ll, a, k);
	VEC(ll, b, k);
	if(n & 1 and n % 3 != 2) sz = 1500000;
	if((n & 1) == 0 and n % 3 == 1) sz = 1500000;
	REP(i, k, sz + 1) {
		ll MAX = -INF;
		REP(j, k) {
			chmax(MAX, min(b[j], a[i - k + j]));
		}
		a.pb(MAX);
	}
	if(n <= sz)
		print(a[n]);
	else {
		ll sabun = n - sz;
		sabun = divup(sabun, k);
		sabun *= k;
		print(a[n - sabun]);
	}
}

int main() {
	int t = 1;
	//cin >> t;
	while(t--) main_();
	return 0;
}
0