提出 #75106309

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define pb push_back

template<class T> inline bool chmax(T& a, T b) { return a < b ? a = b, 1 : 0; }
template<class T> inline bool chmin(T& a, T b) { return a > b ? a = b, 1 : 0; }

const int MOD = 1e9 + 7;

void solve() {
    int n,a,b;cin>>n>>a>>b;
    // start from blac to black at last , odd number of white;

    if(n&1){
        cout<<"No\n";
        return;
    }
    if((a+b)%2==0){
        cout<<"No\n";
        return;
    }
    cout<<"Yes\n";
    string ans="";
    int hole=(a-1)/2;
    for(int i=0;i<n/2;i++){
        if(i<hole){
            ans+=string(n-1,'R')+"D"+string(n-1,'L');
        }else if(i==hole){
            int curr=i*2+1;
            for(int c=1;c<=n;c++){
                if(c==b){
                    

                }else{
                    if(curr==i*2+1){
                        ans+="D";
                        curr++;
                    }else {
                        ans+="U";
                        curr--;
                    }
                }
                if(c<n)ans+="R";
            }
        }else if(i>hole){
            ans+=string(n-1,'L')+"D"+string(n-1,'R');
        }
        if(i<(n/2)-1)ans+="D";
    }
    cout<<ans<<'\n';



    
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int tt = 1;
    cin>>tt;
    while (tt--) {
        solve();
    }

    return 0;
}

提出情報

ジャッジ結果