oj.uz

답안 #134001

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
134001 2019-07-21T22:34:43 Z thecodingwizard Ljetopica (COI19_ljetopica) C++11
100 / 100
 208 ms 125896 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;
            }
        }
    }
    ans %= MOD;
    ans2 %= MOD;
    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);

    F0R(i, 1000) F0R(j, 1000) 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%MOD*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);
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 125688 KB Output is correct
2 Correct 99 ms 125688 KB Output is correct
3 Correct 98 ms 125688 KB Output is correct
4 Correct 99 ms 125688 KB Output is correct
5 Correct 98 ms 125688 KB Output is correct
6 Correct 99 ms 125720 KB Output is correct
7 Correct 103 ms 125824 KB Output is correct
8 Correct 100 ms 125700 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 125640 KB Output is correct
2 Correct 116 ms 125560 KB Output is correct
3 Correct 99 ms 125560 KB Output is correct
4 Correct 100 ms 125648 KB Output is correct
5 Correct 99 ms 125624 KB Output is correct
6 Correct 117 ms 125560 KB Output is correct
7 Correct 119 ms 125560 KB Output is correct
8 Correct 117 ms 125560 KB Output is correct
9 Correct 100 ms 125600 KB Output is correct
10 Correct 98 ms 125588 KB Output is correct
11 Correct 98 ms 125560 KB Output is correct
12 Correct 99 ms 125560 KB Output is correct
13 Correct 98 ms 125560 KB Output is correct
14 Correct 99 ms 125560 KB Output is correct
15 Correct 100 ms 125560 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 164 ms 125756 KB Output is correct
2 Correct 151 ms 125756 KB Output is correct
3 Correct 156 ms 125680 KB Output is correct
4 Correct 169 ms 125660 KB Output is correct
5 Correct 162 ms 125800 KB Output is correct
6 Correct 202 ms 125816 KB Output is correct
7 Correct 133 ms 125752 KB Output is correct
8 Correct 158 ms 125660 KB Output is correct
9 Correct 120 ms 125816 KB Output is correct
10 Correct 154 ms 125644 KB Output is correct

Subtask #4
61.0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 125688 KB Output is correct
2 Correct 99 ms 125688 KB Output is correct
3 Correct 98 ms 125688 KB Output is correct
4 Correct 99 ms 125688 KB Output is correct
5 Correct 98 ms 125688 KB Output is correct
6 Correct 99 ms 125720 KB Output is correct
7 Correct 103 ms 125824 KB Output is correct
8 Correct 100 ms 125700 KB Output is correct
9 Correct 99 ms 125640 KB Output is correct
10 Correct 116 ms 125560 KB Output is correct
11 Correct 99 ms 125560 KB Output is correct
12 Correct 100 ms 125648 KB Output is correct
13 Correct 99 ms 125624 KB Output is correct
14 Correct 117 ms 125560 KB Output is correct
15 Correct 119 ms 125560 KB Output is correct
16 Correct 117 ms 125560 KB Output is correct
17 Correct 100 ms 125600 KB Output is correct
18 Correct 98 ms 125588 KB Output is correct
19 Correct 98 ms 125560 KB Output is correct
20 Correct 99 ms 125560 KB Output is correct
21 Correct 98 ms 125560 KB Output is correct
22 Correct 99 ms 125560 KB Output is correct
23 Correct 100 ms 125560 KB Output is correct
24 Correct 164 ms 125756 KB Output is correct
25 Correct 151 ms 125756 KB Output is correct
26 Correct 156 ms 125680 KB Output is correct
27 Correct 169 ms 125660 KB Output is correct
28 Correct 162 ms 125800 KB Output is correct
29 Correct 202 ms 125816 KB Output is correct
30 Correct 133 ms 125752 KB Output is correct
31 Correct 158 ms 125660 KB Output is correct
32 Correct 120 ms 125816 KB Output is correct
33 Correct 154 ms 125644 KB Output is correct
34 Correct 173 ms 125760 KB Output is correct
35 Correct 133 ms 125688 KB Output is correct
36 Correct 186 ms 125816 KB Output is correct
37 Correct 109 ms 125764 KB Output is correct
38 Correct 141 ms 125816 KB Output is correct
39 Correct 157 ms 125692 KB Output is correct
40 Correct 128 ms 125644 KB Output is correct
41 Correct 161 ms 125752 KB Output is correct
42 Correct 208 ms 125788 KB Output is correct
43 Correct 166 ms 125688 KB Output is correct
44 Correct 195 ms 125688 KB Output is correct
45 Correct 148 ms 125896 KB Output is correct
46 Correct 177 ms 125760 KB Output is correct
47 Correct 163 ms 125656 KB Output is correct
48 Correct 180 ms 125752 KB Output is correct
49 Correct 109 ms 125752 KB Output is correct
50 Correct 169 ms 125688 KB Output is correct
51 Correct 145 ms 125816 KB Output is correct
52 Correct 149 ms 125648 KB Output is correct
53 Correct 166 ms 125808 KB Output is correct
54 Correct 136 ms 125688 KB Output is correct
55 Correct 171 ms 125812 KB Output is correct
56 Correct 171 ms 125688 KB Output is correct
57 Correct 116 ms 125688 KB Output is correct
58 Correct 202 ms 125816 KB Output is correct