oj.uz

답안 #112596

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
112596 2019-05-20T19:39:19 Z BorisBarca Ljetopica (COI19_ljetopica) C++14
100 / 100
 460 ms 32504 KB 
/*
	$$$$$$$\                      $$\           $$$$$$$\
	$$  __$$\                     \__|          $$  __$$\
	$$ |  $$ | $$$$$$\   $$$$$$\  $$\  $$$$$$$\ $$ |  $$ | $$$$$$\   $$$$$$\   $$$$$$$\ $$$$$$\
	$$$$$$$\ |$$  __$$\ $$  __$$\ $$ |$$  _____|$$$$$$$\ | \____$$\ $$  __$$\ $$  _____|\____$$\
	$$  __$$\ $$ /  $$ |$$ |  \__|$$ |\$$$$$$\  $$  __$$\  $$$$$$$ |$$ |  \__|$$ /      $$$$$$$ |
	$$ |  $$ |$$ |  $$ |$$ |      $$ | \____$$\ $$ |  $$ |$$  __$$ |$$ |      $$ |     $$  __$$ |
	$$$$$$$  |\$$$$$$  |$$ |      $$ |$$$$$$$  |$$$$$$$  |\$$$$$$$ |$$ |      \$$$$$$$\\$$$$$$$ |
	\_______/  \______/ \__|      \__|\_______/ \_______/  \_______|\__|       \_______|\_______|
*/
#include <bits/stdc++.h>

using namespace std;

#define PB push_back
#define MP make_pair
#define INS insert
#define LB lower_bound
#define UB upper_bound
#define pii pair <int,int>
#define pll pair <long long, long long>
#define si pair<string, int>
#define is pair<int, string>
#define X first
#define Y second
#define _ << " " <<
#define sz(x) (int)x.size()
#define all(a) (a).begin(),(a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORD(i, a, b) for (int i = (a); i > (b); --i)
#define FORR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FORP(i, a, b) for ((i) = (a); (i) < (b); ++i)
#define FORA(i, x) for (auto &i : x)
#define REP(i, n) FOR(i, 0, n)
#define BITS(x) __builtin_popcount(x)
#define MSET memset
#define MCPY memcpy
#define SQ(a) (a) * (a)

typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <pii> vpi;
typedef vector <ll> vll;
typedef vector <pll> vpl;
typedef vector <double> vd;
typedef vector <ld> vld;
typedef vector<si> vsi;
typedef vector<is> vis;
typedef vector<string> vs;
//((float) t)/CLOCKS_PER_SEC

const int MOD = 1e9 + 7;
const double PI = acos(-1);
const int LOG = 19;
const int INF = 1e9 + 10;
const ll INFL = 1e18 + 10;
const int ABC = 30;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dox[] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int doy[] = {0, 0, -1, 1, -1, 1, -1, 1};

inline int sum(int a, int b){
  if (a + b >= MOD)
  	return a + b - MOD;
  if (a + b < 0)
  	return a + b + MOD;
  return a + b;
}

inline void add(int &a, int b){
  a = sum(a, b);
}

inline int mul(int a, int b){
  return (ll)a * (ll)b % MOD;
}

inline int sub(int a, int b){
	return (a - b + MOD) % MOD;
}

inline int pot(ll pot, int n){
	ll ret = 1;
	if (n == 0)
		return 1;
	while (n){
		if (n & 1)
			ret = (ret * pot) % MOD;
		pot = (pot * pot) % MOD;
		n >>= 1;
	}
	return ret;
}

inline int divide(int a, int b){
	return mul(a, pot(b, MOD - 2));
}

ll lcm(ll a, ll b){
	return abs(a * b) / __gcd(a, b);
}

inline double ccw(pii A, pii B, pii C){
	return (A.X * B.Y) - (A.Y * B.X) + (B.X * C.Y) - (B.Y * C.X) + (C.X * A.Y) - (C.Y * A.X);
}

inline int CCW(pii A, pii B, pii C){
	double val = ccw(A, B, C);
	double eps = max(max(abs(A.X), abs(A.Y)), max(max(abs(B.X), abs(B.Y)), max(abs(C.X), abs(C.Y)))) / 1e9;
	if (val <= -eps)
		return -1;
	if (val >= eps)
		return 1;
	return 0;
}

void to_upper(string &x){
	REP(i, sz(x))
		x[i] = toupper(x[i]);
}

void to_lower(string &x){
	REP(i, sz(x))
		x[i] = tolower(x[i]);
}

string its(ll x){
	if (x == 0)
		return "0";
	string ret = "";
	while (x > 0){
		ret += (x % 10) + '0';
		x /= 10;
	}
	reverse(all(ret));
	return ret;
}

ll sti(string s){
	ll ret = 0;
	REP(i, sz(s)){
		ret *= 10;
		ret += (s[i] - '0');
	}
	return ret;
}

const int N = 1e3 + 10;

int n, k, memo[2][2][N][N], pom[2][2][N][N];
string a, b, m, l;
map <char, char> nxt = {{'L', 'R'}, {'R', 'L'}};
map <char, int> p = {{'L', 0}, {'R', 1}};

int cnt(int manji, int stav, int x, int y){
	if (x == n)
		return (y == 0);
	int &ret = pom[manji][stav][x][y];
	if (~ret)
		return ret;
	ret = 0;

	int move = p[m[x]];
	if (stav)
		move = !move;
	int bit = l[x] - '0';
	if (manji){
		add(ret, cnt(manji, stav, x + 1, y));
		if (y){
			stav++;
			stav %= 2;
			move = !move;
			add(ret, cnt(manji, stav, x + 1, y - 1));

			stav++;
			stav %= 2;
		}

	} else {
		if (move < bit)
			add(ret, cnt(1, stav, x + 1, y));
		else if (move == bit)
			add(ret, cnt(0, stav, x + 1, y));

		if (y){
			stav++;
			stav %= 2;

			move = !move;
			if (move < bit)
				add(ret, cnt(1, stav, x + 1, y - 1));
			else if (move == bit)
				add(ret, cnt(0, stav, x + 1, y - 1));

			stav++;
			stav %= 2;
		}

	}

	return ret;
}

int dp(int manji, int stav, int x, int y){
	if (x == n)
		return 0;
	int &ret = memo[manji][stav][x][y];
	if (~ret)
		return ret;
	ret = 0;

	int move = p[m[x]];
	if (stav)
		move = !move;
	int bit = l[x] - '0';
	if (manji){
		add(ret, mul(mul(pot(2, n - x - 1), move), cnt(manji, stav, x + 1, y))), add(ret, dp(manji, stav, x + 1, y));
		
		if (y){
			stav++;
			stav %= 2;
			move = !move;
			add(ret, mul(mul(pot(2, n - x - 1), move), cnt(manji, stav, x + 1, y - 1))), add(ret, dp(manji, stav, x + 1, y - 1));

			stav++;
			stav %= 2;
		}

	} else {
		if (move < bit)
			add(ret, mul(mul(pot(2, n - x - 1), move), cnt(1, stav, x + 1, y))), add(ret, dp(1, stav, x + 1, y));
		else if (move == bit)
			add(ret, mul(mul(pot(2, n - x - 1), move), cnt(0, stav, x + 1, y))), add(ret, dp(0, stav, x + 1, y));

		if (y){
			stav++;
			stav %= 2;

			move = !move;
			if (move < bit)
				add(ret, mul(mul(pot(2, n - x - 1), move), cnt(1, stav, x + 1, y - 1))), add(ret, dp(1, stav, x + 1, y - 1));
			else if (move == bit)
				add(ret, mul(mul(pot(2, n - x - 1), move), cnt(0, stav, x + 1, y - 1))), add(ret, dp(0, stav, x + 1, y - 1));

			stav++;
			stav %= 2;
		}

	}
	//cout << manji _ stav _ x _ y _ ret << '\n';

	return ret;
}

int main () {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	cin >> n >> k;
	cin >> m;
	cin >> a >> b;
	a = a.substr(1, sz(a) - 1);
	b = b.substr(1, sz(b) - 1);
	n--;

	l = b;
	memset(pom, -1, sizeof pom);
	memset(memo, -1, sizeof memo);
	int _b = 0;
	add(_b, dp(0, 0, 0, k));
	add(_b, dp(0, 1, 0, k));
	add(_b, mul(sum(cnt(0, 0, 0, k), cnt(0, 1, 0, k)), pot(2, n)));

	l = a;
	memset(pom, -1, sizeof pom);
	memset(memo, -1, sizeof memo);
	int _a = sum(dp(0, 0, 0, k), dp(0, 1, 0, k));
	add(_a, mul(sum(cnt(0, 0, 0, k), cnt(0, 1, 0, k)), pot(2, n)));

	int sol = sub(_b, _a);
	REP(i, n)
		add(sol, mul(pot(2, n - i - 1), a[i] - '0'));
	add(sol, pot(2, n));

	cout << sol << '\n';

	return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 32504 KB Output is correct
2 Correct 33 ms 32376 KB Output is correct
3 Correct 33 ms 32384 KB Output is correct
4 Correct 33 ms 32384 KB Output is correct
5 Correct 33 ms 32384 KB Output is correct
6 Correct 32 ms 32384 KB Output is correct
7 Correct 33 ms 32384 KB Output is correct
8 Correct 32 ms 32376 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 32256 KB Output is correct
2 Correct 32 ms 32248 KB Output is correct
3 Correct 32 ms 32360 KB Output is correct
4 Correct 33 ms 32256 KB Output is correct
5 Correct 32 ms 32248 KB Output is correct
6 Correct 32 ms 32248 KB Output is correct
7 Correct 32 ms 32248 KB Output is correct
8 Correct 32 ms 32256 KB Output is correct
9 Correct 31 ms 32256 KB Output is correct
10 Correct 33 ms 32256 KB Output is correct
11 Correct 32 ms 32256 KB Output is correct
12 Correct 33 ms 32316 KB Output is correct
13 Correct 31 ms 32248 KB Output is correct
14 Correct 32 ms 32316 KB Output is correct
15 Correct 32 ms 32248 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 211 ms 32504 KB Output is correct
2 Correct 167 ms 32384 KB Output is correct
3 Correct 182 ms 32480 KB Output is correct
4 Correct 393 ms 32504 KB Output is correct
5 Correct 163 ms 32452 KB Output is correct
6 Correct 422 ms 32504 KB Output is correct
7 Correct 116 ms 32376 KB Output is correct
8 Correct 199 ms 32504 KB Output is correct
9 Correct 39 ms 32384 KB Output is correct
10 Correct 168 ms 32376 KB Output is correct

Subtask #4
61.0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 32504 KB Output is correct
2 Correct 33 ms 32376 KB Output is correct
3 Correct 33 ms 32384 KB Output is correct
4 Correct 33 ms 32384 KB Output is correct
5 Correct 33 ms 32384 KB Output is correct
6 Correct 32 ms 32384 KB Output is correct
7 Correct 33 ms 32384 KB Output is correct
8 Correct 32 ms 32376 KB Output is correct
9 Correct 31 ms 32256 KB Output is correct
10 Correct 32 ms 32248 KB Output is correct
11 Correct 32 ms 32360 KB Output is correct
12 Correct 33 ms 32256 KB Output is correct
13 Correct 32 ms 32248 KB Output is correct
14 Correct 32 ms 32248 KB Output is correct
15 Correct 32 ms 32248 KB Output is correct
16 Correct 32 ms 32256 KB Output is correct
17 Correct 31 ms 32256 KB Output is correct
18 Correct 33 ms 32256 KB Output is correct
19 Correct 32 ms 32256 KB Output is correct
20 Correct 33 ms 32316 KB Output is correct
21 Correct 31 ms 32248 KB Output is correct
22 Correct 32 ms 32316 KB Output is correct
23 Correct 32 ms 32248 KB Output is correct
24 Correct 211 ms 32504 KB Output is correct
25 Correct 167 ms 32384 KB Output is correct
26 Correct 182 ms 32480 KB Output is correct
27 Correct 393 ms 32504 KB Output is correct
28 Correct 163 ms 32452 KB Output is correct
29 Correct 422 ms 32504 KB Output is correct
30 Correct 116 ms 32376 KB Output is correct
31 Correct 199 ms 32504 KB Output is correct
32 Correct 39 ms 32384 KB Output is correct
33 Correct 168 ms 32376 KB Output is correct
34 Correct 414 ms 32456 KB Output is correct
35 Correct 205 ms 32376 KB Output is correct
36 Correct 291 ms 32384 KB Output is correct
37 Correct 393 ms 32384 KB Output is correct
38 Correct 117 ms 32504 KB Output is correct
39 Correct 359 ms 32504 KB Output is correct
40 Correct 102 ms 32376 KB Output is correct
41 Correct 348 ms 32384 KB Output is correct
42 Correct 402 ms 32376 KB Output is correct
43 Correct 383 ms 32376 KB Output is correct
44 Correct 352 ms 32384 KB Output is correct
45 Correct 193 ms 32376 KB Output is correct
46 Correct 354 ms 32476 KB Output is correct
47 Correct 365 ms 32384 KB Output is correct
48 Correct 275 ms 32504 KB Output is correct
49 Correct 50 ms 32376 KB Output is correct
50 Correct 406 ms 32384 KB Output is correct
51 Correct 259 ms 32376 KB Output is correct
52 Correct 302 ms 32504 KB Output is correct
53 Correct 460 ms 32504 KB Output is correct
54 Correct 210 ms 32504 KB Output is correct
55 Correct 421 ms 32376 KB Output is correct
56 Correct 435 ms 32504 KB Output is correct
57 Correct 99 ms 32384 KB Output is correct
58 Correct 408 ms 32376 KB Output is correct