# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
855077 | prof_x | Tracks in the Snow (BOI13_tracks) | C++14 | 1433 ms | 96544 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;
const int dx[4]={-1,0,1,0};
const int dy[4]={0,1,0,-1};
const int MAXN=4000+5;
int g[MAXN][MAXN];
bool visited[MAXN][MAXN];
void solve()
{
int h,k;
cin>>h>>k;
for(int i =0;i<=h;i++)
{
for(int j=0;j<=k;j++)
{
visited[i][j]=false;
}
}
for(int i=1;i<=h;i++)
{
for(int j=1;j<=k;j++)
{
char ch;
cin>>ch;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |