UVALive 3664:Guess(贪心 Grade E)

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

#define N 20000

struct Man{
    int a[3];
    int possible[8];
    void read() {
        for (int i = 0; i < 3; i++) {
            double tmp;
            scanf("%lf", &tmp);
            a[i] = (int)((tmp+1e-4)*100);
        }
        for (int i = 0; i < 8; i++) {
            int sum = 0;
            for (int j = 0; j < 3; j++) {
                if ((i>>j)&1) {
                    sum += a[j];
                }
            }
            possible[i] = sum;
        }
        sort(possible, possible+8);
    }
}man[N];
int rk[N];
int n;

bool dfs(int pre, int id) {
    if (id <= 0) return true;
    int minres = 0x3f3f3f3f;
    bool isok = false;
    for (int i = 7; i >= 0; i--) {
        if (man[rk[id]].possible[i] > pre || (man[rk[id]].possible[i] == pre && rk[id] < rk[id+1])) {
            isok = true;
            minres = min(minres, man[rk[id]].possible[i]);
        } else break;
    }
    if (!isok) return false;

    return dfs(minres, id-1);
}

int main() {
    int cas = 1;
    while (scanf("%d", &n)!=EOF) {
        if (n == 0) break;
        printf("Case %d: ", cas++);
        for (int i = 1; i <= n; i++) {
            man[i].read();
        }
        for (int i = 1; i <= n; i++) {
            scanf("%d",&rk[i]);
        }

        int ans = -1;
        for (int i = 0; i < 8; i++) {
            if (dfs(man[rk[n]].possible[i], n-1)) {
                ans = max(ans, man[rk[n]].possible[i]);
            } else break;
        }

        if (ans == -1) {
            puts("No solution");
        } else {
            printf("%.2f\n", ans/100.0);
        }
    }
    return 0;
}