結果
問題 | No.1095 Smallest Kadomatsu Subsequence |
ユーザー |
|
提出日時 | 2020-06-26 21:57:33 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 346 ms / 2,000 ms |
コード長 | 1,659 bytes |
コンパイル時間 | 1,245 ms |
コンパイル使用メモリ | 131,772 KB |
最終ジャッジ日時 | 2025-01-11 11:23:36 |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:47:21: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 47 | int n; scanf("%d", &n); | ~~~~~^~~~~~~~~~ main.cpp:48:59: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 48 | vector<ll> a(n); for (int i = 0; i < n; i++) scanf("%lld", &a[i]); | ~~~~~^~~~~~~~~~~~~~~
ソースコード
#include <cstdio>#include <iostream>#include <string>#include <sstream>#include <stack>#include <algorithm>#include <cmath>#include <queue>#include <map>#include <set>#include <cstdlib>#include <bitset>#include <tuple>#include <assert.h>#include <deque>#include <bitset>#include <iomanip>#include <limits>#include <chrono>#include <random>#include <array>#include <unordered_map>#include <functional>#include <complex>#include <numeric>template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }constexpr long long MAX = 5100000;constexpr long long INF = 1LL << 60;constexpr int inf = 1000000007;constexpr long long mod = 1000000007LL;//constexpr long long mod = 998244353LL;const long double PI = acos((long double)(-1));using namespace std;typedef unsigned long long ull;typedef long long ll;typedef long double ld;int main(){/*cin.tie(nullptr);ios::sync_with_stdio(false);*/int n; scanf("%d", &n);vector<ll> a(n); for (int i = 0; i < n; i++) scanf("%lld", &a[i]);set<ll> lf, rg;for (int i = 1; i < n; i++) rg.emplace(a[i]);lf.emplace(a[0]);lf.emplace(INF);rg.emplace(INF);ll res = inf;for (int i = 1; i < n - 1; i++) {rg.erase(rg.find(a[i]));{ll mnl = *lf.begin();ll mnr = *rg.begin();if (mnl < a[i] and a[i] > mnr) chmin(res, a[i] + mnl + mnr);}{ll mnl = *lf.lower_bound(a[i]);ll mnr = *rg.lower_bound(a[i]);chmin(res, a[i] + mnl + mnr);}lf.emplace(a[i]);}if (res >= inf) res = -1;cout << res << endl;return 0;}