C++博客-Dreams-随笔分类-Others

zju 2750 Idiomatic Phrases Game

DreamSky — Thu, 14 May 2009 03:09:00 GMT

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2750

//1868088 2009-05-14 08:38:13 Wrong Answer  2750 C++ 130 4100 aslys
//1868170 2009-05-14 09:46:00 Time Limit Exceeded  2750 C++ 1001 4100 aslys
//1868224 2009-05-14 10:24:24 Accepted  2750 C++ 150 4112 aslys
#include<iostream>
#include<string>
#include<queue>
using namespace std;

const int inf = 1000000000;
const int N = 1001;
struct Node
{
    int t;
    char s[5];
    char e[5];
}pt[N];
struct node
{
    int v;
    int cost;
    node(){}//定义中间变量时，要用到该析构函数，此时不需要初值
    node(int a,int c)
    {
        v = a;
        cost = c;
    }
    friend bool operator <(node a,node b) //重载运算符，从小到大排序
    {
        return a.cost > b.cost;
    }
};
int n,gra[N][N];

void dijkstra(int u)
{
    priority_queue<node>Q;
    node p,q;
    bool mark[N];
    int dist[N];
    int i,j,index;
    for(i=1;i<=n;i++)
    {
        if(gra[u][i] != inf)
        {
            p.v = i;
            p.cost = gra[u][i];
            Q.push(p);
        }
        dist[i] = gra[u][i];
        mark[i] = 0;
    }
    mark[u] = 1;
    for(i=1;i<=n;i++)
    {
        index = -1;
        while(!Q.empty()) //对头元素就是最小的
        {
            q = Q.top();
            Q.pop();
            if(mark[q.v] == 0)
            {
                index = q.v;
                break ;
            }
        }
        if(index == -1)
            break;
        if(index == n)
            break;
        mark[index] = 1;

        for(j=1;j<=n;j++)
            if(mark[j] == 0 && dist[j] > q.cost + gra[index][j])
            {
                dist[j] = q.cost + gra[index][j];
                p.cost = dist[j];
                p.v = j;
                Q.push(p);
            }
    }
    if(dist[n] == inf)
        printf("-1\n");
    else
        printf("%d\n",dist[n]);
}
int main()
{

    while(cin>>n && n)
    {
        char temp[N];
        int i,j,len;
        for(i=1;i<=n;i++)//init()
            for(j=1;j<=n;j++)
                gra[i][j] = inf;

        for(i=1;i<=n;i++)
        {
            scanf("%d%s",&pt[i].t,temp);

            len = strlen(temp);

            for(j=0;j<4;j++)//取头
                pt[i].s[j] = temp[j];
            pt[i].s[j] = '\0';

            len -= 4;
            for(j=0;j<4;j++)//取尾
                pt[i].e[j] = temp[j+len];
            pt[i].e[j] = '\0';
        }
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                if(strcmp(pt[i].e,pt[j].s) == 0)
                    gra[i][j] = pt[i].t;
        dijkstra(1);
    }
    return 0;
}

DreamSky 2009-05-14 11:09 发表评论

zju 2853 Evolution

DreamSky — Tue, 12 May 2009 01:55:00 GMT

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2853

//1865331 2009-05-11 21:26:46 Accepted  2853 C++ 3790 1484 aslys
#include<iostream>
using namespace std;
const int N = 204;
int n;
double matrix[N][N];
double x[N][N],y[N][N],z[N][N];
void fun(int k,double m[][N])
{
    int i,j,p,t;
    double sum;
    if(k == 1)  //矩阵的一次方
    {
        for(i=0;i<n;i++)
            for(j=0;j<n;j++)
                m[i][j] = matrix[i][j];
    }
    else if(k == 2) //矩阵的二次方
    {
        for(i=0;i<n;i++)
            for(j=0;j<n;j++)
            {
                sum = matrix[i][0] * matrix[0][j];
                for(p=1;p<n;p++)
                    sum += matrix[i][p] * matrix[p][j];
                m[i][j] = sum;
            }
    }
    else  //矩阵的 k 次方，先计算出 k/2 次方，加快计算速度
    {
        t = k/2;
        fun(t,x); //递归调用
        for(i=0;i<n;i++)
            for(j=0;j<n;j++)
            {
                sum = x[i][0] * x[0][j];
                for(p=1;p<n;p++)
                    sum += x[i][p] * x[p][j];
                y[i][j] = sum;
            }
        if( k % 2 == 1)      // 比如对矩阵A ：A^9 = A^4 * A^4 * A
        {
            for(i=0;i<n;i++)
                for(j=0;j<n;j++)
                {
                    sum = matrix[i][0] * y[0][j];
                     for(p=1;p<n;p++)
                         sum += matrix[i][p] * y[p][j];;
                    m[i][j] = sum;
            }
        }
        else
        {
            for(i=0;i<n;i++)
                for(j=0;j<n;j++)
                    m[i][j] = y[i][j];
        }
    }
}

int main()
{
    int m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        if( m==0 && n==0 )
            break;
        int i,j,k;
        double num[N],r;
        for(i=0;i<n;i++)//init()
            for(j=0;j<n;j++)
            {
                if(i == j)
                    matrix[i][j] = 1.0;
                else
                    matrix[i][j] = 0.0;
            }

        for(i=0;i<n;i++)
            scanf("%lf",&num[i]);

        scanf("%d",&k);
        while(k--)
        {
            scanf("%d%d%lf",&i,&j,&r);
            matrix[j][i] += r; //构建初始矩阵
            matrix[i][i] -= r;
        }

        fun(m,z); //求矩阵的m次方，结果放在 x 数组中

        r = 0.0;
        for(j=0;j<n;j++)
            r += z[n-1][j] * num[j];
        printf("%.0lf\n",r);
    }
    return 0;
}
/*
3 1
40 20 10
2
0 1 1
1 2 1
3 2
40 20 10
2
0 1 1
1 2 1
*/

DreamSky 2009-05-12 09:55 发表评论

zju 2974 Just Pour the Water

DreamSky — Mon, 11 May 2009 11:33:00 GMT

摘要: http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1973 //1864877 2009-05-11 19:06:51 Accepted 2974 C++ 0 188 aslys //烦了点，却也无心改进了~ &nbs... 阅读全文

DreamSky 2009-05-11 19:33 发表评论

hdu 1013 Digital Roots

DreamSky — Sat, 04 Apr 2009 02:49:00 GMT

http://acm.hdu.edu.cn/showproblem.php?pid=1013

#include<stdio.h>
int main()
{
    char tp[1001];
    while(scanf("%s",tp)!=EOF)
    {
        int sum=0;
        char *p=tp;
        if(strcmp(tp,"0")==0)
            break;
        /*
        下面的变量要定义到上面去，否则会出现语法错误，如下
          int sum = 0;
        char *p = tp;
     *************************************
        0_0_1232530_20045.c
        0_0_1232530_20045.c(9) : error C2143: 语法错误 : 缺少“;”(在“类型”的前面)
        0_0_1232530_20045.c(10) : error C2143: 语法错误 : 缺少“;”(在“类型”的前面)
        0_0_1232530_20045.c(11) : error C2065: “p” : 未声明的标识符
        0_0_1232530_20045.c(11) : error C2100: 非法的间接寻址
        0_0_1232530_20045.c(13) : error C2065: “sum” : 未声明的标识符
        0_0_1232530_20045.c(13) : error C2100: 非法的间接寻址
     **************************************
        */
        while(*p!='\0')
        {
            sum += *p - '0';
            while(sum/10)
                sum = sum%10 + sum/10;
            p++;
        }
        printf("%d\n",sum);
    }
    return 0;
}

DreamSky 2009-04-04 10:49 发表评论

poj 1088 滑雪

DreamSky — Thu, 02 Apr 2009 12:20:00 GMT

//为这题……整个人烦到极顶……
#include<iostream>
using namespace std;
int map[101][101];
int dp[101][101];//dp[i][j]表示从i j 出发能够到达的最大长度
int m,n;
int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
int dfs(int si,int sj)
{
    int k,vi,vj,mt,temp;
    if(dp[si][sj] > 0)
        return dp[si][sj];
    mt=0;
    for(k=0;k<4;k++)
    {
        vi=si+dir[k][0];
        vj=sj+dir[k][1];
        if(vi>=1 && vi<=m && vj>=1 && vj<=n )
        {
            if(map[vi][vj] > map[si][sj] )
            {
                temp = dfs(vi,vj);
                if(temp > mt)
                    mt = temp;
            }
        }
    }//for(k=0;k<4;k++)
    dp[si][sj] = mt+1;
    return mt+1;
}

int main()
{
    while(cin>>m>>n)
    {
        int i,j;
        for(i=1;i<=m;i++)
            for(j=1;j<=n;j++)
            {
                scanf("%d",&map[i][j]);
                dp[i][j] = 0;
            }
        for(i=1;i<=m;i++)
            for(j=1;j<=n;j++)
                dfs(i,j);
        int M=0;
        for(i=1;i<=m;i++)
            for(j=1;j<=n;j++)
                if(dp[i][j] > M)
                    M = dp[i][j];
        cout<<M<<endl;
    }
    return 0;
}

http://acm.pku.edu.cn/JudgeOnline/problem?id=1088

DreamSky 2009-04-02 20:20 发表评论

zju 2022 Factorial

DreamSky — Thu, 02 Apr 2009 04:28:00 GMT

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1022

//记录因子5的个数
#include<iostream>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        __int64 n,sum=0,p=5;
        scanf("%I64d",&n);
        while(p<=n)
        {
            sum += n/p;
            n /= 5;
        }
        printf("%I64d\n",sum);
    }
    return 0;
}

DreamSky 2009-04-02 12:28 发表评论