PAT 2011 秋

A ： World Cup Betting

#include <cstdio>
#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    double sum = 0.65, cnt = 3;
    double tmpW, tmpT, tmpL;
    while(cnt--)
    {
        cin >> tmpW >> tmpT >> tmpL;
        if(tmpW > max(tmpT, tmpL))
        {
            cout << "W ";sum *= tmpW;
        }
        else if(tmpT > max(tmpW, tmpL))
        {
            cout << "T "; sum *= tmpT;
        }
        else
        {
            cout << "L "; sum *= tmpL;
        }
    }
    printf("%.2f", (sum-1)*2);
    return 0;
}

B：The Best Rank

#include <cstdio>
#include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <algorithm>
#include <functional>

using namespace std;
typedef struct NODE
{
    string id;
    int math, english, cCode, aver;
    NODE(){}
    NODE(int m, int e, int c, int a):math(m),english(e),cCode(c),aver(a){}
}node;
vector<int> mathVec, engVec, cCodeVec, averVec;
unordered_map<string, node> nodeMap;
unordered_map<string, int> nodeFlagMap;
void getBestRank(string tmpStr)
{
    char typeStr[]="ACME";
    int type = 0, rank = 9999999;
    for(int i = 0; i < averVec.size(); ++ i)
    {
        if(averVec[i] == nodeMap[tmpStr].aver)
        {
            rank = i+1;
            break;
        }
    }
    for(int i = 0; i < cCodeVec.size(); ++ i)
    {
        if(cCodeVec[i] == nodeMap[tmpStr].cCode && i + 1 < rank)
        {
            type = 1;
            rank = i+1;
            break;
        }
    }
    for(int i = 0; i < mathVec.size(); ++ i)
    {
        if(mathVec[i] == nodeMap[tmpStr].math && i + 1 < rank)
        {
            type = 2;
            rank = i+1;
            break;
        }
    }
    for(int i = 0; i < engVec.size(); ++ i)
    {
        if(engVec[i] == nodeMap[tmpStr].english && i + 1 < rank)
        {
            type = 3;
            rank = i+1;
            break;
        }
    }
    printf("%d %c\n", rank, typeStr[type]);
}
int main()
{
    int N, M;
    cin >> N >> M;
    string tmpId;
    int tmpMath, tmpEng, tmpCode, tmpAver;
    for(int i = 0; i < N; ++i)
    {
        cin >> tmpId >> tmpCode >> tmpMath >> tmpEng;
        tmpAver = (tmpMath+tmpEng+tmpCode+1.5)/3;
        mathVec.push_back(tmpMath);
        cCodeVec.push_back(tmpCode);
        engVec.push_back(tmpEng);
        averVec.push_back(tmpAver);
        nodeFlagMap[tmpId] = 1;
        nodeMap[tmpId] = NODE(tmpMath, tmpEng, tmpCode, tmpAver);
    }
    sort(mathVec.begin(), mathVec.end(), greater<int>());
    sort(cCodeVec.begin(), cCodeVec.end(), greater<int>());
    sort(engVec.begin(), engVec.end(), greater<int>());
    sort(averVec.begin(), averVec.end(), greater<int>());
    for(int i = 0; i < M; ++ i)
    {
        cin >> tmpId;
        if(nodeFlagMap[tmpId])
            getBestRank(tmpId);
        else
            cout << "N/A" << endl;
    }
    return 0;
}

C： Battle Over Cities

　　查连通图个数，深搜即可。

#include <cstdio>
#include <iostream>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <string>
#include <unordered_map>
#include <algorithm>
#include <functional>


using namespace std;
const int INF = 0x7f7f7f7f;
const int MAXCITY = 1010;
#define CLR(a,b) memset(a,b,sizeof(a));
int routeMap[MAXCITY][MAXCITY];
int visitFlag[MAXCITY];
void dfs(int u)
{
    visitFlag[u] = 1;
    for(int i = 1; i <= MAXCITY; ++ i)
    {
        if(visitFlag[i] == 0 && routeMap[u][i] == 0)
        {
            dfs(i);
        }
    }
}
int main()
{
    int N, M, K;
    cin >> N >> M >> K;
    int tmpSt, tmpEnd;
    CLR(routeMap, 0x7f);
    for(int i = 0; i < M; ++ i)
    {
        cin >> tmpSt >> tmpEnd;
        routeMap[tmpSt][tmpEnd] = 0;
        routeMap[tmpEnd][tmpSt] = 0;
    }
    int targetCity;
    for(int j = 0; j < K; ++ j)
    {
        cin >> targetCity;
        int cnt = 0;
        CLR(visitFlag, 0);
        visitFlag[targetCity] = 1;
        for(int i = 1; i <= N; ++ i)
        {
            if(visitFlag[i] == 0)
            {
                cnt++;
                dfs(i);
            }
        }
        cout << cnt-1 << endl;
    }
    return 0;
}

D ：Waiting in Line

　　模拟即可。

　　注意：1.下班前没有被服务的输出Sorry

 

#include <cstdio>
#include <iostream>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <string>
#include <unordered_map>
#include <algorithm>
#include <functional>
#include <queue>


using namespace std;
const int INF = 0x7f7f7f7f;
#define CLR(a,b) memset(a,b,sizeof(a));
typedef struct WINLINE
{
    int lastTime, winId;
    queue<int> winQue;
}winline;
typedef struct ALLQUE
{
    vector<int> cusQue;
    int index;
    ALLQUE():index(0){}
}allque;
const int endTime = 17*60;
const int startTime = 8*60;
vector<int> cusTime(1010, 0);
bool cmp(winline a, winline b)
{
    if(a.winQue.size() != b.winQue.size())
        return a.winQue.size() < b.winQue.size();
    else
        return a.winId < b.winId;
}

int main()
{
    int N, M, K, Q, tmpNum;
    allque allCustQue;
    cin >> N >> M >> K >> Q;
    for(int i = 0; i < K; ++ i)
    {
        cin >> tmpNum;
        allCustQue.cusQue.push_back(tmpNum);
    }
    vector<winline> winInfo(N);
    for(int i = 0; i < N; ++ i)
    {
        winInfo[i].lastTime = startTime;
        winInfo[i].winId = i;
    }
    vector<int> tmpQue;
    int maxCap = N*M, nowCap = 0;
    for(int t = startTime; t < endTime; ++ t)
    {
        for(int i = 0; i < N; ++ i)
        {
            while(!winInfo[i].winQue.empty() && winInfo[i].winQue.front() <= t)
            {
                winInfo[i].winQue.pop();
                nowCap --;
            }
        }
        while(nowCap < maxCap)
        {
            sort(winInfo.begin(), winInfo.end(), cmp);
            tmpNum = allCustQue.cusQue[allCustQue.index++] + winInfo[0].lastTime;
            if(winInfo[0].lastTime < endTime)
                cusTime[allCustQue.index] = tmpNum;
            winInfo[0].winQue.push(tmpNum);
            winInfo[0].lastTime = tmpNum;
            nowCap ++;
            if(allCustQue.index >= K)
            {
                t = endTime;
                break;
            }
        }
    }
    for(int i = 0; i < Q; ++ i)
    {
        cin >> tmpNum;
        if(cusTime[tmpNum] >= startTime)
        {
            tmpNum = cusTime[tmpNum];
            printf("%02d:%02d\n", tmpNum/60, tmpNum%60);
        }
        else
            cout << "Sorry" << endl;
    }
    return 0;
}