Submission #1133538

#TimeUsernameProblemLanguageResultExecution timeMemory
1133538MunkhturErdenebatAdvertisement 2 (JOI23_ho_t2)C++20
69 / 100
2094 ms26360 KiB
#include<bits/stdc++.h>
#include<string.h>
#include <algorithm>
#include <stdlib.h>
 #define ll long long
using namespace std;
    ll a,b,c,d,e,f,m,i,j,n,h,g,l,r,ka,p,q,t[500005];
    map<ll,ll> maa,mii,mee;
    vector<ll> vj,vo,vi;
    pair<ll,ll> k[500005];
int main(){
    cin>>a;
    for(i=0 ; i<a ; i++){
        cin>>k[i].second>>k[i].first;
    }
    sort(k,k+a);
    if(k[0].first==k[a-1].first){
        g=1;
        for(i=1 ; i<a ; i++){
            if(k[i].second!=k[i-1].second){
                g++;
            }
        }
        cout<<g;
        return 0;
    }
    g=0;
    for(i=a-1 ; i>=0 ; i--){
        if(maa[i]==0){
            g++;
        }
        else{
            continue;
        }
        for(j=i-1 ; j>=0 ; j--){
            if(maa[j]==0){
                if(k[i].first-k[j].first>=abs(k[i].second-k[j].second)){
                    maa[j]=1;
                }
            }
        }
    }
    cout<<g;
    
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...