Submission #1152620

---

Source Code Expand

#include <iostream>
#include <map>
#include <algorithm>

using ll = long long;

std::pair<ll,ll> a[1000000] = {};


using namespace std;
int main(void){
    // Here your code !
    
    ll n,m;
    cin >> n >> m;
    
    for(int i = 0; i < n; i++){
        ll s , t;
        cin >> s >> t;
        
        if(s > t){
            t += m;
        }
        
        a[i].first = t;
        a[i].second = s;
    }
    
    sort(a,a+n);
    
    ll tmp = a[0].second + m;
    ll tmp2 = a[0].first;
    
    ll res = 1;
    
    for(int i = 1; i < n; i++){
        //cout << a[i].first << " " << a[i].second << endl;
        
        if(tmp2 <= a[i].second && tmp >= a[i].first){
            tmp2 = a[i].first;
            
            res++;
        }
    }    
    
    cout << res << endl;
}

Submission Info

Judge Result