# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
247472 | arnold518 | Sandwich (JOI16_sandwich) | C++14 | 3137 ms | 6864 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 400;
const int INF = 1e7;
int N, M;
char A[MAXN+10][MAXN+10];
int ans[MAXN+10][MAXN+10];
int vis[MAXN+10][MAXN+10];
int cnt;
void dfs(int y, int x)
{
cnt++;
if(A[y][x]=='N')
{
if(vis[y][x]==1)
{
if(vis[y-1][x]>0) cnt=-INF;
if(y!=1 && !vis[y-1][x])
{
vis[y-1][x]=1;
dfs(y-1, x);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |