Code Jam Round 1A 2018

Waffle Choppers

暴力

#include <bits/stdc++.h>
using namespace std;
char G[111][111];
int sum[111][111];

int main(){
    int T;
    scanf("%d", &T);
    for(int kase = 1; kase <= T; ++kase){
        int R, C, H, V;
        scanf("%d %d %d %d", &R, &C, &H, &V);
        for(int i = 1; i <= R; ++i){
            scanf("%s", G[i] + 1);
            for(int j = 1; j <= C; ++j) sum[i][j] = (G[i][j] == '@' ? 1 : 0);
        }
        for(int i = 1; i <= R; ++i)
            for(int j = 1; j <= C; ++j)
                sum[i][j] += sum[i-1][j];
        for(int i = 1; i <= R; ++i)
            for(int j = 1; j <= C; ++j)
                sum[i][j] += sum[i][j-1];
        int ok = 1;
        if(sum[R][C] % ((H + 1) * (V + 1)) != 0) ok = 0;
        int t1 = sum[R][C] / (V + 1);
        int t2 = sum[R][C] / (H + 1);
        int t3 = t1 / (H + 1);
        vector<int> v, h;
        h.push_back(0);
        v.push_back(0);
        for(int i = 1; i <= R; ++i){
            if(sum[i][C] - sum[h[h.size()-1]][C] > t2) {ok = 0; break;}
            if(sum[i][C] - sum[h[h.size()-1]][C] == t2) h.push_back(i);
        }
        for(int i = 1; i <= C; ++i){
            if(sum[R][i] - sum[R][v[v.size()-1]] > t1) {ok = 0; break;}
            if(sum[R][i] - sum[R][v[v.size()-1]] == t1) v.push_back(i);
        }

        for(int i = 1; i < h.size(); ++i){
            for(int j = 1; j < v.size(); ++j){
                int tmp = sum[h[i]][v[j]];
                tmp -= sum[h[i-1]][v[j]];
                tmp -= sum[h[i]][v[j-1]];
                tmp += sum[h[i-1]][v[j-1]];
                if(tmp != t3) ok = 0;
            }
        }

        printf("Case #%d: %s
", kase, ok ? "POSSIBLE" : "IMPOSSIBLE");
    }
    return 0;
}

Bit Party

二分

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL M[1111], S[1111], P[1111];

bool cmp(LL i, LL j){
    return i > j;
}

int main(){
    int T;
    scanf("%d", &T);
    for(int kase = 1; kase <= T; ++kase){
        LL R, B, C;
        scanf("%lld %lld %lld", &R, &B, &C);
        for(int i = 1; i <= C; ++i) scanf("%lld %lld %lld", M + i, S + i, P + i);
        LL l = 0, r = 5e18;
        while(l < r){
            LL mid = l + (r - l) / 2;
            vector<LL> tmp;
            for(int i = 1; i <= C; ++i){
                if(mid >= P[i]) tmp.push_back(min(M[i], (mid - P[i]) / S[i]));
            }
            sort(tmp.begin(), tmp.end(), cmp);
            LL sum = 0;
            for(int i = 0; i < min(R, (LL)tmp.size()); ++i) sum += tmp[i];
            if(sum >= B) r = mid;
            else l = mid + 1;
        }
        printf("Case #%d: %lld
", kase, r);
    }
    return 0;
}

Edgy Baking

dp

#include <bits/stdc++.h>
using namespace std;
typedef pair<int, double> pii;
double dp[111*255];
vector<pii> v;

int main(){
    int T;
    scanf("%d", &T);
    for(int kase = 1; kase <= T; ++kase){
        int N, P, sum = 0;
        scanf("%d %d", &N, &P);
        v.clear();
        for(int i = 1; i <= N; ++i){
            int w, h;
            scanf("%d %d", &w, &h);
            int m = min(w, h);
            sum += w + h + w + h;
            v.push_back(pii(m , 2 * sqrt(w * w + h * h)));
        }
        memset(dp, 0, sizeof(dp));
        int up = min((P - sum) / 2, 250 * 100);
        for(int i = 0; i < v.size(); ++i)
            for(int j = up - v[i].first; j >= 0; --j)
                dp[j+v[i].first] = max(dp[j+v[i].first], dp[j] + v[i].second);
        double ans = 0;
        for(int j = 0; j <= up; ++j) ans = max(ans, dp[j]);
        printf("Case #%d: %.10f
", kase, min((double)P, ans + sum));
    }
    return 0;
}