Codeforces Round #799 (Div. 4)

div2 唯唯诺诺 div4 重拳出击

A

if else 判断

signed main() {
    cin >> t;
    while (t --) {
        int a, b, c, d;
        int ans = 0;
        cin >> a >> b >> c >> d;
        if (a < b) ans ++;
        if (a < c) ans ++;
        if (a < d) ans ++;
        cout << ans << endl;
    }
    
    return 0;
}

B

简单结论

signed main() {
    cin >> t;
    while (t --) {
        int n;
        cin >> n;
        map<int, int> mp;
        for (int i = 1, x; i <= n; i ++) cin >> x, mp[x] ++;
        int ans = 0, res = 0;
        for (auto [x, y] : mp) 
            if (y % 2) ans ++;
            else res ++;
        cout << ans + res / 2 * 2 << endl;
    }
    
    return 0;
}

C

模拟

int t;
const int N = 111;
char g[N][N];
pair<int, int> s[] = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
int check(int i, int j) {
    int ans = 0;
    for (auto [x, y] : s) {
        ans += g[i + x][j + y] == '#';
    }
    return ans;
}
signed main() {
    cin >> t;
    while (t --) {
        for (int i = 1; i <= 8; i ++)
        for (int j = 1; j <= 8; j ++)
            cin >> g[i][j];
        for (int i = 1; i <= 8; i ++)
        for (int j = 1; j <= 8; j ++)
            if (g[i][j] == '#' && check(i, j) > 2) 
                cout << i << " " << j << endl;
    }
    
    return 0;
}

D

模拟

int t;
const int N = 111;
char g[N][N];
int check(int a, int b) {
    if ((a / 10 == b % 10) && (a % 10 == b / 10)) return 1;
    return 0;
}
int v[100][100];
signed main() {
    cin >> t;
    while (t --) {
        int a, b, c;
        scanf("%d:%d%d", &a, &b, &c);
        int ans = 0;
        int ca = a, cb = b;
        int t = 0;
        memset(v, 0, sizeof v);
        do {
            int tt = check(a, b);
            if (tt && !v[a][b]) v[a][b] = 1, ans ++;
            b += c;
            if (b >= 60) {
                a += b / 60;
                b %= 60;
                a %= 24;
            }
            t ++;
        } while(t < 100000);
        cout << ans << endl;
    }
    return 0;
}

E

前缀和 二分

int t;
const int N = 2e5 + 111;
int s[N], g[N];
signed main() {
    cin >> t;
    while (t --) {
        int n, k;
        cin >> n >> k;
        for (int i = 1; i <= n; i ++) cin >> g[i], s[i] = s[i - 1] + g[i];
        if (s[n] < k) cout << -1 << endl;
        else {
            int ans = n;
            for (int i = n; i >= 1; i --) {
                if (s[i] < k) break;
                else if (s[i] == k) {
                    ans = min(ans, n - i);
                    continue;
                }
                int t = lower_bound(s + 1, s + 1 + n, s[i] - k) - s;
                ans = min(ans, n - i + t - 1 + 1);
            }
            cout << ans << endl;
        }
    }
    return 0;
}

F

枚举 暴力

int t;
const int N = 2e5 + 111;
int s[N], g[N];
signed main() {
    cin >> t;
    while (t --) {
        int n;
        cin >> n;
        map<int, int> mp;
        for (int i = 1; i <= n; i ++) cin >> g[i], mp[g[i] % 10] ++;
        int f = 0;
        for (int i = 0; i <= 9; ++ i)
        for (int j = 0; j <= 9; ++ j)
        for (int k = 0; k <= 9; ++ k)
            {
                int arr[10] = {0};
                arr[i] ++;arr[j] ++; arr[k] ++;
                if (mp[i] >= arr[i] && mp[j] >= arr[j] && mp[k] >= arr[k] && (i + j + k) % 10 == 3) {
                    f = 1; goto end;
                }
            }
        end:
        cout << (f ? "YES":"NO") <<endl;
    }
    
    return 0;
}

G

前缀和

int t;
const int N = 2e5 + 111;
int s[N], g[N];
signed main() {
    cin >> t;
    while (t --) {
        int n, k;
        cin >> n >> k;
        for (int i = 1; i <= n; i ++) cin >> g[i];
        for (int i = 1; i <= n; i ++)
            s[i] = g[i - 1] < g[i] * 2;
        for (int i = 1; i <= n; i ++) s[i] = s[i - 1] + s[i];
        int ans = 0;
        for (int i = k + 1; i <= n; i ++) {
            if (s[i] - s[i - k] == k) ans ++;
        }
        cout << ans << endl;
    }
    
    return 0;
}

H

分类 最大字段和 简单dp

const int N = 2e5 + 111;
int g[N], t;
int main() {
    cin >> t;
    while (t --) {
        int n;
        cin >> n;
        for (int i = 1; i <= n; i ++) cin >> g[i];
        map<int, vector<int>> mp;
        map<int, vector<pair<int, int>>> mq;
        map<int, int> pre;
        for (int i = 1; i <= n; i ++) {
            int l = i, r = i, v = g[i];
            while (i < n && g[i + 1] == v) i ++;
            r = i;
            if (pre[v]) mp[v].push_back(-(l - pre[v] - 1)), mq[v].push_back({pre[v] + 1, l - 1});
            pre[v] = r;
            mp[v].push_back(r - l + 1);
            mq[v].push_back({l, r});
        }
        int ans = 0, l = 0, r = 0, v = 0;
        for (auto [x, y] : mp) {
            int st = 0, res = 0, en = 0;
            auto b = mq[x];
            for (int i = 0; i < y.size(); i ++) {
                if (res <= 0) st = i, en = i, res = y[i];
                else res += y[i], en = i;
                if (res > ans) ans = res, l = b[st].x, r = b[en].y, v = x;
            }
        }
        cout << v << " " << l << " " << r << endl;
    }
    return 0;
}