fork download
  1. #include <bits/stdc++.h>//zero a679
  2. using namespace std;
  3.  
  4. const int MaxN=3e5;
  5. int N;
  6. int s[MaxN];
  7. int e[MaxN];
  8.  
  9. int main() {
  10. for(int t=1;cin>>N;t++){
  11. for(int n=0;n<N;n++)
  12. cin>>s[n]>>e[n];
  13. sort(s,s+N);
  14. sort(e,e+N);
  15. int ans=N*(N-1)/2;//Cn取2
  16. for(int m=0,n=0;n<N;n++){//m終點 n起點
  17. while(m<N && e[m]<=s[n])
  18. m+=1;
  19. ans-=m;
  20. }
  21. cout<<"Case "<<t<<": "<<ans<<endl;
  22. }
  23. }
Success #stdin #stdout 0.01s 5284KB
stdin
2
0 10
10 20
2
0 10
5 8
2
0 10
5 20
2
0 10
-5 5
2
0 10
0 10
2
0 10
5 10
5
1 5
1 5
3 10
3 10
3 10
stdout
Case 1: 0
Case 2: 1
Case 3: 1
Case 4: 1
Case 5: 1
Case 6: 1
Case 7: 10