# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
261321 | Nightlight | Arcade (NOI20_arcade) | C++14 | 291 ms | 16544 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define pii pair<int, int>
using namespace std;
int N;
int P[500005], T[500005];
pii A[500005];
vector<int> LIS;
int main() {
scanf("%d %d", &N, &N);
for(int i = 1; i <= N; i++) scanf("%d", &T[i]);
for(int i = 1; i <= N; i++) {
scanf("%d", &P[i]);
A[i] = make_pair(T[i] + P[i], -(N - (T[i] - P[i])));
}
sort(A + 1, A + N + 1);
LIS.emplace_back(-A[1].second);
for(int i = 2; i <= N; i++) {
A[i].second = -A[i].second;
int pos = lower_bound(LIS.begin(), LIS.end(), A[i].second) - LIS.begin();
if(pos == LIS.size()) LIS.emplace_back(A[i].second);
else LIS[pos] = A[i].second;
}
cout << LIS.size() << "\n";
cin >> N;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |