PAT-2021年秋季考试 - 甲级

满分有点多啊这次。

但是还是挺开心的嘿嘿。

7-1 Arrays and Linked Lists (20 分)

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int N, K;
vector<int> pos, cnt, pre;
vector<int> visited;
int main(){
    scanf("%d %d", &N, &K);
    int sum = 0;
    for(int i = 0; i < N; i++){
        int x, y; scanf("%d %d", &x, &y); sum += y;
        pos.push_back(x); cnt.push_back(y); pre.push_back(sum);
    }
    visited.resize(N, 0);
    for(int i = 0; i < K; i++){
        int x; scanf("%d", &x);
        auto it = upper_bound(pre.begin(), pre.end(), x);
        if(it==pre.end()) {printf("Illegal Access\n"); continue;}
        int id = it-pre.begin();
        int ans = (pos[id])+((id==0)?(x*4):(x-pre[id-1])*4);
        //cout << id << " " << pos[id] << " ";
        printf("%d\n", ans);
        visited[id] = 1;
    }
    int ans = 0;
    for(int i = 0; i < N; i++){
        if(visited[i]) ans = i;
    }
    printf("%d\n", ans+1);
}

7-2 Stack of Hats (25 分)

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int N;
vector<int> size, weight;
int main(){
    scanf("%d", &N);
    for(int i = 0; i < N; i++) {int x; scanf("%d", &x); size.push_back(x);}
    for(int i = 0; i < N; i++) {int x; scanf("%d", &x); weight.push_back(x);}
    vector<int> id1, id2;
    for(int i = 0; i < N; i++) {id1.push_back(i); id2.push_back(i);}
    sort(id1.begin(), id1.end(), [&](int l, int r){return size[l]>size[r];});
    sort(id2.begin(), id2.end(), [&](int l, int r){return weight[l]>weight[r];});
    vector<int> v(N, 0);
    for(int i = 0; i < N; i++) v[id1[i]] = i;
    vector<int> ans;
    for(int i = N-1; i >= 0; i--){
        int t = v[i];
        int p = id2[t];
        ans.push_back(p);
    }
    bool first = true;
    for(auto a:ans){
        if(first) first = false; else printf(" ");
        printf("%d", a+1);
    }
    printf("\n");
}

7-3 Playground Exploration (25 分)

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int N, M;
vector<vector<int>> grid;

int main(){
    scanf("%d %d", &N, &M);
    grid.resize(N+1);
    for(int i = 0; i < M; i++){
        int x, y; scanf("%d %d", &x, &y);
        grid[x].push_back(y); grid[y].push_back(x);
    }
    for(int i = 1; i <= N; i++) sort(grid[i].begin(), grid[i].end());
    
    int id = -1; int len = -1;
    for(int i = 1; i <= N; i++){
        vector<int> visited(N+1, 0);
        int cur = i; int tmplen = 0;
        while(true){
            int t = -1; visited[cur] = 1; tmplen++;
            for(auto a:grid[cur]) if(visited[a]==0) {t = a; break;}
            if(t==-1) break;
            cur = t; 
        }
        //cout << i << " " << tmplen << endl;
        if(len==-1 || tmplen>len){
            id = i;
            len = tmplen;
        }
    }
    printf("%d %d\n", id, len);
    
}

7-4 Sorted Cartesian Tree (30 分)

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

int N;
vector<int> key, priority;
vector<int> L, R;
int handle(int l, int r){
    if(l>r) return -1;
    int p = l; int val = 2147483647;
    for(int i = l; i <= r; i++) if(priority[i]<=val) {p = i; val = priority[i];}
    L[p]  = handle(l, p-1); R[p] = handle(p+1, r);
    return p;
}

int main(){

    
    scanf("%d", &N);
    for(int i = 0; i < N; i++){
        int x, y; scanf("%d %d", &x, &y);
        key.push_back(x); priority.push_back(y);
    }
    vector<int> ids;
    for(int i = 0; i < N; i++) ids.push_back(i);
    sort(ids.begin(), ids.end(), [&](int l, int r){return key[l]<key[r];});
    vector<int> tmp(N, 0);
    for(int i = 0; i < N; i++) tmp[i] = priority[ids[i]];
    priority = tmp;
    sort(key.begin(), key.end());
    L.resize(N+1, 0); R.resize(N+1, 0);
    int h = handle(0, N-1);
    
    //for(int i = 0; i < N; i++) cout << i << " " << L[i] << " " << R[i] << endl;
    
    queue<int> q;
    q.push(h);
    vector<int> ans;
    while(!q.empty()){
        int x = q.front(); q.pop(); ans.push_back(x);
        if(L[x]!=-1) q.push(L[x]);
        if(R[x]!=-1) q.push(R[x]);
    }
    bool first = true; 
    for(auto a:ans){
        if(first) first = false; else printf(" ");
        printf("%d", key[a]);
    }
    printf("\n"); first = true;
    for(auto a:ans){
        if(first) first = false; else printf(" ");
        printf("%d", priority[a]);
    }
    printf("\n");
    
    
}