牛客练习赛17

长方体

#include <bits/stdc++.h>
using namespace std;
 
int main(){
    int X1, X2, X3;
    scanf("%d %d %d", &X1, &X2, &X3);
    printf("%d
", 4 * (int)(sqrt(1.0 * X1 * X2 / X3 + 0.5) + sqrt(1.0 * X1 * X3 / X2 + 0.5) + sqrt(1.0 * X2 * X3 / X1 + 0.5)));
    return 0;
}

好位置

#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
char s[maxn], t[maxn];
int a[maxn], r[66];
 
int main(){
    scanf("%s %s", s + 1, t + 1);
    int ls = strlen(s + 1), lt = strlen(t + 1);
    int p = 1, ok = 1;
    for(int i = 1; i <= ls; ++i) {
        if (p <= lt && s[i] == t[p]) ++p;
        a[i] = p - 1;
    }
    p = lt;
    for(int i = ls; i >= 1; --i){
        if(p >= 1 && s[i] == t[p]){
            r[s[i]-'a'] = p;
            p--;
        }
        if(r[s[i]-'a'] && r[s[i]-'a'] <= a[i-1] + 1) continue;
        ok = 0;
        break;
    }
    puts(ok ? "Yes" : "No");
    return 0;
}

操作数

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL mod = 1e9 + 7;
LL a[2222];
 
LL qpow(LL a, LL b) {
    LL ret = 1LL;
    while (b) {
        if (b & 1) ret = ret * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ret;
}
 
LL inv(LL x) {
    return qpow(x, mod - 2);
}
 
int main() {
    int n, k;
    scanf("%d %d", &n, &k);
    for (int i = 1; i <= n; ++i) {
        scanf("%lld", a + i);
        LL ans = 0, tmp = 1;
        for (int j = i; j >= 1; --j) {
            ans = (ans + a[j] * tmp) % mod;
            tmp = tmp * (k - j + i) % mod * inv(i - j + 1) % mod;
        }
        printf("%lld%c", k ? ans : a[i], i == n ? '
' : ' ');
    }
    return 0;
}

经纬度

#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
 
int main(){
    int T;
    scanf("%d", &T);
    while(T--){
        double lat1, lng1, lat2, lng2, r = 6371009;
        scanf("%lf %lf %lf %lf", &lat1, &lng1, &lat2, &lng2);
        lat1 = lat1 / 180 * pi;
        lat2 = lat2 / 180 * pi;
        lng1 = lng1 / 180 * pi;
        lng2 = lng2 / 180 * pi;
        double x1 = r * cos(lat1) * sin(lng1), y1 = r * cos(lat1) * cos(lng1), z1 = r * sin(lat1);
        double x2 = r * cos(lat2) * sin(lng2), y2 = r * cos(lat2) * cos(lng2), z2 = r * sin(lat2);
        double x = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2) + (z1 - z2) * (z1 - z2));
        double c = acos((2 * r * r - x * x) / 2 / r / r);
        double d = c * r - x;
        printf("%.0f
", d);
    }
    return 0;
}

求长度

#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int maxn = 1e5 + 10;
const int INF = 1e9;
vector<pii> G[maxn];
int n, p[11];
 
int dis[maxn], vis[maxn];
void dijkstra(int s){
    for(int i = 0; i <= n; ++i) dis[i] = INF, vis[i] = 0;
    dis[s] = 0;
    priority_queue<pii> pq;
    pq.push(pii(0, s));
    while(!pq.empty()){
        int x = pq.top().second; pq.pop();
        if(vis[x]) continue;
        vis[x] = 1;
        for(int i = 0; i < G[x].size(); ++i){
            int to = G[x][i].first, d = G[x][i].second;
            if(dis[to] > dis[x] + d) {
                dis[to] = dis[x] + d;
                pq.push(pii(-dis[to], to));
            }
        }
    }
}
 
int d[11][11], f[1<<10][10];
int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        int m, S;
        scanf("%d %d", &n, &m);
        for (int i = 0; i <= n; ++i) G[i].clear();
        for (int i = 1; i <= m; ++i) {
            int x, y, z;
            scanf("%d %d %d", &x, &y, &z);
            G[x].push_back(pii(y, z));
            G[y].push_back(pii(x, z));
        }
        scanf("%d", &S);
        for(int i = 0; i < (1 <<S); ++i)
            for(int j = 0; j < S; ++j)
                f[i][j] = INF;
        for (int i = 1; i <= S; ++i) scanf("%d", p + i);
        for (int i = 1; i <= S; ++i) {
            dijkstra(p[i]);
            f[1<<(i-1)][i-1] = d[0][i] = d[i][0] = dis[0];
            for (int j = 1; j <= i; ++j) {
                d[i][j] = d[j][i] = dis[p[j]];
            }
        }
        for(int i = 0; i < (1 << S); ++i){
            for(int j = 0; j < S; ++j){
                if(f[i][j] == INF) continue;
                for(int k = 0; k < S; ++k){
                    if(i & (1 << k)) continue;
                    if(d[j+1][k+1] == INF) continue;
                    f[i^(1<<k)][k] = min(f[i^(1<<k)][k], f[i][j] + d[j+1][k+1]);
                }
            }
        }
        int ans = INF;
        for(int i = 0; i < S; ++i){
            ans = min(ans, f[(1<<S)-1][i] + d[0][i+1]);
        }
        printf("%d
", ans);
    }
    return 0;
}

玩游戏

#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 10;
char s[maxn], t[maxn];
 
bool check(int x, int lt){
    for(int i = 1; i <= lt; ++i)
        if(s[x+i] != t[i]) return false;
    return true;
}
 
int main(){
    int T;
    scanf("%d", &T);
    while(T--){
        scanf("%s %s", s + 1, t + 1);
        int ls = strlen(s + 1), lt = strlen(t + 1), ok = 0;
        if(ls == lt){
            if(check(0, lt)) ok = 1;
        }
        else if((ls - lt) % 2 == 1) {
            if (check((ls - lt - 1) / 2, lt) && check((ls - lt - 1) / 2 + 1, lt)) ok = 1;
        }
        else {
            if ((check((ls - lt - 1) / 2, lt) || check((ls - lt - 1) / 2 + 1, lt)) && (check((ls - lt - 1) / 2 + 1, lt) || check((ls - lt - 1) / 2 + 2, lt))) ok = 1;
        }
        puts(ok ? "Alice" : "Bob");
    }
    return 0;
}