#656429 (C++17) No.1460 Max of Min

提出ソース

結果

問題	No.1460 Max of Min
ユーザー	nok0
提出日時	2021-05-13 11:04:35
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	13,485 bytes
コンパイル時間	5,968 ms
コンパイル使用メモリ	294,424 KB
実行使用メモリ	4,348 KB
最終ジャッジ日時	2023-10-25 04:55:01
合計ジャッジ時間	35,474 ms
ジャッジサーバーID （参考情報）	judge13 / judge15

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,348 KB
testcase_01	AC	2 ms 4,348 KB
testcase_02	AC	3 ms 4,348 KB
testcase_03	WA	-
testcase_04	AC	9 ms 4,348 KB
testcase_05	AC	2 ms 4,348 KB
testcase_06	WA	-
testcase_07	WA	-
testcase_08	AC	2 ms 4,348 KB
testcase_09	AC	2 ms 4,348 KB
testcase_10	WA	-
testcase_11	WA	-
testcase_12	AC	56 ms 4,348 KB
testcase_13	WA	-
testcase_14	AC	116 ms 4,348 KB
testcase_15	AC	60 ms 4,348 KB
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	AC	56 ms 4,348 KB
testcase_21	AC	90 ms 4,348 KB
testcase_22	WA	-
testcase_23	AC	87 ms 4,348 KB
testcase_24	WA	-
testcase_25	AC	11 ms 4,348 KB
testcase_26	WA	-
testcase_27	WA	-
testcase_28	AC	77 ms 4,348 KB
testcase_29	WA	-
testcase_30	WA	-
testcase_31	AC	161 ms 4,348 KB
testcase_32	AC	309 ms 4,348 KB
testcase_33	AC	289 ms 4,348 KB
testcase_34	AC	301 ms 4,348 KB
testcase_35	AC	163 ms 4,348 KB
testcase_36	WA	-
testcase_37	AC	301 ms 4,348 KB
testcase_38	AC	162 ms 4,348 KB
testcase_39	AC	306 ms 4,348 KB
testcase_40	AC	304 ms 4,348 KB
testcase_41	AC	257 ms 4,348 KB
testcase_42	AC	297 ms 4,348 KB
testcase_43	WA	-
testcase_44	WA	-
testcase_45	AC	166 ms 4,348 KB
testcase_46	WA	-
testcase_47	WA	-
testcase_48	WA	-
testcase_49	AC	105 ms 4,348 KB
testcase_50	AC	75 ms 4,348 KB
testcase_51	WA	-
testcase_52	WA	-
testcase_53	AC	130 ms 4,348 KB
testcase_54	AC	302 ms 4,348 KB
testcase_55	WA	-
testcase_56	AC	296 ms 4,348 KB
testcase_57	WA	-
testcase_58	WA	-
testcase_59	WA	-
testcase_60	WA	-
testcase_61	AC	301 ms 4,348 KB
testcase_62	AC	200 ms 4,348 KB
testcase_63	WA	-
testcase_64	AC	290 ms 4,348 KB
testcase_65	WA	-
testcase_66	AC	302 ms 4,348 KB
testcase_67	AC	297 ms 4,348 KB
testcase_68	WA	-
testcase_69	WA	-
testcase_70	AC	306 ms 4,348 KB
testcase_71	WA	-
testcase_72	AC	302 ms 4,348 KB
testcase_73	AC	301 ms 4,348 KB
testcase_74	AC	173 ms 4,348 KB
testcase_75	AC	297 ms 4,348 KB
testcase_76	AC	297 ms 4,348 KB
testcase_77	AC	296 ms 4,348 KB
testcase_78	AC	194 ms 4,348 KB
testcase_79	AC	177 ms 4,348 KB
testcase_80	AC	298 ms 4,348 KB
testcase_81	AC	142 ms 4,348 KB
testcase_82	AC	151 ms 4,348 KB
testcase_83	AC	299 ms 4,348 KB
testcase_84	WA	-
testcase_85	WA	-
testcase_86	WA	-
testcase_87	WA	-
testcase_88	WA	-
testcase_89	WA	-
testcase_90	WA	-
testcase_91	WA	-
testcase_92	WA	-
testcase_93	WA	-

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

ソースコード

raw source code

/**
 *	author: nok0
 *	created: 2021.05.09 22:05:20
**/
#include <bits/stdc++.h>

#include <atcoder/all>

//Ο(N^2)
struct bostan_mori_ll {
public:
	bostan_mori_ll(const std::vector<long long> &a) {
		auto pq1 = find_generating_function(std::vector<mint1>{a.begin(), a.end()});
		p1 = std::move(pq1.first);
		q1 = std::move(pq1.second);
		auto pq2 = find_generating_function(std::vector<mint2>{a.begin(), a.end()});
		p2 = std::move(pq2.first);
		q2 = std::move(pq2.second);
		d = q1.size();
		assert(q1[0] == 1 and p1.size() + 1 <= q1.size());
	}

	long long kth_term(long long k) {
		long long r1, r2;
		{
			long long c = k;
			if(d == 1)
				return 0;
			auto p = p1, q = q1;
			while(c) {
				auto q_minus = q;
				for(int i = 1; i < d; i += 2)
					q_minus[i] *= -1;
				p = atcoder::convolution(p, q_minus);
				q = atcoder::convolution(q, q_minus);
				for(int i = 0; i < d - 1; i++)
					p[i] = p[(i << 1) | (c & 1)];
				for(int i = 0; i < d; i++)
					q[i] = q[i << 1];
				p.resize(d - 1);
				q.resize(d);
				c >>= 1;
			}
			r1 = p[0].val();
		}
		{
			long long c = k;
			if(d == 1)
				return 0;
			auto p = p2, q = q2;
			while(c) {
				auto q_minus = q;
				for(int i = 1; i < d; i += 2)
					q_minus[i] *= -1;
				p = atcoder::convolution(p, q_minus);
				q = atcoder::convolution(q, q_minus);
				for(int i = 0; i < d - 1; i++)
					p[i] = p[(i << 1) | (c & 1)];
				for(int i = 0; i < d; i++)
					q[i] = q[i << 1];
				p.resize(d - 1);
				q.resize(d);
				c >>= 1;
			}
			r2 = p[0].val();
		}
		return garner(r1, r2);
	}

private:
	static constexpr int m1 = 998244353;
	static constexpr int m2 = 1004535809;
	static constexpr int inv_m1_mod_m2 = 669690699;
	using mint1 = atcoder::static_modint<m1>;
	using mint2 = atcoder::static_modint<m2>;
	int d;
	std::vector<mint1> p1, q1;
	std::vector<mint2> p2, q2;

	long long garner(long long r1, long long r2) {
		long long t = atcoder::internal::safe_mod((r2 - r1) * inv_m1_mod_m2, m2);
		r1 += t * m1;
		return r1;
	}

	template <class T>
	std::vector<T> Berlekamp_Massey(const std::vector<T> &a) {
		int n = a.size();
		std::vector<T> c{-1}, c2{0};
		T r2 = 1;
		int i2 = -1;
		for(int i = 0; i < n; i++) {
			T r = 0;
			int d = c.size();
			for(int j = 0; j < d; j++) r += c[j] * a[i - j];
			if(r == 0) continue;
			T coef = -r / r2;
			int d2 = c2.size();
			if(d - i >= d2 - i2) {
				for(int j = 0; j < d2; j++)
					c[j + i - i2] += c2[j] * coef;
			} else {
				std::vector<T> tmp(c);
				c.resize(d2 + i - i2);
				for(int j = 0; j < d2; j++) c[j + i - i2] += c2[j] * coef;
				c2 = std::move(tmp);
				i2 = i, r2 = r;
			}
		}
		c[0] = 1;
		return c;
	}

	template <class T>
	std::pair<std::vector<T>, std::vector<T>> find_generating_function(std::vector<T> a) {
		auto q = Berlekamp_Massey(a);
		int d = q.size() - 1;
		a.resize(d);
		for(int i = 1; i < (int)q.size(); i++) q[i] *= -1;
		a = atcoder::convolution(a, q);
		a.resize(d);
		return {a, q};
	}
};

/**
 *	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 = 10000;
void main_() {
	LL(k, n);
	VEC(ll, a, k);
	VEC(ll, b, k);
	REP(i, k, sz + 1) {
		ll MAX = -INF;
		REP(j, k) {
			chmax(MAX, min(b[j], a[i - k + j]));
		}
		a.pb(MAX);
	}
	bostan_mori_ll bm(a);
	print(bm.kth_term(n));
}

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

yukicoder

結果

テストケース

ソースコード