Regionals 2012 :: Asia - Dhaka
题意：求每个点的度数
分析：可以在，每个字母的的两个端点里求出的的出度，那么除了起点外其他点还有一个入度，再+1
/************************************************
* Author :Running_Time
* Created Time :2015/11/4 星期三 13:22:03
* File Name :B.cpp
************************************************/ #include <cstdio>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <bitset>
#include <cstdlib>
#include <ctime>
using namespace std; #define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
typedef long long ll;
const int N = 1e3 + 10;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const double EPS = 1e-10;
const double PI = acos (-1.0);
int vis[33];
char s[N];
int p1[33], p2[33];
int ans[33]; int main(void) {
int T, cas = 0; scanf ("%d", &T);
while (T--) {
scanf ("%s", &s);
memset (ans, -1, sizeof (ans));
memset (vis, 0, sizeof (vis));
memset (p1, -1, sizeof (p1));
memset (p2, -1, sizeof (p2));
int len = strlen (s);
for (int i=0; i<len; ++i) {
if (ans[s[i]-'A'] == -1) ans[s[i]-'A'] = 0;
if (p1[s[i]-'A'] == -1) p1[s[i]-'A'] = i;
else p2[s[i]-'A'] = i;
}
for (int i=0; i<len; ++i) {
if (vis[s[i]-'A'] == 1) continue;
int j = p1[s[i]-'A'] + 1;
if (j == p2[s[i]-'A']) {
//ans[s[i]-'A'] = 1; vis[s[i]-'A'] = 1;
continue;
}
while (j < p2[s[i]-'A']) {
ans[s[i]-'A']++;
j = p2[s[j]-'A'] + 1;
}
vis[s[i]-'A'] = 1;
}
for (int i=0; i<26; ++i) ans[i]++;
ans[s[0]-'A']--; printf ("Case %d\n", ++cas);
for (int i=0; i<26; ++i) {
if (ans[i] <= 0) continue;
printf ("%c = %d\n", 'A' + i, ans[i]);
}
} //cout << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; return 0;
}
水 C Memory Overflow
/************************************************
* Author :Running_Time
* Created Time :2015/11/4 星期三 12:55:22
* File Name :C.cpp
************************************************/ #include <cstdio>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <bitset>
#include <cstdlib>
#include <ctime>
using namespace std; #define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
typedef long long ll;
const int N = 5e2 + 10;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const double EPS = 1e-10;
const double PI = acos (-1.0);
char s[N]; int main(void) {
int T, cas = 0; scanf ("%d", &T);
while (T--) {
int n, k; scanf ("%d%d", &n, &k);
scanf ("%s", &s);
int ans = 0;
for (int i=0; i<n; ++i) {
bool flag = false;
for (int j=max (0, i-k); j<i; ++j) {
if (s[j] == s[i]) {
flag = true; break;
}
}
if (flag) ans++;
}
printf ("Case %d: %d\n", ++cas, ans);
} //cout << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; return 0;
}
暴力/高斯消元 E Poker End Games
只会暴力
/************************************************
* Author :Running_Time
* Created Time :2015/11/4 星期三 18:34:27
* File Name :E.cpp
************************************************/ #include <cstdio>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <bitset>
#include <cstdlib>
#include <ctime>
using namespace std; #define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
typedef long long ll;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const double EPS = 1e-10;
const double PI = acos (-1.0); int main(void) {
int T, cas = 0; scanf ("%d", &T);
while (T--) {
int a, b; scanf ("%d%d", &a, &b);
double p = 1.0, round = 0, win = 0;
int n = 1e6;
for (int i=1; i<=n; ++i) {
if (a == b) {
round += p * i;
win += p * 0.5;
break;
}
if (a > b) {
a -= b; b += b;
round += p * i * 0.5;
win += p * 0.5;
}
else if (a < b) {
b -= a; a += a;
round += p * i * 0.5;
}
p *= 0.5;
}
printf ("Case %d: %.6f %.6f\n", ++cas, round, win);
} //cout << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; return 0;
}
题意：判断能否根据某个点是'*'来区别出形状，必须是‘*'，其他的都是'.'才行。
/************************************************
* Author :Running_Time
* Created Time :2015/11/4 星期三 14:03:02
* File Name :F.cpp
************************************************/ #include <cstdio>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <bitset>
#include <cstdlib>
#include <ctime>
using namespace std; #define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
typedef long long ll;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const double EPS = 1e-10;
const double PI = acos (-1.0);
char s[40][20][50];
char ss[40];
int id[40];
int ans[20]; int f(char ch) {
if (ch >= 'A' && ch <= 'Z') return ch - 'A';
else return 26 + (ch - '0');
} int main(void) {
int n, m, cas = 0; scanf ("%d%d", &n, &m);
scanf ("%s", &ss);
//printf ("%s\n", ss);
memset (id, -1, sizeof (id));
for (int i=0; i<n; ++i) {
id[f (ss[i])] = i;
for (int j=0; j<17; ++j) {
scanf ("%s", s[i][j]);
}
/*
for (int j=0; j<17; ++j) {
printf ("%s\n", s[i][j]);
}
*/
} for (int i=0; i<m; ++i) {
scanf ("%s", &ss);
int len = strlen (ss);
for (int j=0; j<len; ++j) {
ans[j] = 0;
if (id[f (ss[j])] == -1) continue;
for (int k=0; k<16 && !ans[j]; ++k) { //row
for (int l=0; l<43 && !ans[j]; ++l) { //col
bool flag = true;
if (s[id[f (ss[j])]][k][l] != '*') continue;
for (int ii=0; ii<len; ++ii) {
if (ii == j) continue;
if (id[f (ss[ii])] == -1) continue;
if (s[id[f (ss[ii])]][k][l] != '.') {
flag = false; break;
}
}
if (flag) ans[j] = 1;
}
}
}
printf ("Query %d: ", ++cas);
for (int i=0; i<len; ++i) {
printf ("%c", ans[i] ? 'Y' : 'N');
}
puts ("");
} //cout << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; return 0;
}
DP I Learning Vector
题意：给了一些向量，问选出一些与x坐标轴组成的多变形面积最大
分析：开始以为贪心，因为很难想DP把之前的选的向量保存起来。看题解才知道，dp[i][j][h] 表示前i个选择了j个，最后高度为h组成的面积，那么状态转移时不需要知道之前的长度，用梯形面积公式累加多出来的面积就行了。另外，向量应该先极角排序。
/************************************************
* Author :Running_Time
* Created Time :2015/11/4 星期三 15:47:19
* File Name :I_2.cpp
************************************************/ #include <cstdio>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <bitset>
#include <cstdlib>
#include <ctime>
using namespace std; #define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
typedef long long ll;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const double EPS = 1e-10;
const double PI = acos (-1.0);
int dcmp(double x) { //三态函数，减少精度问题
if (fabs (x) < EPS) return 0;
else return x < 0 ? -1 : 1;
}
struct Vec {
int x, y;
Vec () {}
Vec (int x, int y) : x (x), y (y) {}
}vs[55];
bool cmp(Vec A, Vec B) {
return dcmp (A.x * B.y - A.y * B.x) < 0;
} int dp[55][55][2550]; int main(void) {
int T, cas = 0; scanf ("%d", &T);
while (T--) {
int n, k; scanf ("%d%d", &n, &k);
int H = 0;
for (int x, y, i=1; i<=n; ++i) {
scanf ("%d%d", &vs[i].x, &vs[i].y);
H += vs[i].y;
}
sort (vs+1, vs+1+n, cmp);
memset (dp, -1, sizeof (dp));
dp[0][0][0] = 0;
for (int i=0; i<n; ++i) {
for (int j=0; j<=i && j<=k; ++j) {
for (int h=0; h<=H; ++h) {
if (dp[i][j][h] == -1) continue;
dp[i+1][j][h] = max (dp[i+1][j][h], dp[i][j][h]);
if (j < k) {
int hh = h + vs[i+1].y;
dp[i+1][j+1][hh] = max (dp[i+1][j+1][hh], dp[i][j][h] + (h + hh) * vs[i+1].x);
}
}
}
} int ans = 0;
for (int i=0; i<=H; ++i) if (ans < dp[n][k][i]) ans = dp[n][k][i];
printf ("Case %d: %d\n", ++cas, ans);
} //cout << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; return 0;
}
Regionals 2012 :: Asia - Dhaka的更多相关文章
- [Regionals 2012 :: Asia - Tokyo ]
链接: https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=56 ...
- Regionals 2012, Asia - Jakarta 解题报告
啥都不会做了.. 做题慢死 A.Grandpa's Walk 签到题. 直接DFS就行. 注意先判断这个点可以作为一个路径的起点不. 然后再DFS. 否则处理起来略麻烦 #include <io ...
- 2015 UESTC Winter Training #4【Regionals 2008 :: Asia - Tehran】
2015 UESTC Winter Training #4 Regionals 2008 :: Asia - Tehran 比赛开始时电脑死活也连不上WIFI,导致花了近1个小时才解决_(:зゝ∠)_ ...
- HDU-4432-Sum of divisors （ 2012 Asia Tianjin Regional Contest ）
Sum of divisors Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) ...
- HDU 4436 str2int（后缀自动机）（2012 Asia Tianjin Regional Contest）
Problem Description In this problem, you are given several strings that contain only digits from '0' ...
- Regionals 2012 :: Chengdu
题目连接 排行榜 A和I都是签到题 按位BFS K Yet Another Multiple Problem 题意:给一些可以用的数字,求最小的数,它由特定的数字组成且是n的倍数 分析:暴力枚举不可行 ...
- Regionals 2012 :: HangZhou
题目传送门排行榜 一个人做了12年北大出的题,自己还是太弱了,图论的知识忘光光,最小生成树裸题写不来,Dijkstra TLE不知道用SPFA. 简单几何(点到线段的距离) + 三分 B Steali ...
- 2012 Asia Chengdu Regional Contest
Browsing History http://acm.hdu.edu.cn/showproblem.php?pid=4464 签到 #include<cstdio> #include&l ...
- 2012 Asia Hangzhou Regional Contest
Friend Chains http://acm.hdu.edu.cn/showproblem.php?pid=4460 图的最远两点距离,任意选个点bfs,如果有不能到的点直接-1.然后对于所有距离 ...
随机推荐
- getVisibleSize 和 getContentSize 和 getWinSize
getVisibleSize:获得视口(可视区域)的大小,若是DesignResolutionSize跟屏幕尺寸一样大,则getVisibleSize便是getWinSize.getVisibleOr ...
- LR调用DLL（加密测试等）
利用LoadRunner实现加密测试,哇咔咔2015-05-12 10:17:06标签:编译器 加密 用户在进行LoadRunner打压时,有时候请求的参数是加密的,而加密的法则是通过调用一段DLL来 ...
- Android 中this、 getApplicationContext()、getApplication()之间的区别
this:代表当前,在Activity当中就是代表当前的Activity,换句话说就是Activity.this在Activity当中可以缩写为this. getApplicationContext( ...
- [Effective JavaScript 笔记]第35条：使用闭包存储私有数据
js的对象系统并没有特别鼓励或强制信息隐藏.所有的属性名都是一个字符串,任意一个程序都可以简单地通过访问属性名来获取相应的对象属性.例如,for...in循环.ES5的Object.keys()和Ob ...
- 修改 ~/.bashrc显示 git 当前分支
vim ~/.bashrc # git branch show configuration PS1="\\w:\$(git branch 2>/dev/null | grep '^*' ...
- C#开发实例 键盘篇
键盘的操作控制: 键盘和鼠标一样是重要输入设备的一部分.开发过程中,会涉及到很多的键盘操作控制. 2.1获取键盘信息 ①获取组合键 Windows中有很多默认的组合键,如Ctrl+v,Ctrl+A.本 ...
- jquery.fileupload.js 杂记
通过$your_jq_dom.fileupload({},donf:function...,fail:function..., ...) 得到的只是一个支持上传的控件,当然绑定了各种事件. 传参给ur ...
- JS的trim()方法
去除字符串左右两端的空格,在vbscript里面可以轻松地使用 trim.ltrim 或 rtrim,但在js中却没有这3个内置方法,需要手工编写.下面的实现方法是用到了正则表达式,效率不错,并把这三 ...
- [转]Spring的IOC原理[通俗解释一下]
1. IoC理论的背景我们都知道,在采用面向对象方法设计的软件系统中,它的底层实现都是由N个对象组成的,所有的对象通过彼此的合作,最终实现系统的业务逻辑. 图1:软件系统中耦合的对象 如果我们打开机械 ...
- 【OpenStack】OpenStack系列3之Swift详解
Swift安装部署(与keystone依赖包有冲突,需要安装不同版本eventlet) 参考:http://www.server110.com/openstack/201402/6662.html h ...