Submission #65067214

---

Source Code Expand

#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int > 
#define pb emplace_back
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
using namespace std; 
const int N = 114;
int n;
ll a[N][N];
ll X[N], Y[N], P[N];
void calc(int n) {
	ll val = max(P[2] - n * 2 - 2, 0LL);
	L(i, 2, n)P[i] -= val;
	val *= n - 1;
	L(i, 1, n)
		X[i] = val / n;
	L(i, n - val % n + 1, n)
		++X[i];
	ll mx = *max_element(P + 1, P + n + 1);
	L(t, 1, mx)
		R(i, n, 2) if(P[i] >= t) {
			if(X[i - 1] < X[i]) {
				++X[i - 1];
			} else {
				++X[i];
			}
		}
}
ll k;
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> k;
	--k;
	P[1] = a[1][1] = k;
	L(t, 2, n) {
		R(i, n, 1) P[i] = P[i - 1];
		calc(t);
		L(i, 1, t) a[i][t - i + 1] = X[i];
		L(i, 1, n) P[i] = X[i];
	}
	L(i, 1, n) {
		L(j, 1, n - i + 1) {
			a[n - j + 1][n - i + 1] = a[i][j];
		}
	}
	int x = 1, y = 1;
	while(x != n || y != n) {
		if(x == n) {
			++y;
			cout << "R";
		} else if(y == n) {
			++x;
			cout << "D";
		} else if(a[x + 1][y] <= a[x][y + 1]) {
			++x;
			cout << "D";
		} else {
			++y;
			cout << "R";
		}
	}
	cout << '\n';
	// L(i, 1, n) {
	// 	L(j, 1, n) {
	// 		cout << a[i][j] << ' ';
	// 	}
	// 	cout << endl;
	// }
	return 0;
}

Submission Info

Judge Result