# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
848700 | vjudge1 | Snake Escaping (JOI18_snake_escaping) | C++17 | 689 ms | 28320 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;
void main_program();
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0);
main_program();
}
const int maxn = 1 << 20;
int lg, n, q;
vector<int> v;
vector<int> subsetZeta(vector<int> V){
for (int j = 0; j < lg; j++){
for (int i = 0; i < n; i++){
if (((i >> j) & 1)){
V[i] += V[i ^ (1 << j)];
}
}
}
return V;
}
vector<int> supersetZeta(vector<int> V){
for (int j = 0; j < lg; j++){
for (int i = 0; i < n; i++){
if (((i >> j) & 1) == 0){
# | 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... |