Submission #133990

# Submission time Handle Problem Language Result Execution time Memory
133990 2019-07-21T22:19:38 Z thecodingwizard Ljetopica (COI19_ljetopica) C++11
25 / 100
176 ms 125688 KB
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define F0R1(i, a) for (int i=1; i<=(a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define MIN(a, b) a = min(a, b)
#define MAX(a, b) a = max(a, b)

#define INF 1000000010
#define LL_INF 4500000000000000000LL
#define LSOne(S) (S & (-S))
#define EPS 1e-9
#define pA first
#define pB second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define PI acos(-1.0)
// #define MOD (int)(2e+9+11)
#define MOD (int)(1e+9+7)
#define SET(vec, val, size) for (int i = 0; i < size; i++) vec[i] = val;
#define SET2D(arr, val, dim1, dim2) F0R(i, dim1) F0R(j, dim2) arr[i][j] = val;
#define SET3D(arr, val, dim1, dim2, dim3) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) arr[i][j][k] = val;
#define SET4D(arr, val, dim1, dim2, dim3, dim4) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) F0R(l, dim4) arr[i][j][k][l] = val;

#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize
#define SORT(vec) sort(all(vec))
#define RSORT(vec) sort(vec.rbegin(),vec.rend())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vl;

// @formatter:off
// Source: Benq (https://github.com/bqi343/USACO) [Modified]
namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
    template<class T> void reA(T A[], int sz);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
        re(first); re(rest...);
    }

    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.pA,p.pB); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
    template<class T> void reA(T A[], int sz) { F0R(i, sz) re(A[i]); }

    void setupIO(const string &PROB = "") {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        if (PROB.length() != 0) {
            ifstream infile(PROB + ".in");
            if (infile.good()) {
                freopen((PROB + ".in").c_str(), "r", stdin);
                freopen((PROB + ".out").c_str(), "w", stdout);
            }
        }
    }
}
using namespace input;

namespace output {
    template<class T1, class T2> void prD(const pair<T1,T2>& x);
    template<class T, size_t SZ> void prD(const array<T,SZ>& x);
    template<class T> void prD(const vector<T>& x);
    template<class T> void prD(const set<T>& x);
    template<class T1, class T2> void prD(const map<T1,T2>& x);

    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void prD(const T& x) { cout << x; }
    template<class Arg, class... Args> void prD(const Arg& first, const Args&... rest) {
        prD(first); prD(rest...);
    }

    template<class T1, class T2> void prD(const pair<T1,T2>& x) {
        prD("{",x.pA,", ",x.pB,"}");
    }
    template<class T> void prDContain(const T& x) {
        prD("{");
        bool fst = 1; for (const auto& a: x) prD(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        prD("}");
    }
    template<class T, size_t SZ> void prD(const array<T,SZ>& x) { prDContain(x); }
    template<class T> void prD(const vector<T>& x) { prDContain(x); }
    template<class T> void prD(const set<T>& x) { prDContain(x); }
    template<class T1, class T2> void prD(const map<T1,T2>& x) { prDContain(x); }

    void psD() { prD("\n"); }
    template<class Arg> void psD(const Arg& first) {
        prD(first); psD(); // no space at end of line
    }
    template<class Arg, class... Args> void psD(const Arg& first, const Args&... rest) {
        prD(first," "); psD(rest...); // print w/ spaces
    }


    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
        pr(first); pr(rest...);
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr(x.pA, " ", x.pB);
    }
    template<class T> void prContain(const T& x) {
        bool fst = 1; for (const auto& a: x) pr(!fst?" ":"",a), fst = 0; // const needed for vector<bool>
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }

    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) {
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
        pr(first," "); ps(rest...); // print w/ spaces
    }
}
using namespace output;
// @formatter:on

/* ============================ */

int n, k;
string P, A, B;

pll memo[1000][1000][2][2][2];
ll pow2[1000];
pll dp(int idx, int k, bool flip, bool smallest, bool largest) {
    if (idx == n) {
        if (k != 0) return mp(0, 0);
        return mp(0, 1);
    }
    ll val = P[idx] == 'L' ? 0 : 1;
    if (flip) val = !val;
    if (memo[idx][k][flip][smallest][largest].pA != -1) return memo[idx][k][flip][smallest][largest];
    ll ans = 0, ans2 = 0;
    if (k > 0) {
        bool bad = false;
        if (smallest && A[idx] == '1' && val == 1) bad = true;
        if (largest && B[idx] == '0' && val == 0) bad = true;
        if (!bad) {
            bool isSmallest = smallest;
            if (A[idx] == '0' && val == 0) isSmallest = false;
            bool isLargest = largest;
            if (B[idx] == '1' && val == 1) isLargest = false;

            pll x = dp(idx + 1, k - 1, !flip, isSmallest, isLargest);
            if (x.pB > 0) {
                ans2 += x.pB;
                ans += x.pA + (!val)*pow2[idx]*x.pB;
            }
        }
    }
    bool bad = false;
    if (smallest && A[idx] == '1' && val == 0) bad = true;
    if (largest && B[idx] == '0' && val == 1) bad = true;
    if (!bad) {
        bool isSmallest = smallest;
        if (A[idx] == '0' && val == 1) isSmallest = false;
        bool isLargest = largest;
        if (B[idx] == '1' && val == 0) isLargest = false;

        pll x = dp(idx + 1, k, flip, isSmallest, isLargest);
        if (x.pB > 0) {
            ans2 += x.pB;
            ans += x.pA + val * pow2[idx] * x.pB;
        }
    }
    return memo[idx][k][flip][smallest][largest] = mp(ans % MOD, ans2 % MOD);
}

int main() {
    setupIO();

    re(n, k, P, A, B);

    --n;
    A = A.substr(1); B = B.substr(1);

    if (sz(B) < n || sz(A) > n) {
        ps(0); return 0;
    }

    F0R(i, n) F0R(j, n) F0R(k, 2) F0R(l, 2) F0R(m, 2) memo[i][j][k][l][m].pA = -1;
    F0Rd(i, n) {
        if (i == n - 1) pow2[i] = 1;
        else pow2[i] = pow2[i + 1] * 2 % MOD;
    }
    pll x = dp(0, k, 0, sz(A) == n, sz(B) == n), y = dp(0, k, 1, sz(A) == n, sz(B) == n);
    ps((x.pA + y.pA + (x.pB + y.pB)*2*pow2[0]) % MOD);

    return 0;
}

Compilation message

ljetopica.cpp: In function 'void input::setupIO(const string&)':
ljetopica.cpp:83:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen((PROB + ".in").c_str(), "r", stdin);
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ljetopica.cpp:84:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen((PROB + ".out").c_str(), "w", stdout);
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 99 ms 125688 KB Output is correct
2 Correct 91 ms 116472 KB Output is correct
3 Correct 82 ms 104952 KB Output is correct
4 Correct 74 ms 94072 KB Output is correct
5 Correct 66 ms 82936 KB Output is correct
6 Correct 58 ms 73208 KB Output is correct
7 Correct 50 ms 64264 KB Output is correct
8 Correct 44 ms 55800 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Incorrect 2 ms 504 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 158 ms 125664 KB Output is correct
2 Correct 176 ms 125532 KB Output is correct
3 Correct 150 ms 125536 KB Output is correct
4 Correct 169 ms 125560 KB Output is correct
5 Correct 142 ms 125560 KB Output is correct
6 Correct 166 ms 125532 KB Output is correct
7 Correct 128 ms 125688 KB Output is correct
8 Correct 148 ms 125560 KB Output is correct
9 Correct 106 ms 125564 KB Output is correct
10 Correct 147 ms 125688 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 99 ms 125688 KB Output is correct
2 Correct 91 ms 116472 KB Output is correct
3 Correct 82 ms 104952 KB Output is correct
4 Correct 74 ms 94072 KB Output is correct
5 Correct 66 ms 82936 KB Output is correct
6 Correct 58 ms 73208 KB Output is correct
7 Correct 50 ms 64264 KB Output is correct
8 Correct 44 ms 55800 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Incorrect 2 ms 504 KB Output isn't correct
11 Halted 0 ms 0 KB -