【codeforces】 472C Design Tutorial: Make It Nondeterministic
来源:互联网 发布:淘宝卖点卡 编辑:程序博客网 时间:2024/05/21 12:39
简单贪心。。。。
#include <iostream> #include <queue> #include <stack> #include <map> #include <set> #include <bitset> #include <cstdio>#include <algorithm>#include <cstring>#include <climits>#include <cstdlib>#include <cmath>#include <time.h>#define maxn 100005#define maxm 40005#define eps 1e-10#define mod 10000007#define INF 1e9#define lowbit(x) (x&(-x))#define mp make_pair#define ls o<<1#define rs o<<1 | 1#define lson o<<1, L, mid #define rson o<<1 | 1, mid+1, R typedef long long LL;typedef unsigned long long ULL;//typedef int LL;using namespace std;LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}//headstruct node{char f[60];char s[60];}name[maxn];int rank[maxn];char now[60];int n;void read(void){for(int i = 1; i <= n; i++) scanf("%s%s", name[i].f, name[i].s);for(int i = 1; i <= n; i++) scanf("%d", &rank[i]);}void work(void){int ok = 1;now[0] = 0;for(int i = 1; i <= n && ok; i++) {int t =rank[i];int a = strcmp(name[t].f, now), b = strcmp(name[t].s, now);if(a > 0 && b > 0) {if(strcmp(name[t].f, name[t].s) > 0) strcpy(now, name[t].s);else strcpy(now, name[t].f);}else if(a > 0) strcpy(now, name[t].f);else if(b > 0) strcpy(now, name[t].s);else ok = 0;}if(ok) printf("YES\n");else printf("NO\n");}int main(void){while(scanf("%d", &n)!=EOF) {read();work();}return 0;}
0 0
- 【CODEFORCES】 C. Design Tutorial: Make It Nondeterministic
- codeforces 472C Design Tutorial: Make It Nondeterministic 贪心
- codeforces 472C. Design Tutorial: Make It Nondeterministic
- Codeforces 472C - Design Tutorial: Make It Nondeterministic(模拟)
- 【codeforces】 472C Design Tutorial: Make It Nondeterministic
- codeforces-#472C. Design Tutorial: Make It Nondeterministic(贪心)
- CodeForces 472C Design Tutorial: Make It Nondeterministic (贪心)
- Codeforces 472C Design Tutorial: Make It Nondeterministic
- Codeforces 472C Design Tutorial: Make It Nondeterministic【贪心】
- codeforces 之 Design Tutorial: Make It Nondeterministic
- C. Design Tutorial: Make It Nondeterministic
- Codeforces #270 C. Design Tutorial: Make It Nondeterministic(字符串:字符串处理)
- Codeforces Round #270——C. Design Tutorial: Make It Nondeterministic
- CF 270C - Design Tutorial: Make It Nondeterministic
- cf472C Design Tutorial: Make It Nondeterministic
- codeforces 472A. Design Tutorial: Learn from Math
- Codeforces 472B - Design Tutorial: Learn from Life(模拟)
- 【codeforces】 472D Design Tutorial: Inverse the Problem
- 使用CURL封装HttpClient
- oracle 执行计划
- java8大排序
- 【学习python】eclipse导入Flask报错,但程序执行正常
- 在局域网的情况下,使用真机(手机)测试web程序
- 【codeforces】 472C Design Tutorial: Make It Nondeterministic
- 在字符串中寻找连续最长的数字串
- ios 学习之 NSPredicate 模糊、精确、查询
- 在安卓和linux设备上添加event设备
- 思软软件协同oa办公软件标准版产品功能明细介绍
- git gitlab私服搭建
- Android 应用启动速度优化
- Qt控件父对象的确认
- poj 3740 Easy Finding(Dancing Links 精确覆盖)