Submission #998558

#	Time	Username	Problem	Language	Result	Execution time	Memory
998558		LOLOLO	Arcade (NOI20_arcade)	C++14	100 / 100	146 ms	20672 KiB

Arcade

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 5e5 + 10;
int x[N], y[N];

int lcs(vector <int> v) {
    vector <int> cc;
    for (auto x : v) {
        if (sz(cc) == 0 || cc.back() < -x) {
            cc.pb(-x);
        } else {
            int p = lower_bound(all(cc), -x) - cc.begin();
            cc[p] = -x;
        }
    }

    return sz(cc);
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, m;
    cin >> n >> m;

    for (int i = 1; i <= m; i++)
        cin >> x[i];

    for (int i = 1; i <= m; i++)
        cin >> y[i];

    vector <pair <int, int>> save;

    for (int i = 1; i <= m; i++) {
        save.pb({x[i] - y[i], x[i] + y[i]});
    }

    sort(all(save));

    vector <int> lst;
    for (auto x : save) {
        lst.pb(x.s);
    } 

    cout << lcs(lst) << '\n';
    return 0;
}

• 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