제출 #634396

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
634396		Forested	Arcade (NOI20_arcade)	C++17	100 / 100	169 ms	12036 KiB

Arcade

#ifndef LOCAL
#define FAST_IO
#endif

// ===== template.hpp =====
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32) (n); ++i)
#define REP3(i, m, n) for (i32 i = (i32) (m); i < (i32) (n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32) (n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = __uint128_t;
using i32 = signed int;
using i64 = signed long long;
using i128 = __int128_t;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64) x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64) x;
    return os;
}

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ===== template.hpp =====

#ifdef DEBUGF
#include "cpl/template/debug.hpp"
#else
#define DBG(x) (void) 0
#endif

i32 lis(i32 n, const Vec<i32> &a) {
    Vec<i32> dp(n + 1, 2 * INF);
    dp[0] = -2 * INF;
    REP(i, n) {
        *lower_bound(ALL(dp), a[i]) = a[i];
    }
    PER(i, n + 1) {
        if (dp[i] != 2 * INF) {
            return i;
        }
    }
    return 0;
}

int main() {
    i32 n, m;
    cin >> n >> m;
    Vec<i32> t(m), a(m);
    REP(i, m) {
        cin >> t[i];
    }
    REP(i, m) {
        cin >> a[i];
    }
    
    Vec<pair<i32, i32>> evs(m);
    REP(i, m) {
        evs[i].first = a[i] - t[i];
        evs[i].second = a[i] + t[i];
    }
    sort(ALL(evs), [](const pair<i32, i32> &p, const pair<i32, i32> &q) -> bool {
        if (p.first != q.first) {
            return p.first < q.first;
        } else {
            return p.second > q.second;
        }
    });
    Vec<i32> ys(m);
    REP(i, m) {
        ys[i] = evs[i].second;
    }
    
    cout << lis(m, ys) << '\n';
}

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 12 / 12
• Subtask 4: 21 / 21
• Subtask 5: 14 / 14
• Subtask 6: 20 / 20
• Subtask 7: 15 / 15