제출 #757796

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
757796		raysh07	Arcade (NOI20_arcade)	C++17	100 / 100	163 ms	28204 KiB

Arcade

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
int n, m;
const int maxn = 5e5 + 69;

int lis(vector<int> a) {
    vector<int> d(n+1, INF);
    d[0] = -INF;

    for (int i = 0; i < n; i++) {
        int l = upper_bound(d.begin(), d.end(), a[i]) - d.begin();
        if (d[l-1] < a[i] && a[i] < d[l])
            d[l] = a[i];
    }

    int ans = 0;
    for (int l = 0; l <= n; l++) {
        if (d[l] < INF)
            ans = l;
    }
    return ans;
}

void Solve() 
{
    cin>>m>>n;
    pair <int, int> a[maxn];
    for (int i=1; i<=n; i++){
        int x; cin>>x;
        a[i].f += x;
        a[i].s -= x;
    }
    
    for (int i=1; i<=n; i++){
        int x; cin>>x;
        a[i].f += x;
        a[i].s += x;
        a[i].s = -a[i].s;
    }
    
    sort(a+1, a+n+1);
    vector <int> v;
    
    for (int i=1; i<=n; i++){
        v.push_back(-a[i].s);
    }
    
    // for (auto x: v)
    // cout<<x<<" ";
    
    cout<<lis(v)<<"\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    //cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\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