Submission #2885252

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int amax[100005];
int bmin[100005];


int main(){
    int n,m;
    int a,b;
    int ans=1;

    cin >> n >> m;
    vector<pair<int,int>> ab(m);

    for(int i=0; i<m; i++){
        cin>>a>>b;
        if(a>b){swap(a,b);}
        ab[i].first=a;
        ab[i].second=b;
    }

    sort(ab.begin(),ab.end());
    amax[0]=ab[0].first;
    bmin[0]=ab[0].second;

    for(int i=1; i<m; i++){
        for(int j=0; j<ans; j++){
            if(bmin[j]>ab[i].first && amax[j]<ab[i].second){
                amax[j] = max(amax[j], ab[i].first);
                bmin[j] = min(bmin[j], ab[i].second);
                break;
            }else if(j==ans-1){
                amax[ans] = ab[i].first;
                bmin[ans] = ab[i].second;
                ans++;
                break;
            }
        }
    }

    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result