Submission #845894

#TimeUsernameProblemLanguageResultExecution timeMemory
845894mickey080929Sandwich (JOI16_sandwich)C++17
35 / 100
8007 ms3412 KiB
#include <bits/stdc++.h> using namespace std; int n, m; int a[410][410]; int vis[410][410]; int chk[410][410]; int dx[] = {-1, 0, 1, 0}; int dy[] = {0, 1, 0, -1}; int dfs(int x, int y, int d) { vis[x][y] = d; for (int i=0; i<2; i++) { int t = (d<<1) + a[x][y] + i; if (t >= 4) t -= 4; int nx = x + dx[t]; int ny = y + dy[t]; if (nx <= 0 || nx > n || ny <= 0 || ny > m) continue; int nd = (t >= a[nx][ny] && t <= 1+a[nx][ny]) ^ 1; if (vis[nx][ny] == nd) { if (chk[nx][ny]) continue; return 0; } if (vis[nx][ny] == (nd ^ 1)) return 0; if (!dfs(nx, ny, nd)) return 0; } chk[x][y] = 1; return 1; } int solve(int sx, int sy, int sd) { memset(vis, -1, sizeof(vis)); memset(chk, 0, sizeof(chk)); if (!dfs(sx, sy, sd)) return -1; int ans = 0; for (int i=1; i<=n; i++) { for (int j=1; j<=m; j++) { ans += (vis[i][j] != -1); } } return ans << 1; } int main() { scanf("%d %d", &n, &m); for (int i=1; i<=n; i++) { for (int j=1; j<=m; j++) { char c; scanf(" %c", &c); if (c == 'N') a[i][j] = 0; else a[i][j] = 1; } } for (int i=1; i<=n; i++) { for (int j=1; j<=m; j++) { int t1 = solve(i, j, 0), t2 = solve(i, j, 1); if (t1 == -1) printf("%d ", t2); else if (t2 == -1) printf("%d ", t1); else printf("%d ", min(t1, t2)); } printf("\n"); } }

Compilation message (stderr)

sandwich.cpp: In function 'int main()':
sandwich.cpp:46:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
sandwich.cpp:50:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |             scanf(" %c", &c);
      |             ~~~~~^~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...