1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50
| #include<iostream> #include<stdio.h> #include<algorithm> #include<map> #include<queue> #include<vector> #include<cstring> #include<stack> #define mem(ss) memset(ss,0,sizeof(ss)) typedef long long ll; typedef long double ld; typedef __int128 lll; const ll mod=1e9+7; #define io_opt ios::sync_with_stdio(false);cin.tie(0);cout.tie(0) using namespace std; ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);} inline int read(){int data=0;char ch=0;while (ch<'0' || ch>'9') ch=getchar();while (ch>='0' && ch<='9') data=data*10+ch-'0',ch=getchar();return data;} int n,ans; map<int,bool>mp; int a[10020],b[10020]; int main(){ io_opt; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]>>b[i]; } int x1,x2,y1,y2,l,r; for(int i=1;i<=n;i++){ x1=a[i-1],x2=a[i]; y1=b[i-1],y2=b[i]; l=max(x1,y1),r=min(x2,y2); int cur=max(r-l+1,0); if(cur==1){ if(!mp[l]){ ans++; mp[l]=true; } } else if(cur>=2){ if(mp[l]) cur--; if(mp[r]) cur--; ans+=cur; mp[l]=true; mp[r]=true; } } cout<<ans<<endl; return 0; }
|