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