#503222 (C++14) No.1095 Smallest Kadomatsu Subsequence

• 問題: No.1095 Smallest Kadomatsu Subsequence
• ユーザー: uzzy
• 提出日時: 2020-06-26 21:59:34
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 1,323 bytes
• コンパイル時間: 2,651 ms
• コンパイル使用メモリ: 184,460 KB
• 実行使用メモリ: 5,888 KB
• 最終ジャッジ日時: 2024-07-04 21:05:55
• 合計ジャッジ時間: 4,273 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
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	2 ms; 5,376 KB
testcase_04	WA	-
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	WA	-
testcase_09	AC	2 ms; 5,376 KB
testcase_10	WA	-
testcase_11	AC	2 ms; 5,376 KB
testcase_12	WA	-
testcase_13	AC	3 ms; 5,376 KB
testcase_14	AC	3 ms; 5,376 KB
testcase_15	WA	-
testcase_16	AC	4 ms; 5,376 KB
testcase_17	WA	-
testcase_18	AC	5 ms; 5,376 KB
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	AC	2 ms; 5,376 KB
testcase_23	AC	27 ms; 5,888 KB
testcase_24	AC	26 ms; 5,760 KB
testcase_25	AC	27 ms; 5,760 KB
testcase_26	WA	-
testcase_27	WA	-
testcase_28	AC	26 ms; 5,760 KB
testcase_29	AC	27 ms; 5,888 KB
testcase_30	AC	26 ms; 5,760 KB
testcase_31	AC	28 ms; 5,888 KB
testcase_32	AC	27 ms; 5,888 KB

ソースコード

#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N;
	cin >> N;

	int A[200200];
	rep(i, N) cin >> A[i];

	int L[200200], R[200200];
	int saishou = 1e9;
	rep(i, N) {
		chmin(saishou, A[i]);
		L[i] = saishou;
	}
	saishou = 1e9;
	for (int i = N - 1; i >= 0; i--) {
		chmin(saishou, A[i]);
		R[i] = saishou;
	}
	int kotae = 1e9;
	rep1(i, N - 2) {
		if (A[i] > L[i - 1] && A[i] > R[i + 1]) {
			chmin(kotae, L[i - 1] + A[i] + R[i + 1]);
		}
	}
	int saidai = 0;
	rep(i, N) {
		chmax(saidai, A[i]);
		L[i] = saidai;
	}
	saidai = 0;
	for (int i = N - 1; i >= 0; i--) {
		chmax(saidai, A[i]);
		R[i] = saidai;
	}
	rep1(i, N - 2) {
		if (A[i] < L[i - 1] && A[i] < R[i + 1]) {
			chmin(kotae, L[i - 1] + A[i] + R[i + 1]);
		}
	}

	if (kotae > 5e8) {
		co(-1);
	}
	else co(kotae);

	Would you please return 0;
}