# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64514 | theknife2001 | Jetpack (COCI16_jetpack) | C++17 | 76 ms | 17332 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 ii pair<int ,int>
#define se second
#define fi first
using namespace std;
const int N=1e5+55;
char grid[11][N];
ii p[11][N];
int n;
bool q;
bool ok(int i , int j)
{
return (grid[i][j]!='X'&&p[i][j]==ii(-1,-1)&&!q);
}
void dfs(int i , int j)
{
if(j==n-1)
{
q=1;
return ;
}
if(i==9)
{
if(ok(i,j+1))
{
p[i][j+1]={i,j};
dfs(i,j+1);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |