Submission #340188

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
340188	2020-12-27 09:16:42	lohacho	Sandwich (JOI16_sandwich)	C++14	100 / 100	5802 ms	4068 KiB

sandwich

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int N, M;
  cin >> N >> M;
  vector<string> a(N);
  for(int i = 0; i < N; ++i){
    cin >> a[i];
  }
  vector<vector<int>> chk(N, vector<int>(M, 0));
  vector<vector<int>> ans(N, vector<int>(M, (int)1e9));
  vector<int> NN = {0, 0, 1, 1}, ZZ = {0, 1, 1, 0};
  vector<int> wx = {-1, 0, 1, 0}, wy = {0, 1, 0, -1};
  function<int(int, int, int)> dfs = [&](int x, int y, int dir){
    if(chk[x][y] == 1){
      return (int)1e9;
    }
    if(chk[x][y] == 2){
      return 0;
    }
    int rv = 1;
    chk[x][y] = 1;
    for(int i = 0; i < 4; ++i){
      if((a[x][y] == 'N' && NN[i] == dir) || (a[x][y] == 'Z' && ZZ[i] == dir)){
        int nx = x + wx[i], ny = y + wy[i];
        if(nx >= 0 && ny >= 0 && nx < N && ny < M){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 35 / 35
• Subtask 2: 65 / 65