Cod sursa(job #2180804)

Utilizator Coroian_DavidCoroian David Coroian_David Data 21 martie 2018 10:53:09
Problema Cowfood Scor 60
Compilator cpp Status done
Runda Arhiva de probleme Marime 2.59 kb
#include <bits/stdc++.h>

#define MOD 3210121

#define MAX_N 20
#define MAX_K 30
#define MAX_S 10000

#define MAX_COMB 50

using namespace std;

typedef long long lint;

FILE *f, *g;

int k, s, n;
int total;

int comb[MAX_S + MAX_K + 1][MAX_K + 1];
int stars[MAX_S + 1];
int a[MAX_N + 1][MAX_K + 1];

void readFile()
{
    f = fopen("cowfood.in", "r");

    fscanf(f, "%d%d%d", &k, &s, &n);

    int i, j;
    for(i = 1; i <= n; i ++)
    {
        for(j = 1; j <= k; j ++)
            fscanf(f, "%d", &a[i][j]);
    }

    fclose(f);
}

void getComb()
{
    int i, j;
    for(i = 0; i <= s + k; i ++)
    {
        int mn = min(i, k);
        for(j = 0; j <= mn; j ++)
            comb[i][j] = 0;
    }

    comb[0][0] = 1;
    for(i = 1; i <= s + k; i ++)
    {
        int mn = min(i, k);

        comb[i][0] = 1;
        for(j = 1; j <= mn; j ++)
        {
            comb[i][j] = comb[i - 1][j] + comb[i - 1][j - 1];

            if(comb[i][j] >= MOD)
                comb[i][j] -= MOD;
        }
    }
}

void getStars()
{
    int i;
    stars[0] = 1;
    for(i = 1; i <= s; i ++)
    {
        stars[i] = stars[i - 1] + comb[i + k - 1][k - 1];

        if(stars[i] >= MOD)
            stars[i] -= MOD;
    }

    total = stars[s] - (s * k + 1) % MOD;

    if(total < 0)
        total += MOD;
}

int rez;
int mn[MAX_K + 1];

int stkLen;
int stk[MAX_N + 1];

void getPinex()
{
    if(stkLen != 0)
    {
        int i, j, h;
        for(j = 1; j <= k; j ++)
            mn[j] = -1;

        int sign = stkLen;
        for(i = 1; i <= stkLen; i ++)
        {
            for(h = 1; h <= k; h ++)
                mn[h] = max(mn[h], a[stk[i]][h]);
        }

        int sum = s;
        for(j = 1; j <= k; j ++)
            sum -= mn[j];

        if(sum >= 0)
        {
            if(sign & 1)
                rez += stars[sum];

            else
                rez -= stars[sum];

            if(rez < 0)
                rez += MOD;

            if(rez >= MOD)
                rez -= MOD;
        }
    }

    for(int i = stk[stkLen] + 1; i <= n; i ++)
    {
        stk[++ stkLen] = i;
        getPinex();
        stkLen --;
    }
}

void getRez()
{
    rez = total - rez;

    if(rez < 0)
        rez += MOD;
}

void solve()
{
    getComb();

    getStars();

    getPinex();

    getRez();
}

void printFile()
{
    g = fopen("cowfood.out", "w");

    fprintf(g, "%d\n", rez);

    fclose(g);
}

int main()
{
    readFile();

    solve();

    printFile();

    return 0;
}