Submission #65065594

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=(a);i<(n);i++)
#define per(i,a,n) for (int i=(n)-1;i>=(a);i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

int n;
ll k,cnt[111][111];
bool check(VI c) {
	int z=0,w=0;
	per(i,0,SZ(c)) {
		w+=c[i];
		z+=w;
	}
	return (k-z)%(SZ(c)+1)==0;
}
int main() {
	scanf("%d%lld",&n,&k);
	--k;
	cnt[0][0]=k;
	for (int i=1;i<=n;i++) {
		VI dif;
		for (int j=1;j<i;j++) {
			dif.pb(cnt[i-1][j-1]-cnt[i-1][j]);
		}
		set<VI> st;
		for (int c=0;c<i;c++) {
			VI ndif=dif;
			ndif.insert(ndif.begin()+c,0);
			if (check(ndif)) {
				st.insert(ndif);
			}
			ndif=dif;
			ndif.insert(ndif.begin()+c,1);
			if (check(ndif)) {
				st.insert(ndif);
			}
		}
		assert(SZ(st)==1);
		auto c=*st.begin();
		int z=0,w=0;
		per(i,0,SZ(c)) {
			w+=c[i];
			z+=w;
		}
		ll b=(k-z)/(SZ(c)+1);
		cnt[i][i]=b;
		per(j,0,SZ(c)) {
			cnt[i][j]=cnt[i][j+1]+c[j];
		}
		//rep(j,0,i+1) printf("%lld ",cnt[i][j]); puts("");
	}
	string ans1,ans2;
	int y=0;
	for (int x=1;x<n;x++) {
		if (cnt[x][y]>cnt[x][y+1]) y++,ans1.pb('R'),ans2.pb('D');
		else ans1.pb('D'),ans2.pb('R');
		cnt[x][y]+=1;
	}
	reverse(all(ans2));
	ans1+=ans2;
	puts(ans1.c_str());
	//rep(i,0,n) printf("%d\n",)
}

Submission Info

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:35:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   35 |         scanf("%d%lld",&n,&k);
      |         ~~~~~^~~~~~~~~~~~~~~~

Judge Result