# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
436927 | qwerasdfzxcl | Sandwich (JOI16_sandwich) | C++14 | 4100 ms | 7872 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>
typedef long long ll;
using namespace std;
char matrix[404][404];
int visited[404][404];
int dp[404][404], dx[4] = {-1, 1, 0, 0}, dy[4] = {0, 0, 1, -1}, n, m;
bool valid(int x, int y){
return ((1<=x && x<=n) && (1<=y && y<=m));
}
int cnt;
bool dfs(int x, int y, int c){
if (visited[x][y]) return visited[x][y]==1e9;
visited[x][y] = c+1;
cnt++;
bool ret = 1;
int nx1 = x+dx[c], nx2 = y+dy[c];
if (valid(nx1, nx2)){
ret &= dfs(nx1, nx2, c);
}
int d = 2;
if (!c && matrix[x][y]=='Z') d = 3;
if (c && matrix[x][y]=='N') d = 3;
int nx3 = x+dx[d], nx4 = y+dy[d];
if (valid(nx3, nx4)){
if (d==2 && matrix[nx3][nx4]=='N') ret &= dfs(nx3, nx4, 0);
else if (d==3 && matrix[nx3][nx4]=='Z') ret &= dfs(nx3, nx4, 0);
else ret &= dfs(nx3, nx4, 1);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |