Code Jam Round 1C 2018

A Whole New Word

暴力

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
char s[11], t[11];
set<string> S;
map<char, int> cnt[11];
int ok, L;

void dfs(int l){
    if(l == L + 1){
        t[l] = 0;
        if(S.find(string(t + 1)) != S.end()) return;
        ok = 1;
        puts(t + 1);
        return;
    }
    for(char c = 'A'; c <= 'Z'; c++){
        if(ok) return;
        if(cnt[l].find(c) == cnt[l].end()) continue;
        t[l] = c;
        dfs(l + 1);
    }
}

int main(){
    int T;
    scanf("%d", &T);
    for(int kase = 1; kase <= T; ++kase){
        S.clear();
        int N;
        scanf("%d %d", &N, &L);
        for(int i = 1; i <= L; ++i) cnt[i].clear();
        for(int i = 1; i <= N; ++i){
            scanf("%s", s + 1);
            S.insert(string(s + 1));
            for(int j = 1; j <= L; ++j)
                cnt[j][s[j]]++;
        }
        ok = 0;
        printf("Case #%d: ", kase);
        dfs(1);
        if(!ok) puts("-");
    }
    return 0;
}

Lollipop Shop

贪心出现次数少的

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int cnt[222], vis[222];

int main(){
    int T;
    scanf("%d", &T);
    while(T--){
        int n;
        scanf("%d", &n);
        memset(cnt, 0, sizeof(cnt));
        memset(vis, 0, sizeof(vis));
        for(int i = 1; i <= n; ++i){
            int x, y, m = 222, p = -1;
            scanf("%d", &x);
            for(int j = 1; j <= x; ++j){
                scanf("%d", &y);
                cnt[y]++;
                if(vis[y]) continue;
                if(cnt[y] < m) m = cnt[y], p = y;
            }
            if(p != -1) vis[p] = 1;
            cout << p << endl;
        }
    }
    return 0;
}

Ant Stack

暴力一下发现最多一百多层

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL INF = 1e18;
LL f[222];

int main(){
    int T;
    scanf("%d", &T);
    for(int kase = 1; kase <= T; ++kase){
        for(int i = 1; i <= 200; ++i) f[i] = INF;
        int n, w, ans = 0;
        scanf("%d", &n);
        for(int i = 1; i <= n; ++i){
            scanf("%d", &w);
            for(int j = 200; j >= 0; j--){
                if(6LL * w >= f[j]) f[j+1] = min(f[j+1], f[j] + w);
            }
        }
        for(int i = 1; i <= 200; ++i)
            if(f[i] != INF) ans = i;
        printf("Case #%d: %d
", kase, ans);
    }
    return 0;
}