結果
問題 | No.1734 Decreasing Elements |
ユーザー | minato |
提出日時 | 2024-01-07 17:17:30 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 52 ms / 3,000 ms |
コード長 | 15,551 bytes |
コンパイル時間 | 2,165 ms |
コンパイル使用メモリ | 185,616 KB |
実行使用メモリ | 9,720 KB |
最終ジャッジ日時 | 2024-09-27 19:27:04 |
合計ジャッジ時間 | 4,774 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 6 ms
8,844 KB |
testcase_01 | AC | 6 ms
8,888 KB |
testcase_02 | AC | 6 ms
8,804 KB |
testcase_03 | AC | 7 ms
8,892 KB |
testcase_04 | AC | 6 ms
8,852 KB |
testcase_05 | AC | 6 ms
8,740 KB |
testcase_06 | AC | 6 ms
8,952 KB |
testcase_07 | AC | 7 ms
8,852 KB |
testcase_08 | AC | 8 ms
8,928 KB |
testcase_09 | AC | 7 ms
8,856 KB |
testcase_10 | AC | 9 ms
8,872 KB |
testcase_11 | AC | 23 ms
9,244 KB |
testcase_12 | AC | 19 ms
9,092 KB |
testcase_13 | AC | 26 ms
9,248 KB |
testcase_14 | AC | 35 ms
9,612 KB |
testcase_15 | AC | 30 ms
9,188 KB |
testcase_16 | AC | 37 ms
9,608 KB |
testcase_17 | AC | 37 ms
9,660 KB |
testcase_18 | AC | 38 ms
9,544 KB |
testcase_19 | AC | 51 ms
9,604 KB |
testcase_20 | AC | 52 ms
9,720 KB |
testcase_21 | AC | 39 ms
9,628 KB |
testcase_22 | AC | 38 ms
9,632 KB |
testcase_23 | AC | 38 ms
9,544 KB |
testcase_24 | AC | 33 ms
9,700 KB |
testcase_25 | AC | 36 ms
9,604 KB |
testcase_26 | AC | 36 ms
9,704 KB |
ソースコード
#line 1 "library-cpp/other/template.hpp" // clang-format off #include <algorithm> #include <array> #include <bitset> #include <cassert> #include <chrono> #include <cmath> #include <complex> #include <deque> #include <forward_list> #include <fstream> #include <functional> #include <iomanip> #include <ios> #include <iostream> #include <limits> #include <list> #include <map> #include <numeric> #include <optional> #include <queue> #include <random> #include <set> #include <sstream> #include <stack> #include <string> #include <tuple> #include <type_traits> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using uint = unsigned int; using ll = long long; using ull = unsigned long long; using i128 = __int128_t; using ld = long double; using pii = pair<int, int>; using pll = pair<long long, long long>; template <class T> using maxheap = priority_queue<T>; template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>; template <class T> using vec = vector<T>; template <class T> using vvec = vector<vector<T>>; #define OVERLOAD_REP(_1, _2, _3, name, ...) name #define REP0(n) for (auto minato = decay_t<decltype(n)>{}; minato < (n); ++minato) #define REP1(i, n) for (auto i = decay_t<decltype(n)>{}; (i) < (n); (i)++) #define REP2(i, l, r) for (auto i = (l); (i) < (r); (i)++) #define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__) #define OVERLOAD_RREP(_1, _2, _3, name, ...) name #define RREP1(i, n) for (auto i = (n) - 1; (i) >= decay_t<decltype(n)>{}; (i)--) #define RREP2(i, l, r) for (auto i = (r) - 1; (i) >= (l); (i)--) #define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP2, RREP1)(__VA_ARGS__) #define ALL(x) begin(x), end(x) template <class Container> int SZ(const Container& v) { return int(v.size()); } template <class T> void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); } template <class T> T MAX(const vector<T>& v) { return *max_element(v.begin(), v.end()); } template <class T> T MIN(const vector<T>& v) { return *min_element(v.begin(), v.end()); } template <class T> T SUM(const vector<T>& v) { return accumulate(v.begin(), v.end(), T(0)); } template <class T> T ABS(T x) { return max(x, -x); } template <class T1, class T2> bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; } template <class T1, class T2> bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); } int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); } int popcount(ull x) { return __builtin_popcountll(x); } int kthbit(ull x, int k) { return (x >> k) & 1; } constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x - 1) * 10; } template <typename S> void rearrange(const vector<S>& id) { (void)id; } template <typename S, typename T> void rearrange_exec(const vector<S>& id, vector<T>& v) { vector<T> w(v.size()); for (size_t i = 0; i < id.size(); i++) { w[i] = v[id[i]]; } v.swap(w); } template <typename S, typename Head, typename... Tail> void rearrange(const vector<S>& id, Head& a, Tail& ...tail) { rearrange_exec(id, a); rearrange(id, tail...); } istream& operator>>(istream& is, __int128_t& x) { x = 0; string s; is >> s; int n = int(s.size()), it = 0; if (s[0] == '-') it++; for (; it < n; it++) x = (x * 10 + s[it] - '0'); if (s[0] == '-') x = -x; return is; } ostream& operator<<(ostream& os, __int128_t x) { if (x == 0) return os << 0; if (x < 0) os << '-', x = -x; deque<int> deq; while (x) deq.emplace_front(x % 10), x /= 10; for (int e : deq) os << e; return os; } template <class T> vector<T> &operator++(vector<T>& v) { for (auto& e : v) { e++; } return v;} template <class T> vector<T> operator++(vector<T>& v, int) { auto res = v; for (auto& e : v) { e++; } return res; } template <class T> vector<T> &operator--(vector<T>& v) { for (auto& e : v) { e--; } return v; } template <class T> vector<T> operator--(vector<T>& v, int) { auto res = v; for (auto& e : v) { e--; } return res; } template <class T1, class T2> pair<T1, T2> operator-(const pair<T1, T2>& x) { return pair<T1, T2>(-x.first, -x.second); } template <class T1, class T2> pair<T1, T2> operator-(const pair<T1, T2>& x, const pair<T1, T2>& y) { return pair<T1, T2>(x.first - y.first, x.second - y.second); } template <class T1, class T2> pair<T1, T2> operator+(const pair<T1, T2>& x, const pair<T1, T2>& y) { return pair<T1, T2>(x.first + y.first, x.second + y.second); } template <class T1, class T2> pair<T1, T2> operator+=(pair<T1, T2>& l, const pair<T1, T2>& r) { return l = l + r; } template <class T1, class T2> pair<T1, T2> operator-=(pair<T1, T2>& l, const pair<T1, T2>& r) { return l = l - r; } constexpr char ln = '\n'; const string YESNO[2] = {"NO", "YES"}; const string YesNo[2] = {"No", "Yes"}; void YES(bool t = true) { cout << YESNO[t] << "\n"; } void NO(bool t = 1) { YES(!t); } void Yes(bool t = true) { cout << YesNo[t] << "\n"; } void No(bool t = 1) { Yes(!t); } template <class T> void drop(T x) { cout << x << "\n"; exit(0); } #define INT(...) \ int __VA_ARGS__; \ IN(__VA_ARGS__) #define LL(...) \ ll __VA_ARGS__; \ IN(__VA_ARGS__) #define STR(...) \ string __VA_ARGS__; \ IN(__VA_ARGS__) #define CHR(...) \ char __VA_ARGS__; \ IN(__VA_ARGS__) #define LDB(...) \ long double __VA_ARGS__; \ IN(__VA_ARGS__) #define VEC(type, name, size) \ vector<type> name(size); \ IN(name) #define VEC2(type, name1, name2, size) \ vector<type> name1(size), name2(size); \ for (int i = 0; i < size; i++) IN(name1[i], name2[i]) #define VEC3(type, name1, name2, name3, size) \ vector<type> name1(size), name2(size), name3(size); \ for (int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i]) #define VEC4(type, name1, name2, name3, name4, size) \ vector<type> name1(size), name2(size), name3(size), name4(size); \ for (int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]); #define VV(type, name, N, M) \ vector<vector<type>> name(N, vector<type>(M)); \ IN(name) template <class T> void scan(T& a) { cin >> a; } template <class T> void scan(vector<T>& a) { for (auto& i : a) scan(i); } void IN() {} template <class Head, class... Tail> void IN(Head& head, Tail&... tail) { scan(head); IN(tail...); } void print() { cout << "\n"; } template <class T> void print(const vector<T>& v) { for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) { cout << " "; } cout << *it; } print(); } template <class T, class... Args> void print(const T& x, const Args& ... args) { cout << x; if (sizeof...(Args)) cout << " "; print(args...); } #ifdef MINATO_LOCAL template <class T1, class T2> ostream& operator<<(ostream& os, pair<T1, T2> p); template <class ...Args> ostream& operator<<(ostream& os, tuple<Args...> t); template <class T> ostream& operator<<(ostream& os, vector<T> v); template <class T, size_t N> ostream& operator<<(ostream& os, array<T, N> a); template <class T, size_t N> enable_if_t<!is_same_v<char, remove_cv_t<T>>, ostream>& operator<<(ostream& os, T(&a)[N]); template <class Key> ostream& operator<<(ostream& os, set<Key> s); template <class Key, class T> ostream& operator<<(ostream& os, map<Key, T> mp); template <class Key> ostream& operator<<(ostream& os, multiset<Key> s); template <class T> ostream& operator<<(ostream& os, queue<T> q); template <class T> ostream& operator<<(ostream& os, deque<T> q); template <class T> ostream& operator<<(ostream& os, priority_queue<T> q); template <class T> ostream& operator<<(ostream& os, priority_queue<T, vector<T>, greater<T>> q); template <class T1, class T2> ostream& operator<<(ostream& os, pair<T1, T2> p) { return os << "(" << p.first << ", " << p.second << ")"; } template <size_t N, class TUPLE> void debug_tuple(ostream& os, TUPLE _) { (void)os; (void)_; } template <size_t N, class TUPLE, class T, class ...Args> void debug_tuple(ostream &os, TUPLE t) { os << (N == 0 ? "" : ", ") << get<N>(t); debug_tuple<N + 1, TUPLE, Args...>(os, t); } template <class ...Args> ostream& operator<<(ostream& os, tuple<Args...> t) { os << "("; debug_tuple<0, tuple<Args...>, Args...>(os, t); return os << ")"; } string debug_delim(int& i) { return i++ == 0 ? "" : ", "; } #define debug_embrace(x) { int i = 0; os << "{"; { x } return os << "}"; } template <class T> ostream& operator<<(ostream& os, vector<T> v) { debug_embrace( for (T e : v) { os << debug_delim(i) << e; } ) } template <class T, size_t N> ostream& operator<<(ostream& os, array<T, N> a) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) } template <class T, size_t N> enable_if_t<!is_same_v<char, remove_cv_t<T>>, ostream>& operator<<(ostream& os, T(&a)[N]) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) } template <class Key> ostream& operator<<(ostream& os, set<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) } template <class Key, class T> ostream& operator<<(ostream& os, map<Key, T> mp) { debug_embrace( for (auto e : mp) { os << debug_delim(i) << e; }) } template <class Key> ostream& operator<<(ostream& os, multiset<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) } template <class T> ostream& operator<<(ostream& os, queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.front(); } ) } template <class T> ostream& operator<<(ostream& os, deque<T> q) { debug_embrace( for (T e : q) { os << debug_delim(i) << e; } ) } template <class T> ostream& operator<<(ostream& os, priority_queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) } template <class T> ostream& operator<<(ostream& os, priority_queue<T, vector<T>, greater<T>> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) } void debug_out() { cerr << endl; } template <class T, class... Args> void debug_out(const T& x, const Args& ... args) { cerr << " " << x; debug_out(args...); } #define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__) #else #define debug(...) (void(0)) #endif /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// // clang-format on #line 2 "library-cpp/segmenttree/SegmentTree.hpp" #line 5 "library-cpp/segmenttree/SegmentTree.hpp" template <class T, class F> struct SegmentTree { private: F op; T e; int _n, size_, log; std::vector<T> node; public: SegmentTree() { } SegmentTree(const F& op, T e, int n) : SegmentTree(op, e, std::vector<T>(n, e)) { } SegmentTree(const F& op, T e, const std::vector<T>& v) : op(op), e(e), _n(int(v.size())), log(0) { while ((1 << log) < _n) log++; size_ = 1 << log; node = std::vector<T>(2 * size_, e); for (int i = 0; i < _n; i++) node[size_ + i] = v[i]; for (int i = size_ - 1; i >= 1; i--) { update(i); } } int size() const { return _n; } // (0-indexed) void set(int p, T x) { assert(0 <= p && p < _n); p += size_; node[p] = x; for (int i = 1; i <= log; i++) update(p >> i); } // [l, r) (0-indexed) T get(int l, int r) { if (l >= r) return e; T resl = e, resr = e; l += size_; r += size_; while (l < r) { if (l & 1) resl = op(resl, node[l++]); l >>= 1; if (r & 1) resr = op(node[--r], resr); r >>= 1; } return op(resl, resr); } T all_get() { return node[1]; } template <class C> int max_right(int l, const C& check) { assert(0 <= l && l <= _n); assert(check(e)); if (l == _n) return _n; l += size_; T sm = e; do { while (~l & 1) l >>= 1; if (!check(op(sm, node[l]))) { while (l < size_) { l = (2 * l); if (check(op(sm, node[l]))) { sm = op(sm, node[l]); l++; } } return l - size_; } sm = op(sm, node[l]); l++; } while ((l & -l) != l); return _n; } template <class C> int min_left(int r, const C& check) { assert(0 <= r && r <= _n); assert(check(e)); if (r == 0) return 0; r += size_; T sm = e; do { r--; while (r > 1 && (r & 1)) r >>= 1; if (!check(op(node[r], sm))) { while (r < size_) { r = (2 * r + 1); if (check(op(node[r], sm))) { sm = op(node[r], sm); r--; } } return r + 1 - size_; } sm = op(node[r], sm); } while ((r & -r) != r); return 0; } T operator[](int p) { assert(0 <= p && p < _n); return node[p + size_]; } #ifdef MINATO_LOCAL friend ostream& operator<<(ostream& os, SegmentTree r) { std::vector<T> v(r.size()); for (int i = 0; i < r.size(); i++) { v[i] = r[i]; } os << v; return os; } #endif private: void update(int k) { node[k] = op(node[2 * k], node[2 * k + 1]); } }; template <typename T> auto buildPointSetRangeMin(int n, T e) { auto f = [](T a, T b) { return min(a, b); }; SegmentTree seg(f, e, n); return seg; } template <typename T> auto buildPointSetRangeMin(const std::vector<T>& v, T e) { auto f = [](T a, T b) { return min(a, b); }; SegmentTree seg(f, e, v); return seg; } template <typename T> auto buildPointSetRangeMax(int n, T e) { auto f = [](T a, T b) { return max(a, b); }; SegmentTree seg(f, e, n); return seg; } template <typename T> auto buildPointSetRangeMax(const std::vector<T>& v, T e) { auto f = [](T a, T b) { return max(a, b); }; SegmentTree seg(f, e, v); return seg; } #line 3 "A.cpp" void solve() { INT(N); VEC(int, A, N); constexpr int MX = 2e5; constexpr int INF = 1e9; vec<pii> init(MX + 1); rep(i, MX + 1) init[i] = {INF, i}; rrep(i, N) init[A[i]] = {i, A[i]}; constexpr pii e = {INF, INF}; auto seg = buildPointSetRangeMin(init, e); int L = 0, R = MX + 1; int ans = 0; while (true) { auto [id, M] = seg.get(L + 1, R); if (id == INF) break; ans++; int K = M - L; if (K * 2 > R - L) { rep(i, M, R) { int val = seg[i].first; if (val < seg[i - K].first) seg.set(i - K, {val, i - K}); } R = M; } else { rep(i, L, M) { int val = seg[i].first; if (val < seg[i + K].first) seg.set(i + K, {val, i + K}); } L = M; } } cout << ans << endl; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(7); int T = 1; // cin >> T; for (int test_case = 1; test_case <= T; test_case++) { // debug(test_case); solve(); } }