제출 #1249346

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1249346		Geforgs	Arcade (NOI20_arcade)	C++20	100 / 100	119 ms	8648 KiB

Arcade

#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;

void solve(){
    ll n, m, i, x, y;
    cin>>n>>m;
    vector<pair<ll, ll>> a(m);
    for(i=0;i<m;++i){
        cin>>x;
        a[i] = {x, x};
    }
    for(i=0;i<m;++i){
        cin>>y;
        a[i] = {a[i].first - y, a[i].first + y};
    }
    sort(a);
    reverse(a);
    vector<ll> b;
    for(i=0;i<m;++i){
        x = lower_bound(b.begin(), b.end(), a[i].second) - b.begin();
        if(x == b.size()){
            b.pb(a[i].second);
        }else{
            b[x] = a[i].second;
        }
    }
    cout<<b.size()<<endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    srand(time(nullptr));
    ll t=1;
//    cin>>t;
    for(;t>0;--t){
        solve();
    }
    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