# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
210540 | kshitij_sodani | Snake Escaping (JOI18_snake_escaping) | C++17 | 692 ms | 40184 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 <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef long long llo;
#define a first
#define b second
#define endl "\n"
int aa=7;
//vector<int> aac[1000001];
//vector<int> pre[16000];
int sl3[21];
int sl[22];
int l;
int dp[1600000];//3^13
int last[1600000];//3^13
int ans[1000001];//q
int it[1100001];//n
int num[1000001];//q
int ok;
/*void find(int ind,int tot,int ind2){//pre_sub
if(ind==aa){
pre[tot].pb(ind2);
// cout<<tot<<" "<<ind2<<endl;
}
else{
if(aac[ind2][ind]%2==0){
find(ind+1,tot,ind2);
# | 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... |