SMU Summer 2024 Team Round 1 ACGHJK题解

A. Maliang Learning Painting

思路:三个数相加即可 (难度在于英文题面

AC代码:

#include<iostream>
#include<queue>
#include<algorithm>
#include<cmath>
#include<utility>
#include<map>
#include<vector>

using namespace std;
#define int long long
int a,b,c;
signed main() {
    cin >> a >> b >> c;
    int ans = a+b +c;
    cout << ans;
    return 0;
}

C - Liar

思路:若所有数加起来与s相等则可无人说谎,若不等则最少1人说谎

AC代码:

#include<iostream>
#include<queue>
#include<algorithm>
#include<cmath>
#include<utility>
#include<map>
#include<vector>

using namespace std;
#define int long long
const int N = 1e5+10;
int n,s;
int a[N];

signed main() {
    cin >> n >> s;
    int sum = 0;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        sum+=a[i];
    }
    if(sum == s)cout << n << endl;
    else cout << n-1 << endl;
    return 0;
}

G - Multiples of 5 

思路:因为11的每个次方个位都是1,所以直接将每组数相乘在模5,看是否为0即可

#include<iostream>
#include<queue>
#include<algorithm>
#include<cmath>
#include<utility>
#include<map>
#include<vector>

using namespace std;
#define int long long
int t;

signed main() {
    cin >> t;
    while(t--) {
        int n;
        cin >> n;
        int ans = 0;
        for (int i = 1; i <= n; i++) {
            int a;
            char b;
            int c;
            cin >> a >> b;
            if(b == 'A') {
                c = 0;
            }
            else c = b-'0';
            ans += (a*c);
        }
        if(ans%5 == 0)cout << "Yes" << endl;
        else cout << "No" << endl;
    }
    return 0;
}

H - Convolution

思路:

考虑卷积核 K 中的每个元素产生贡献。K 中的每个元素都对应矩阵 I 中 的一个子矩阵。
例如 Ki,j 产生的贡献是 Ki,j× 矩阵 Ii,j∼n−k+i,m−l+j 的子矩阵之和，其中 的 k,l 是卷积核 K 的长宽。

所以当子矩阵和为负数时，Ki,j 取 −1;子矩阵和为正数时，Ki,j 取 1。快 速求出某个子矩阵和可以用二维前缀和来实现。

AC代码:

#include<bits/stdc++.h>

using namespace  std;
#define int long long
#define endl "\n"
int a[1010][1010];
int sum[1010][1010];
int n,m,k,l;
void solve(){
    cin>>n>>m>>k>>l;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            int x;
            cin>>x;
            sum[i][j]=sum[i][j-1]+x;
        }
    }
    int res=0;

    for(int i=1;i<=k;i++){
        for(int j=1;j<=l;j++){
            int ans=0;
            for(int p=0;p<n-k+1;p++){
                ans+=sum[i+p][j+m-l]-sum[i+p][j-1];
//                cout << sum[i+p][j+l-1]-sum[i+p][j-1] << ".";
//                cout << ans << ' ';
            }
            res+=abs(ans);
        }
    }

    cout<<res<<endl;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    while(t--){
        solve();
    }
    return 0;
}

J - Magic Mahjong

思路:(难点在于不会打麻将)(跟着傅姐学麻将(bushi))输入字符串,看是否符合题意中的 [国士无双] 或者 [七对子]

AC代码:

#include<iostream>
#include<queue>
#include<algorithm>
#include<cmath>
#include<utility>
#include<map>
#include<vector>

using namespace std;
#define int long long
const int mod = 998244353;
string p[11] = {"1p","2p","3p","4p","5p","6p","7p","8p","9p"};
string s[11] = {"1s","2s","3s","4s","5s","6s","7s","8s","9s"};
string m[11] = {"1m","2m","3m","4m","5m","6m","7m","8m","9m"};
string z[11] = {"1z","2z","3z","4z","5z","6z","7z"};

int t;

signed main() {
    cin >> t;
    map<string,bool>mp;

    for (int i = 0; i <= 8; i++) {
        mp[p[i]] = false;
        mp[s[i]] = false;
        mp[m[i]] = false;
    }
    mp["1p"] = true;mp["9p"] = true;
    mp["1s"] = true;mp["9s"] = true;
    mp["1m"] = true;mp["9m"] = true;
    for (int i = 0; i <= 6; i++)mp[z[i]] = true;

    while(t--) {
        string ls;
        cin >> ls;
        bool st = true;
        map<string,int>ve;

        for (int i = 0; i < ls.length(); i=i+2) {
            string lp;
            lp = lp+ls[i];
            lp = lp+ls[i+1];
            if(!mp[lp]) {
                st = false;
            }
            ve[lp]++;
        }

        int res = 0;
        int ans = 0;
        for (auto x : ve) {
            if(x.second == 1)res++;
            if(x.second == 2)ans++;
        }
        if(st && res == 12 && ans == 1) cout << "Thirteen Orphans" << endl;
        else if(ans == 7)cout << "7 Pairs" << endl;
        else cout << "Otherwise" << endl;
    }

    return 0;
}

K - Magic Tree

思路:可以从样例和二行二列的结果看出,可以每次看做从已知的方块左侧加一列,那么向右和向上为2种情况,走到已知的情况中,所以答案即为 2*已知 ,已知的初始为2,所以答案 即为 2^(m-1)

AC代码:

#include<iostream>
#include<queue>
#include<algorithm>
#include<cmath>
#include<utility>
#include<map>
#include<vector>

using namespace std;
#define int long long
const int mod = 998244353;
int t;

int qpow(int base,int power) {
    int res = 1;
    while(power) {
        if(power&1)res = res*base%mod;
        base = base*base%mod;
        power >>=1;
    }
    return res;
}

signed main() {
    cin >> t;
    int ans =qpow(2,t-1) %mod;
    cout << ans;
    return 0;
}