Submission #1184423

#TimeUsernameProblemLanguageResultExecution timeMemory
118442312345678Arcade (NOI20_arcade)C++20
0 / 100
0 ms320 KiB
#include <bits/stdc++.h>

using namespace std;

const int nx=5e5+5;

int n, t[nx], a[nx];
vector<pair<int, int>> p;
vector<int> v;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>n;
    for (int i=1; i<=n; i++) cin>>t[i];
    for (int i=1; i<=n; i++) cin>>a[i], p.push_back({a[i]+t[i], a[i]-t[i]});
    sort(p.begin(), p.end());
    reverse(p.begin(), p.end());
    for (auto [_, x]:p)
    {
        auto itr=lower_bound(v.begin(), v.end(), x);
        if (itr==v.end()) v.push_back(x);
        else *itr=x;
    }
    cout<<v.size();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...