# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1175457 | TrendBattles | Snake Escaping (JOI18_snake_escaping) | C++17 | 249 ms | 12656 KiB |
#include <bits/stdc++.h>
using namespace std;
using lli = long long int;
#define INFILE "main.inp"
#define OUTFILE "main.out"
namespace SUBTASK_small_L {
void main(int L, int Q, string digits) {
vector <int> pow_3(L + 1);
pow_3[0] = 1;
for (int i = 1; i <= L; ++i) {
pow_3[i] = pow_3[i - 1] * 3;
}
const int M = pow_3[L];
vector <int> mask_3(1 << L);
vector <int> finale(M);
for (int m = 1; m < (1 << L); ++m) {
int p = m & -m;
mask_3[m] = mask_3[m ^ p] + pow_3[__builtin_ctz(p)];
}
for (int m = 0; m < (1 << L); ++m) {
int x = digits[m] - '0';
for (int p = 0; p < (1 << L); ++p) {
int f_m = mask_3[p] * 2 + mask_3[m & ~p];
finale[f_m] += x;
}
}
for (int _ = 0; _ < Q; ++_) {
string que; cin >> que;
int m = 0;
for (int i = 0; i < L; ++i) {
if (que[i] == '1') m += pow_3[L - i - 1];
else if (que[i] == '?') m += pow_3[L - i - 1] * 2;
}
cout << finale[m] << '\n';
}
}
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
if (fopen(INFILE, "r")) {
freopen(INFILE, "r", stdin);
freopen(OUTFILE, "w", stdout);
}
int L, Q; cin >> L >> Q;
string digits; cin >> digits;
if (L <= 13) {
SUBTASK_small_L::main(L, Q, digits);
return 0;
}
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |