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

• 問題: No.1460 Max of Min
• ユーザー: e869120
• 提出日時: 2021-03-31 21:59:06
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,231 ms / 2,000 ms
• コード長: 1,724 bytes
• コンパイル時間: 955 ms
• コンパイル使用メモリ: 91,556 KB
• 実行使用メモリ: 7,552 KB
• 最終ジャッジ日時: 2024-05-09 07:39:26
• 合計ジャッジ時間: 35,607 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	1,102 ms; 7,424 KB
testcase_04	AC	1,103 ms; 7,424 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	1,193 ms; 7,424 KB
testcase_07	AC	1,231 ms; 7,424 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	1,181 ms; 7,424 KB
testcase_11	AC	1,192 ms; 7,424 KB
testcase_12	AC	124 ms; 5,376 KB
testcase_13	AC	1,068 ms; 7,168 KB
testcase_14	AC	230 ms; 5,376 KB
testcase_15	AC	72 ms; 5,376 KB
testcase_16	AC	967 ms; 6,912 KB
testcase_17	AC	459 ms; 5,504 KB
testcase_18	AC	4 ms; 5,376 KB
testcase_19	AC	356 ms; 5,376 KB
testcase_20	AC	6 ms; 5,376 KB
testcase_21	AC	22 ms; 5,376 KB
testcase_22	AC	388 ms; 5,376 KB
testcase_23	AC	3 ms; 5,376 KB
testcase_24	AC	547 ms; 5,888 KB
testcase_25	AC	3 ms; 5,376 KB
testcase_26	AC	1,182 ms; 7,296 KB
testcase_27	AC	80 ms; 5,376 KB
testcase_28	AC	14 ms; 5,376 KB
testcase_29	AC	499 ms; 5,632 KB
testcase_30	AC	1,057 ms; 7,296 KB
testcase_31	AC	410 ms; 5,376 KB
testcase_32	AC	14 ms; 5,376 KB
testcase_33	AC	4 ms; 5,376 KB
testcase_34	AC	10 ms; 5,376 KB
testcase_35	AC	4 ms; 5,376 KB
testcase_36	AC	2 ms; 5,376 KB
testcase_37	AC	7 ms; 5,376 KB
testcase_38	AC	6 ms; 5,376 KB
testcase_39	AC	10 ms; 5,376 KB
testcase_40	AC	9 ms; 5,376 KB
testcase_41	AC	6 ms; 5,376 KB
testcase_42	AC	4 ms; 5,376 KB
testcase_43	AC	250 ms; 5,376 KB
testcase_44	AC	394 ms; 5,376 KB
testcase_45	AC	7 ms; 5,376 KB
testcase_46	AC	69 ms; 5,376 KB
testcase_47	AC	74 ms; 5,376 KB
testcase_48	AC	741 ms; 6,144 KB
testcase_49	AC	387 ms; 5,376 KB
testcase_50	AC	6 ms; 5,376 KB
testcase_51	AC	285 ms; 5,376 KB
testcase_52	AC	48 ms; 5,376 KB
testcase_53	AC	7 ms; 5,376 KB
testcase_54	AC	8 ms; 5,376 KB
testcase_55	AC	656 ms; 5,632 KB
testcase_56	AC	8 ms; 5,376 KB
testcase_57	AC	70 ms; 5,376 KB
testcase_58	AC	1,226 ms; 7,424 KB
testcase_59	AC	47 ms; 5,376 KB
testcase_60	AC	86 ms; 5,376 KB
testcase_61	AC	9 ms; 5,376 KB
testcase_62	AC	9 ms; 5,376 KB
testcase_63	AC	6 ms; 5,376 KB
testcase_64	AC	6 ms; 5,376 KB
testcase_65	AC	1,114 ms; 7,168 KB
testcase_66	AC	9 ms; 5,376 KB
testcase_67	AC	7 ms; 5,376 KB
testcase_68	AC	120 ms; 5,376 KB
testcase_69	AC	36 ms; 5,376 KB
testcase_70	AC	15 ms; 5,376 KB
testcase_71	AC	466 ms; 5,376 KB
testcase_72	AC	9 ms; 5,376 KB
testcase_73	AC	8 ms; 5,376 KB
testcase_74	AC	8 ms; 5,376 KB
testcase_75	AC	8 ms; 5,376 KB
testcase_76	AC	7 ms; 5,376 KB
testcase_77	AC	7 ms; 5,376 KB
testcase_78	AC	6 ms; 5,376 KB
testcase_79	AC	7 ms; 5,376 KB
testcase_80	AC	7 ms; 5,376 KB
testcase_81	AC	7 ms; 5,376 KB
testcase_82	AC	7 ms; 5,376 KB
testcase_83	AC	7 ms; 5,376 KB
testcase_84	AC	1,176 ms; 7,552 KB
testcase_85	AC	1,148 ms; 7,296 KB
testcase_86	AC	1,178 ms; 7,296 KB
testcase_87	AC	1,181 ms; 7,424 KB
testcase_88	AC	1,172 ms; 7,552 KB
testcase_89	AC	1,163 ms; 7,424 KB
testcase_90	AC	1,157 ms; 7,296 KB
testcase_91	AC	1,206 ms; 7,424 KB
testcase_92	AC	1,209 ms; 7,424 KB
testcase_93	AC	1,147 ms; 7,424 KB

ソースコード

#include <iostream>
#include <map>
#include <ctime>
#include <cmath>
#include <queue>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)

int K;
long long N;
int A[1 << 22], B[1 << 22], C[1 << 22];
long long QA[1 << 22], QB[1 << 22];

int main() {
	// Crazy Solution
	// Step #1. 入力
	cin >> K >> N;
	for (int i = 0; i < K; i++) cin >> QA[i];
	for (int i = 0; i < K; i++) cin >> QB[i];

	// Step #2. 座標圧縮
	vector<long long> X;
	for (int i = 0; i < K; i++) X.push_back(QA[i]);
	for (int i = 0; i < K; i++) X.push_back(QB[i]);
	sort(X.begin(), X.end());
	X.erase(unique(X.begin(), X.end()), X.end());
	for (int i = 0; i < K; i++) A[i] = lower_bound(X.begin(), X.end(), QA[i]) - X.begin();
	for (int i = 0; i < K; i++) B[i] = lower_bound(X.begin(), X.end(), QB[i]) - X.begin();
	for (int i = 0; i < K; i++) C[K - i] = B[i];

	// Step #3. 愚直解
	long long rem = min(N, 1LL * K * K);
	for (int i = K; i <= rem; i++) A[i] = -1;
	for (int i = 0; i <= K; i++) {
		for (int j = 1; j <= K; j++) {
			if (i + j < K) continue;
			A[i + j] = max(A[i + j], min(A[i], C[j]));
		}
	}
	for (int i = K; i <= rem; i++) {
		for (int j = 1; j <= K; j++) {
			A[i + j] = max(A[i + j], min(A[i], C[j]));
		}
	}
	if (rem == N) {
		cout << X[A[N]] << endl;
		return 0;
	}
	
	// Step #4. 周期を見る
	long long pr = -1;
	for (long long i = rem - 1; i >= K; i--) {
		bool flag = false;
		for (int j = 0; j < K; j++) {
			if (A[rem - K + j] != A[i - K + j]) { flag = true; break; }
		}
		if (flag == false) { pr = rem - i; break; }
	}
	
	// Step #5. 答えを出力
	long long idx = (rem - pr) + (N - rem) % pr;
	cout << X[A[idx]] << endl;
	return 0;
}