oj.uz

답안 #105145

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
105145 2019-04-10T17:33:16 Z RockyB Snake Escaping (JOI18_snake_escaping) C++17
5 / 100
 2000 ms 66560 KB 
/// In The Name Of God

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)(1 << 20) + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int L = 7;


int n, q;
char s[N];
char t[N][20];

int add_id;

int tmr;
int was[20][1594323];
int dp[20][1594323];
ll pw[20];
int calc(int v, int mask, int nmask) {
	if (v == n) {
		return s[nmask + add_id] - '0';
	}
	if (was[v][mask] == tmr) return dp[v][mask];
	was[v][mask] = tmr;
	if ((mask / pw[v - L]) % 3 == 2) {
		return dp[v][mask] = calc(v + 1, mask - pw[v - L], nmask + (1 << v)) + calc(v + 1, mask - 2 * pw[v - L], nmask);
	}
	if ((mask / pw[v - L]) % 3 == 1) {
		return dp[v][mask] = calc(v + 1, mask, nmask + (1 << v));
	}
	return dp[v][mask] = calc(v + 1, mask, nmask);
}
/// 3 ^ 0 * q0 + 3 ^ 1 * q1 + 3^2 * q2 = n
/// 7 = 3 ^ 1 * 2 + 3^0 * 1

/*
	3 ^ 2 * q2 + 3 ^ 1 * q1 + 3 ^ 0 * q0
	
*/

bool good(int mask, int id) {
	rep(i, 0, L) {
		if (t[id][i] != '?') {
			if (t[id][i] == '0' && (mask & (1 << i))) return 0;
			if (t[id][i] == '1' && !(mask & (1 << i))) return 0;
		}
	}
	return 1;
}

int ans[N];
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n >> q >> s;
	rep(i, 0, q) {
		cin >> t[i];
		reverse(t[i], t[i] + n);
	}
	L = min(n, L);
	pw[0] = 1;
	rep(i, 1, 20) pw[i] = pw[i - 1] * 3;
	rep(mask, 0, (1 << L)) {
		++tmr;
		rep(i, 0, q) {
			if (good(mask, i)) {
				if (n <= L) {
					ans[i] += s[mask] - '0';
				}
				else {
					int st = 0;
					per(j, n - 1, L) {
						if (t[i][j] == '?') st = st * 3 + 2;
						else if (t[i][j] == '1') st = st * 3 + 1;
						else st *= 3;
					}
					add_id = mask;
					ans[i] += calc(L, st, 0);
				}
			}
		}
	}
	rep(i, 0, q) cout << ans[i] << nl;
	ioi
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 6 ms 512 KB Output is correct
3 Correct 6 ms 512 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 7 ms 488 KB Output is correct
6 Correct 8 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 6 ms 512 KB Output is correct
3 Correct 6 ms 512 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 7 ms 488 KB Output is correct
6 Correct 8 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Execution timed out 2043 ms 34816 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 6 ms 512 KB Output is correct
3 Correct 6 ms 512 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 7 ms 488 KB Output is correct
6 Correct 8 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Execution timed out 2043 ms 34816 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 6 ms 512 KB Output is correct
3 Correct 6 ms 512 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 7 ms 488 KB Output is correct
6 Correct 8 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 576 ms 18920 KB Output is correct
12 Correct 1144 ms 22484 KB Output is correct
13 Runtime error 87 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 6 ms 512 KB Output is correct
3 Correct 6 ms 512 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 7 ms 488 KB Output is correct
6 Correct 8 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Execution timed out 2043 ms 34816 KB Time limit exceeded
12 Halted 0 ms 0 KB -