#620230 (C++14) No.1405 ジグザグロボット

• 問題: No.1405 ジグザグロボット
• ユーザー: CuriousFairy315
• 提出日時: 2021-02-19 23:01:33
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 513 ms / 3,153 ms
• コード長: 7,095 bytes
• コンパイル時間: 2,837 ms
• コンパイル使用メモリ: 205,944 KB
• 実行使用メモリ: 36,352 KB
• 最終ジャッジ日時: 2024-09-16 23:44:17
• 合計ジャッジ時間: 11,989 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 35

ソースコード

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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
#include <bits/stdc++.h>
using namespace std;
// SSRSさんの提出からQCFium法を抜いても通るかテスト
const int INF = 1000000;
vector<int> dy = {1, 0, 0};
vector<int> dx = {0, 1, -1};
struct lazy_segment_tree{
  int N;
  vector<int> ST, lazy;
  lazy_segment_tree(vector<int> &A){
    int n = A.size();
    N = 1;
    while (N < n){
      N *= 2;
    }
    ST = vector<int>(N * 2 - 1, -INF);
    for (int i = 0; i < n; i++){
      ST[N - 1 + i] = A[i];
    }
    for (int i = N - 2; i >= 0; i--){
      ST[i] = max(ST[i * 2 + 1], ST[i * 2 + 2]);
    }
    lazy = vector<int>(N * 2 - 1, 0);
  }
  void eval(int i){
    if (i < N - 1){
      lazy[i * 2 + 1] += lazy[i];
      lazy[i * 2 + 2] += lazy[i];
    }
    ST[i] += lazy[i];
    lazy[i] = 0;
  }
  void range_add(int L, int R, int x, int i, int l, int r){
    eval(i);
    if (r <= L || R <= l){
      return;
    } else if (L <= l && r <= R){
      lazy[i] = x;
      eval(i);
    } else {
      int m = (l + r) / 2;
      range_add(L, R, x, i * 2 + 1, l, m);
      range_add(L, R, x, i * 2 + 2, m, r);
      ST[i] = max(ST[i * 2 + 1], ST[i * 2 + 2]);
    }
  }
  void range_add(int L, int R, int x){
    range_add(L, R, x, 0, 0, N);
  }
  int range_max(int L, int R, int i, int l, int r){
    eval(i);
    if (r <= L || R <= l){
      return -INF;
    } else if (L <= l && r <= R){
      return ST[i];
    } else {
      int m = (l + r) / 2;
      return max(range_max(L, R, i * 2 + 1, l, m), range_max(L, R, i * 2 + 2, m, r));
    }
  }
  int range_max(int L, int R){
    return range_max(L, R, 0, 0, N);
  }
};
int main(){
  int N, X, Y;
  cin >> N >> X >> Y;
  string S;
  cin >> S;
  vector<string> T(1);
  for (int i = 0; i < N; i++){
    if (S[i] == 'S'){
      T.push_back("");
    } else {
      T.back() += S[i];
    }
  }
  int K = T.size();
  if (Y >= K){
    cout << -1 << endl;
  } else {
    vector<int> a(K + 1, 0);
    vector<vector<pair<int, int>>> add(K);
    vector<vector<int>> a2 = {a};
    for (int i = 0; i < K; i++){
      int sz = T[i].size();
      for (int j = 0; j < sz; j++){
        if (T[i][j] == 'R'){
          for (int k = 0; k <= i; k++){
            a[k]++;
          }
          add[i].push_back(make_pair(i + 1, 1));
        }
        if (T[i][j] == 'L'){
          int r = 0;
          while (a[r] > 0){
            r++;
          }
          for (int k = 0; k < r; k++){
            a[k]--;
          }
          add[i].push_back(make_pair(r, -1));
        }
      }
      a2.push_back(a);
    }
    vector<vector<int>> dp(Y + 2, vector<int>(K + 1, -INF));
    dp[0][0] = 0;
    for (int i = 0; i <= Y; i++){
      lazy_segment_tree ST(dp[i]);
      for (int j = 0; j <= K; j++){
        dp[i + 1][j] = ST.range_max(0, j);
        if (j < K){
          int cnt = add[j].size();
          for (int k = 0; k < cnt; k++){
            ST.range_add(0, add[j][k].first, add[j][k].second);
          }
        }
      }
    }
    if (dp[Y + 1][K] < X){
      cout << -1 << endl;
    } else {
      vector<int> P(Y + 2);
      P[Y + 1] = K;
      for (int i = Y; i >= 0; i--){
        for (int j = 0; j < P[i + 1]; j++){
          if (dp[i + 1][P[i + 1]] == dp[i][j] + a2[P[i + 1]][j]){
            P[i] = j;
            break;
          }
        }
      }
      vector<int> L(Y + 1);
      for (int i = 0; i <= Y; i++){
        L[i] = dp[i][P[i]];
      }
      vector<string> T2(Y + 1);
      for (int i = 0; i <= Y; i++){
        for (int j = P[i]; j < P[i + 1]; j++){
          T2[i] += T[j];
          T2[i] += 'S';
        }
      }
      T2[Y].pop_back();
      vector<int> R = L;
      for (int i = 0; i <= Y; i++){
        int x = L[i];
        int l = T2[i].size();
        for (int j = 0; j < l; j++){
          if (T2[i][j] == 'L'){
            x--;
          }
          if (T2[i][j] == 'R'){
            x++;
          }
          x = max(x, L[i]);
          R[i] = max(R[i], x);
        }
      }
      set<pair<int, int>> st;
      for (int i = 0; i <= Y; i++){
        for (int j = L[i]; j <= R[i]; j++){
          st.insert(make_pair(i, j));
        }
      }
      vector<vector<int>> ans(Y + 2);
      for (auto P : st){
        int y = P.first;
        int x = P.second;
        for (int i = 0; i < 3; i++){
          int y2 = y + dy[i];
          int x2 = x + dx[i];
          if (st.count(make_pair(y2, x2)) == 0){
            ans[y2].push_back(x2);
          }
        }
      }
      for (int i = 0; i < Y + 2; i++){
        sort(ans[i].begin(), ans[i].end());
        ans[i].erase(unique(ans[i].begin(), ans[i].end()), ans[i].end());
      }
      while (true){
        set<pair<int, int>> st2;
        for (int i = 0; i < Y + 2; i++){
          int cnt = ans[i].size();
          for (int j = 0; j < cnt; j++){
            st2.insert(make_pair(i, ans[i][j]));
          }
        }
        int cx = 0, cy = 0;
        vector<int> up(Y + 1);
        vector<int> id(Y);
        for (int i = 0; i < N; i++){
          int x2 = cx, y2 = cy;
          if (S[i] == 'L'){
            x2--;
          }
          if (S[i] == 'R'){
            x2++;
          }
          if (S[i] == 'S'){
            y2++;
          }
          if (st2.count(make_pair(y2, x2)) == 1){
            x2 = cx;
            y2 = cy;
          }
          if (y2 != cy){
            id[cy] = i;
            up[cy] = x2;
          }
          cx = x2;
          cy = y2;
        }
        up[Y] = cx;
        if (cx == X){
          break;
        }
        vector<int> d(Y + 1);
        d[0] = up[0];
        for (int j = 1; j <= Y; j++){
          d[j] = up[j] - up[j - 1];
        }
        int p = 0;
        while (d[p] == 0){
          p++;
        }
        ans[p].back()--;
        set<pair<int, int>> st3;
        for (int i = 0; i < Y + 2; i++){
          int cnt = ans[i].size();
          for (int j = 0; j < cnt; j++){
            st3.insert(make_pair(i, ans[i][j]));
          }
        }
        vector<int> px(N + 1), py(N + 1);
        px[0] = 0;
        py[0] = 0;
        for (int i = 0; i < N; i++){
          px[i + 1] = px[i];
          py[i + 1] = py[i];
          if (S[i] == 'L'){
            px[i + 1]--;
          }
          if (S[i] == 'R'){
            px[i + 1]++;
          }
          if (S[i] == 'S'){
            py[i + 1]++;
          }
          if (st3.count(make_pair(py[i + 1], px[i + 1])) == 1 || py[i + 1] > p){
            px[i + 1] = px[i];
            py[i + 1] = py[i];
          }
        }
        if (px[id[p]] != up[p]){
          for (int i = p + 1; i < Y + 2; i++){
            int cnt = ans[i].size();
            for (int j = 0; j < cnt; j++){
              ans[i][j]--;
            }
          }
        }
      }
      for (int i = 0; i < Y + 2; i++){
        ans[i].erase(unique(ans[i].begin(), ans[i].end()), ans[i].end());
      }
      int M = 0;
      for (int i = 0; i < Y + 2; i++){
        M += ans[i].size();
      }
      cout << M << endl;
      for (int i = 0; i < Y + 2; i++){
        int cnt = ans[i].size();
        for (int j = 0; j < cnt; j++){
          cout << ans[i][j] << ' ' << i << endl;
        }
      }
    }
  }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX