# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1144132 | SmuggingSpun | Snake Escaping (JOI18_snake_escaping) | C++20 | 2096 ms | 2528 KiB |
#include<bits/stdc++.h>
#define taskname "E"
using namespace std;
int LOG, n, q;
string toxic;
namespace sub1{
void solve(){
for(int _ = 0; _ < q; _++){
int ans = 0;
string s;
cin >> s;
reverse(s.begin(), s.end());
for(int mask = n - 1; mask > -1; mask--){
ans += toxic[mask];
for(int i = 0; i < LOG; i++){
if(s[i] != '?' && bool(1 << i & mask) != bool(s[i] == '1')){
ans -= toxic[mask];
break;
}
}
}
cout << ans << "\n";
}
}
}
namespace sub2{
void solve(){
unordered_map<string, int>ans;
for(int mask = n - 1; mask > -1; mask--){
for(int sub = n - 1; sub > -1; sub--){
string s = "";
for(int i = 0; i < LOG; i++){
if(1 << i & sub){
s += char((1 << i & mask) ? 49 : 48);
}
else{
s += '?';
}
}
ans[s] += toxic[mask];
}
}
for(int _ = 0; _ < q; _++){
string s;
cin >> s;
reverse(s.begin(), s.end());
cout << ans[s] << "\n";
}
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
cin >> LOG >> q >> toxic;
for(char& c : toxic){
c -= 48;
}
if((n = 1 << LOG) <= 1024){
sub1::solve();
}
else if(n <= 8192){
sub2::solve();
}
}
컴파일 시 표준 에러 (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... |