zoukankan      html  css  js  c++  java
  • UVA LIVE 7146 Defeat the Enemy

    这个题跟codeforces 556 D Case of Fugitive思路一样

    关于codeforces 556 D Case of Fugitive的做法的链接http://blog.csdn.net/stl112514/article/details/46868749


    题意大概我方有n个军队,敌方有m个军队。军队有两个属性:攻击力和防御力

    一个军队能打败还有一个军队的条件:一军队攻击力不低于还有一个军队防御力


    大概是2014上海区域赛最简单的一个题?


    #include<map>
    #include<string>
    #include<cstring>
    #include<cstdio>
    #include<cstdlib>
    #include<cmath>
    #include<queue>
    #include<vector>
    #include<iostream>
    #include<algorithm>
    #include<bitset>
    #include<climits>
    #include<list>
    #include<iomanip>
    #include<stack>
    #include<set>
    using namespace std;
    struct Tr
    {
    	int at,df;
    	bool operator <(Tr one)const
    	{
    		return df<one.df;
    	}
    }gd[int(1e5)+10],bd[int(1e5)+10];
    bool cmp(Tr one,Tr two)
    {
    	return one.at>two.at;
    }
    bool cmp1(Tr one,Tr two)
    {
    	return one.df>two.df;
    }
    int main()
    {
    	int T;
    	cin>>T;
    	for(int cs=1;cs<=T;cs++)
    	{
    		int n,m;
    		cin>>n>>m;
    		for(int i=0;i<n;i++)
    			cin>>gd[i].at>>gd[i].df;
    		for(int i=0;i<m;i++)
    			cin>>bd[i].at>>bd[i].df;
    		sort(gd,gd+n,cmp);
    		sort(bd,bd+m,cmp1);
    		map<Tr,int>mp;
    		int ans=0;
    		for(int i=0,j=0;i<m;i++)
    		{
    			while(j<n&&gd[j].at>=bd[i].df)
    				mp[gd[j++]]++;
    			if(mp.empty())
    			{
    				ans=-1;
    				break;
    			}
    			map<Tr,int>::iterator it;	
    			swap(bd[i].at,bd[i].df);
    			it=mp.upper_bound(bd[i]);
    			swap(bd[i].at,bd[i].df);
    			if(it==mp.end())
    				it=mp.begin();
    			Tr t=it->first;
    			it->second--;
    			if(it->second==0)
    				mp.erase(it);
    			if(t.at<bd[i].df)
    			{
    				ans=-1;
    				break;
    			}
    			if(t.df<=bd[i].at)
    				ans++;	
    		}
    		if(ans!=-1)
    			ans=n-ans;
    		printf("Case #%d: %d
    ",cs,ans);
    	}
    	return 0;
    }


    Time Limit:3000MS

    7146 Defeat The Enemy
    Long long ago there is a strong tribe living on the earth. They always have wars and eonquer others.
    One day, there is another tribe become their target. The strong tribe has decide to terminate them!!!
    There are m villages in the other tribe. Each village contains a troop with attack power EAttacki
    ,
    and defense power EDefensei
    . Our tribe has n troops to attack the enemy. Each troop also has the
    attack power Attacki
    , and defense power Defensei
    . We can use at most one troop to attack one enemy
    village and a troop can only be used to attack only one enemy village. Even if a troop survives an
    attack, it can’t be used again in another attack.
    The battle between 2 troops are really simple. The troops use their attack power to attack against
    the other troop simultaneously. If a troop’s defense power is less than or equal to the other troop’s
    attack power, it will be destroyed. It’s possible that both troops survive or destroy.
    The main target of our tribe is to destroy all the enemy troops. Also, our tribe would like to have
    most number of troops survive in this war.
    Input
    The first line of the input gives the number of test cases, T. T test cases follow. Each test case start
    with 2 numbers n and m, the number of our troops and the number of enemy villages. n lines follow,
    each with Attacki and Defensei
    , the attack power and defense power of our troops. The next m lines
    describe the enemy troops. Each line consist of EAttacki and EDefensei
    , the attack power and defense
    power of enemy troops
    Output
    For each test ease, output one line containing ‘Case #x: y’, where x is the test case number (starting
    from 1) and y is the max number of survive troops of our tribe. If it‘s impossible to destroy all enemy
    troops, output ‘-1’ instead.
    Limits:
    1 ≤ T ≤ 100,
    1 ≤ n, m ≤ 105
    ,
    1 ≤ Attacki
    , Defensei
    , EAttacki
    , EDefensei ≤ 109
    ,
    Sample Input
    2
    3 2
    5 7
    7 3
    1 2
    4 4
    2 2
    2 1
    3 4
    1 10
    5 6
    ACM-ICPC Live Archive: 7146 – Defeat The Enemy 2/2
    Sample Output
    Case #1: 3
    Case #2: -1



  • 相关阅读:
    php的函数
    php字符串
    PDA触屏的终极解决办法
    数字万用表 选购指南
    WindowsXp Sp2 英文版
    访问局域网某台电脑时提示:无法访问,你可能没有权限使用网络资源.的解决办法
    中华人民共和国国家标准职工工伤与职业病致残程度鉴定
    删除所有设备驱动的批处理
    如何制作Win XP操作系统映像文件
    使用批处理和devcon.exe来控制 Windows 的设备
  • 原文地址:https://www.cnblogs.com/wzzkaifa/p/7102279.html
Copyright © 2011-2022 走看看