結果
| 問題 | No.1188 レベルX門松列 |
| ユーザー |
 iiljj
|
| 提出日時 | 2020-08-22 14:46:05 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 8,327 bytes |
| コンパイル時間 | 2,356 ms |
| コンパイル使用メモリ | 210,680 KB |
| 実行使用メモリ | 6,824 KB |
| 最終ジャッジ日時 | 2024-10-15 09:04:02 |
| 合計ジャッジ時間 | 3,246 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 15 ms
6,820 KB |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | AC | 2 ms
6,820 KB |
| testcase_06 | AC | 8 ms
6,816 KB |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | AC | 2 ms
6,820 KB |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | AC | 2 ms
6,820 KB |
| testcase_21 | AC | 2 ms
6,820 KB |
| testcase_22 | AC | 2 ms
6,820 KB |
| testcase_23 | AC | 2 ms
6,820 KB |
ソースコード
/* #region Head */
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;
#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l
constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;
template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
for (T &x : vec) is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
os << "{";
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
return os;
}
template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
is >> pair_var.first >> pair_var.second;
return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
auto itrcp = itr;
if (++itrcp != map_var.end()) os << ", ";
}
return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) {
os << "{";
REPI(itr, map_var) {
auto [key, value] = *itr;
os << "(" << key << ", " << value << ")";
auto itrcp = itr;
if (++itrcp != map_var.end()) os << ", ";
}
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
pq<T> pq_cp(pq_var);
os << "{";
if (!pq_cp.empty()) {
os << pq_cp.top(), pq_cp.pop();
while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
}
return os << "}";
}
// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) DUMPOUT << ", ";
dump_func(move(tail)...);
}
// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
if (comp(xmax, x)) {
xmax = x;
return true;
}
return false;
}
// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
if (comp(x, xmin)) {
xmin = x;
return true;
}
return false;
}
// ローカル用
#define DEBUG_
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
struct AtCoderInitialize {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
AtCoderInitialize() {
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH) cout << unitbuf;
}
} ATCODER_INITIALIZE;
void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }
/* #endregion */
template <typename T> vc<pll> vec_spans(vc<T> &v, function<bool(T, T)> f) {
vc<pll> ret;
ll start = 0;
ll end = 0;
ll sz = SIZE(v);
REP(i, 1, sz) {
if (f(v[i - 1], v[i])) {
end = i;
} else {
if (start < end) ret.emplace_back(start, end);
start = end = i;
}
}
if (start < end) ret.emplace_back(start, end);
return ret;
}
// Problem
void solve() {
ll n;
cin >> n;
vll a(n);
cin >> a;
auto f_inc = [](ll e0, ll e1) -> bool { return e0 < e1; }; // 単調増加
auto f_dec = [](ll e0, ll e1) -> bool { return e0 > e1; }; // 単調増加
vc<pll> spans_inc = vec_spans<ll>(a, f_inc);
vc<pll> spans_dec = vec_spans<ll>(a, f_dec);
ll ma = 0;
ll sz_inc = SIZE(spans_inc), sz_dec = SIZE(spans_dec);
{
// 増加→減少，のパターンを探す
ll ptr_inc = 0, ptr_dec = 0;
while (ptr_inc < sz_inc && ptr_dec < sz_dec) {
// 増加区間の右端と，減少区間の左端が等しいものを探す
while (ptr_inc < sz_inc && spans_inc[ptr_inc].second < spans_dec[ptr_dec].first) ptr_inc++;
while (ptr_dec < sz_dec && spans_inc[ptr_inc].second > spans_dec[ptr_dec].first) ptr_dec++;
if (ptr_inc == sz_inc || ptr_dec == sz_dec) break;
if (spans_inc[ptr_inc].second == spans_dec[ptr_dec].first) {
ll len = min(spans_inc[ptr_inc].second - spans_inc[ptr_inc].first,
spans_dec[ptr_dec].second - spans_dec[ptr_dec].first);
chmax(ma, len);
ptr_dec++;
}
}
}
{
// 減少→増加，のパターンを探す
ll ptr_inc = 0, ptr_dec = 0;
while (ptr_inc < sz_inc && ptr_dec < sz_dec) {
// 減少区間の右端と，増加区間の左端が等しいものを探す
while (ptr_dec < sz_dec && spans_dec[ptr_dec].second < spans_inc[ptr_inc].first) ptr_dec++;
while (ptr_inc < sz_inc && spans_dec[ptr_dec].second > spans_inc[ptr_inc].first) ptr_inc++;
if (ptr_inc == sz_inc || ptr_dec == sz_dec) break;
if (spans_dec[ptr_dec].second == spans_inc[ptr_inc].first) {
ll len = min(spans_inc[ptr_inc].second - spans_inc[ptr_inc].first,
spans_dec[ptr_dec].second - spans_dec[ptr_dec].first);
chmax(ma, len);
ptr_inc++;
}
}
}
cout << ma << endl;
}
// entry point
int main() {
solve();
return 0;
}