HDOJ 1025

Constructing Roads In JGShining's Kingdom

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12519    Accepted Submission(s): 3577

Problem Description

JGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines.

Half of these cities are rich in resource (we call them rich cities) while the others are short of resource (we call them poor cities). Each poor city is short of exactly one kind of resource and also each rich city is rich in exactly one kind of resource. You may assume no two poor cities are short of one same kind of resource and no two rich cities are rich in one same kind of resource. 

With the development of industry, poor cities wanna import resource from rich ones. The roads existed are so small that they're unable to ensure the heavy trucks, so new roads should be built. The poor cities strongly BS each other, so are the rich ones. Poor cities don't wanna build a road with other poor ones, and rich ones also can't abide sharing an end of road with other rich ones. Because of economic benefit, any rich city will be willing to export resource to any poor one.

Rich citis marked from 1 to n are located in Line I and poor ones marked from 1 to n are located in Line II. 

The location of Rich City 1 is on the left of all other cities, Rich City 2 is on the left of all other cities excluding Rich City 1, Rich City 3 is on the right of Rich City 1 and Rich City 2 but on the left of all other cities ... And so as the poor ones. 

But as you know, two crossed roads may cause a lot of traffic accident so JGShining has established a law to forbid constructing crossed roads.

For example, the roads in Figure I are forbidden.



In order to build as many roads as possible, the young and handsome king of the kingdom - JGShining needs your help, please help him. ^_^

 

Input

Each test case will begin with a line containing an integer n(1 ≤ n ≤ 500,000). Then n lines follow. Each line contains two integers p and r which represents that Poor City p needs to import resources from Rich City r. Process to the end of file.

 

Output

For each test case, output the result in the form of sample. 
You should tell JGShining what's the maximal number of road(s) can be built. 

 

Sample Input

   
   
   
   

    
    
    
    2
1 2
2 1
3
1 2
2 3
3 1
   
   
   
   

 

Sample Output

   
   
   
   

    
    
    
    Case 1:
My king, at most 1 road can be built.

Case 2:
My king, at most 2 roads can be built.


    
    
    
    
 
     
 
      Hint 
     
 Huge input, scanf is recommended. 
    
    
    
    
     
   
   
   
   

 

Author

JGShining（极光炫影）

 

一道有点隐晦的LIS ， 看出来这题就不难了，注意二分去做，n^2会TLE，有两个小trick，第一个是每个Case后有一行空行，第二个是road>1时要变成roads。

#include <cstdio>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <map>
#include <string>
#include <stack>
#include <cctype>
#include <vector>
#include <queue>
#include <set>
#include <iomanip>

using namespace std;
//#define Online_Judge
#define outstars cout << "***********************" << endl;
#define clr(a,b) memset(a,b,sizeof(a))
#define lson l , mid  , rt << 1
#define rson mid + 1 , r , rt << 1|1
#define FOR(i , x , n) for(int i = (x) ; i < (n) ; i++)
#define FORR(i , x , n) for(int i = (x) ; i <= (n) ; i++)
#define REP(i , x , n) for(int i = (x) ; i > (n) ; i--)
#define REPP(i ,x , n) for(int i = (x) ; i >= (n) ; i--)

#define mk make_pair
const int inf = 1 << 30;
const int MAXN = 500000 + 150;
const int maxw = 100 + 20;
const int MAXNNODE = 1000 +10;
const long long LLMAX = 0x7fffffffffffffffLL;
const long long LLMIN = 0x8000000000000000LL;
const int INF = 0x7fffffff;
const int IMIN = 0x80000000;
#define eps 1e-8
#define mod 20071027
typedef long long LL;
const double PI = acos(-1.0);
typedef double D;
typedef pair<int , int> pii;
const D e = 2.718281828459;
struct Node
{
    int a , b;
    bool operator < (const Node & rhs)const
    {
        return a < rhs.a;
    }
}num[MAXN];
int dp[MAXN];
int main()
{
    //ios::sync_with_stdio(false);
#ifdef Online_Judge
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif // Online_Judge
    int n;
    int kase =1;
    while(~scanf("%d", & n))
    {
        FOR(i , 0 , n)
        {
            scanf("%d%d" , &num[i].a , & num[i].b);
        }
        sort(num , num + n);
        dp[0] = -1;
        int top = 0;
        FOR(i , 0,  n)
        {
            if(num[i].b > dp[top])
            {
                dp[++top] = num[i].b;
            }
            else
            {
                int R = top , L = 1 ;
                while(L <= R)
                {
                    int mid = (L + R)/ 2;
                    if(num[i].b > dp[mid])L = mid + 1;
                    else R = mid - 1;

                }
                dp[L] = num[i].b;
            }
        }
        if(top == 1)printf("Case %d:\nMy king, at most %d road can be built.\n\n" , kase++ , top);
        else printf("Case %d:\nMy king, at most %d roads can be built.\n\n" , kase++ , top);
    }
    return 0;
}