Submission #701603

#	Time	Username	Problem	Language	Result	Execution time	Memory
701603		Jarif_Rahman	Arcade (NOI20_arcade)	C++17	100 / 100	274 ms	15872 KiB

Arcade

#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int N, n; cin >> N >> n;
    vector<pair<int, int>> v(n);
    for(int i = 0; i < n; i++) cin >> v[i].f;
    for(int i = 0; i < n; i++) cin >> v[i].sc;

    sort(v.begin(), v.end(), [](pair<int, int> a, pair<int, int> b){
        return make_pair(a.f-a.sc, a.f+a.sc) > make_pair(b.f-b.sc, b.f+b.sc);
    });

    vector<int> o(n);
    for(int i = 0; i < n; i++) o[i] = i;
    sort(o.begin(), o.end(), [&](int a, int b){
        return make_pair(v[a].f+v[a].sc, -a) > make_pair(v[b].f+v[b].sc, -b);
    });

    set<int> s;
    for(int i = 0; i < n; i++){
        if(!s.empty() && *s.begin() < o[i]) s.erase(prev(s.lower_bound(o[i])));
        s.insert(o[i]);
    }

    cout << s.size() << "\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