# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
697658 | Jarif_Rahman | Snake Escaping (JOI18_snake_escaping) | C++17 | 2088 ms | 65536 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>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
const int p3[16] = {1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683, 59049, 177147, 531441, 1594323, 4782969, 14348907};
int v[1<<20];
vector<pair<int, int>> queries[1<<10];
//int dp[1594323];
int dp[59049];
void bruteforce(str &s, int &x, int &i, int k = 0, int index = 0){
if(k == 10){
queries[index].pb({x, i});
return;
}
if(s[10+k] != '1') bruteforce(s, x, i, k+1, index);
if(s[10+k] != '0') bruteforce(s, x, i, k+1, index+(1<<k));
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int L, Q; cin >> L >> Q;
for(int i = 0; i < (1<<L); i++){
char c; cin >> c;
# | 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... |