【codeforces 777B】Game of Credit Cards
来源:互联网 发布:用户数据挖掘 编辑:程序博客网 时间:2024/04/28 06:39
【题目链接】:http://codeforces.com/contest/777/problem/B
【题意】
等价题意:
两个人都有n个数字,
然后两个人的数字进行比较;
数字小的那个人得到一个嘲讽;
问你如何搞
才能让莫里亚蒂得到的嘲讽最少;
莫里亚蒂得到的嘲讽最多;
【题解】
/* 先考虑莫里亚蒂得到最小的; 先把夏洛克的从小到大排序 然后从小到大处理夏洛克的数字; 对于夏洛克的每一个数字x 尝试用一个>=x的但是最小的数来击败它.然后这个数打上标记; 如果找不到大于等于它的数字,那么就结束; n-i+1就是莫里亚蒂得到的最小数目; 因为夏洛克后面的数字会越来越大的; 对于让夏洛克得到最多嘲讽; 则只要把那个>=x改成>x的就好了; i-1就是夏洛克得到的最多嘲讽个数;*/
【完整代码】
#include <bits/stdc++.h>using namespace std;#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define LL long long#define rep1(i,a,b) for (int i = a;i <= b;i++)#define rep2(i,a,b) for (int i = a;i >= b;i--)#define mp make_pair#define pb push_back#define fi first#define se second#define rei(x) scanf("%d",&x)#define rel(x) scanf("%lld",&x)typedef pair<int, int> pii;typedef pair<LL, LL> pll;const int dx[9] = { 0,1,-1,0,0,-1,-1,1,1 };const int dy[9] = { 0,0,0,-1,1,-1,1,-1,1 };const double pi = acos(-1.0);const int N = 1e3+100;int n;int a[N], b[N];char s[N];bool bo[N];int main(){ //freopen("F:\\rush.txt", "r", stdin); rei(n); scanf("%s", s + 1); rep1(i, 1, n) a[i] = s[i] - '0'; scanf("%s", s + 1); rep1(i, 1, n) b[i] = s[i] - '0'; sort(a + 1, a + 1 + n); int ans1 = 0; rep1(i, 1, n) { int mi = -1; rep1(j,1,n) if (!bo[j] && b[j] >= a[i]) { if (mi == -1) mi = j; else if (b[j] < b[mi]) mi = j; } if (mi == -1) { ans1 = n - i + 1; break; } bo[mi] = true; } memset(bo, false, sizeof bo); int ans2 = n; rep1(i, 1, n) { int mi = -1; rep1(j, 1, n) if (!bo[j] && b[j] > a[i]) { if (mi == -1) mi = j; else if (b[j] < b[mi]) mi = j; } if (mi == -1) { ans2 = i-1; break; } bo[mi] = true; } cout << ans1 << endl; cout << ans2 << endl; return 0;}
0 0
- 【codeforces 777B】Game of Credit Cards
- Codeforces 777B-Game of Credit Cards
- codeforces 777b Game of Credit Cards
- Game of Credit Cards (Codeforces-777B)
- 【CodeForces 777B】Game of Credit Cards(贪心+排序)
- codeforces 777 B. Game of Credit Cards (排序乱搞)
- CodeForces 777B Game of Credit Cards【贪心】
- codeforces 777B Game of Credit Cards (贪心)
- B. Game of Credit Cards
- Codeforces Round #401 (Div. 2) B. Game of Credit Cards
- 777Game of Credit Cards
- Codeforces Round #401 (Div. 2) B. Game of Credit Cards(模拟)
- Codeforces Round #401 (Div. 2)B. Game of Credit Cards(贪心)
- Codeforces Round #401(Div. 2)B. Game of Credit Cards【贪心】
- Codeforces Round #401 (Div. 2), problem: (B) Game of Credit Cards
- codeforces 777 BGame of Credit Cards(贪心)
- cf 777B _ B. Game of Credit Cards (排序比较)
- Codeforces777B Game of Credit Cards
- 欢迎使用CSDN-markdown编辑器
- 详解重写equals()方法就必须重写hashCode()方法的原因
- Qt修炼手册4_信号与槽
- struts2配置文件中标签package标签的属性说明
- mysql学习笔记(一)
- 【codeforces 777B】Game of Credit Cards
- Android中水波纹使用
- 【CodeForces 777A】Shell Game(模拟)
- 双目视觉的标定
- 170224
- SQL高级语句-IN操作符-允许我们在 WHERE 子句中规定多个值。
- 音频自动化测试
- PHP的fsockopen、pfsockopen函数被主机商禁用的解决办法
- IntelliJ IDEA 工具技巧