| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1184428 | 12345678 | Arcade (NOI20_arcade) | C++20 | 116 ms | 8464 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], t[i]-a[i]});
sort(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 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... | ||||
