# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
845040 | jamkel19 | Trampoline (info1cup20_trampoline) | C++14 | 556 ms | 1048576 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;
#define st first
#define nd second
typedef long long ll;
void dfs(vector<vector<bool>>&a,vector<vector<vector<int>>>&b,int x,int y,int &n, int &m)
{
if(b[x][y][x]<m+1)
{
return;
}
b[x][y][x]=y;
if(a[x][y] && x<n-1)
{
dfs(a,b,x+1,y,n,m);
for(int w=x+1;w<n;w++)
{
b[x][y][w]=b[x+1][y][w];
}
}
if(y<m-1)
{
dfs(a,b,x,y+1,n,m);
if(!a[x][y])
{
for(int w=x+1;w<n;w++)
{
b[x][y][w]=b[x][y+1][w];
}
}
# | 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... |