Submission #105716

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
105716	2019-04-14 04:21:44	Pro_ktmr	Sandwich (JOI16_sandwich)	C++14	100 / 100	2070 ms	15496 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;
#define LL long long
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define PB push_back
#define MP make_pair
#define all(x) x.begin(),x.end()
int H,W;
string S[400];
int state[400][400]; //0:初期、1:計算中、2:計算終了
/*
 3
1 2
 0
*/
int dfs(int y, int x, int d){
  if(x < 0 || x >= W || y < 0 || y >= H) return 0;
  if(state[y][x] == 1) return INT_MAX;
  if(state[y][x] == 2) return 0;
  state[y][x] = 1;
  int ans = 1;
  if(S[y][x] == 'N'){
    if(d == 0 || d == 1){
      int tmp = dfs(y, x+1, 1);
      if(tmp == INT_MAX) return INT_MAX;
      ans += tmp;
      tmp = dfs(y-1, x, 0);
      if(tmp == INT_MAX) return INT_MAX;
      ans += tmp;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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