#902845 (C++17) No.2423 Merge Stones

提出ソース

結果

問題	No.2423 Merge Stones
ユーザー	nok0
提出日時	2023-08-12 15:02:38
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	TLE
実行時間	-
コード長	12,265 bytes
コンパイル時間	3,219 ms
コンパイル使用メモリ	236,608 KB
実行使用メモリ	294,912 KB
最終ジャッジ日時	2024-11-19 23:00:35
合計ジャッジ時間	179,261 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 152,704 KB
testcase_01	AC	3 ms 10,496 KB
testcase_02	AC	3 ms 10,496 KB
testcase_03	AC	3 ms 152,576 KB
testcase_04	AC	2 ms 10,496 KB
testcase_05	AC	2 ms 152,576 KB
testcase_06	AC	3 ms 10,496 KB
testcase_07	AC	2 ms 152,576 KB
testcase_08	AC	2 ms 10,496 KB
testcase_09	AC	2 ms 152,576 KB
testcase_10	AC	2 ms 10,496 KB
testcase_11	TLE	-
testcase_12	AC	1,982 ms 152,576 KB
testcase_13	AC	1,952 ms 294,784 KB
testcase_14	AC	1,986 ms 152,704 KB
testcase_15	AC	1,886 ms 294,912 KB
testcase_16	AC	1,988 ms 152,704 KB
testcase_17	AC	1,965 ms 294,784 KB
testcase_18	AC	1,913 ms 152,576 KB
testcase_19	AC	1,931 ms 294,912 KB
testcase_20	AC	1,987 ms 147,468 KB
testcase_21	AC	1,962 ms 147,632 KB
testcase_22	AC	2,019 ms 147,692 KB
testcase_23	AC	1,964 ms 147,520 KB
testcase_24	AC	1,992 ms 147,444 KB
testcase_25	AC	2,070 ms 147,588 KB
testcase_26	AC	1,979 ms 147,496 KB
testcase_27	AC	2,001 ms 147,540 KB
testcase_28	AC	2,006 ms 147,328 KB
testcase_29	AC	2,064 ms 147,456 KB
testcase_30	AC	1,995 ms 147,456 KB
testcase_31	AC	2,085 ms 147,456 KB
testcase_32	AC	2,045 ms 147,456 KB
testcase_33	AC	2,032 ms 147,456 KB
testcase_34	AC	1,961 ms 147,448 KB
testcase_35	AC	1,972 ms 147,448 KB
testcase_36	AC	2,031 ms 147,328 KB
testcase_37	AC	2,073 ms 147,456 KB
testcase_38	AC	2,003 ms 147,328 KB
testcase_39	AC	2,058 ms 147,328 KB
testcase_40	AC	1,982 ms 147,328 KB
testcase_41	AC	2,091 ms 147,456 KB
testcase_42	AC	1,966 ms 147,456 KB
testcase_43	AC	1,982 ms 147,328 KB
testcase_44	AC	2,008 ms 147,456 KB
testcase_45	AC	1,985 ms 147,328 KB
testcase_46	AC	1,992 ms 147,456 KB
testcase_47	AC	1,955 ms 147,456 KB
testcase_48	AC	1,940 ms 147,456 KB
testcase_49	AC	2,024 ms 147,328 KB
testcase_50	AC	2,181 ms 147,328 KB
testcase_51	TLE	-
testcase_52	TLE	-
testcase_53	TLE	-
testcase_54	TLE	-
testcase_55	TLE	-
testcase_56	AC	2,010 ms 147,456 KB
testcase_57	AC	1,975 ms 147,328 KB
testcase_58	AC	2,046 ms 147,456 KB
testcase_59	AC	2,002 ms 147,456 KB
testcase_60	AC	1,954 ms 147,456 KB
testcase_61	TLE	-
testcase_62	TLE	-
testcase_63	TLE	-
testcase_64	TLE	-
testcase_65	TLE	-
testcase_66	TLE	-
testcase_67	TLE	-
testcase_68	TLE	-
testcase_69	TLE	-
testcase_70	TLE	-
testcase_71	TLE	-
testcase_72	TLE	-

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

ソースコード

raw source code

#line 1 "j.cpp"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#line 1 "j.cpp"
/**
 *	author: nok0
 *	created: 2023.08.12 13:56:08
**/
#line 1 "/Users/nok0/Documents/Programming/nok0/cftemp.hpp"
#include <bits/stdc++.h>
using namespace std;

#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;
}
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;
}
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 = 1) {
	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;
}
std::vector<std::pair<char, int>> rle(const string &s) {
	int n = s.size();
	std::vector<std::pair<char, int>> ret;
	for(int l = 0; l < n;) {
		int r = l + 1;
		for(; r < n and s[l] == s[r]; r++) {}
		ret.emplace_back(s[l], r - l);
		l = r;
	}
	return ret;
}
template <class T>
std::vector<std::pair<T, int>> rle(const std::vector<T> &v) {
	int n = v.size();
	std::vector<std::pair<T, int>> ret;
	for(int l = 0; l < n;) {
		int r = l + 1;
		for(; r < n and v[l] == v[r]; r++) {}
		ret.emplace_back(v[l], r - l);
		l = r;
	}
	return ret;
}
std::vector<int> iota(int n) {
	std::vector<int> p(n);
	std::iota(p.begin(), p.end(), 0);
	return p;
}
template <class T>
struct cum_vector {
public:
	cum_vector() = default;
	template <class U>
	cum_vector(const std::vector<U> &vec) : cum((int)vec.size() + 1) {
		for(int i = 0; i < (int)vec.size(); i++)
			cum[i + 1] = cum[i] + vec[i];
	}
	T prod(int l, int r) {
		return cum[r] - cum[l];
	}

private:
	std::vector<T> cum;
};

// 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;
	a = (a % mod + mod) % mod;
	while(n) {
		if(n & 1) (ret *= a) %= mod;
		(a *= a) %= mod;
		n >>= 1;
	}
	return ret;
}
template <class T, class F>
T bin_search(T ok, T ng, const F &f) {
	while(abs(ok - ng) > 1) {
		T mid = (ok + ng) >> 1;
		(f(mid) ? ok : ng) = mid;
	}
	return ok;
}
template <class T, class F>
T bin_search(T ok, T ng, const F &f, int loop) {
	for(int i = 0; i < loop; i++) {
		T mid = (ok + ng) / 2;
		(f(mid) ? ok : ng) = mid;
	}
	return ok;
}

// 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 = 1e18;
#pragma endregion

void main_();

int main() {
	main_();
	return 0;
}
#line 6 "j.cpp"

void main_() {
	INT(n, K);
	VEC(int, a, n);
	// V<> a(n, 100);
	// V<> c(n);
	// rep(i, n) c[i] = i % 50 + 1;
	VEC(int, c, n);
	SUB(c);
	array<ll, 50> ar;
	ar.fill(-INF);
	using VA = array<ll, 50>;
	//左　右　全体　内部
	ll res = *max_element(all(a));
	vector<ll> vis((n * 2 + 1) * (n * 2 + 1), -1);
	vector<VA> memo((n * 2 + 1) * (n * 2 + 1), ar);
	auto toint = [&](int l, int r) {
		return r * (n * 2 + 1) + l;
	};

	auto dp = [&](auto dp, int l, int r) -> void {
		auto idx = toint(l, r);
		if(vis[idx] != -1) return;
		if(l >= n) {
			dp(dp, l - n, r - n);
			vis[idx] = 1;
			memo[idx] = memo[toint(l - n, r - n)];
			return;
		}

		auto ret = ar;
		if(r - l == 1) {
			int i = l % n;
			ret[c[i]] = a[i];
			vis[idx] = 1;
			memo[idx] = ret;
			return;
		}
		rep(k, l + 1, r) {
			dp(dp, l, k);
			auto lef = memo[toint(l, k)];
			dp(dp, k, r);
			auto rig = memo[toint(k, r)];
			// ret[0] = lef[0];
			// ret[1] = rig[1];
			// rep(i, 50) {
			// 	if(lef[i] == -INF) continue;
			// 	rep(j, i - K, i + K + 1) {
			// 		if(j >= 0 and j < 50 and rig[0][j] != -INF) {
			// 			chmax(ret[0][i], lef[i] + rig[0][j]);
			// 			chmax(ret[0][j], lef[i] + rig[0][j]);
			// 			chmax(res, ret[0][i]);
			// 		}
			// 	}
			// }
			// rep(i, 50) {
			// 	if(lef[1][i] == -INF) continue;
			// 	rep(j, i - K, i + K + 1) {
			// 		if(j >= 0 and j < 50 and rig[j] != -INF) {
			// 			chmax(ret[1][i], lef[1][i] + rig[j]);
			// 			chmax(ret[1][j], lef[1][i] + rig[j]);
			// 			chmax(res, ret[1][i]);
			// 		}
			// 	}
			// }

			rep(i, 50) {
				if(lef[i] == -INF) continue;
				rep(j, i - K, i + K + 1) {
					if(j >= 0 and j < 50 and rig[j] != -INF) {
						chmax(ret[i], lef[i] + rig[j]);
						chmax(ret[j], lef[i] + rig[j]);
						chmax(res, ret[i]);
					}
				}
			}
		}
		vis[idx] = 1;
		memo[idx] = ret;
		return;
	};

	rep(i, n) {
		dp(dp, i, i + n);
	}

	print(res);
}

yukicoder

結果

テストケース

ソースコード