cf-History

C. History

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Polycarpus likes studying at school a lot and he is always diligent about his homework. Polycarpus has never had any problems with natural sciences as his great-great-grandfather was the great physicist Seinstein. On the other hand though, Polycarpus has never had an easy time with history.

Everybody knows that the World history encompasses exactly n events: the i-th event had continued from the year a_i to the year b_i inclusive (a_i < b_i). Polycarpus easily learned the dates when each of n events started and ended (Polycarpus inherited excellent memory from his great-great-granddad). But the teacher gave him a more complicated task: Polycaprus should know when all events began and ended and he should also find out for each event whether it includes another event. Polycarpus' teacher thinks that an event j includes an event i if a_j < a_i and b_i < b_j. Your task is simpler: find the number of events that are included in some other event.

Input

The first input line contains integer n (1 ≤ n ≤ 10⁵) which represents the number of events. Next n lines contain descriptions of the historical events, one event per line. The i + 1 line contains two integers a_i and b_i (1 ≤ a_i < b_i ≤ 10⁹) — the beginning and the end of the i-th event. No two events start or finish in the same year, that is, a_i ≠ a_j, a_i ≠ b_j, b_i ≠ a_j, b_i ≠ b_j for all i, j (where i ≠ j). Events are given in arbitrary order.

Output

Print the only integer — the answer to the problem.

Sample test(s)

Input

5
1 10
2 9
3 8
4 7

Output

4

Input

5
1 100
2 50
51 99
52 98
10 60
第一次做cf感觉题目还是比较好的，题意是给出n个历史事件的开始和结束时间，求出满足一个事件在其他任一一个事件发生之内的事件的个数(n<10^5)

View Code

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <algorithm>
 4 #include <cstring>
 5 #include <cstdlib>
 6 
 7 using namespace std;
 8 
 9 const int N=1000010;
10 struct node
11 {
12     int s,e;
13 }f[N];
14 
15 int cmp(const void *a,const void *b)
16 {
17     struct node *c=(struct node *)a;
18     struct node *d=(struct node *)b;
19     return c->s - d->s;
20 }
21 int table[N],n,used[N];
22 int find(int key)
23 {
24     int l=0,r=n-1;
25     while(l<=r)
26     {
27         int mid=(l+r)>>1;
28         if(key==table[mid]) return mid;
29         else if(key<table[mid])
30            r=mid-1;
31         else
32            l=mid+1;
33     }
34 }
35 
36 int main()
37 {
38 
39     while(scanf("%d",&n)!=EOF)
40     {
41         for(int i=0;i<n;i++)
42         {
43            scanf("%d%d",&f[i].s,&f[i].e);
44            table[i]=f[i].e;
45         }
46         qsort(f,n,sizeof(f[0]),cmp);
47         sort(table,table+n);
48         memset(used,0,sizeof(used));
49         int ans=0;
50         int k,pre=n-1;
51         for(int i=n-1;i>0;i--)
52          {
53              k=pre;
54              while(used[k]==1) k--;
55              if(f[i].e<table[k]) ans++;
56              int pos=find(f[i].e);
57              used[pos]=1;
58              pre=k;
59          }
60         printf("%d\n",ans);
61     }
62     return 0;
63 }

另外一个题简单题he sequence of n integers is called a permutation if it contains all integers from 1 to n exactly once.算作日常积累吧

 

转载于:https://www.cnblogs.com/one--world--one--dream/archive/2011/12/17/2291152.html