제출 #1339893

#제출 시각아이디문제언어결과실행 시간메모리
1339893LuvidiArcade (NOI20_arcade)C++20
65 / 100
1046 ms2948 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++;
        vector<pii> a2;
        set<pii> s;
        for(auto[x,y]:a){
            bool b=1;
            auto it=s.lower_bound({y,x});
            if(it!=s.end()){
                auto[y2,x2]=*it;
                b&=y2-y>=abs(x2-x);
            }
            if(it!=s.begin()){
                it--;
                auto[y2,x2]=*it;
                b&=y-y2>=abs(x2-x);
            }
            if(b){
                s.insert({y,x});
            }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 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...