This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
using ll = long long ;
using pii = pair<ll , ll> ;
using i3 = tuple<ll , ll , ll> ;
const int N = 1e5+5 ;
int n , m , cnt , ans ;
int l , r ;
int qs[N] ;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> l >> r ;
for(int i=1;i<=r;i++){
int x , y ; cin >> x >> y ;
int st = l - y + 1 , ed = y ;
if(st <= ed){
qs[st]++ , qs[min(ed+1 , l+1)]-- ;
}
}
for(int i=1;i<=l;i++){
qs[i] += qs[i-1] ;
if(qs[i] > 0) ans++ ;
}
cout << ans ;
}
# | 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... |