nyoj364田忌赛马

2024-02-16 11:38
文章标签 田忌赛马 nyoj364

本文主要是介绍nyoj364田忌赛马,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!

田忌赛马

时间限制: 3000 ms  |  内存限制: 65535 KB
难度: 3
描述
Here is a famous story in Chinese history.

"That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play horse racing with the king and others."

"Both of Tian and the king have three horses in different classes, namely, regular, plus, and super. The rule is to have three rounds in a match; each of the horses must be used in one round. The winner of a single round takes two hundred silver dollars from the loser."

"Being the most powerful man in the country, the king has so nice horses that in each class his horse is better than Tian's. As a result, each time the king takes six hundred silver dollars from Tian."

"Tian Ji was not happy about that, until he met Sun Bin, one of the most famous generals in Chinese history. Using a little trick due to Sun, Tian Ji brought home two hundred silver dollars and such a grace in the next match."

"It was a rather simple trick. Using his regular class horse race against the super class from the king, they will certainly lose that round. But then his plus beat the king's regular, and his super beat the king's plus. What a simple trick. And how do you think of Tian Ji, the high ranked official in China?"

Were Tian Ji lives in nowadays, he will certainly laugh at himself. Even more, were he sitting in the ACM contest right now, he may discover that the horse racing problem can be simply viewed as finding the maximum matching in a bipartite graph. Draw Tian's horses on one side, and the king's horses on the other. Whenever one of Tian's horses can beat one from the king, we draw an edge between them, meaning we wish to establish this pair. Then, the problem of winning as many rounds as possible is just to find the maximum matching in this graph. If there are ties, the problem becomes more complicated, he needs to assign weights 0, 1, or -1 to all the possible edges, and find a maximum weighted perfect matching...

However, the horse racing problem is a very special case of bipartite matching. The graph is decided by the speed of the horses --- a vertex of higher speed always beat a vertex of lower speed. In this case, the weighted bipartite matching algorithm is a too advanced tool to deal with the problem.

In this problem, you are asked to write a program to solve this special case of matching problem.
输入
The input consists of many test cases. Each case starts with a positive integer n (n <= 1000) on the first line, which is the number of horses on each side. The next n integers on the second line are the speeds of Tian’s horses. Then the next n integers on the third line are the speeds of the king’s horses.
输出
For each input case, output a line containing a single number, which is the maximum money Tian Ji will get, in silver dollars.

样例输入
3
92 83 71
95 87 74
2
20 20
20 20
2
20 19
22 18
样例输出
200
0
0
 
#include<stdio.h>
#include<algorithm>
using namespace std;
bool cmp(int a,int b)
{return a>b;
}
int main()
{int n,i,j,tian[1001],king[1001];int sum,he;while(scanf("%d",&n)!=EOF){sum=0;he=0;for(i=0;i<n;i++){scanf("%d",&tian[i]);}for(i=0;i<n;i++){scanf("%d",&king[i]);}sort(tian,tian+n);sort(king,king+n,cmp);for(i=0;i<n;i++){for(j=0;j<n;j++){if(tian[i]>king[j]&&tian[i]!=0&&king[j]!=0){//慢马能赢得就让它赢,不能赢也要把对手的快马拉下水//如			田忌  71	83   92//			国王	95     87    74//此时,田忌的第一匹马,不大于过往的马,所以,tian[0]=0;king[0]=0;就将国王的快马拉下水了 sum++;tian[i]=0;king[j]=0;break;}}}for(i=0;i<n;i++){for(j=0;j<n;j++){if(tian[i]==king[j]&&tian[i]!=0&&king[j]!=0){he++;tian[i]=0;king[j]=0;break;}}}he=n-sum-he;sum=sum-he;printf("%d\n",sum*200);}return 0;
}
/*
解题思路:
慢马能赢的就让它赢,不能赢得,也要把国王的好马拉下水;
慢慢平手,不要以为平手就可以了,因为后面的队友可以赢这匹马,平手和输结果是一样的,就算输也要把对手的快马拉下水;
如果我方的快马能赢,就没必要牺牲了,要发挥我方快马的才能。 
*/

别人的代码:
#include <stdio.h>
#include <algorithm>
using namespace std;
int T[1002],K[1002],n,win,lose;
void read()
{for(int i=0;i<n;i++)scanf("%d",&T[i]);for(int i=0;i<n;i++)scanf("%d",&K[i]);sort(T,T+n);sort(K,K+n);
}
void race()
{win = lose =0;int t_slow=0,t_fast=n-1;int k_slow=0,k_fast=n-1;while(t_slow <= t_fast){if(T[t_slow] > K[k_slow]){win++;t_slow++;k_slow++;}else if(T[t_slow] < K[k_slow]){lose++;t_slow++;k_fast--;}else{if(T[t_fast] > K[k_fast]){win++;t_fast--;k_fast--;}else{if(T[t_slow]!=K[k_fast])lose++;t_slow++;k_fast--;}/*else if(T[t_fast] < K[k_fast]){lose++;t_slow++;k_fast--;}else{if(T[t_slow]==K[t_fast])break;lose++;t_slow++;k_fast--;}*/}}
}
int main()
{
//freopen("1","r",stdin);
//freopen("2","w",stdout);while(~scanf("%d",&n)){read();race();//printf("win:%d\tlose:%d\n",win,lose);printf("%d\n",200*(win-lose));}return 0;
}


这篇关于nyoj364田忌赛马的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!



http://www.chinasem.cn/article/714418

相关文章

算法打卡——田忌赛马问题

问题简介:就是一个贪心的思想,下面上题目 要求示例输出输入 大体上先比较快马,田的快马与王的快马 其次比较田的慢马与王的慢马, 两处边界比较完全之后可以直接贪心了 几份示例的代码 代码一 #include <bits/stdc++.h>using namespace std;int main() {int n;int tian[2002], qi[2002];while(ci

[GESP202312 四级] 田忌赛马

题目描述 如果一个两位数是素数,且它的数字位置经过对换后仍为素数,则称为绝对素数,例如 1313。给定两个正整数 A,BA,B,请求出大于等于 AA、小于等于 BB 的所有绝对素数。 输入格式 输入 11 行,包含两个正整数 AA 和 BB。保证 10<A<B<10010<A<B<100。 输出格式 若干行,每行一个绝对素数,从小到大输出。 输入输出样例 输入 #1复制 11 20

nyist 364 田忌赛马

田忌赛马 时间限制: 3000 ms  |  内存限制: 65535 KB 难度: 3 描述 Here is a famous story in Chinese history. "That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes

【2024最新华为OD-C/D卷试题汇总】[支持在线评测] 田忌赛马 (200分) - 三语言AC题解(Python/Java/Cpp)

🍭 大家好这里是清隆学长 ,一枚热爱算法的程序员 ✨ 本系列打算持续跟新华为OD-C/D卷的三语言AC题解 💻 ACM银牌🥈| 多次AK大厂笔试 | 编程一对一辅导 👏 感谢大家的订阅➕ 和 喜欢💗 📎在线评测链接 田忌赛马(200分) 🌍 评测功能需要订阅专栏后私信联系清隆解锁~ 文章目录 📎在线评测链接🦄 田忌赛马问题描述输入格式输出格式样例输入 1样例输出

小米用田忌赛马的方式,逼得苹果降价超2000元应对,确实厉害

苹果的iPhone15降价2300多元,成为618的大热门,之前不少人士认为迫使苹果如此大幅度降价的原因是因为另一家手机企业的竞争,而日前有人士认为是小米用田忌赛马的方式,迫使苹果降价应对。 小米这次大幅度降价的手机并非是最新款的小米14,而是小米13,小米13的价格低至2700多元,比定价5999元的iPhone15便宜了3299元,一部iPhone15的定价可以买两部小米13了。 小米13

【华为OD机试-C卷D卷-200分】田忌赛马(C++/Java/Python)

【华为OD机试】-(A卷+B卷+C卷+D卷)-2024真题合集目录 【华为OD机试】-(C卷+D卷)-2024最新真题目录 题目描述 给定两个只包含数字的数组a,b,调整数组 a 里面的数字的顺序,使得尽可能多的a[i] > b[i]。 数组a和b中的数字各不相同。 输出所有可以达到最优结果的a数组的结果。 输入描述 输入的第一行是数组 a 中的数字,其中只包含数字,每两个数字之

[华为OD] C卷 田忌赛马 DFS 200

题目: 给定两个只包含数字的数组a, b,调整数组a里面数字的顺序,使得尽可能多的a[i] >b[i]。 数组a和b中的数字各不相同。 输出所有可以达到最优结果的a数组的数量 输入描述 输入的第一行是数组a中的数字,其中只包含数字,每两个数字之间相隔一个空格,a数组大  小不超过10 输入的第二行是数组b中的数字,其中只包含数字,每两个数字之间相隔一个空格,b数组大  小不超过10

每日OJ题_贪心算法二⑤_力扣870. 优势洗牌(田忌赛马)

目录 力扣870. 优势洗牌(田忌赛马) 解析代码 力扣870. 优势洗牌(田忌赛马) 870. 优势洗牌  难度 中等 给定两个长度相等的数组 nums1 和 nums2,nums1 相对于 nums2 的优势可以用满足 nums1[i] > nums2[i] 的索引 i 的数目来描述。 返回 nums1 的任意排列,使其相对于 nums2 的优势最大化。 示例 1:

华为OD机试真题-田忌赛马-2024年OD统一考试(C卷D卷)

题目描述: 给定两个只包含数字的数组a,b,调整数组 a 里面数字的顺序,使得尽可能多的 a[i] >b[i]。数组  a和 b 中的数字各不相同。 输出所有可以达到最优结果的 a 数组的数量 输入描述: 输入的第一行是数组 a 中的数字,其中只包含数字,每两个数字之间相隔一个空格,a 数组大小不超过 10 输入的第二行是数组 b 中的数字,其中只包含数字,每两个数字之间相隔一个空格,b数组大小

田忌赛马【洛谷P1650】

P1650 田忌赛马 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn) #include<iostream>#include <algorithm>#include<cstdio>#include <map>using namespace std;const int N=1e5+100;int n;map<int,int>a,b;//映射,速度->数量int