#637960 (C++14) No.1460 Max of Min

• 問題: No.1460 Max of Min
• ユーザー: QCFium
• 提出日時: 2021-03-31 22:56:35
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 905 ms / 2,000 ms
• コード長: 1,438 bytes
• コンパイル時間: 1,798 ms
• コンパイル使用メモリ: 176,136 KB
• 実行使用メモリ: 6,948 KB
• 最終ジャッジ日時: 2024-05-09 09:44:36
• 合計ジャッジ時間: 30,680 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	AC	2 ms; 6,940 KB
testcase_02	AC	2 ms; 6,944 KB
testcase_03	AC	8 ms; 6,944 KB
testcase_04	AC	8 ms; 6,940 KB
testcase_05	AC	2 ms; 6,940 KB
testcase_06	AC	6 ms; 6,940 KB
testcase_07	AC	6 ms; 6,940 KB
testcase_08	AC	2 ms; 6,948 KB
testcase_09	AC	1 ms; 6,940 KB
testcase_10	AC	27 ms; 6,940 KB
testcase_11	AC	6 ms; 6,944 KB
testcase_12	AC	3 ms; 6,940 KB
testcase_13	AC	6 ms; 6,940 KB
testcase_14	AC	3 ms; 6,940 KB
testcase_15	AC	3 ms; 6,940 KB
testcase_16	AC	5 ms; 6,944 KB
testcase_17	AC	5 ms; 6,944 KB
testcase_18	AC	2 ms; 6,940 KB
testcase_19	AC	4 ms; 6,940 KB
testcase_20	AC	2 ms; 6,940 KB
testcase_21	AC	3 ms; 6,940 KB
testcase_22	AC	4 ms; 6,944 KB
testcase_23	AC	2 ms; 6,944 KB
testcase_24	AC	5 ms; 6,940 KB
testcase_25	AC	2 ms; 6,944 KB
testcase_26	AC	6 ms; 6,940 KB
testcase_27	AC	3 ms; 6,944 KB
testcase_28	AC	2 ms; 6,940 KB
testcase_29	AC	4 ms; 6,940 KB
testcase_30	AC	5 ms; 6,944 KB
testcase_31	AC	5 ms; 6,944 KB
testcase_32	AC	584 ms; 6,940 KB
testcase_33	AC	128 ms; 6,940 KB
testcase_34	AC	214 ms; 6,940 KB
testcase_35	AC	43 ms; 6,940 KB
testcase_36	AC	2 ms; 6,944 KB
testcase_37	AC	311 ms; 6,944 KB
testcase_38	AC	612 ms; 6,944 KB
testcase_39	AC	126 ms; 6,940 KB
testcase_40	AC	81 ms; 6,944 KB
testcase_41	AC	49 ms; 6,940 KB
testcase_42	AC	20 ms; 6,940 KB
testcase_43	AC	237 ms; 6,944 KB
testcase_44	AC	525 ms; 6,944 KB
testcase_45	AC	5 ms; 6,940 KB
testcase_46	AC	182 ms; 6,940 KB
testcase_47	AC	247 ms; 6,940 KB
testcase_48	AC	571 ms; 6,940 KB
testcase_49	AC	391 ms; 6,940 KB
testcase_50	AC	7 ms; 6,940 KB
testcase_51	AC	288 ms; 6,944 KB
testcase_52	AC	36 ms; 6,944 KB
testcase_53	AC	325 ms; 6,940 KB
testcase_54	AC	774 ms; 6,944 KB
testcase_55	AC	759 ms; 6,944 KB
testcase_56	AC	787 ms; 6,940 KB
testcase_57	AC	807 ms; 6,940 KB
testcase_58	AC	6 ms; 6,944 KB
testcase_59	AC	781 ms; 6,940 KB
testcase_60	AC	774 ms; 6,940 KB
testcase_61	AC	789 ms; 6,940 KB
testcase_62	AC	810 ms; 6,940 KB
testcase_63	AC	3 ms; 6,940 KB
testcase_64	AC	3 ms; 6,940 KB
testcase_65	AC	775 ms; 6,940 KB
testcase_66	AC	791 ms; 6,940 KB
testcase_67	AC	905 ms; 6,944 KB
testcase_68	AC	798 ms; 6,944 KB
testcase_69	AC	824 ms; 6,944 KB
testcase_70	AC	799 ms; 6,944 KB
testcase_71	AC	791 ms; 6,944 KB
testcase_72	AC	775 ms; 6,944 KB
testcase_73	AC	765 ms; 6,944 KB
testcase_74	AC	761 ms; 6,940 KB
testcase_75	AC	802 ms; 6,940 KB
testcase_76	AC	779 ms; 6,940 KB
testcase_77	AC	802 ms; 6,944 KB
testcase_78	AC	801 ms; 6,940 KB
testcase_79	AC	775 ms; 6,940 KB
testcase_80	AC	831 ms; 6,940 KB
testcase_81	AC	766 ms; 6,940 KB
testcase_82	AC	816 ms; 6,940 KB
testcase_83	AC	861 ms; 6,940 KB
testcase_84	AC	25 ms; 6,940 KB
testcase_85	AC	26 ms; 6,940 KB
testcase_86	AC	26 ms; 6,944 KB
testcase_87	AC	27 ms; 6,944 KB
testcase_88	AC	26 ms; 6,940 KB
testcase_89	AC	28 ms; 6,940 KB
testcase_90	AC	27 ms; 6,944 KB
testcase_91	AC	28 ms; 6,944 KB
testcase_92	AC	27 ms; 6,940 KB
testcase_93	AC	26 ms; 6,944 KB

ソースコード

#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}


int gcd(int a, int b) {
	while (a && b) {
		if (a > b) a %= b;
		else b %= a;
	}
	return a + b;
}

int main() {
	int k = ri();
	int64_t n;
	std::cin >> n;
	std::vector<int64_t> a(k + k);
	for (auto &i : a) std::cin >> i;
	std::reverse(a.begin() + k, a.end());
	
	if (n < k) {
		printf("%" PRId64 "\n", a[n]);
		return 0;
	}
	
	int threashold = k * k + k;
	
	int index[k + k];
	std::iota(index, index + k + k, 0);
	std::sort(index, index + k + k, [&] (int i, int j) { return a[i] > a[j]; });
	
	int l = 0;
	int r = k + k;
	while (r - l > 1) {
		int m = l + ((r - l) >> 1);
		
		std::vector<int> start;
		std::vector<int> move;
		for (int i = 0; i < m; i++) {
			if (index[i] < k) start.push_back(index[i]);
			else move.push_back(index[i] - k + 1);
		}
		
		bool ok = false;
		if (!move.size()) ok = false;
		else if (n > threashold) {
			int g = 0;
			for (auto j : move) g = gcd(g, j);
			for (auto i : start) for (auto j : move) if (i + j >= k && (n - i - j) % g == 0) ok = true;
		} else {
			bool dp[threashold + 1];
			memset(dp, 0, sizeof(dp));
			for (auto i : start) dp[i] = true;
			for (int i = 0; i < threashold; i++) {
				if (!dp[i]) continue;
				for (auto j : move) if (i + j <= threashold && i + j >= k) dp[i + j] = true;
			}
			if (dp[n]) ok = true;
		}
		if (ok) r = m;
		else l = m;
	}
	printf("%" PRId64 "\n", a[index[l]]);
	
	return 0;
}