# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
285764 | glikcakbn | Snake Escaping (JOI18_snake_escaping) | C++14 | 1886 ms | 42488 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 <iostream>
#include <vector>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int L, T; cin >> L >> T;
int n = (1 << L);
int A[n];
for(int i = 0; i < n; ++i)
{
char c; cin >> c;
A[i] = c - '0';
}
int B[n]; for(int i = 0; i < n; ++i) B[i] = A[i];
for(int i = 0; i < L; ++i)
{
for(int j = 0; j < n; ++j)
if(j >> i & 1) B[j] += B[j ^ (1 << i)];
}
int C[n]; for(int i = 0; i < n; ++i) C[i] = A[i];
for(int i = 0; i < L; ++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... |