百花数据结构第二次上机考试

前言

感觉这次难度比上次大，代码应该比上次更复杂，也有可能是我全忘了。。。

A: 篮球比赛技术统计效率值

code

#include<bits/stdc++.h>
using namespace std;
#define isw {ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
typedef pair<int,int>P;
#define inf 0x3f3f3f3f
#define maxn 100005
#define int long long
signed main(){
    string s;
    while(cin>>s){
    int ans=0;
    int t=0;
    int a=0;
    int b=0;
    for(int i=0;i<s.size();i++){
        if(s[i]>='0'&&s[i]<='9'){
            if(s[i]=='1'){
                if(s[i+1]=='Y'){
                    
                    ans++;
                }
                else a++;
            }
            else if(s[i+1]=='Y')ans+=(s[i]-'0');
            else if(s[i+1]=='N')b++;
        }
        else if(s[i]!='Y'&&s[i]!='N'){
            if(s[i]!='T')ans+=1;
        else ans--;
        }
         
    }
    // cout<<ans<<endl;
    // cout<<a<<" "<<b<<endl;
         ans-=(a+b);
    cout<<ans<<endl;
}
}

B: 三个数的排序

code

#include<bits/stdc++.h>
using namespace std;
#define isw {ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
typedef pair<int,int>P;
#define inf 0x3f3f3f3f
#define maxn 100005
#define int long long
signed main(){
    int a[3];
    for(int i=0;i<3;i++)cin>>a[i];
    sort(a,a+3);
    for(int i=0;i<3;i++)cout<<a[i]<<" ";
    return 0;
}

C: 是否为有效的拓扑序列

code

#include<bits/stdc++.h>
using namespace std;
#define isw {ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
typedef pair<int,int>P;
#define inf 0x3f3f3f3f
#define maxn 100005
#define int long long
int d[105][105];
int indegree[105];
signed main(){
    int n,m;
    cin>>n>>m;
    while(m--){
        int a,b;
        cin>>a>>b;
        d[a][b]=1;
        indegree[b]++;
    }
    int t;
    cin>>t;
    vector<int>a[t+5];
    for(int i=0;i<n;i++){
        for(int j=0;j<t;j++){
            a[j].push_back(indegree[i]);
        }
    }
    for(int k=0;k<t;k++){
        vector<int>v;
        for(int i=0;i<n;i++){
            int x;
            cin>>x;
            v.push_back(x);
        }
        bool isok=true;
        for(int i=0;i<n;i++){
            if(a[k][v[i]]>0){
                isok=false;
                break;
            }
            else {
                for(int j=0;j<n;j++){
                    if(d[v[i]][j])a[k][j]--;
                }
            }
        }
        if(isok)cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
     
}

E: 简单扑克牌游戏

code

#include<bits/stdc++.h>
using namespace std;
#define isw {ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
typedef pair<int,int>P;
#define inf 0x3f3f3f3f
#define maxn 1005
//#define int long long
 
int fun(string a,string b,string c){
    if(a[1]==b[1]&&b[1]==c[1]){
        if(a[0]+1==b[0]&&b[0]+1==c[0])return 1;
        else return 4;
    }
    if(a[0]+1==b[0]&&b[0]+1==c[0])return 2;
    if(a[0]==b[0]&&b[0]==c[0])return 3;
    if(a[0]==b[0]||a[0]==c[0]||c[0]==b[0])return 5;
    return 6;
}
int main(){
    string a,b,c,x,y,z;
    while(cin>>a>>b>>c>>x>>y>>z){
        if(fun(a,b,c)==fun(x,y,z)){
            if(fun(a,b,c)==1||fun(a,b,c)==2||fun(a,b,c)==3){
                if(a[0]>x[0])cout<<"zhangsan"<<endl;
                else if(a[0]<x[0])cout<<"lisi"<<endl;
                else cout<<"tie"<<endl;
            }
            else if(fun(a,b,c)==4){
                if(c[0]>z[0])cout<<"zhangsan"<<endl;
                else if(c[0]<z[0])cout<<"lisi"<<endl;
                else cout<<"tie"<<endl;
            }
            else if(fun(a,b,c)==5){
                int m,n;
                if(a[0]==b[0]||a[0]==c[0])m=a[0]-'0';
                else m=b[0]-'0';
                if(x[0]==y[0]||x[0]==z[0])n=x[0]-'0';
                else n=y[0]-'0';
                if(m>n)cout<<"zhangsan"<<endl;
                else if(m<n)cout<<"lise"<<endl;
                else cout<<"tie"<<endl;
            }
            else {
                if(c[0]>z[0])cout<<"zhangsan"<<endl;
                else if(c[0]<z[0])cout<<"lisi"<<endl;
                else cout<<"tie"<<endl;
            }
        }
        else if(fun(a,b,c)<fun(x,y,z))cout<<"zhangsan"<<endl;
        else cout<<"lisi"<<endl;
    }
}

F: 五子棋-五子连线

code

#include<bits/stdc++.h>
using namespace std;
#define isw {ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
typedef pair<int,int>P;
#define inf 0x3f3f3f3f
#define maxn 1005
//#define int long long
int dis[maxn],d[maxn][maxn];
bool vis[maxn];
int n,m;
bool judge(int x,int y){
    if(x>=0&&x<=9&&y>=0&&y<=9)return 1;
    return 0;
}
int main(){
    int a[5],b[5];
    for(int i=0;i<4;i++){
        cin>>a[i]>>b[i];
    }
    sort(a,a+4);
    sort(b,b+4);
    int x,y;
    if(a[3]-a[0]==4||b[3]-b[0]==4){
        for(int i=1;i<4;i++){
            if(a[i]-a[i-1]==2){
                x=(a[i]+a[i-1])/2;
                y=(b[i]+b[i-1])/2;
            }
        }
        for(int i=1;i<4;i++){
            if(b[i]-b[i-1]==2){
                x=(a[i]+a[i-1])/2;
                y=(b[i]+b[i-1])/2;
            }
        }
    }
    else if(judge(2*a[0]-a[1],2*b[0]-b[1])){
        x=2*a[0]-a[1];
        y=2*b[0]-b[1];
    }
    else if(judge(2*a[3]-a[2],2*b[3]-b[2])){
        x=2*a[3]-a[2];
        y=2*b[3]-b[2];
    }
    cout<<x<<" "<<y<<endl;
}

G: 案例6-1.7：公路村村通

code

#include<bits/stdc++.h>
using namespace std;
#define isw {ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
typedef pair<int,int>P;
#define inf 0x3f3f3f3f
#define maxn 1005
//#define int long long
int dis[maxn],d[maxn][maxn];
bool vis[maxn];
int n,m;
int prim(){
    memset(vis,0,sizeof(vis));
    memset(dis,0x3f,sizeof(dis));
    int res=0;
    for(int i=0;i<n;i++){
        int t=-1;
        for(int j=1;j<=n;j++){
            if(!vis[j]&&(t==-1||dis[j]<dis[t])){
                t=j;
            }
        }
        if(i!=0&&dis[t]==inf)return inf;
        if(i!=0)res+=dis[t];
        for(int j=1;j<=n;j++)dis[j]=min(dis[j],d[j][t]);
        vis[t]=true;
    }
    return res;
}
int main(){
    cin>>n>>m;
    memset(d,0x3f,sizeof(d));
    while(m--){
        int a,b,c;
        cin>>a>>b>>c;
        d[a][b]=d[b][a]=min(d[a][b],c);
    }
    int ans=prim();
   // cout<<(ans==inf)<<endl;
    if(ans==inf)cout<<"-1"<<endl;
    else cout<<ans<<endl;
}