#728775 (C++23(draft)) No.1804 Intersection of LIS

提出ソース

結果

問題	No.1804 Intersection of LIS
ユーザー	👑 hitonanode
提出日時	2022-01-07 21:46:57
言語	C++23(draft) (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	92 ms / 2,000 ms
コード長	6,187 bytes
コンパイル時間	2,016 ms
コンパイル使用メモリ	174,796 KB
実行使用メモリ	12,720 KB
最終ジャッジ日時	2023-08-09 03:09:53
合計ジャッジ時間	5,132 ms
ジャッジサーバーID （参考情報）	judge11 / judge12

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,504 KB
testcase_01	AC	1 ms 4,376 KB
testcase_02	AC	1 ms 4,376 KB
testcase_03	AC	78 ms 12,516 KB
testcase_04	AC	77 ms 12,568 KB
testcase_05	AC	76 ms 12,528 KB
testcase_06	AC	78 ms 12,484 KB
testcase_07	AC	79 ms 12,620 KB
testcase_08	AC	80 ms 12,464 KB
testcase_09	AC	80 ms 12,432 KB
testcase_10	AC	81 ms 12,520 KB
testcase_11	AC	81 ms 12,528 KB
testcase_12	AC	79 ms 12,716 KB
testcase_13	AC	78 ms 12,460 KB
testcase_14	AC	78 ms 12,412 KB
testcase_15	AC	78 ms 12,528 KB
testcase_16	AC	81 ms 12,720 KB
testcase_17	AC	81 ms 12,696 KB
testcase_18	AC	2 ms 4,380 KB
testcase_19	AC	2 ms 4,380 KB
testcase_20	AC	2 ms 4,376 KB
testcase_21	AC	2 ms 4,380 KB
testcase_22	AC	2 ms 4,380 KB
testcase_23	AC	2 ms 4,380 KB
testcase_24	AC	2 ms 4,376 KB
testcase_25	AC	3 ms 4,380 KB
testcase_26	AC	2 ms 4,384 KB
testcase_27	AC	2 ms 4,380 KB
testcase_28	AC	1 ms 4,380 KB
testcase_29	AC	1 ms 4,376 KB
testcase_30	AC	2 ms 4,376 KB
testcase_31	AC	1 ms 4,376 KB
testcase_32	AC	1 ms 4,380 KB
testcase_33	AC	1 ms 4,376 KB
testcase_34	AC	2 ms 4,380 KB
testcase_35	AC	90 ms 12,460 KB
testcase_36	AC	92 ms 12,484 KB
testcase_37	AC	47 ms 12,460 KB
testcase_38	AC	47 ms 12,588 KB
testcase_39	AC	1 ms 4,380 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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 <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 lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr)
#else
#define dbg(x) (x)
#define dbgif(cond, x) 0
#endif



vector<int> solve(vector<int> P) {
    dbg(P);
    const int N = P.size();
    constexpr int INF = 1 << 20;
    vector<int> lbs(N + 10, INF);
    lbs[0] = -1;
    vector<int> arglbs(N + 10, -1);
    vector<int> prv(N, -1);
    REP(i, N) {
        int j = arglb(lbs, P[i]);
        lbs[j] = P[i];
        prv[i] = arglbs[j - 1];
        arglbs[j] = i;
    }
    vector<int> used(N);
    int cur = 0;
    while (lbs[cur] < INF) cur++;
    cur--;
    int k = arglbs[cur];
    while (k >= 0) {
        used[k] = 1;
        k = prv[k];
    }
    return used;
}

int main() {
    int N;
    cin >> N;
    vector<int> P(N);
    cin >> P;
    auto Q = P;
    for (auto &x : P) x--;
    auto v = solve(P);
    for (auto &x : P) x = N - 1 - x;
    reverse(ALL(P));
    auto w = solve(P);
    reverse(ALL(w));
    vector<int> idx;
    REP(i, N) {
        if (v[i] and w[i]) idx.push_back(i);
    }
    cout << idx.size() << '\n';
    for (auto i : idx) cout << Q[i] << ' ';
    cout << '\n';
}

yukicoder

結果

テストケース

ソースコード