Cod sursa(job #1796985)

Utilizator iulianrotaruRotaru Gheorghe-Iulian iulianrotaru Data 3 noiembrie 2016 22:05:16
Problema Caramizi Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 2.08 kb
#include<fstream>
using namespace std;
class InputReader {
    public:
        InputReader() {}
        InputReader(const char *file_name) {
            input_file = fopen(file_name, "r");
            cursor = 0;
            fread(buffer, SIZE, 1, input_file);
        }
        inline InputReader &operator >>(long long &n) {
            while(buffer[cursor] < '0' || buffer[cursor] > '9') {
                advance();
            }
            n = 0;
            while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
                n = n * 10 + buffer[cursor] - '0';
                advance();
            }
            return *this;
        }
        inline InputReader &operator >>(int &n) {
            while(buffer[cursor] < '0' || buffer[cursor] > '9') {
                advance();
            }
            n = 0;
            while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
                n = n * 10 + buffer[cursor] - '0';
                advance();
            }
            return *this;
        }
    private:
        FILE *input_file;
        static const int SIZE = 1 << 17;
        int cursor;
        char buffer[SIZE];
        inline void advance() {
            ++ cursor;
            if(cursor == SIZE) {
                cursor = 0;
                fread(buffer, SIZE, 1, input_file);
            }
        }
}f("caramizi.in");
ofstream g("caramizi.out");
int i,j,n,m,cmax;
long long s,R[1<<20],C[1<<18],many[1<<20];
int main()
{
    f>>n>>m;
    for(i=1;i<=n;++i)
    {
        f>>j;
        ++many[j];
        cmax=max(cmax,j);
        s+=j;
    }
    for(i=1;i<=cmax;++i)
        R[i]=R[i-1]+i*many[i];
    for(i=cmax;i;--i)
        many[i]+=many[i+1];
    for(i=1;i<=cmax;++i)
        R[i]=max(R[i-1],((R[i]+many[i+1]*i)/i)*i);
    C[s/cmax+1]=R[cmax];
    for(i=s/cmax;i;--i)
        C[i]=max(C[i+1],(s/i)*i);
    C[0]=C[1];
    for(i=1;i<=m;++i)
    {
        f>>j;
        if(j>cmax)
        {
            R[cmax+1]=max((s/j)*j,C[s/j+1]);
            j=cmax+1;
        }
        g<<R[j]<<'\n';
    }
    return 0;
}