| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1339867 | Luvidi | Arcade (NOI20_arcade) | C++20 | 1094 ms | 1192 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back
void solve() {
int n,m;
cin>>n>>m;
vector<pii> a(m);
for(int i=0;i<m;i++)cin>>a[i].sc;
for(int i=0;i<m;i++)cin>>a[i].fs;
sort(a.begin(),a.end());
int ans=0;
while(!a.empty()){
ans++;
// cout<<ans<<'\n';
vector<pii> a2;
vector<pii> v;
for(auto[x,y]:a){
vector<pii> v2;
bool b=0;
for(auto[x2,y2]:v){
if(y2>y&&!b){
v2.pb({x,y});
b=1;
}
v2.pb({x2,y2});
}
if(!b)v2.pb({x,y});
b=1;
for(int i=0;i+1<v2.size();i++){
b&=v2[i+1].sc-v2[i].sc>=abs(v2[i+1].fs-v2[i].fs);
}
if(b){
// cout<<x<<' '<<y<<'\n';
v=v2;
}else{
a2.pb({x,y});
}
}
a=a2;
}
cout<<ans<<'\n';
}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
solve();
}| # | 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... | ||||
