C++博客-A Crazy Man-最新评论http://www.cppblog.com/notonlysuccess/CommentsRSS.aspxACMzh-cnMon, 16 Nov 2009 11:48:35 GMTMon, 16 Nov 2009 11:48:35 GMTcnblogsre: PKU——DP专辑http://www.cppblog.com/notonlysuccess/archive/2009/11/08/91589.html#100383EtflEtflSat, 07 Nov 2009 16:35:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/11/08/91589.html#100383

Etfl 2009-11-08 00:35 发表评论
]]>re: 神奇的舞蹈~~Dancing_Linkshttp://www.cppblog.com/notonlysuccess/archive/2009/09/08/89701.html#95613whywhyTue, 08 Sep 2009 13:29:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/09/08/89701.html#95613

why 2009-09-08 21:29 发表评论
]]>re: 神奇的舞蹈~~Dancing_Linkshttp://www.cppblog.com/notonlysuccess/archive/2009/09/07/89701.html#95488whywhyMon, 07 Sep 2009 13:44:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/09/07/89701.html#95488我自己也模仿着写了个,但一直TLE
能否借你完整的代码学习学习呢~
这是我的邮箱:
weihaoo2@163.com
谢谢啊~


why 2009-09-07 21:44 发表评论
]]>re: 概率题总汇http://www.cppblog.com/notonlysuccess/archive/2009/08/29/83367.html#94769ACMerACMerSat, 29 Aug 2009 08:25:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/08/29/83367.html#94769#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
const int MAXN = 20;
struct point_T {
int x, y;
};
point_T st, ed[MAXN * MAXN];
char map[MAXN][MAXN];
int board[MAXN][MAXN];
int row, col, cnt;
double mat[MAXN * MAXN][MAXN * MAXN];
int dir[4][2] = { {1, 0}, {-1, 0}, {0, -1}, {0, 1} };
bool ok(int x, int y) {
return x >= 0 && x < row && y >= 0 && y < col && (map[x][y] == '@' || map[x][y] == '.' || map[x][y] == '$');
}
void floodfill(int x, int y) {
board[x][y] = ++ cnt;
for(int i = 0; i < 4; i ++) {
int tx = x + dir[i][0];
int ty = y + dir[i][1];
if(ok(tx, ty) && board[tx][ty] == -1) {
floodfill(tx, ty);
}
}
}
bool gauss(int n) {
int i, j, row, idx;
double buf, maxx;
for(row = 0; row < n; row ++) {
for(maxx = 0, i = row; i < n; i ++) {
if(maxx < fabs(mat[i][row])) {
maxx = fabs(mat[i][row]);
idx = i;
}
}
if(maxx == 0) return false;
if(idx != row) {
for(i = row; i <= n; i ++)
swap(mat[row][i], mat[idx][i]);
}
for(i = row + 1; i < n; i ++) {
buf = mat[i][row] / mat[row][row];
for(j = row; j <= n; j ++)
mat[i][j] -= buf * mat[row][j];
}
}
for(i = n - 1; i >= 0; i --) {
for(j = i + 1; j < n; j ++)
mat[i][n] -= mat[i][j] * mat[j][j];
mat[i][i] = mat[i][n] / mat[i][i];
}
return true;
}
int main() {
int i, j, k, l, cn;
while(scanf("%d%d", &row, &col) != EOF) {
cn = 0;
for(i = 0; i < row; i ++) {
scanf("%s", map[i]);
for(j = 0; j < col; j ++) {
if(map[i][j] == '@') {
st.x = i;
st.y = j;
}else if(map[i][j] == '$') {
ed[cn].x = i;
ed[cn].y = j;
cn ++;
}
}
}
memset(board, -1, sizeof(board));
cnt = -1;
floodfill(st.x, st.y);
for(i = 0; i < cn; i ++) {
if(board[ed[i].x][ed[i].y] != -1)
break;
}
if(i == cn) {
printf("-1\n");
continue;
}
memset(mat, 0, sizeof(mat));
int now, tx, ty, num;
for(i = 0; i < row; i ++) {
for(j = 0; j < col; j ++) {
if(board[i][j] != -1) {
now = board[i][j];
num = 0;
for(k = 0; k < 4; k ++) {
tx = i + dir[k][0];
ty = j + dir[k][1];
if(ok(tx, ty)) {
num ++;
mat[now][board[tx][ty]] = -1;
}
mat[now][now] = num;
mat[now][cnt + 1] = num;
}
}
}
}
for(i = 0; i < cn; i ++) {
l = board[ed[i].x][ed[i].y];
memset(mat[l], 0, sizeof(mat[l]));
mat[l][l] = 1;
}
if(gauss(cnt + 1))
printf("%.6lf\n", mat[board[st.x][st.y]][board[st.x][st.y]]);
else
printf("-1\n");
}
return(0);
}




ACMer 2009-08-29 16:25 发表评论
]]>re: 概率题总汇http://www.cppblog.com/notonlysuccess/archive/2009/08/29/83367.html#94768ACMACMSat, 29 Aug 2009 08:21:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/08/29/83367.html#94768==> (a + b)E[n] - aE[n-1] - bE[n + 1] = 0;
==>为什么在建增广矩阵时是mat[i][i - 1] = -b, mat[i][i + 1] = -a,mat[i][i] = a + b; 而不是mat[i][i - 1] = -a, mat[i][i + 1] = -b, mat[i][i] = a + b;

ACM 2009-08-29 16:21 发表评论
]]>re: 概率题总汇http://www.cppblog.com/notonlysuccess/archive/2009/08/20/83367.html#93910lxghostlxghostThu, 20 Aug 2009 06:52:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/08/20/83367.html#93910

lxghost 2009-08-20 14:52 发表评论
]]>re: 神奇的舞蹈~~Dancing_Linkshttp://www.cppblog.com/notonlysuccess/archive/2009/08/18/89701.html#93699傻崽傻崽Tue, 18 Aug 2009 05:47:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/08/18/89701.html#93699

有的啊~初始的时候对S进行了赋值~这个S达到一个很强的剪枝的呢

傻崽 2009-08-18 13:47 发表评论
]]>re: 神奇的舞蹈~~Dancing_Linkshttp://www.cppblog.com/notonlysuccess/archive/2009/08/17/89701.html#93648acmeracmerMon, 17 Aug 2009 14:06:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/08/17/89701.html#93648

acmer 2009-08-17 22:06 发表评论
]]>re: 半年AC生涯，仅以此文纪念http://www.cppblog.com/notonlysuccess/archive/2009/08/12/80162.html#92995cscsWed, 12 Aug 2009 02:28:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/08/12/80162.html#92995

cs 2009-08-12 10:28 发表评论
]]>re: 半年AC生涯，仅以此文纪念http://www.cppblog.com/notonlysuccess/archive/2009/08/09/80162.html#92712WACowWACowSun, 09 Aug 2009 08:31:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/08/09/80162.html#92712

WACow 2009-08-09 16:31 发表评论
]]>re: 半年AC生涯，仅以此文纪念http://www.cppblog.com/notonlysuccess/archive/2009/08/09/80162.html#92711SiNZeRoSiNZeRoSun, 09 Aug 2009 08:25:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/08/09/80162.html#92711

SiNZeRo 2009-08-09 16:25 发表评论
]]>re: 半年AC生涯，仅以此文纪念[未登录]http://www.cppblog.com/notonlysuccess/archive/2009/08/07/80162.html#92493李李Fri, 07 Aug 2009 01:47:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/08/07/80162.html#92493

李 2009-08-07 09:47 发表评论
]]>re: 神奇的舞蹈~~Dancing_Linkshttp://www.cppblog.com/notonlysuccess/archive/2009/08/05/89701.html#92358傻崽傻崽Wed, 05 Aug 2009 14:14:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/08/05/89701.html#92358
其实关键在于建图的过称~~上边那个模板其实速度差别不是很大

傻崽 2009-08-05 22:14 发表评论
]]>re: 2009.2.10小记http://www.cppblog.com/notonlysuccess/archive/2009/08/05/73421.html#92281zxzzxzWed, 05 Aug 2009 06:29:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/08/05/73421.html#92281

zxz 2009-08-05 14:29 发表评论
]]>re: PKU——DP专辑http://www.cppblog.com/notonlysuccess/archive/2009/08/04/91589.html#92198zhuweicongzhuweicongTue, 04 Aug 2009 10:40:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/08/04/91589.html#92198

zhuweicong 2009-08-04 18:40 发表评论
]]>re: 神奇的舞蹈~~Dancing_Linkshttp://www.cppblog.com/notonlysuccess/archive/2009/07/30/89701.html#91670howiehowieThu, 30 Jul 2009 01:49:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/07/30/89701.html#91670你的为什么那么快呢？请问做了什么优化?


howie 2009-07-30 09:49 发表评论
]]>re: 神奇的舞蹈~~Dancing_Linkshttp://www.cppblog.com/notonlysuccess/archive/2009/07/16/89701.html#90270majiamajiaThu, 16 Jul 2009 11:21:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/07/16/89701.html#90270

majia 2009-07-16 19:21 发表评论
]]>re: HDOJ1074~~Doing Homework解题报告http://www.cppblog.com/notonlysuccess/archive/2009/07/10/74168.html#89716shǎ崽shǎ崽Fri, 10 Jul 2009 02:46:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/07/10/74168.html#89716
这里没有代码格式
自己复制ALT + F8一下


#include<stdio.h>
#include<string>
#define Min(a,b) a>b?b:a
struct DP{
int score;
int next;
int time;
}dp[32768];
struct Homework{
int deadlion,time;
char name[101];
}hw[15];
char ans[15][101];
int n;

void dfs(int k)
{
int i,min,cnt,time,d=k,id,score,next,t;
char ch[16];

memset(ch,'0',sizeof(ch));
i = 14;
d = k;
cnt = 0;
ch[15] = 0;
while(d)
{
if(d&1)
{
cnt += d&1;
ch[i] = (d&1) + '0';
id = i;//如果只有一个1，id可以记录下1的位子
}
i --;
d >>= 1;
}//转化成二进制

if(cnt == 1)//最底下的情况,只完成了一种作业
{
id = 14 - id;
if(hw[id].deadlion >= hw[id].time)
dp[k].score = 0;
else
dp[k].score = hw[id].time - hw[id].deadlion;
dp[k].time = hw[id].time;
dp[k].next = id;
return ;
}

min = 0x7FFFFFFF;
for(i=0;i<15;i++)
{
if(ch[i]=='1')
{
id = 14 - i;
int kk = k - (1<<id);
if(dp[kk].time == -1)
dfs(kk);
time = dp[kk].time + hw[id].time;
score = dp[kk].score;
if(hw[id].deadlion < time)
score += (time-hw[id].deadlion);
if(score < min || score == min && strcmp(hw[id].name,hw[next].name)<0)
{
if(score<min)
next = id;
min = score;
t = time;
}
}
}
dp[k].score = min;
dp[k].next = next;
dp[k].time = t;
}


int main()
{
int T,i,k;
scanf("%d",&T);
while (T--)
{
scanf("%d",&n);
k = (1<<n)-1;//一共有这么多可能
for(i=0;i<=k;i++)
dp[i].time = -1;
for(i=0;i<n;i++)
scanf("%s%d%d",hw[i].name,&hw[i].deadlion,&hw[i].time);
dfs(k);
printf("%d\n",dp[k].score);
//输出名字
for(i=0;i<n;i++)
{
strcpy(ans[i],hw[ dp[k].next ].name);
k = k - (1<<(dp[k].next));
}
for(i=n-1;i>=0;i--)
puts(ans[i]);
}
return 0;
}

shǎ崽 2009-07-10 10:46 发表评论
]]>re: HDOJ1074~~Doing Homework解题报告[未登录]http://www.cppblog.com/notonlysuccess/archive/2009/07/09/74168.html#89603acacThu, 09 Jul 2009 02:37:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/07/09/74168.html#89603麻烦贴下

在线狂等

ac 2009-07-09 10:37 发表评论
]]>re: 半年AC生涯，仅以此文纪念[未登录]http://www.cppblog.com/notonlysuccess/archive/2009/07/07/80162.html#89480蜗牛蜗牛Tue, 07 Jul 2009 10:59:00 GMThttp://www.cppblog.com/notonlysuccess/archive/2009/07/07/80162.html#89480兄弟对ACM的精神和态度让我敬佩!

蜗牛 2009-07-07 18:59 发表评论
]]>