#419765 (C++17) No.971 いたずらっ子

• 問題: No.971 いたずらっ子
• ユーザー: LayCurse
• 提出日時: 2020-01-19 05:31:08
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 37 ms / 2,000 ms
• コード長: 2,432 bytes
• コンパイル時間: 2,703 ms
• コンパイル使用メモリ: 212,424 KB
• 最終ジャッジ日時: 2025-01-08 20:11:32
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 4
other	AC * 21

ソースコード

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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S min_L(S a,T b){
  return a<=b?a:b;
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(char &c){
  int i;
  for(;;){
    i = getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c = i;
}
inline int rd(char c[]){
  int i;
  int sz = 0;
  for(;;){
    i = getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c[sz++] = i;
  for(;;){
    i = getchar_unlocked();
    if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF){
      break;
    }
    c[sz++] = i;
  }
  c[sz]='\0';
  return sz;
}
inline void wt_L(char a){
  putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    putchar_unlocked('-');
  }
  while(s--){
    putchar_unlocked(f[s]+'0');
  }
}
int X;
int Y;
char A[2000][2002];
int dp[2000][2000];
int main(){
  int i;
  int j;
  rd(X);
  rd(Y);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(X);Lj4PdHRW++){
      rd(A[Lj4PdHRW]);
    }
  }
  for(i=(1);i<(X);i++){
    if(A[i][0]=='k'){
      dp[i][0] = dp[i-1][0] +i+1;
    }
    else{
      dp[i][0] = dp[i-1][0] +1;
    }
  }
  for(j=(1);j<(Y);j++){
    if(A[0][j]=='k'){
      dp[0][j] = dp[0][j-1] +j+1;
    }
    else{
      dp[0][j] = dp[0][j-1] +1;
    }
  }
  for(i=(1);i<(X);i++){
    for(j=(1);j<(Y);j++){
      if(A[i][j]=='k'){
        dp[i][j] =min_L(dp[i-1][j], dp[i][j-1])+i+j+1;
      }
      else{
        dp[i][j] =min_L(dp[i-1][j], dp[i][j-1])+1;
      }
    }
  }
  wt_L(dp[X-1][Y-1]);
  wt_L('\n');
  return 0;
}
// cLay varsion 20200119-1
// --- original code ---
// int X, Y;
// char A[2000][2002];
// int dp[2000][2000];
// {
//   int i, j;
//   rd(X,Y,A(X));
//   rep(i,1,X) dp[i][0] = dp[i-1][0] + if[A[i][0]=='k', i+1, 1];
//   rep(j,1,Y) dp[0][j] = dp[0][j-1] + if[A[0][j]=='k', j+1, 1];
//   rep(i,1,X) rep(j,1,Y) dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + if[A[i][j]=='k', i+j+1, 1];
//   wt(dp[X-1][Y-1]);
// }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX