# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
467339 | TlenekWodoru | Game (eJOI20_game) | C++14 | 1 ms | 332 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;
int tab[100][100][5];
bool zaj[100][100];
int h=0;
void DFS(int y, int x)
{
zaj[y][x]=1;
if(tab[y][x][1]==0&&zaj[y-1][x]==0)
{
DFS(y-1,x);
}
if(tab[y][x][2]==0&&zaj[y][x+1]==0)
{
DFS(y,x+1);
}
if(tab[y][x][3]==0&&zaj[y+1][x]==0)
{
DFS(y+1,x);
}
if(tab[y][x][4]==0&&zaj[y][x-1]==0)
{
DFS(y,x-1);
}
h++;
}
int main()
{ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n,m;cin>>n>>m;
for(int i=0;i<=n+1;i++)
Compilation message (stderr)
# | 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... |