Codeforces EDU 155

A.
如果存在一个运动员体力和耐力都大于1号，那么输出-1，否则贪心输出1号运动员的体力

struct node{
    int a,b,id;
}s[300000];
bool cmp(node x,node y){
    if(x.a==y.a) return x.b > y.b;
    return x.a > y.a;
}
void solve(){

    int n;
    cin >> n;
    int ma = 0,me = 0;
    int f = 1;
    for(int i = 1;i<=n;i++){
        cin >> s[i].a >> s[i].b;
        if(i>1){
            if(s[i].a>=s[1].a){
                if(s[i].b>=s[1].b){
                    f = 0;
                }
            }
        }
    }
    if(f) cout<<s[1].a<<endl;
    else cout<<-1<<endl;



}

B.
考虑竖着放和横着放，如果竖着放，答案是将A数组所有数加起来再加上B数组最小的数乘以n，反之同理

#define ll long long
void solve(){

    int n;
    cin >> n;
    vector<ll>a(n);
    vector<ll>b(n);
    ll ma = 1000000000;
    ll mb = 1000000000;
    ll s1 = 0;
    ll s2 = 0;
    for(int i = 0;i<n;i++){
        cin >> a[i];
        ma = min(a[i],ma);
        s1 += a[i];
    }

    for(int i = 0;i<n;i++){
        cin >> b[i];
        mb = min(mb,b[i]);
        s2 += b[i];
    }
    cout<<min(s1+mb*n,s2+ma*n)<<'\n';



}

C.
找到连续的1段和0段，对每个这样的段，每个段的数量减1累加起来，就是答案的第一项，第二项是所有段的长度相乘再乘以第一项的全排列数量，即第一项的阶乘。

def precompute_factorials(n, mod):
    factorials = [1] * (n + 1)
    for i in range(1, n + 1):
        factorials[i] = (factorials[i - 1] * i) % mod
    return factorials

def solve():
    p = 998244353
    s = input()
    cnt = 1
    k = 1
    sum_val = 0

    for i in range(1, len(s)):
        if s[i] == s[i - 1]:
            cnt += 1
        else:
            if  cnt > 1:
                sum_val += cnt - 1
                k *= (cnt)%p
            cnt = 1

    # print((1 * 200000 % p * 199999 % p) % p, end=" ")
    if cnt > 1:
        sum_val += cnt - 1
        k *= (cnt ) % p
    k*=(factorials[sum_val])
    print(sum_val, k%p)

def main():
    _ = int(input())
    for _ in range(_):
        solve()

factorials = precompute_factorials(200010, 998244353)

if __name__ == "__main__":
    main()