CodeForces 761C Dasha and Password
来源:互联网 发布:skype for mac 10.8.4 编辑:程序博客网 时间:2024/06/08 15:10
题目链接:http://codeforces.com/contest/761/problem/C
题意:给你n个长度为m的字符串,让你每个字符串选择一个字符组成一个密码,要求密码必须含有数字,小写字母和特殊字符,且每个字符串选择字符的时候,相当于旋转一个轮盘,旋转到这个字符的位置,现在问你组成字符的密码的最小步数
解析:开一个数组a[i][j]存第i行转到数字的最小步数,转到字母的最小步数,转到字符的最小步数,然后就暴力枚举就好了
#include <iostream>#include <cstdio>#include <algorithm>#include <vector>#include <cstring>#include <queue>#include <map>using namespace std;const int maxn = 1e6+100;const int inf = 0x7fffffff;int a[maxn][3];int main(void){ int n,m; scanf("%d %d",&n,&m); for(int i=0;i<n;i++) { string tmp; cin>>tmp; a[i][0] = tmp.length(); a[i][1] = tmp.length(); a[i][2] = tmp.length(); int len = tmp.length(); for(int j=0;j<len;j++) { if(tmp[j]>='0' && tmp[j]<='9') a[i][0] = min(a[i][0],min(j,len-j)); else if(tmp[j]>='a' && tmp[j]<='z') a[i][1] = min(a[i][1],min(j,len-j)); else a[i][2] = min(a[i][2],min(j,len-j)); } } int ans = inf; for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { if(i==j) continue; for(int k=0;k<n;k++) { if(i==j||j==k) continue; ans = min(ans,a[i][0]+a[j][1]+a[k][2]); } } } printf("%d\n",ans); return 0;}
0 0
- Codeforces 761C DaSha and Password 暴力
- Codeforces 761C Dasha and Password 【模拟】
- Codeforces 761C-Dasha and Password
- 【Codeforces 761 C Dasha and Password 】
- CodeForces 761C Dasha and Password
- CodeForces 761C Dasha and Password
- Codeforces 761C Dasha and Password
- 【codeforces 761C】Dasha and Password(动态规划做法)
- 【codeforces 761C】Dasha and Password(贪心+枚举做法)
- Codeforces-Round 394#C-Dasha and Password'
- C. Dasha and Password
- 761C Dasha and Password[简单dp]
- Codeforces Round #394 (Div. 2) C. Dasha and Password
- Codeforces Round #394 (Div. 2)C. Dasha and Password【暴力】
- Codeforces Round #394 (Div. 2) C. Dasha and Password
- Codeforces Round #394 (Div. 2)(A. Dasha and Stairs,B. Dasha and friends,C. Dasha and Password)
- CF761 C. Dasha and Password (DP)
- C. Dasha and Password(模拟,暴力)
- 关于让VS中scanf_s消除
- 不租云服务,也能自建网站
- 堆排序
- 程序员学习能力提升三要素
- java 匿名内部类的理解
- CodeForces 761C Dasha and Password
- 蓝桥 调和级数
- java-封装特性理解
- Spark性能优化之通过YDB实现比原生Spark性能高100倍的多表关联
- jquery-事件-on源码
- 解决redis connection refused: connect遇到的坑
- Ceilometr: 1 、Ceilometer技术介绍
- linux内存管理子系统
- 第一篇博客