记一些PAT题目（四）

A1031 Hello World for U

#include <iostream>

using namespace std;

int main(){
    string s;
    cin>>s;
    int l = s.size(), ll, lb, lr;
    lb = (l+2)/3 + (l+2)%3;
    ll = lr = (l+2)/3;
    for (int i=0; i<ll; i++){
        cout<<s[i];
        if (i != ll-1)
            for (int j=0; j<lb-2; j++)
                cout<<" ";
        else
            for (int j=i+1; j<lb+i-1; j++)
                cout<<s[j];
        cout<<s[l-i-1]<<endl;
    }
}

A1032 Sharing

// not good method
#include <iostream>
#include <vector>
#include <map>
using namespace std;

int main(){
    map<string, string> node;
    map<string, bool> visit;
    string a, b, suf = "";
    int n;
    cin>>a>>b>>n;
    for (int i=0; i<n; i++){
        string add, nex;
        char data;
        cin>>add>>data>>nex;
        node[add] = nex;
        visit[add] = false;
    }
    while (a != "-1"){
        visit[a] = true;
        a = node[a];
    }
    while (b != "-1"){
        if (visit[b]){
            cout<<b;
            break;
        }
        b = node[b];
    }
    if (b == "-1")
        cout<<"-1";
}

A1033 To Fill or Not to Fill

#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>

using namespace std;

struct sta{
    double price;
    double distance;  //join the double number of arithmetic, so it must be double type
}station[502];

int cmp (sta s1, sta s2){
    return s1.distance < s2.distance;
}

int main(){
    int c, td, rd, n;
    cin>>c>>td>>rd>>n;
    for (int i=0; i<n; i++)
        cin>>station[i].price>>station[i].distance;
    station[n].price = 0;
    station[n].distance = td;
    sort(station, station+n, cmp);
    if (station[0].distance != 0){
        cout<<"The maximum travel distance = 0.00";
        return 0;
    }
    int cur = 0;
    double curgas = 0, totalprice = 0, maxdis = c * rd;
    while (cur < n){
        int k = -1;
        double minprice = 1000;
        for (int i=cur+1; i<=n && station[i].distance <= maxdis; i++){
            if (station[i].price < minprice){
                minprice = station[i].price;
                k = i;
                if (minprice < station[cur].price)
                    break;
            }
        }
        if (k == -1) break;
        double need = (station[k].distance - station[cur].distance)/rd;
        if (minprice < station[cur].price){
            if (need > curgas){
                totalprice += (need - curgas)*station[cur].price;
                curgas = 0;
            }else
                curgas -= need;
        }else{
            totalprice  += (c-curgas)*station[cur].price;
            curgas = c - need;
        }
        cur = k;
        maxdis = station[cur].distance + c*rd;
    }
    if (cur == n)
        printf("%.2f", totalprice);
    else
        printf("The maximum travel distance = %.2f", maxdis);
}

A1034 Head of a Gang

#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <set>

using namespace std;

int visit[2002]{}, times[2002]{};
map<string, int> ntoi;
map<int, string> itos;
set<int> follow[2002]; //vector is repetitive
int main(){
    int n, k, index = 0;
    cin>>n>>k;
    for (int i=0; i<n; i++){
        string name1, name2;
        int time;
        cin>>name1>>name2>>time;
        if (ntoi.count(name1) == 0){
            times[index] = time;
            itos[index] = name1;
            ntoi[name1] = index++;
        }else
            times[ntoi[name1]] += time;
        if (ntoi.count(name2) == 0){
            times[index] = time;
            itos[index] = name2;
            ntoi[name2] = index++;
        }else
            times[ntoi[name2]] += time;
        follow[ntoi[name1]].insert(ntoi[name2]);
        follow[ntoi[name2]].insert(ntoi[name1]);
    }
    map<string, int> heads;
    for (int i=0; i<index; i++){
        if (!visit[i]){
            queue<int> q;
            q.push(i);
            int head, max = -1, totaltime = 0, cou = 0;
            while (q.size()){
                int cur = q.front();
                q.pop();
                if (visit[cur]) continue;
                visit[cur] = 1;
                totaltime += times[cur];
                ++cou;
                for (auto nex: follow[cur]){
                    if (!visit[nex])
                        q.push(nex);
                }
                if (max < times[cur]){
                    head = cur;
                    max = times[cur];
                }else if (max == times[cur] && itos[cur] < itos[head])
                    head = cur; // max is not unique that does not tally with the subject
            }
            if (cou > 2 && totaltime/2 > k)
                heads[itos[head]] = cou;
        }
    }
    cout<<heads.size()<<endl;
    for (auto &kv: heads)
        cout<<kv.first<<" "<<kv.second<<endl;
}

#include <iostream>
#include <string>
#include <map>

using namespace std;

int main(){
    int n, k, index = 0;
    cin>>n>>k;
    map<string, int> gangs[n]; // can use vector as well
    for (int i=0; i<n; i++){
        string name1, name2;
        int time, flag = 0;
        cin>>name1>>name2>>time;
        for (int i=0; i<n; i++){
            if (!gangs[i].empty() && (gangs[i].count(name1) || gangs[i].count(name2))){
                    for (int j=0; j<n; j++){
                        if (!gangs[j].empty() && (gangs[j].count(name1) || gangs[j].count(name2))){
                            if (j != i){
                                for (auto &kv: gangs[j])
                                    gangs[i][kv.first] += kv.second;
                                gangs[j].clear();
                                break;
                            }
                        }
                    }
                    gangs[i][name1] += time;
                    gangs[i][name2] += time;
                    flag = 1;
            }
        }
        if (!flag){
            for (int i=0; i<n; i++){
                if (gangs[i].empty()){
                    gangs[i][name1] = time;
                    gangs[i][name2] = time;
                    break;
                }
            }
        }
    }
    map<string, int> heads;
    for (int i=0; i<n; i++){
        if (!gangs[i].empty()){
            string head;
            int max = -1, totaltime = 0;
            for (auto &kv: gangs[i]){
                if (kv.second > max){
                    head = kv.first;
                    max = kv.second;
                }
                totaltime += kv.second;
            }
            if (gangs[i].size() > 2 && totaltime/2 > k)
                heads[head] = gangs[i].size();
        }
        
    }
    cout<<heads.size()<<endl;
    for (auto &kv: heads)
        cout<<kv.first<<" "<<kv.second<<endl;
}

A1035 Password

#include <iostream>
#include <vector>

using namespace std;

vector<pair<string, string>> user;
int main(){
    int n;
    cin>>n;
    for (int i=0; i<n; i++){
        bool ismodi = false;
        string u, p;
        cin>>u>>p;
        for (int j=p.size()-1; j>=0; j--){
            switch(p[j]){
                case '1': p[j] = '@'; ismodi = true; break;
                case '0': p[j] = '%'; ismodi = true; break;
                case 'l': p[j] = 'L'; ismodi = true; break;
                case 'O': p[j] = 'o'; ismodi = true;
            }
        }
        if (ismodi) user.push_back(make_pair(u, p));
    }
    if (user.empty()){
        if (n == 1)
            cout<<"There is 1 account and no account is modified";
        else
            printf("There are %d accounts and no account is modified", n);
    }else{
        cout<<user.size()<<endl;
        for (auto &kv: user){
            cout<<kv.first<<" "<<kv.second<<endl;
        }
    }
}

A1036 Boys vs Girls

#include <iostream>

using namespace std;

int main(){
    int n, max = -1, min = 101;
    cin>>n;
    string maname, maid, miname, mid;
    for (int i=0; i<n; i++){
        string name, gender, id;
        int grade;
        cin>>name>>gender>>id>>grade;
        if (gender == "F"){
            if (grade > max){
                max = grade;
                maname = name;
                maid = id;
            }
        }else{
            if (grade < min){
                min = grade;
                miname = name;
                mid = id;
            }
        }
    }
    if (max == -1)
        cout<<"Absent"<<endl;
    else
        cout<<maname<<" "<<maid<<endl;
    if (min == 101)
        cout<<"Absent"<<endl;
    else
        cout<<miname<<" "<<mid<<endl;
    if (max == -1 || min == 101)
        cout<<"NA";
    else
        cout<<max - min;
}

A1037 Magic Coupon

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
typedef long long ll;
int main(){
    vector<int> ca, cb, pa, pb;
    int nc, np;
    cin>>nc;
    for (int i=0; i<nc; i++){
        ll t;
        cin>>t;
        if (t < 0)
            cb.push_back(t);
        else
            ca.push_back(t);
    }
    cin>>np;
    for (int i=0; i<np; i++){
        ll t;
        cin>>t;
        if (t < 0)
            pb.push_back(t);
        else
            pa.push_back(t);
    }
    sort(ca.begin(), ca.end());
    sort(cb.begin(), cb.end());
    sort(pa.begin(), pa.end());
    sort(pb.begin(), pb.end());
    int na = ca.size() > pa.size() ? pa.size() : ca.size();
    int nb = cb.size() > pb.size() ? pb.size() : cb.size();
    ll back = 0;
    for (int i=0; i<na; i++){
        back += ca[ca.size()-i-1]*pa[pa.size()-i-1];
    }
    for (int i=0; i<nb; i++){
        back += cb[i]*pb[i];
    }
    cout<<back;
}

A1038 Recover the Smallest Number

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int cmp(string s1, string s2){
    return s1+s2 < s2+s1;
}

int main(){
    vector<string> nums;
    int n;
    cin>>n;
    for (int i=0; i<n; i++){
        string s;
        cin>>s;
        nums.push_back(s);
    }
    sort(nums.begin(), nums.end(), cmp);
    bool flag = true;
    for (int i=0; i<nums.size(); i++){
        if (flag){
            if (stoll(nums[i]) != 0){
                cout<<stoi(nums[i]);
                flag = false;
            }
        }else
            cout<<nums[i];
    }
    if (flag) cout<<0; // test 2 is 0
}

A1039 Course List for Student

#include <iostream>
#include <vector>
#include <map>
#include <set>
using namespace std;

/*
int getId(char* s){
    int id = 0;
    for (int i=0; i<3; i++)
        id = id*26 + s[i]-'A';
    id = id*10 + s[3] - '0';
    return id;
}*/
int main(){
    int n, k;
    cin>>n>>k;
    map<string, set<int>> course;
    for (int i=0; i<k; i++){
        int ci, ni;
        scanf("%d %d\n", &ci, &ni);
        for(int j=0; j<ni; j++){
            string s;
            cin>>s;
            course[s].insert(ci);
        }
    }
    for (int i=0; i<n; i++){
        string name;
        cin>>name;
        cout<<name<<" "<<course[name].size();
        for (int j: course[name]){
            cout<<" "<<j;
        }
        cout<<endl;
    }
}

A1040 Longest Symmetric String

// method one
#include <iostream>
#include <algorithm>
using namespace std;

int main(){
    string s;
    getline(cin, s);
    int max = 1;
    for (int i=0; i<s.size()-1; i++){
        for (int j=i+1; j<s.size(); j++){
            if (s[i] == s[j]){
                string sub = s.substr(i,j-i+1), t;
                t = sub;
                reverse(t.begin(), t.end());
                if (t == sub){
                    if (j-i+1 > max)
                        max = j-i+1;
                }
            }
        }
    }
    cout<<max;
}

//method two
#include <iostream>
#include <algorithm>
using namespace std;

int main(){
    string s;
    getline(cin, s);
    int max = 1;
    for (int i=0; i<s.size()-1; i++){
        for (int j=i+1; j<s.size(); j++){
            if (s[i] == s[j]){
                int m = i, n = j;
                while(m < n){
                    if (s[m] != s[n])
                        break;
                    ++m;
                    --n;
                }
                if (m >= n && j-i+1 > max)
                    max = j-i+1;
            }
        }
    }
    cout<<max;
}