(SWUST OJ)2022-2023-2《算法分析设计与实践》实验四

411: 售货员的难题

#include<stdio.h>
#include <string.h>
#define MAX 0x7fffffff
int min,n,map[42][42],dis[42];
bool used[42];
void search(int a,int b,int c)
{
    if (b==n)
    {
        if (map[a][1]+c<min)min=map[a][1]+c;
        return;
    }
    if(c+dis[a]>min) return;
    for (int i=1;i<=n;i++)
        if (!used[i]&&i!=a)
        {
            used[i]=true;
            search(i,b+1,c+map[a][i]);
            used[i]=false;
        }
}
void dijk()
{
    int sel;
    for (int i=1;i<=n;i++)
        dis[i]=MAX;
    dis[1]=0;

    for (int i=1;i<=n;i++)
    {
        min=MAX;
        for (int j=1;j<=n;j++)
            if (!used[j]&&dis[j]<min)
            {
                min=dis[j];
                sel=j;
            }
        used[sel]=true;
        for (int j=1;j<=n;j++)
            if (j!=sel)
                if (dis[sel]+map[sel][j]<dis[j])
                    dis[j]=dis[sel]+map[sel][j];
    }
    memset(used,0,sizeof(used));
}
int main()
{
    scanf("%d",&n);
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++)
            scanf("%d",&map[i][j]);
    dijk();
    min=MAX;
    used[1]=true;
    search(1,1,0);
    printf("%d\n",min);
    fclose(stdout);
    return 0;
}

594: Maximum Tape Utilization Ratio

#include<iostream>
#include<algorithm>
#include<vector>
#define INF 0x3f3f3f3f
#define LL long long int
using namespace std;
struct node
{
    int count;
    int sumVa;
    vector<LL> army;
    //构造函数：初始化列表-->node():count(0),sumVa(0){};
    node() {
        count = 0;
        sumVa = 0;
        army.clear();
    }
};
int main()
{
    int n, Length;
    while (cin >> n >> Length)
    {
        int len[605];
        for (int i = 1; i <= n; i++)
            cin >> len[i];
        node dp[6005];            //必须写在main()
        //题目巨坑：输出最小字典序的程序
        for (int i = n; i >0; i--)    //只有也必须倒叙规划
        {
            int s = len[i];
            for (int j = Length; j >= 0; j--)
            {
                if (j >= s)
                {
                    if (dp[j].count < dp[j - s].count + 1
                        || dp[j].count == dp[j - s].count + 1
                           && dp[j].sumVa <= dp[j - s].sumVa + s)
                    {
                        dp[j].count = dp[j - s].count + 1;
                        dp[j].sumVa = dp[j - s].sumVa + s;
                        dp[j].army  = dp[j - s].army;
                        dp[j].army.push_back(s);
                    }
                }
            }
        }
        cout << dp[Length].count << " " << dp[Length].sumVa << endl;
        for (int i = dp[Length].army.size() - 1; i >= 0; i--)
        {
            if (i != dp[Length].army.size() - 1)
                cout << " ";
            cout << dp[Length].army[i];
        }
        cout << endl;
    }
    return 0;
}

696: Soldiers

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
bool com(int a,int b)
{
    return a<b;
}
int main()
{
    int n,x[10001],y[10001],i;
    cin>>n;
    for(i=0;i<n;i++)
    {
        cin>>x[i]>>y[i];
    }
    sort(x,x+n,com);
    sort(y,y+n,com);
    for(i=0;i<n;i++)
    {
        x[i]-=i;
    }
    sort(x,x+n,com);
    int midy=y[n/2];
    int midx=x[n/2];
    int sum=0;
    for(i=0;i<n;i++)
    {
        sum+=abs(x[i]-midx)+abs(y[i]-midy);
    }
    cout<<sum<<endl;
    return 0;
}

698: Independent Task Scheduling

#include<stdio.h>
using namespace std;
#define MAX 201
int a[MAX];//a[i],A机器 处理i作业花费时间 
int b[MAX];//b[i],B机器 处理i作业花费时间 
int f[MAX][10000];// f[i][j],在处理i作业时A机器花费j时间的情况下B机器花费的最小时间 
int suma=0;//如果所有作业全部由A机器处理，最大时间限制 
int min(int x,int y)
{
    return x<y?x:y;
}
int max(int x,int y)
{
    return x>y?x:y;
}
int dealWith(int n)
{
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<=suma;j++)
        {
            if(a[i]<=j)
            {
                f[i][j]=min(f[i-1][j-a[i]],f[i-1][j]+b[i]);
            }
            else
            {
                f[i][j]=f[i-1][j]+b[i];
            }
        }

    }
    int m=99999;
    for(int j=1;j<=suma;j++)
    {
        int t;
        t=max(j,f[n][j]);
        m=min(m,t);

    }
    return m;
}
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        suma+=a[i];
    }
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&b[i]);
    }
    int m=dealWith(n);
    printf("%d\n",m);
    return 0;
}

699: Arbitrage

#include<iostream>
using namespace std;
int main()
{
    int n,h=0;
    while(cin>>n)
    {
        h++;
        if(n==0) return 0;
        else
        {
            int i,j,m,k,g;
            double a[31][31],rate;
            string str[31];
            string str1,str2;
            for(i=1;i<=n;i++)
            {
                cin>>str[i];
            }
            for(i=1;i<=n;i++)
            {
                for(j=1;j<=n;j++)
                {
                    if(i==j)
                    {
                        a[i][j]=1;
                    }
                    else
                    {
                        a[i][j]=0;
                    }
                }
            }
            cin>>m;
            for(i=1;i<=m;i++)
            {
                cin>>str1>>rate>>str2;
                for(j=1;j<=n;j++)
                {
                    if(str[j]==str1)
                        k=j;
                    if(str[j]==str2)
                        g=j;
                }
                a[k][g]=rate;
                for(j=1;j<=n;j++)
                {
                    for(k=1;k<=n;k++)
                    {
                        for(g=1;g<=n;g++)
                        {
                            if(a[j][g]<a[j][k]*a[k][g])
                                a[j][g]=a[j][k]*a[k][g];
                        }
                    }
                }
            }
            int flag=0;
            for(i=1;i<=n;i++)
            {
                if(a[i][i]>1)
                {
                    cout<<"Case "<<h<<' '<<"Yes"<<endl;
                    flag++;
                    break;
                }
            }
            if(flag==0)
                cout<<"Case "<<h<<' '<<"No"<<endl;
        }
    }
}