Submission #105719

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
105719	2019-04-14 04:22:31	Pro_ktmr	Dangerous Skating (JOI16_skating)	C++14	100 / 100	555 ms	15440 KiB

skating

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 MP(a,b) make_pair(a,b)
int H,W;
string S[1000];
int beginY,beginX,endY,endX;
vector<int> l[1000],r[1000],u[1000],d[1000];
int cost[1000][1000];
int main(){
  cin >> H >> W;
  for(int i=0; i<H; i++) cin >> S[i];
  cin >> beginY >> beginX >> endY >> endX;
  beginY--; beginX--; endY--; endX--;
  for(int i=0; i<H; i++){
    for(int j=0; j<W; j++){
      cost[i][j] = INT_MAX;
    }
  }
  
  //
  
  for(int i=1; i<H-1; i++){
    for(int j=1; j<W-1; j++){
      if(S[i][j] == '#') continue;
      if(S[i-1][j] == '#') u[j].push_back(i);
      if(S[i+1][j] == '#') d[j].push_back(i);
      if(S[i][j-1] == '#') l[i].push_back(j);
      if(S[i][j+1] == '#') r[i].push_back(j);
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 13 / 13
• Subtask 2: 65 / 65
• Subtask 3: 22 / 22