USACO January, B

Cow Run (C++)

Madi Khamitbekov (kh.madi1)
Submitted: Mon, Jan 09, 2012 23:00:28 EST

/*
** Khamitbekov Madi
** Kazakhstan, Almaty
** Kazakh-Turkish High School, 2011
*/
#include <algorithm>
#include <iostream>
#include <string.h>
#include <utility>
#include <fstream>
#include <cstdlib>
#include <cstring>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <queue>
#include <ctime>
#include <list>
#include <set>
#include <map>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector < vector < int > >  vvi;
typedef vector < pair < int, int > >  vpi;
typedef queue  < pair < int, int > > qpi;

#define ones(x) (__builtin_popcount(x))
#define abs(x) ((x) > 0 ? (x) : -(x))
#define all(v) (v).begin(), (v).end()
#define sq(x) ((x)*(x))
#define len length()
#define pb push_back
#define mp make_pair
#define inf 7777777
#define eps (1e-7)
#define sz size()
#define s second
#define f first

int n, m, k, r = 0, pl, d = 0, d1;
string b;
int h[100][10];

int main ()
{
    freopen ("cowrun.in", "r", stdin);
    freopen ("cowrun.out", "w", stdout);

    cin >> n >> m >> k;
    cin >> b;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < 8; j++)
            cin >> h[i][j];
    bool bad = 0;
    int d1 = 0;
    for (int mask = 0; mask < (1<<n); mask++) {
        bool ok = 1;
        for (int be = 0; be < (1<<n); be++) {
                bad = 0;
            r = 0;
            for (int i = 0; i < n; i++) {
                pl = 4;
                if (mask&(1<<i)) pl = 0;
                if (be&(1<<i))  d = ((r*1LL*h[i][pl])%m + h[i][pl+1])%m;
                else        d = ((r*1LL*h[i][pl+2])%m + h[i][pl+3])%m;
                if (d > k) {bad = 1;break;}
                r = (r + d)%m;
            }
            ok &= (!bad && !r);
            if (!ok)break;
        }
        if (ok) {
            for (int i = 0; i < n; i++)
                if (mask&(1<<i)) cout << "T";
                else         cout << "B";
            return 0;
        }
    }

    return 0;
}