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

• 問題: No.1460 Max of Min
• ユーザー: QCFium
• 提出日時: 2021-03-31 22:50:50
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: TLE
• 実行時間: -
• コード長: 1,355 bytes
• コンパイル時間: 2,013 ms
• コンパイル使用メモリ: 178,992 KB
• 実行使用メモリ: 6,948 KB
• 最終ジャッジ日時: 2024-05-09 09:32:36
• 合計ジャッジ時間: 9,477 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,820 KB
testcase_01	AC	2 ms; 6,940 KB
testcase_02	AC	2 ms; 6,944 KB
testcase_03	AC	9 ms; 6,944 KB
testcase_04	AC	8 ms; 6,940 KB
testcase_05	AC	2 ms; 6,940 KB
testcase_06	AC	4 ms; 6,940 KB
testcase_07	AC	4 ms; 6,944 KB
testcase_08	AC	2 ms; 6,944 KB
testcase_09	AC	1 ms; 6,940 KB
testcase_10	AC	771 ms; 6,944 KB
testcase_11	AC	3 ms; 6,944 KB
testcase_12	AC	3 ms; 6,944 KB
testcase_13	AC	4 ms; 6,940 KB
testcase_14	AC	3 ms; 6,944 KB
testcase_15	AC	3 ms; 6,940 KB
testcase_16	AC	4 ms; 6,944 KB
testcase_17	AC	3 ms; 6,940 KB
testcase_18	AC	2 ms; 6,944 KB
testcase_19	AC	3 ms; 6,940 KB
testcase_20	AC	2 ms; 6,944 KB
testcase_21	AC	2 ms; 6,940 KB
testcase_22	AC	3 ms; 6,940 KB
testcase_23	AC	2 ms; 6,940 KB
testcase_24	AC	3 ms; 6,940 KB
testcase_25	AC	2 ms; 6,940 KB
testcase_26	AC	3 ms; 6,944 KB
testcase_27	AC	3 ms; 6,940 KB
testcase_28	AC	3 ms; 6,944 KB
testcase_29	AC	3 ms; 6,940 KB
testcase_30	AC	3 ms; 6,940 KB
testcase_31	AC	2 ms; 6,940 KB
testcase_32	AC	31 ms; 6,940 KB
testcase_33	AC	148 ms; 6,940 KB
testcase_34	AC	16 ms; 6,940 KB
testcase_35	AC	5 ms; 6,940 KB
testcase_36	AC	2 ms; 6,940 KB
testcase_37	AC	13 ms; 6,940 KB
testcase_38	AC	186 ms; 6,940 KB
testcase_39	AC	5 ms; 6,940 KB
testcase_40	AC	8 ms; 6,940 KB
testcase_41	AC	5 ms; 6,944 KB
testcase_42	AC	5 ms; 6,940 KB
testcase_43	AC	7 ms; 6,944 KB
testcase_44	AC	10 ms; 6,940 KB
testcase_45	AC	2 ms; 6,940 KB
testcase_46	AC	5 ms; 6,944 KB
testcase_47	AC	5 ms; 6,944 KB
testcase_48	AC	11 ms; 6,940 KB
testcase_49	AC	23 ms; 6,940 KB
testcase_50	AC	2 ms; 6,940 KB
testcase_51	AC	7 ms; 6,944 KB
testcase_52	AC	3 ms; 6,940 KB
testcase_53	AC	20 ms; 6,940 KB
testcase_54	AC	127 ms; 6,944 KB
testcase_55	AC	34 ms; 6,940 KB
testcase_56	AC	412 ms; 6,940 KB
testcase_57	AC	14 ms; 6,940 KB
testcase_58	AC	3 ms; 6,940 KB
testcase_59	AC	22 ms; 6,944 KB
testcase_60	AC	34 ms; 6,940 KB
testcase_61	AC	109 ms; 6,940 KB
testcase_62	AC	40 ms; 6,940 KB
testcase_63	AC	3 ms; 6,944 KB
testcase_64	AC	3 ms; 6,940 KB
testcase_65	AC	18 ms; 6,940 KB
testcase_66	AC	52 ms; 6,940 KB
testcase_67	TLE	-
testcase_68	AC	13 ms; 6,940 KB
testcase_69	AC	33 ms; 6,944 KB
testcase_70	AC	69 ms; 6,940 KB
testcase_71	AC	11 ms; 6,944 KB
testcase_72	AC	17 ms; 6,944 KB
testcase_73	AC	299 ms; 6,948 KB
testcase_74	AC	34 ms; 6,944 KB
testcase_75	AC	427 ms; 6,944 KB
testcase_76	AC	108 ms; 6,944 KB
testcase_77	AC	121 ms; 6,944 KB
testcase_78	AC	316 ms; 6,948 KB
testcase_79	AC	39 ms; 6,944 KB
testcase_80	AC	968 ms; 6,944 KB
testcase_81	AC	322 ms; 6,944 KB
testcase_82	AC	31 ms; 6,940 KB
testcase_83	AC	1,249 ms; 6,940 KB
testcase_84	AC	735 ms; 6,944 KB
testcase_85	AC	729 ms; 6,948 KB
testcase_86	AC	723 ms; 6,944 KB
testcase_87	AC	745 ms; 6,940 KB
testcase_88	AC	756 ms; 6,940 KB
testcase_89	AC	728 ms; 6,940 KB
testcase_90	AC	711 ms; 6,940 KB
testcase_91	AC	749 ms; 6,944 KB
testcase_92	AC	776 ms; 6,944 KB
testcase_93	AC	737 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]; });
	
	std::set<int> start;
	std::set<int> move;
	for (auto i : index) {
		if (i < k) start.insert(i);
		else move.insert(i - k + 1);
		
		if (!move.size()) continue;
		
		int g = 0;
		for (auto j : move) g = gcd(g, j);
		
		// std::cerr << "added " << i << std::endl;
		bool ok = false;
		if (n > threashold) {
			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) {
			printf("%" PRId64 "\n", a[i]);
			return 0;
		}
	}
	assert(0);
	
	return 0;
}