이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
const int maxn = 500010;
int n, buttons;
int T[maxn], A[maxn];
pi plots[maxn];
int32_t main() {
FAST
cin >> n >> buttons;
for (int i =0;i<buttons;i++) cin >> T[i];
for (int i =0;i<buttons;i++) cin >> A[i];
for (int i =0;i<buttons;i++) plots[i] = pi(T[i] + A[i], T[i] - A[i]);
sort(plots,plots+buttons);
//for (int i =0;i<buttons;i++) cout << plots[i].f << " " << plots[i].s << "\n";
vector <int> v;
for (int i =0;i<buttons;i++) {
if (v.empty() or v.back() < plots[i].s) v.push_back(-plots[i].s);
else {
int pos = lower_bound(v.begin(),v.end(),-plots[i].s) - v.begin();
v[pos] = -plots[i].s;
}
}
cout << v.size() << "\n";
}
# | 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... |