SourceCodeCPP/dichuyen.cpp at master · DungTran2301/SourceCodeCPP · GitHub

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
//
// created by:DungTD
//
#include <bits/stdc++.h>
#define faster() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define  endl '\n'
#define base int (1e9+7)
#define ll long long

using namespace std;
vector <char> res;
vector <string> ans;
bool check = false;
int a[100][100];
int n;
void backTrack(int i, int j, string s) {
    if (i==n && j==n && a[i][j]==1) {
        check=true;
        ans.push_back(s);
    }
    if (i==1 && j==1 && a[i][j]==0) {
        check=false;
        return;
    }
    if (i<n && a[i+1][j]==1){
        backTrack(i+1, j, s+"D");
    }
    if (j<n &&a[i][j+1]==1){
        backTrack(i, j+1, s+"R");
    }
}
void solve(){
    cin >> n;
    ans.clear();
    check = false;
    for (int i=1; i<=n; i++)
        for (int j=1; j<=n; j++) cin >> a[i][j];
    backTrack(1, 1, "");
    sort(ans.begin(), ans.end());
    if (!check) {
        cout << -1 << endl;
    }
    for (int i=0; i<ans.size(); i++) cout << ans[i] << " ";
    cout << endl;
}

int main(){
    faster();
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}