# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
445839 | JovanB | Snake Escaping (JOI18_snake_escaping) | C++17 | 1774 ms | 24640 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int N = 20;
int str[1<<N];
int sub[1<<N];
int over[1<<N];
int main(){
ios_base::sync_with_stdio(false), cin.tie(0);
cout.precision(10);
cout << fixed;
int n, qrs;
cin >> n >> qrs;
string td;
cin >> td;
for(int i=0; i<(1<<n); i++){
str[i] = td[i] - '0';
sub[i] = over[i] = str[i];
}
for(int i=0; i<n; i++){
for(int mask=0; mask<(1<<n); mask++){
if(mask & (1 << i)) sub[mask] += sub[mask ^ (1 << i)];
}
}
for(int i=0; i<n; i++){
# | 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... |