PAT甲级刷题记录（1031-1040）

1031-1040

1031 Hello World for U(20)

#include<iostream>
using namespace std;
int main(){
    int n1, n2;
    string s;
    cin >> s;
    int len = s.length();
    n1 = (len + 2) / 3;
    int space_num = len - 2 * n1;
    for(int i = 0; i <=  (n1 - 1) - 1; i++){
        cout << s[i];
        for(int j = 1; j <= space_num; j++){
            cout << " ";
        }
        cout << s[len - i - 1] << endl;
    }
    for(int i = n1 -1; i <=  len - (n1 - 1) -1; i++){
        cout << s[i];
    }
    return 0;
}

1032 Sharing(25)

#include<iostream>
using namespace std;
int ans[100001];
bool visit[100001] = {false};
int main(){
    int address1, address2, N;
    char temp;
    int start, end;
    scanf("%d%d%d", &address1, &address2, &N);
    for(int i = 1; i <= N; i++){
        scanf("%d %c %d", &start, &temp, &end);
        ans[start] = end;
    }
    while(address1 != -1){
        visit[address1] = true;
        address1 = ans[address1];
    }
    int res = -1;
    while(address2 != -1){
        if(visit[address2] == true){
            res = address2;
            break;
        } 
        address2 = ans[address2];
    }
    if(res == -1){
        printf("%d", res);
    }else{
        printf("%05d", res);
    }
}

1033 To Fill or Not to Fill(25)

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

const int INF = 1e9;

struct station{
    double price, dis;
};
bool cmp(station s1, station s2){
    return s1.dis < s2.dis;
}

int main(){
    double c, d, davg;
    int n;
    cin >>  c >> d >> davg >> n;
    vector<station> sta(n + 1);
    sta[0].price = 0;
    sta[0].dis = d;
    
    for(int i = 1; i <= n; i++){
        cin >> sta[i].price >> sta[i].dis;
    }
    double nowprice = 0.0, nowdis = 0.0, maxdis = 0.0;
    double ans = 0.0;
    double leftdis = 0.0;//上个站点剩下的油
    sort(sta.begin(), sta.end(), cmp);
    if(sta[0].dis != 0){
        cout << "The maximum travel distance = 0.00";
        return 0;
    }else{
        nowprice = sta[0].price;
    }
    
    while(nowdis < d){
        maxdis = nowdis + c * davg;//当前站油箱加满能到的的最远距离
        double minprice = INF, minpricedis = 0;
        bool flag = false;
        for(int i = 1; i <= n; i++){
            if(sta[i].dis > maxdis){//到不了该距离
                break;
            }
            if(sta[i].dis <= nowdis){//之前的站点忽略
                continue;
            }
            if(sta[i].price < nowprice){//如果路上有更便宜的站点
                //加油开到该站点, 因为这里的油便宜，因此没有从上一个站点剩下的油
                ans += (sta[i].dis - nowdis - leftdis) / davg * nowprice;
                leftdis = 0;
                nowprice = sta[i].price;
                nowdis = sta[i].dis;
                flag = true;
                break;
           }
           if(sta[i].price < minprice){//如果没有比当前站点便宜的，那就找路径上最便宜的
               minprice = sta[i].price;
               minpricedis = sta[i].dis;
           }
        }
        if(flag == false && minprice != INF){
            //路上有站点,但是由于这个站点比之前的站点更贵，因此在之前的站点加满，开到这个站点后还剩下leftdis的油
            ans += nowprice * (c - leftdis / davg);
            leftdis = c * davg - (minpricedis - nowdis);
            nowprice = minprice;
            nowdis = minpricedis;
        }
        if(flag == false && minprice == INF){
            nowdis += c * davg;
            printf("The maximum travel distance = %.2f", nowdis);
            return 0;
        }
    }
    printf("%.2f",ans);
}

1034 Head of a Gang(30)

#include<iostream>
#include<map>
#include<vector>
using namespace std;
const int maxn = 2001;
map<string, int> str2int;
map<int, string> int2str;
map<string, int> ans;

int adj[maxn][maxn], weight[maxn];
bool visited[maxn] = {false};
int people_num = 0;
int n, k;

int change(string name){
    if(str2int[name] == 0){
        people_num++;
        str2int[name] = people_num;
        int2str[people_num] = name;
    }
    return str2int[name];
}
void dfs(int u, int &head, int &numMember, int &totalweigth){
    visited[u] = true;
    numMember++;
    if(weight[u] > weight[head]){
        head = u;
    }
    for(int v = 1; v <= people_num; v++){
        if(adj[u][v] > 0){
            totalweigth += adj[u][v];
            adj[u][v] = adj[v][u] = 0;
            if(!visited[v]){
                dfs(v, head, numMember, totalweigth);
            }
        }
    }
}
void dfsall(){
    for(int i = 1; i <= people_num; i++){
        if(!visited[i]){
            int head = i, numMember = 0, totalweigth = 0;
            dfs(i, head, numMember, totalweigth);
            if(numMember > 2 && totalweigth > k){
                ans[int2str[head]] = numMember;
            }
        }
    }
}

int main(){
    cin >> n >> k;
    string name1, name2;
    int time;
    for(int i = 1; i <= n; i++){
        cin >> name1 >> name2 >> time;
        int n1 = change(name1);
        int n2 = change(name2);
        weight[n1] += time;
        weight[n2] += time;
        adj[n1][n2] += time;
        adj[n2][n1] += time;
    }
    dfsall();
    
    cout << ans.size() << endl;
    for(auto it = ans.begin(); it != ans.end(); it++){
        cout << it -> first << " " << it -> second << endl;
    }
}

1035 Password(20)

#include<iostream>
#include<string>
#include<vector>
#include<unordered_map>
using namespace std;
//ordered_map 的顺序并非插入顺序
//ordered_map<string,string> m;
vector<pair<string, string> > m;
const char originmap[] = {'1','0','l','O'};
const char changemap[] = {'@','%','L','o'};
string change(string password){
    string::size_type idx;
    for(int i = 0; i < 4; i++){
        //存在多个只能找到一个
        idx = password.find(originmap[i]);
        while(idx != string::npos){
            password[idx] = changemap[i];
            idx = password.find(originmap[i]);
        }
    }
    return password;
}
int main(){
    int n;
    cin >> n;
    int cnt = 0;
    string name, password;
    for(int i = 1; i <= n; i++){
        cin >> name >> password;
        string password2 = change(password);
        if(password2 != password){
            //m[name] = password2;
            m.emplace_back(name,password2);
            cnt++;
        }
    }
    if(cnt == 0){
        if(n == 1){
            printf("There is 1 account and no account is modified");
        }else{
            printf("There are %d accounts and no account is modified", n);
        }
    }else{
        cout <<  cnt << endl;
        for(auto it = m.begin(); it != m.end();it++){
            cout << it -> first << " " << it -> second << endl; 
        }  
    }
    return 0;
}

1036 Boys vs Girls(25)

//复杂化了 直接在输入时存储分数变量就行了 
//每输入一个用户 对比一次 不需要定义结构体
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
const int maxn = 10001;
struct student{
    string name, id;
    int gender, score;
}stu[maxn];
bool cmp(student s1, student s2){
    if(s1.gender != s2.gender){
        return s1.gender > s2.gender;
    }else{
        return s1.score < s2.score;
    }
}
int main(){
    int n;
    cin >> n;
    for(int i = 0 ;i < n; i++){
        char gender;
        cin >> stu[i].name >> gender >> stu[i].id >> stu[i].score;
        gender == 'M' ? stu[i].gender = 1 : stu[i].gender = 0;
    }
    sort(stu, stu + n, cmp);
    student s1 = stu[0];
    student s2 = stu[n - 1];
    if(s1.gender == 0){
        cout << s2.name << " " << s2.id << endl;
        cout << "Absent" << endl;
        cout << "NA";
    }else if(s2.gender == 1){
        cout << "Absent" << endl;
        cout << s1.name << " " << s1.id << endl;
        cout << "NA";
    }else{
        cout << s2.name << " " << s2.id << endl;
        cout << s1.name << " " << s1.id << endl;
        cout << s2.score - s1.score;
    }
}

1037 Magic Coupon(25)

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> c, p;
int main(){
    int nc, np;
    scanf("%d",&nc);
    int temp;
    for(int i = 1; i <= nc; i++){
        scanf("%d", &temp);
        c.push_back(temp);
    }
    
    sort(c.begin(), c.end());
    scanf("%d",&np);
    for(int i = 1; i <= np; i++){
        scanf("%d", &temp);
        p.push_back(temp);
    }
    sort(p.begin(), p.end());
    int ans = 0;
    int j = 0;
    while(p[j] < 0 && c[j] < 0){
        ans += p[j] * c[j];
        j++;
    }
    
    int i = p.size() - 1;
    j = c.size() - 1; 
    while(p[i] > 0 && c[j] > 0){
        ans += p[i] * c[j];
        i--;
        j--;
    }
   printf("%d", ans);
}

1038 Recover the Smallest Number(30)

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 10001;
string nums[maxn];
bool cmp(string s1, string s2){
    return s1 + s2 < s2 + s1;
    
}
int main(){
    int n;
    cin >> n;
    for(int i = 0; i < n; i++){
        cin >> nums[i];
    }
    sort(nums, nums + n, cmp);
// 有一个测试点过不去 应该是存在一个0和0xx
//     for(int i = 0; i < n; i++){
//         if(i == 0){
//             int j;
//             for(j = 0; j < nums[i].length(); j++){
//                 if(nums[i][j] != '0'){
//                     break;
//                 }
//             }
//             for(; j < nums[i].length(); j++){
//                 cout << nums[i][j];
//             }
//         }else{
//             cout << nums[i];
//         }
//     }
    string s;
    for(int i = 0; i < n; i++){
        s += nums[i];
    }
    int j = 0;
    for(; j < s.length(); j++){
        if(s[j] != '0'){
            break;
        }
    }
    int flag = 0;//用于判0
    for(; j < s.length(); j++){
        flag = 1;
        cout << s[j];
    }
    if(!flag){
        cout << 0;
    }
}

1039 Course List for Student(25)

#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
map<string, vector<int> > m;
int main(){
    int n, k;
    int c_id, ni;
    string name;
    cin >> n >> k;
    for(int i = 1; i <= k ;i++){
        cin >> c_id >> ni;
        for(int i = 1; i <= ni; i++){
            cin >> name;
            m[name].push_back(c_id);
        }
    }
    for(int i = 1; i <= n; i++){
        cin >> name;
        cout << name;
        if(!m[name].empty()){
            cout << " " << m[name].size();
            sort(m[name].begin(), m[name].end());
            for(int i = 0; i < m[name].size(); i++){
                cout << " " << m[name][i];
            }
            cout << endl;
        }else{
            cout << " 0" << endl;
        }
    }
    return 0;
}

1040 Longest Symmetric String(25)

最长回文子序列

#include<iostream>
using namespace std;
const int maxn = 1001;
bool dp[maxn][maxn] = {false};
int main(){
    string s;
    //cin >> s; 含空格不能这样读取一行
    getline(cin, s);
    int res = 1;
    int len = s.length();
    for(int i = 0; i < len; i++){
        dp[i][i] = true;
        if(i < len - 1 && s[i] == s[i + 1]){
            dp[i][i + 1] = true;
            res = 2;
        }
    }
    
    for(int l = 3; l <= len; l++){
        for(int i = 0; i <= len -l; i++){
            int j = i + l -1;
            if(dp[i + 1][j - 1] && s[i] == s[j]){
                dp[i][j] = true;
                res = l;
            }
        }
    }
    cout << res;
}