Cod sursa(job #1222514)

Utilizator mariusn01Marius Nicoli mariusn01 Data 23 august 2014 14:36:26
Problema Ghiozdan Scor 36
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.5 kb
#include <fstream>
#define DIM 75010
#define INF 1000000000

using namespace std;
ifstream fin("ghiozdan.in");
ofstream fout("ghiozdan.out");


int F[210];
int D[2][DIM];
int Q[DIM];
//D[i][j] = numarul minim de obiecte pentru a obtine greutatea j
//luand in calcul doar greutatile <= i

int N, G, i, j, r, x, p, u, step, act;

int main() {
    fin>>N>>G;
    for (i=1;i<=N;i++) {
        fin>>x;
        F[x]++;
    }

    for (i=0;i<=1;i++)
        for (j=0;j<=G;j++)
            D[i][j] = INF;

//    for (j=0;j<=G;j+=i)
    D[0][0] = 0;
    act = 1;

    for (i=1;i<=200;i++) {
        if (F[i] == 0)
            continue;

        D[0][0] = 0;
        D[1][0] = 0;

        for (r=i; r>=1; r--) {
            //calculez D[i][j] cu j de forma multiplu de i + r
            p = 1; u = 0;


            for (j=r; j<=G; j+=i) {
                D[act][j] = D[!act][j];
                if (j-i >= 0 && D[!act][j-i] != INF) {
                    while (p<=u && D[!act][j-i] < D[!act][ Q[u] ] + (j-i-Q[u])/i + 1) {
                        u--;
                    }
                    Q[++u] = j-i;
                }

                if ((j-Q[p])/i > F[i])
                    p++;
                if (p <= u)
                    D[act][j] = D[!act][ Q[p] ] + ( j-Q[p] )/i;


            }

        }
        act = !act;
    }
    for (i=G; i>=1; i--)
        if (D[!act][i] != INF) {
            fout<<i<<" "<<D[!act][i];
            break;
        }

    return 0;
}