Submission #75070183

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using P = pair<int,int>;
using PL = pair<ll,ll>;
template <class T>
using PQ = priority_queue<T>;
template <class T>
using PQG = priority_queue<T, vector<T>, greater<T>>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rep1(i,n) for (int i = 1; i <= (n); i++)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)(a).size()
#define pb push_back
#define eb emplace_back
#define pob pop_back
template <class T>
bool chmax(T& a, const T& b) {return (a < b ? (a = b, true) : false);}
template <class T>
bool chmin(T& a, const T& b) {return (a > b ? (a = b, true) : false);}
const int INF = 2e9;
const ll LINF = 2e18;
const vector<int> di = {-1,1,0,0}, dj = {0,0,-1,1};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int t;
  cin >> t;
  rep(ti,t) {
    int n, a, b;
    cin >> n >> a >> b;
    a--; b--;
    vector visited(n,vector<bool>(n));
    string ans, path;
    auto dfs = [&](auto dfs, int i, int j) -> void {
      visited[i][j] = true;
      if(i == n-1 && j == n-1 && sz(path) == n*n-2) {
        ans = path;
        return;
      }
      rep(k,4) {
        int ni = i+di[k], nj = j+dj[k];
        if(ni < 0 || nj < 0 || ni >= n || nj >= n) continue;
        if(visited[ni][nj] || (ni == a && nj == b)) continue;
        path.pb("UDLR"[k]);
        dfs(dfs,ni,nj);
        path.pob();
      }
      visited[i][j] = false;
    };

    dfs(dfs,0,0);
    if(ans == "") cout << "No\n";
    else cout << "Yes\n" << ans << "\n";
  }
  return 0;
}

Submission Info

Judge Result