結果

問題 No.8069 Torn Documents
ユーザー 👑 emthrm
提出日時 2020-04-02 13:47:38
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 2,000 ms
コード長 2,285 bytes
コンパイル時間 2,393 ms
コンパイル使用メモリ 202,752 KB
最終ジャッジ日時 2025-01-09 12:30:44
ジャッジサーバーID
（参考情報） 		judge2 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;
int main() {
  int a, b; string s; cin >> a >> b >> s;
  {
    int status = 0;
    for (char c : s) {
      if (c == 'L') {
        if (status == 0) status = 1;
      } else if (c == 'R') {
        if (status == 1) status = 0;
      } else if (c == 'U') {
        if (status == 1 || status == 2) status = 3;
      } else if (c == 'D') {
        if (status == 1 || status == 3) status = 2;
      }
    }
    if (status == 3) {
      vector<pair<int, int>> walls{{0, 1}, {a + 1, 1}, {a + 2, 0}, {a - 1, b}, {a, b + 1}, {a + 1, b}};
      sort(ALL(walls));
      walls.erase(unique(ALL(walls)), walls.end());
      cout << walls.size() << '\n';
      for (auto [a, b] : walls) cout << a << ' ' << b << '\n';
      return 0;
    }
  }
  {
    int status = 0;
    for (char c : s) {
      if (c == 'L') {
        if (status == 1 || status == 2) status = 3;
      } else if (c == 'R') {
        if (status == 1 || status == 3) status = 2;
      } else if (c == 'U') {
        if (status == 0) status = 1;
      } else if (c == 'D') {
        if (status == 1) status = 0;
      }
    }
    if (status == 3) {
      vector<pair<int, int>> walls{{1, 0}, {1, b + 1}, {0, b + 2}, {a, b - 1}, {a + 1, b}, {a, b + 1}};
      sort(ALL(walls));
      walls.erase(unique(ALL(walls)), walls.end());
      cout << walls.size() << '\n';
      for (auto [a, b] : walls) cout << a << ' ' << b << '\n';
      return 0;
    }
  }
  cout << "-1\n";
  return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0