QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#254480#7751. Palindrome Pathucup-team2230AC ✓143ms111604kbC++178.2kb2023-11-18 13:02:582023-11-18 13:02:59

Judging History

你现在查看的是最新测评结果

  • [2023-11-18 13:02:59]
  • 评测
  • 测评结果：AC
  • 用时：143ms
  • 内存：111604kb
查看
  • [2023-11-18 13:02:58]
  • 提交

answer

//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <cassert>
#include <iomanip>
#include <chrono>
#include <random>
#include <bitset>
#include <complex>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define int long long
//#define L __int128
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define a first
#define b second
#define fi first
#define sc second
#define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define gnr(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define per(i,b) gnr(i,0,b)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) (int)(x.size())
#define pcnt(x) __builtin_popcountll(x)
#define all(x) x.begin(),x.end()

#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
 
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}
 
template<class t> using vc=vector<t>;
 
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.fi<<","<<p.sc<<"}";
}
 
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}
 
 //https://codeforces.com/blog/entry/62393
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		// http://xorshift.di.unimi.it/splitmix64.c
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}
 
	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
	//don't make x negative!
	size_t operator()(pair<int,int> x)const{
		return operator()(uint64_t(x.first)<<32|x.second);
	}
};
//unordered_set -> dtype, null_type
//unordered_map -> dtype(key), dtype(value)
using namespace __gnu_pbds;
template<class t,class u>
using hash_table=gp_hash_table<t,u,custom_hash>;

template<class T>
void g(T &a){
	cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 998244353;
//const ll mod = 1000000007;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());

struct modular{
	ll v;
	modular(ll vv=0){s(vv%mod+mod);}
	modular& s(ll vv){
		v=vv<mod?vv:vv-mod;
		return *this;
	}
	modular operator-()const{return modular()-*this;}
	modular &operator+=(const modular&rhs){return s(v+rhs.v);}
	modular &operator-=(const modular&rhs){return s(v+mod-rhs.v);}
	modular &operator*=(const modular&rhs){v=ll(v)*rhs.v%mod;return *this;}
	modular &operator/=(const modular&rhs){return *this*=rhs.inv();}
	modular operator+(const modular&rhs)const{return modular(*this)+=rhs;}
	modular operator-(const modular&rhs)const{return modular(*this)-=rhs;}
	modular operator*(const modular&rhs)const{return modular(*this)*=rhs;}
	modular operator/(const modular&rhs)const{return modular(*this)/=rhs;}
	modular pow(ll n)const{
		if(n<0)return inv().pow(-n);
		modular res(1),x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	modular inv()const{return pow(mod-2);}
	friend modular operator+(ll x,const modular&y){
		return modular(x)+y;
	}
	friend modular operator-(ll x,const modular&y){
		return modular(x)-y;
	}
	friend modular operator*(ll x,const modular&y){
		return modular(x)*y;
	}
	friend modular operator/(ll x,const modular&y){
		return modular(x)/y;
	}
	friend ostream& operator<<(ostream&os,const modular&m){
		return os<<m.v;
	}
	friend istream& operator>>(istream&is,modular&m){
		ll x;is>>x;
		m=modular(x);
		return is;
	}
	bool operator<(const modular&r)const{return v<r.v;}
	bool operator==(const modular&r)const{return v==r.v;}
	bool operator!=(const modular&r)const{return v!=r.v;}
	explicit operator bool()const{
		return v;
	}
};
ll modpow(ll x,ll n){
	ll res=1;
	while(n>0){
		if(n&1) res=res*x%mod;
		x=x*x%mod;
		n>>=1;
	}
	return res;
}
#define _sz 1
modular F[_sz],R[_sz];
void make(){
	F[0] = 1;
	for(int i=1;i<_sz;i++) F[i] = F[i-1] * i;
	R[_sz-1] = F[_sz-1].pow(mod-2);
	for(int i=_sz-2;i>=0;i--) R[i] = R[i+1] * (i+1);
}
modular C(int a,int b){
	if(b < 0 || a < b) return modular();
	return F[a]*R[b]*R[a-b];
}
using ld=long double;
using vi=vc<int>;
int n,m;
string f[32];
vc<P>edge[31*31*31*31+5];
int ti(int a,int b,int c,int d){
	return a*30*30*30+b*30*30+c*30+d;
}
int dist[31*31*31*31+5];
P pre[31*31*31*31+5];
bool usedb[31*31*31*31+5];

void solve(){
	cin>>n>>m;
	rep(j,n)cin>>f[j];
	int sx,sy,gx,gy;
	cin>>sx>>sy>>gx>>gy;
	sx--;sy--;gx--;gy--;
	int dx[4]={0,0,-1,1};
	int dy[4]={-1,1,0,0};
	rep(i,n){
		rep(j,m){
			rep(a,n){
				rep(b,m){
					int cur = ti(i,j,a,b);
					rep(k,4){
						int ni = i+dx[k];
						int nj = j+dy[k];
						if(0<=ni and 0<=nj and ni<n and nj<m and f[ni][nj] == '1');
						else{
							ni = i, nj = j;
						}
						
						int na = a-dx[k];
						int nb = b-dy[k];
						if(0<=na and 0<=nb and na<n and nb<m and f[na][nb]=='1'){
							edge[ti(i,j,a,b)].eb(ti(ni,nj,na,nb), k);
							//cout<<vi{i,j,a,b}<<" "<<vi{ni,nj,na,nb}<<endl;
						}
						{
							if(0<=a+dx[k] and a+dx[k]<n and 0<=b+dy[k] and b+dy[k]<m
							and f[a+dx[k]][b+dy[k]]=='1');
							else{
								edge[ti(i,j,a,b)].eb(ti(ni,nj,a,b), k);
								//cout<<vi{i,j,a,b}<<" "<<vi{ni,nj,a,b}<<endl;
							}
						}
					}
				}
			}
		}
	}
	bool used[32][32] = {};
	string now = "";
	string bas = "LRUD";
	auto dfs=[&](auto self,int x,int y)->void{
		if(used[x][y]) return;
		used[x][y] = 1;
		rep(i,4){
			int nx = x+dx[i];
			int ny = y+dy[i];
			if(0<=nx and nx<n and 0<=ny and ny<m and f[nx][ny]=='1' and !used[nx][ny])
			{
				now.pb(bas[i]);
				self(self,nx,ny);
				now.pb(bas[i^1]);
			}
		}
	};
	dfs(dfs,sx,sy);
	rep(i,n)rep(j,m){
		if(f[i][j]=='1' and !used[i][j]){
			o(-1);
			return;
		}
	}
	string now2 = now;
	reverse(all(now2));
	string ans = now+now2;
	
	bool vis[32][32]={};
	int cx=sx,cy=sy;
	rep(i,si(ans)+1){
		vis[cx][cy] = 1;
		if(i==si(ans)) break;
		rep(k,4){
			if(ans[i]==bas[k]){
				cx += dx[k];
				cy += dy[k];
				if(0<=cx and cx<n and 0<=cy and cy<m and f[cx][cy]=='1');
				else{
					cx -= dx[k];
					cy -= dy[k];
				}
			}
		}
	}
	//cout<<cx<<' '<<cy<<endl;
	//rep(i,n)rep(j,m) if(f[i][j]=='1') assert(vis[i][j]);
	//(sx,sy,gx,gy) -> (sx,sy,cx,cy)
	queue<int>que;
	rep(i,31*31*31*31+5) dist[i] = INF;
	dist[ti(sx,sy,gx,gy)] = 0;
	que.push(ti(sx,sy,gx,gy));
	while(!que.empty()){
		int q = que.front(); que.pop();
		if(usedb[q]) continue;
		usedb[q] = 1;
		for(auto [to,dir]:edge[q]){
			if(usedb[to]) continue;
			que.push(to);
			if(dist[to] > dist[q]+1){
				dist[to] = dist[q]+1;
				pre[to] = mp(q,dir);
			}
		}
	}
	if(!usedb[ti(sx,sy,cx,cy)]) o(-1);
	else{
		string ret;
		int cc = ti(sx,sy,cx,cy);
		while(cc != ti(sx,sy,gx,gy)){
			ret.pb(bas[pre[cc].b]);
			cc = pre[cc].a;
		}
		ans += ret;
	//	reverse(all(ret));
		reverse(all(ans));
		ans += ret;
		reverse(all(ans));
		o(ans);
	}
}
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	int t; t = 1; //cin >> t;
	while(t--) solve();
}
Source code, Language: C++17

这程序好像有点Bug，我给组数据试试？

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 3ms
memory: 36248kb

input:

2 2
11
11
1 1 2 2

output:

RDLRULLURLDR

result:

ok Valid Solution (Length = 12).

Test #2:

score: 0
Accepted
time: 0ms
memory: 26260kb

input:

2 2
10
01
1 1 2 2

output:

-1

result:

ok No Solution.

Test #3:

score: 0
Accepted
time: 0ms
memory: 34256kb

input:

1 1
1
1 1 1 1

output:

result:

ok Valid Solution (Length = 0).

Test #4:

score: 0
Accepted
time: 0ms
memory: 36240kb

input:

5 4
1111
1111
1111
1111
1111
4 2 4 2

output:

LLRDDDULURRRULLLURRRLLLDRRRDDLDLLRRRLURULLLDRRDLLLURULRRRLLDLDDRRRDLLLRRRULLLURRRULUDDDRLL

result:

ok Valid Solution (Length = 90).

Test #5:

score: 0
Accepted
time: 0ms
memory: 37644kb

input:

5 5
11111
10101
11111
10101
11111
1 4 5 5

output:

RRRRLLLLDDRRRRUUDDDDLLLLUDRRUDRRUULLUDLLUURRRRRRUULLDULLUURRDURRDULLLLDDDDUURRRRDDLLLLRRRR

result:

ok Valid Solution (Length = 90).

Test #6:

score: 0
Accepted
time: 3ms
memory: 34584kb

input:

5 3
111
100
111
001
111
4 3 3 2

output:

URDULLUURRLLDDRRDDLLRRUURRLLDDRRDDLLRRUULLUDRU

result:

ok Valid Solution (Length = 46).

Test #7:

score: 0
Accepted
time: 4ms
memory: 36256kb

input:

5 4
1001
1101
1111
0011
0010
2 2 1 1

output:

ULUDDRRRUUDDDLDURULLLURRULLLURUDLDDDUURRRDDULU

result:

ok Valid Solution (Length = 46).

Test #8:

score: 0
Accepted
time: 4ms
memory: 36340kb

input:

5 3
101
111
100
111
100
4 1 2 2

output:

RUULLRRLLUURRUDLLUDDDDUUDDDDULLDURRUULLRRLLUUR

result:

ok Valid Solution (Length = 46).

Test #9:

score: 0
Accepted
time: 4ms
memory: 35996kb

input:

5 5
01110
10110
11110
11011
11100
2 4 5 1

output:

LDDRULULRRLDDLLUDDRDLRRLULURRRDRLULURRULULRDRRRULULRRLDRDDULLDDLRRLULURDDL

result:

ok Valid Solution (Length = 74).

Test #10:

score: 0
Accepted
time: 0ms
memory: 36760kb

input:

5 3
011
111
110
111
011
3 1 2 1

output:

LRULRRULRDLDDLRRDLRULULLULURLDRRLDDLDRLURRLURL

result:

ok Valid Solution (Length = 46).

Test #11:

score: 0
Accepted
time: 0ms
memory: 34940kb

input:

4 5
11111
11111
11111
11111
3 2 1 3

output:

LLRUUUDDLURRRRULLLLRRRRDDLLDLLRRRRLLURRULLLLDRRDLLLLURRULLRRRRLLDLLDDRRRRLLLLURRRRULDDUUURLL

result:

ok Valid Solution (Length = 92).

Test #12:

score: 0
Accepted
time: 0ms
memory: 34812kb

input:

5 5
11111
10101
11111
10101
11111
2 5 1 1

output:

UUUUDULLLLDDRRRRDDLLLLUDRRUDRRUULLUDLLUURRRRDDRRRRUULLDULLUURRDURRDULLLLDDRRRRDDLLLLUDUUUU

result:

ok Valid Solution (Length = 90).

Test #13:

score: 0
Accepted
time: 4ms
memory: 36612kb

input:

4 5
11111
10000
11111
00001
1 3 4 5

output:

DRRRRLLLLDDRRRRDULLLLUURRRRLLLLRRRRUULLLLUDRRRRDDLLLLRRRRD

result:

ok Valid Solution (Length = 58).

Test #14:

score: 0
Accepted
time: 6ms
memory: 26136kb

input:

3 5
10100
00010
00111
1 3 1 1

output:

-1

result:

ok No Solution.

Test #15:

score: 0
Accepted
time: 0ms
memory: 35360kb

input:

4 5
10001
11111
11100
11111
4 5 3 1

output:

DLLLLURRULLUDRRRRUDLLDLLDRRRRRRRRDLLDLLDURRRRDULLURRULLLLD

result:

ok Valid Solution (Length = 58).

Test #16:

score: 0
Accepted
time: 3ms
memory: 34668kb

input:

3 5
11111
10100
11111
1 2 3 5

output:

RRDLDULLDDRRRRLLUURRLLDDLLUURRUULLDDLLRRUULLRRRRDDLLUDLDRR

result:

ok Valid Solution (Length = 58).

Test #17:

score: 0
Accepted
time: 5ms
memory: 25952kb

input:

4 5
01110
10101
11011
10111
1 3 2 3

output:

-1

result:

ok No Solution.

Test #18:

score: 0
Accepted
time: 0ms
memory: 36512kb

input:

5 5
11111
11111
11111
11111
11111
1 3 5 2

output:

LLLRRLLDRRRRULRDDLLLLDRRRRDLLLLRRRRULLLLURRRRULLLLURRRRULLLLURRRRULLLLURRRRLLLLDRRRRDLLLLDDRLURRRRDLLRRLLL

result:

ok Valid Solution (Length = 106).

Test #19:

score: 0
Accepted
time: 0ms
memory: 37316kb

input:

5 5
11111
10101
11111
10101
11111
5 1 2 3

output:

DLLRRRRUULLLLUURRRRDULLDULLDDDURRDURRDDLLLLLLLLDDRRUDRRUDDDLLUDLLUDRRRRUULLLLUURRRRLLD

result:

ok Valid Solution (Length = 86).

Test #20:

score: 0
Accepted
time: 7ms
memory: 35592kb

input:

5 5
11111
10000
11111
00001
11111
4 5 5 3

output:

LULDDRRRRDULLLLUURRRRLLLLDDRRRRDDLLLLRRRRUURRRRLLLLDDRRRRDDLLLLRRRRUULLLLUDRRRRDDLUL

result:

ok Valid Solution (Length = 84).

Test #21:

score: 0
Accepted
time: 0ms
memory: 26908kb

input:

5 5
01010
10101
10101
11001
10011
4 1 5 4

output:

-1

result:

ok No Solution.

Test #22:

score: 0
Accepted
time: 0ms
memory: 35976kb

input:

5 5
10101
11111
10101
11111
11111
3 1 2 4

output:

DLUURRRRUDDDLLLLDRRRRLLLLURRUDRRUULLUDLLUDDDDULLDULLUURRDURRULLLLRRRRDLLLLDDDURRRRUULD

result:

ok Valid Solution (Length = 86).

Test #23:

score: 0
Accepted
time: 0ms
memory: 37556kb

input:

5 5
00001
11111
01110
01111
01111
1 5 5 2

output:

DLLLLRDRRDLLDRRRUDLLLURRULLURRRUURRRULLURRULLLDURRRDLLDRRDRLLLLD

result:

ok Valid Solution (Length = 64).

Test #24:

score: 0
Accepted
time: 3ms
memory: 26500kb

input:

5 5
01011
10111
11011
10101
01110
4 1 2 3

output:

-1

result:

ok No Solution.

Test #25:

score: 0
Accepted
time: 3ms
memory: 39780kb

input:

10 8
11111111
11111111
11111111
11111111
11111111
11111111
11111111
11111111
11111111
11111111
7 7 3 6

output:

RRRRRLUUUUUUUDDDDDDLLLLLLURRRRRRRULLLLLLLURRRRRRRULLLLLLLURRRRRRRULLLLLLLRRRRRRRDLLLLLLLDRRRRRRRDLLLLLLLDRRRRRRRDDDLLLLLLLDRRRRRRRDLLLLLLLRRRRRRRULLLLLLLURRRRRRRUULLLLLLLDRRRRRRRRRRRRDLLLLLLLUURRRRRRRULLLLLLLURRRRRRRLLLLLLLDRRRRRRRDLLLLLLLDDDRRRRRRRDLLLLLLLDRRRRRRRDLLLLLLLDRRRRRRRLLLLLLLURRRRRRRULLL...

result:

ok Valid Solution (Length = 354).

Test #26:

score: 0
Accepted
time: 4ms
memory: 38672kb

input:

10 6
111111
101010
111111
101010
111111
101010
111111
101010
111111
101010
1 6 2 3

output:

DRRLLLLLDDRRRRRLUDDDLLLLUDDDRRRRRLUDDDLLLLUDDURRUDDURRRLDUUULLUDLLUURRUDRRRLUULLUDLLUURRRRRRRRRRUULLDULLUULRRRDURRUULLDULLUUUDLRRRUDDURRUDDULLLLDDDULRRRRRDDDULLLLDDDULRRRRRDDLLLLLRRD

result:

ok Valid Solution (Length = 182).

Test #27:

score: 0
Accepted
time: 4ms
memory: 38812kb

input:

10 10
1111111111
1000000000
1111111111
0000000001
1111111111
1000000000
1111111111
0000000001
1111111111
1000000000
5 5 5 2

output:

LLLLLLLLRRRRLLLLDDRRRRRRRRRDDLLLLLLLLLDURRRRRRRRRUULLLLLLLLLUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLRRRRRRRRRUULLLLLLLLLUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRUDLLLLLLLLLDDRRRRRRRRRDDLLLLRRRRLLLLLLLL

result:

ok Valid Solution (Length = 240).

Test #28:

score: 0
Accepted
time: 4ms
memory: 26376kb

input:

10 10
1010110101
0000011010
1001001001
0011111000
1000111100
1011101001
1100110011
0110001011
0011111000
0101011101
7 5 4 3

output:

-1

result:

ok No Solution.

Test #29:

score: 0
Accepted
time: 8ms
memory: 38384kb

input:

10 6
100100
111111
100001
111111
101111
111111
101010
111111
111100
111111
6 5 7 3

output:

LDDDRLLLLUURRRRRUULLLLLUDDURRRUDRRDDDLLLRRRDUULLLLLDDDDRRRRRLUDLDLLLDRRRRRLLLLLURRRULUDLLUURRRRRRRRUULLDULURRRULLLLLRRRRRDLLLDLDULRRRRRDDDDLLLLLUUDRRRLLLDDDRRDURRRUDDULLLLLUURRRRRUULLLLRDDDL

result:

ok Valid Solution (Length = 190).

Test #30:

score: 0
Accepted
time: 8ms
memory: 39808kb

input:

10 8
11111110
11110111
01111111
11111101
11011101
11111111
11111011
11011101
11001111
11111110
7 1 2 1

output:

LLUUDDLLLRRRRULLLLURULRRRRRULLLLULURRRRRRDLRRDLRDDDLLULLRRDRDRDDLLLULRRLDDLLLLURULRDLDRRRRRRLLURRRUULURUUUULULLLDLRULLLDRDRRRRDLLLLDLDRRRRDLLLLLLLLDRRRRDLDLLLLDRRRRDRDLLLURLDLLLULUUUURULUURRRULLRRRRRRDLDRLURULLLLDDLRRLULLLDDRDRDRRLLULLDDDRLDRRLDRRRRRRULULLLLURRRRRLURULLLLURRRRLLLDDUULL

result:

ok Valid Solution (Length = 286).

Test #31:

score: 0
Accepted
time: 3ms
memory: 26192kb

input:

10 10
1111011101
1110111110
1111011111
1011101111
0101010111
1110111111
0111010111
1011111011
0111010101
1011111110
2 6 7 4

output:

-1

result:

ok No Solution.

Test #32:

score: 0
Accepted
time: 0ms
memory: 36476kb

input:

8 10
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
8 10 6 10

output:

RRRRRRRRRDDDDDLLLLLLLLLURRRRRRRRRULLLLLLLLLURRRRRRRRRULLLLLLLLLURRRRRRRRRULLLLLLLLLURRRRRRRRRLLLLLLLLLDRRRRRRRRRDLLLLLLLLLDRRRRRRRRRDLLLLLLLLLDRRRRRRRRRDLLLLLLLLLDRRRRRRRRRRRRRRRRRRDLLLLLLLLLDRRRRRRRRRDLLLLLLLLLDRRRRRRRRRDLLLLLLLLLDRRRRRRRRRDLLLLLLLLLRRRRRRRRRULLLLLLLLLURRRRRRRRRULLLLLLLLLURRRRRRRRR...

result:

ok Valid Solution (Length = 344).

Test #33:

score: 0
Accepted
time: 6ms
memory: 38728kb

input:

10 10
1111111111
1010101010
1111111111
1010101010
1111111111
1010101010
1111111111
1010101010
1111111111
1010101010
3 5 9 1

output:

LDDDDDRDLLLLLULLLLUURRRRRRRRRLDDLLLRUDDDLLLLLLUDDDRRRRRRRRRLUULRRLUDDDDDLLLLLLLLUDDURRUDDURRUDDURRUDDURRRLDUUULLUDLLUDLLUDLLUURRUDRRUDRRUURRRLUULLLLDULLDULLDDRRRRRRRRDDLLUDLLUDLLLLUULRRRUURRDURRDURRUULLDULLDULLDULLUUUDLRRRUDDURRUDDURRUDDURRUDDULLLLLLLLDDDDDULRRLUULRRRRRRRRRDDDULLLLLLDDDURLLLDDLRRRRR...

result:

ok Valid Solution (Length = 324).

Test #34:

score: 0
Accepted
time: 0ms
memory: 40080kb

input:

10 10
1111111111
1000000000
1111111111
0000000001
1111111111
1000000000
1111111111
0000000001
1111111111
1000000000
5 4 7 2

output:

RDRRRRRDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDURRRRRRRRRUULLLLLLLLLUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLRRRRRRRRRUULLLLLLLLLUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRUDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDRRRRRDR

result:

ok Valid Solution (Length = 244).

Test #35:

score: 0
Accepted
time: 3ms
memory: 26036kb

input:

9 10
1111001000
1110010111
0001001000
0101000101
1101000001
0111100110
0010010000
0001001000
1011001101
2 8 5 2

output:

-1

result:

ok No Solution.

Test #36:

score: 0
Accepted
time: 3ms
memory: 34968kb

input:

5 10
1001011101
1111111111
1000011001
1111111111
1101110010
4 3 4 7

output:

LLLRRDDDLLUURRRRRRRRRUDDDLLLLLLDRRLLURRURLDRRRDURUULLULLRRDLLLLUDLLLUDDDDRLURRRRULRDDDDULLLDULLLLDRRLLULLUURUDRRRDLRURRULLRRDLLLLLLDDDURRRRRRRRRUULLDDDRRLLL

result:

ok Valid Solution (Length = 156).

Test #37:

score: 0
Accepted
time: 2ms
memory: 27292kb

input:

7 10
1111111001
1111101110
1111011111
1101011101
1111011111
1111001011
1111111011
7 10 7 2

output:

-1

result:

ok No Solution.

Test #38:

score: 0
Accepted
time: 4ms
memory: 38936kb

input:

9 10
0101011101
1111111111
0101111111
1111111111
1111110101
1011111111
1101111101
1111111011
1101011111
3 7 7 10

output:

DDDDRDRRRRRRUULLLLULLLRUDDDLDRRRRRULLLRRRRRRRULLULLLRURRLLDRRRRUDLLDRRDDDLLLLLLLRDRRRRLDLLLLLLURLUDDDRLURRRDURRDRRRRULRUDDLLLLURULLLURRRRUDRRUULLLLDLLLLLURUURRUDDRRRRRRDDURRUURULLLLLDLLLLUURRDURRRRULLLURULLLLDDURLURRRRDRRUDRRRULRDDDULRULLLLLLDLRRRRDRLLLLLLLDDDRRDLLDURRRRDLLRRURLLLULLURRRRRRRLLLURRRR...

result:

ok Valid Solution (Length = 330).

Test #39:

score: 0
Accepted
time: 5ms
memory: 39468kb

input:

10 10
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
9 5 3 2

output:

LLLLLLLLRRRRDDULLLLURRRRRRRRRULLLLLLLLLURRRRRRRRRULLLLLLLLLURRRRRRRRRULLLLLLLLLURRRRRRRRRULLLLLLLLLRRRRRRRRRDLLLLLLLLLDRRRRRRRRRDLLLLLLLLLDRRRRRRRRRDLLLLLLLLLDRRRRRRRRRDDLLLLDLLLLLRRRRRRRRRLLLLURRRRULLLLLLLLLDRRRRRRRRDLLLLLLLLLURRRRULLLLRRRRRRRRRLLLLLDLLLLDDRRRRRRRRRDLLLLLLLLLDRRRRRRRRRDLLLLLLLLLDRR...

result:

ok Valid Solution (Length = 426).

Test #40:

score: 0
Accepted
time: 10ms
memory: 39048kb

input:

10 10
1111111111
1010101010
1111111111
1010101010
1111111111
1010101010
1111111111
1010101010
1111111111
1010101010
2 1 1 3

output:

LLLLLLLURRRRRRRRRLDDLLLLLLLLDDRRRRRRRRRLUDDDLLLLLLLLUDDDRRRRRRRRRLUDDULLUDDULLUDDULLUDDULLDUUURRUDRRUDRRUDRRRLUULLUDLLUDLLUDLLUURRUDRRUDRRUDRRRLUULLLLLLLLDDLLLLLLLLUULRRRDURRDURRDURRUULLDULLDULLDULLUULRRRDURRDURRDURRUUUDLLUDDULLUDDULLUDDULLUDDULRRRRRRRRRDDDULLLLLLLLDDDULRRRRRRRRRDDLLLLLLLLDDLRRRRRRR...

result:

ok Valid Solution (Length = 310).

Test #41:

score: 0
Accepted
time: 10ms
memory: 40212kb

input:

10 10
1111111111
1000000000
1111111111
0000000001
1111111111
1000000000
1111111111
0000000001
1111111111
1000000000
7 4 3 5

output:

LLLLLRUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDURRRRRRRRRUULLLLLLLLLLLLUURRRRRRRRRUDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLRRRRRRRRRUULLLLLLLLLUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRUURLLLLL

result:

ok Valid Solution (Length = 266).

Test #42:

score: 0
Accepted
time: 3ms
memory: 27704kb

input:

10 10
1110000101
1100110001
1011011001
0000000111
0010010111
0100111011
1110010011
1100111111
0110001110
0100000101
9 9 6 10

output:

-1

result:

ok No Solution.

Test #43:

score: 0
Accepted
time: 8ms
memory: 39520kb

input:

10 10
1110111011
1111111111
1110110000
1111111111
1010011100
1111111111
1111001110
1111111111
1001010011
1111111111
6 9 2 9

output:

RRRRRRRRLUUUULLLLLLLLUURRRRRRRRRLLDLLRRULLULULLLLURRLLDDRRLLURRRRRRRRRULRDLLLULLRRDLLDRDLLLDULLDDDRRRDLLLDDRRRRRRRRRULULLLLRDURURRLLDRRRLDRDLLLLLLUDLLLUURRRULLLURRRRRRRRRLLRRRRRRRRRULLLURRRUULLLDULLLLLLDRDLRRRDLLRRURUDRLLLLULURRRRRRRRRDDLLLDRRRDDDLLUDLLLDRDLLDRRLLULLLDRLURRRRRRRRRULLRRDDLLRRULLLLULU...

result:

ok Valid Solution (Length = 342).

Test #44:

score: 0
Accepted
time: 0ms
memory: 39404kb

input:

10 10
1111110011
1011111110
0111011111
1101101101
1111111110
1110111101
1011011111
1111111101
1011111101
1111111011
7 3 5 5

output:

LLULDDRDRDLLLUURRULLURURRULULLDURRRRRDLRRRRURLDDLLLRDRDLLLLURLDRDRRRDLLDLDLLDLLUDRRRRRRULRRULRDLDLLLLURRURURRRRUDDDDLRUUULLULLLURRRRLULURRRDULULLLULLLDRDLLDLDRRDLLDDRRRULLURRRDDLLDRRDLDLLDRDLLLULLLULUDRRRULULRRRRULLLULLUUURLDDDDURRRRURURRULLLLDLDRLURRLURRRRRRDULLDLLDLDLLDRRRDRDLRULLLLDRDRLLLDDLRURRR...

result:

ok Valid Solution (Length = 340).

Test #45:

score: 0
Accepted
time: 3ms
memory: 27888kb

input:

10 10
1101011101
1110111011
0101110101
1111101011
1111111111
1010111010
0111111101
1111101011
0111111101
1011101111
3 8 2 2

output:

-1

result:

ok No Solution.

Test #46:

score: 0
Accepted
time: 10ms
memory: 47756kb

input:

20 12
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
16 8 13 12

output:

RRRRRRRRRRRLLLLDDDDDDDDDDDDUUUULLLLLLLURRRRRRRRRRRULLLLLLLLLLLURRRRRRRRRRRULLLLLLLLLLLURRRRRRRRRRRULLLLLLLLLLLURRRRRRRRRRRULLLLLLLLLLLURRRRRRRRRRRULLLLLLLLLLLURRRRRRRRRRRULLLLLLLLLLLURRRRRRRRRRRULLLLLLLLLLLURRRRRRRRRRRLLLLLLLLLLLDRRRRRRRRRRRDLLLLLLLLLLLDRRRRRRRRRRRDLLLLLLLLLLLDRRRRRRRRRRRDLLLLLLLLLL...

result:

ok Valid Solution (Length = 1018).

Test #47:

score: 0
Accepted
time: 17ms
memory: 51604kb

input:

20 17
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
111111...

output:

RULLLLLLLLLLLLLLLDLUUUUUUULLLLLUURRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRDULLDULLDULLDULLDULLDULLDULLDULLDDDURRDURRDURRDURRDURRDURRDURRDURRDDDDLLLLLLLLLLUDDDLLLLLLUDDDRRRRRRRRRRRRRRRRUULLLLLLLLLRUDDURRUDDURRUDDURRUDDURRUDDDDDLLLLLLLLLLLLLLLLUDDDRRRRRRRRRRRRRRRRUDDDLLLLLLLLLLLLLLLLUDDDRRR...

result:

ok Valid Solution (Length = 1088).

Test #48:

score: 0
Accepted
time: 18ms
memory: 54736kb

input:

20 19
1111111111111111111
1000000000000000000
1111111111111111111
0000000000000000001
1111111111111111111
1000000000000000000
1111111111111111111
0000000000000000001
1111111111111111111
1000000000000000000
1111111111111111111
0000000000000000001
1111111111111111111
1000000000000000000
11111111111111...

output:

RRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRDULLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRUULLLLLLL...

result:

ok Valid Solution (Length = 822).

Test #49:

score: 0
Accepted
time: 7ms
memory: 33684kb

input:

20 16
0101001111110001
0000111101001011
0000111100011001
1101110100110100
1011011110001101
1101000110111111
0111010111100101
1101101111011001
1101010100000101
1111001000110010
0001011000101000
0101111010110110
0001101111000111
1010100010000110
0100100011011100
0100100101011111
0001000001001110
10011...

output:

-1

result:

ok No Solution.

Test #50:

score: 0
Accepted
time: 22ms
memory: 52504kb

input:

20 18
100101011111011110
111111111111111111
101111101010000001
111111111111111111
110010011011001010
111111111111111111
110110111110000010
111111111111111111
100001000001111000
111111111111111111
100010100111111000
111111111111111111
111100011010110111
111111111111111111
111101010111011110
111111111...

output:

RRRRRRRRRRRRRUUUUUULDLULLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRLLLULLLULLLLLLLLLLLURULURULUURRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLURRRRLLLLDRRDDLLRDRLURRRRRRRRRRRRRRLUDDDLLLLRRRRRLUULLUDLLLULRDLDLLLLRRRRULLULRDLLLLUURRRRUDRRUDRRRRRRRUULULLLRRRDLLLLLULLLLRRRRDLLLLLLUDLLUDLLLUDDDRDLDRDLDDURRRRRDURRRRRRDRRRDDLLL...

result:

ok Valid Solution (Length = 1150).

Test #51:

score: 0
Accepted
time: 15ms
memory: 51812kb

input:

20 16
1110111111111111
1111111001111111
1111110111111011
1111110011111111
1111111111011111
1111110111101111
1111011111111111
1101111111111111
1011111111111001
0111111011111111
1110111111111111
1111111111111111
1111011011111111
0101110111111111
1110111101111110
1111111111111111
1111111111011111
11111...

output:

RULLLUDRRURUURUUUULLLLDLLLLURRLLDDRRRRRURLDDLLLLLDRRRRRRRRRULULRRRRRULLLURRRRRRDLLRDRDLLLLLRDRRRRDLLLDLLLLLLLULLLLLDRRRDRRRRRRRRRRRRULLRRDDDLLLLLLLULLLLLLDLDLDRRRRRRRRRRRRRRRULLLLLLLLLLLULRRRLLDRRRRRRRRRRRDDLLLLLLLDLDLLLULULLLRDDLDRRRRRRRRRRRRRRRDLLLLDLLLLLLLLLLLURRRRRRRRRLLLLLLLLLDDRRRRRRRRRRDLLLLL...

result:

ok Valid Solution (Length = 1192).

Test #52:

score: 0
Accepted
time: 11ms
memory: 36348kb

input:

20 18
110111110101110101
101010111110101010
110101111101111101
111011111011101111
010111110111111101
111011111011111011
011111110111010111
101110101010111010
010111110101110111
101010101011101110
011101110111011111
101010111011111010
010101111111110101
101011101110111011
110101011101010101
101010101...

output:

-1

result:

ok No Solution.

Test #53:

score: 0
Accepted
time: 6ms
memory: 45292kb

input:

14 20
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
...

output:

LLLLLLLRDDDDDDDDDDDDDLURRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRLLLLLLLLLLLLLLLLLL...

result:

ok Valid Solution (Length = 1158).

Test #54:

score: 0
Accepted
time: 19ms
memory: 55112kb

input:

19 20
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
...

output:

RDDDDDDDDDLLLLLRRRRRRRRRRRRRRRRRRRLDDLLLLLLLLLLLLLLLLLLUDDDRRRRRRRRRRRRRRRRRRRLUDDDLLLLLLLLLLLLLLLLLLUDDDRRRRRRRRRRRRRRRRRRRLUDDDLLLLLLLLLLLLLLLLLLUDDDRRRRRRRRRRRRRRRRRRRLUDDDLLLLLLLLLLLLLLLLLLUDDDRRRRRRRRRRRRRRRRRRRLUDDDLLLLLLLLLLLLLLLLLLUDRRUDRRUDRRUDRRUDRRUDRRUDRRUDRRUDRRRLUULLUDLLUDLLUDLLUDLLUDL...

result:

ok Valid Solution (Length = 1186).

Test #55:

score: 0
Accepted
time: 6ms
memory: 41836kb

input:

10 20
11111111111111111111
10000000000000000000
11111111111111111111
00000000000000000001
11111111111111111111
10000000000000000000
11111111111111111111
00000000000000000001
11111111111111111111
10000000000000000000
5 6 8 20

output:

DRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLDURRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLL...

result:

ok Valid Solution (Length = 488).

Test #56:

score: 0
Accepted
time: 23ms
memory: 35940kb

input:

18 20
11011110100011011100
01100010001011110000
11100110001011101110
10110111100011001111
10100011111011110011
00001010110000010010
01101101100110010001
10001000111110000100
11000011001000001001
10101011101010100110
01111011011010100001
00010110000101101011
10110101011011000011
00110010111011000100
...

output:

-1

result:

ok No Solution.

Test #57:

score: 0
Accepted
time: 28ms
memory: 55292kb

input:

20 20
10101101000110011011
11111111111111111111
10110101010011101111
11111111111111111111
11010000010101011110
11111111111111111111
10100110101011011011
11111111111111111111
10010101101010101001
11111111111111111111
11101001101101101010
11111111111111111111
11100110110111110111
11111111111111111111
...

output:

LLLDDRDRDDUURDDRLLLLLLLLURULURRULLURRULLUURRRRRRRRRRRRRRRRRRRULULLLLLLLLLLLLLLLLLLURULUURRRRRRRRRRRRRRRRRRRULRDDLLLDLLLLLLLLLLLLLLURLDRDURRUDRRUDRRUDDURRDURURRLLDRDURRDRRRULRRLDLLLURURRRULLLULRDLLLLULRDLLLLLUDLLULRDLLLUDLLUDDDRDLDDURRDURRRDRLURRRDURRDURRDRLURRRDRLURRRRLDRDDDLLLLLLLLLLLLLLLLUDRDDLRRR...

result:

ok Valid Solution (Length = 1308).

Test #58:

score: 0
Accepted
time: 16ms
memory: 51660kb

input:

18 20
11111111111110111111
01111111111011111111
01111111111110011111
11111111111101111111
11111011111110111111
11111111111110111110
11111111111111011111
11011111111111111110
11110111111111001111
10111111110110111111
11111011111111111111
11111111111011101111
11101111001111111111
11111111111111111111
...

output:

RRRRRRURRLDDDDDDDDDDLLDLLLULLLLLURRRRRRRRRRRRRRRRRRRULLLLLLLLLULLLLLLLLLLURRRRULLULLURULURRRRRRRRRRRRULLLLLLULLLLLLDRRRRLLLLURURRRRRRRRRRRURRRRRRRULLLLLRRRRRDDLLLLDLLRDRRRRRULLLRRRDLDLLLLRDRRRRLDLLLLLLLLLLLLLLLULRRRRRRRRRRRLLLLLLLLLLDDURRDRRRRRRRRLDLDLLLLLULRRRRLLLDRRRRRRRRRRRRRULLLLLRRURRRLLLDRRRDD...

result:

ok Valid Solution (Length = 1346).

Test #59:

score: 0
Accepted
time: 7ms
memory: 32352kb

input:

13 20
11011101111111110111
11111110111010111111
11111111111101011101
10111010101111111010
01011101111111010111
10101011101110101110
01111101010101011111
11111011111110101011
11110111111111011111
11111010101011101011
01111111110101011111
10111010101011111110
11111111110111011101
12 16 1 20

output:

-1

result:

ok No Solution.

Test #60:

score: 0
Accepted
time: 18ms
memory: 55612kb

input:

20 20
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
...

output:

RRRRRRRRRRRRRRRLLLLLLUUUUUUUUUUUUUUUDDDDDDDDDDDLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRLLLLLLLLLLLLLLLLLLLD...

result:

ok Valid Solution (Length = 1690).

Test #61:

score: 0
Accepted
time: 24ms
memory: 55492kb

input:

20 20
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
...

output:

RDRRRRRRRRRRRULUUULLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRLUULLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRLDULLDULLDULLDULLDULLDULLDULLDULLDULLDDDURRDURRDURRDURRDURRDURRDURRDURRDURRRLDDDDLLUDDDLLLLLLLLLLLLLLLLUDDDRRRRRRRRRRRRRRRRRRRLUULRRLUDDDDDLLLLLLLLLLLLLLLLLLUDDDRRRRRRRRRRRRRRRRRRRLUDDDLLLLLLLLLLLLLLLLLLU...

result:

ok Valid Solution (Length = 1232).

Test #62:

score: 0
Accepted
time: 21ms
memory: 55188kb

input:

20 20
11111111111111111111
10000000000000000000
11111111111111111111
00000000000000000001
11111111111111111111
10000000000000000000
11111111111111111111
00000000000000000001
11111111111111111111
10000000000000000000
11111111111111111111
00000000000000000001
11111111111111111111
10000000000000000000
...

output:

LLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLUUDDRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRDDLLLLLLL...

result:

ok Valid Solution (Length = 1108).

Test #63:

score: 0
Accepted
time: 16ms
memory: 38192kb

input:

20 20
11110100001010101100
10110001101110101000
01011110111010110000
10111001001011011100
00110111011000010101
01001111110001010010
00101001010111010111
10110100100010001000
10101010001110000010
01111111010110101011
00100101001111000101
00110001001001111000
10101110010001000010
00000100010000110000
...

output:

-1

result:

ok No Solution.

Test #64:

score: 0
Accepted
time: 32ms
memory: 56320kb

input:

20 20
11010001010100101010
11111111111111111111
11000010111011001011
11111111111111111111
10010100111100111110
11111111111111111111
11101100001110000111
11111111111111111111
11010100111101000011
11111111111111111111
11010011111100110100
11111111111111111111
10001011110000111010
11111111111111111111
...

output:

DDDRDLLLDRDDDDDDLULLLLLLLLULDLLLLLLLLLLLLLLLLLURLDDRDLDDRRRRRRRRRRRRRRRRRRRDLLDLLLLLLLLLLLLLLLLLURRLLDDRDLDRDLDDRRRRRRRRRRRRRRRRRRRLUULLLLLLLLLLLLLLLLRUULRRRRRRRRRRRRRRRRRULURLDRDLLDULLDLRULLUDLLULLLRRRDDLLLLLRRRRRULLLLLLUDLLUDDDRDURRDRRRLLLURRRRRRRRDRRLLURRRRRLDDLLLLLDDLLLLLLLLLLLLLUDDRRRDLLLDRDLRR...

result:

ok Valid Solution (Length = 1254).

Test #65:

score: 0
Accepted
time: 18ms
memory: 56136kb

input:

20 20
11111111111101111111
11111111111111111101
11111110111110111111
11111011110111111111
11010010110111111011
11111111111111101111
11111111111111111111
11111111111111111001
11111111011110111111
11111111111111111101
11101011111111111111
11111110111111101111
11111111111111111101
10111111111111100111
...

output:

UUUULLLLLLLDRUUDDDDDLLLULULLLURRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLURRRRRRRRRRRRRRULLLURRRRRRRRULLLLLULLLLLLLLLLLLLLURRRRRRRRRRRLLLLLLLLLLLDDRRRRRRDRRRULRRRRLLLDDLRULLLDUULLDLLLLDRLURRRDURULLLLURRRRRRRRRRRRRURRRRRRDULLDLLRRULLLLDRDRRRRRDDLDLLULRDRDRRUDDDLLLLLDLLLLLLLLLLLLLLDRRDLLDRRRRRRRRRRRRRRRRRULULLL...

result:

ok Valid Solution (Length = 1492).

Test #66:

score: 0
Accepted
time: 17ms
memory: 38348kb

input:

20 20
11010111110101010101
10111010101111101010
11111101111101110111
10101011111010101110
11111111110101111101
10111111111010101111
11110101010111111101
10111110101011101111
01110111011101111101
10111011101010111010
11010111011111010111
11111011101011101111
01010111011111011111
11111010111110111011
...

output:

-1

result:

ok No Solution.

Test #67:

score: 0
Accepted
time: 75ms
memory: 91932kb

input:

30 25
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
11111111...

output:

LLLLLLLLLLLLLLLLLLLLLLLRRRRRRRRRRRRRRRDDDDDDDDDDDDDDDDDDDDDDDDDUUUUUUUUUUUUUUUUUUUUUUULLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLLLLLLRRRRRRRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLLLLLL...

result:

ok Valid Solution (Length = 3168).

Test #68:

score: 0
Accepted
time: 63ms
memory: 91316kb

input:

30 25
1111111111111111111111111
1010101010101010101010101
1111111111111111111111111
1010101010101010101010101
1111111111111111111111111
1010101010101010101010101
1111111111111111111111111
1010101010101010101010101
1111111111111111111111111
1010101010101010101010101
1111111111111111111111111
10101010...

output:

ULDDDDDRDULLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLLLLLDURRDURRDURRDURRDURR...

result:

ok Valid Solution (Length = 2294).

Test #69:

score: 0
Accepted
time: 38ms
memory: 91112kb

input:

30 25
1111111111111111111111111
1000000000000000000000000
1111111111111111111111111
0000000000000000000000001
1111111111111111111111111
1000000000000000000000000
1111111111111111111111111
0000000000000000000000001
1111111111111111111111111
1000000000000000000000000
1111111111111111111111111
00000000...

output:

LLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRLDDLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRLDDLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRDDLLLLL...

result:

ok Valid Solution (Length = 1782).

Test #70:

score: 0
Accepted
time: 89ms
memory: 89476kb

input:

30 30
011110110001111010011111110010
011101110110100110001101010100
100100100111010000000011100101
111110001011110110101000100000
100110011100000111100111100010
110011101000111000101110011101
011000001101110100001010011100
001101101010010100111111110011
100010111001110111010110100001
000101010010110...

output:

-1

result:

ok No Solution.

Test #71:

score: 0
Accepted
time: 119ms
memory: 111036kb

input:

30 30
101011111010110011011100010111
111111111111111111111111111111
101000010010011000101010010010
111111111111111111111111111111
101010011110010001011010010101
111111111111111111111111111111
111100010110101001000001000001
111111111111111111111111111111
111101000101101001001000100001
111111111111111...

output:

URDDDDDDDDDDDDRDLLLLLLLLLLLLLLLLLLLLLLLLLULLDLLULLURULUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLLLLRURLDDDRRRRRRRRRRRRRRRRRRRRRRRRRRULLLLRRRRDDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLUDDDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRDLLLDLLLLLLLLLLLLLLLLLLLLLLLLLLURRRRRRRRRLLLLLLLLLDRRRRRRRRRRRRRUDRRUDRRURRRLLL...

result:

ok Valid Solution (Length = 2798).

Test #72:

score: 0
Accepted
time: 143ms
memory: 111604kb

input:

30 30
111111111111111101111111011011
111111100111011111111111101010
111111111111111111111111011111
111111111101111111110111111110
111111111111111011111111111111
111110111111111111111111011111
111111111111111111111111111011
111101111111011111111111111111
111111111111111111111111111111
101110111110111...

output:

URRRRRRRRRRRRRRRRRRDRUUUUUURLLLLLLULLLLLLLLLLLLLURRRRRRRRULLLLLLLLURRRRRRRRULLLULLLLLUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLULLLLLLLLLLLLLURRRRULLLLURRRRRRRRRULLLLLLLLLURRRRRRULLLLLLRRRRRRRRRRRRRRRDLLDLLLULRRLDRDRRRRRRRRULLLLLRRURRRRRRRRLULLLLLLRRRRRRDDLLLRDRRRRRRRULLLRUULRDDRRRLUURLDDDDLLL...

result:

ok Valid Solution (Length = 3426).

Test #73:

score: 0
Accepted
time: 74ms
memory: 90624kb

input:

30 30
110111011111110111011111110101
101110101010111010101011101010
011101111101011101011111010111
111110101110111111111011101110
010101110101011101010101111111
101111101011111111111110101011
111101110111010101011101010101
111011111010101010101010101111
011111011111110101011111111101
111010101111101...

output:

-1

result:

ok No Solution.

Test #74:

score: 0
Accepted
time: 38ms
memory: 74604kb

input:

21 30
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111...

output:

RRRRLDDDDDDDDDDDDDUUUUUUUUUULLLLLLLLLLLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLLLLLLLLLLLURRR...

result:

ok Valid Solution (Length = 2572).

Test #75:

score: 0
Accepted
time: 42ms
memory: 76768kb

input:

21 30
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101...

output:

LLLLLLLLLLLLLLLLLLLLLLRURRUUUUUUULLLUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRLUULLLLLLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRLUULLLLLLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRLUULLLLLLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRLDULLDULLDULLDULLDULLDULLDULLDULLDULLDULLDULLDU...

result:

ok Valid Solution (Length = 1982).

Test #76:

score: 0
Accepted
time: 44ms
memory: 76316kb

input:

21 30
111111111111111111111111111111
100000000000000000000000000000
111111111111111111111111111111
000000000000000000000000000001
111111111111111111111111111111
100000000000000000000000000000
111111111111111111111111111111
000000000000000000000000000001
111111111111111111111111111111
100000000000000...

output:

LLLLLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLRRRRRRRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRR...

result:

ok Valid Solution (Length = 1752).

Test #77:

score: 0
Accepted
time: 67ms
memory: 71168kb

input:

25 30
011010010110010101001110110111
000011111001111101110011010001
011011100010011000110100110000
001111001100100010111111101001
000101111100111001000000001111
001010110011101110101000010000
001010011001010000011001001001
011111010111110110101001110000
011001010011100010100101011000
100011000011110...

output:

-1

result:

ok No Solution.

Test #78:

score: 0
Accepted
time: 85ms
memory: 89876kb

input:

25 30
101100000100000111111100110011
111111111111111111111111111111
100111110101001111010001110011
111111111111111111111111111111
101101100110111111011110101110
111111111111111111111111111111
111001000110101100010101000110
111111111111111111111111111111
100000001011110010001101011010
111111111111111...

output:

URRRRRRRRRRRRRRRRRRRRRRRRRRRDRUUUUUULLLLLLLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRULULLLLLLLLLLLLLLLLLLLLLLLLLLLLUDDURRURLDRDRRRRLLLLURRRRRRUDDURRDURRRDRRRLLLURURRRRRRLLLLLLDRRRRDURRRRDRRLLURURLDRRRRRULRDLDRDLDLLRRULLLLDULLDLLLRRRULLLLLDLLLLLRRRRRULLLLLLLDLRULLLLDLRULLLDLRULLLDDDRRDLLD...

result:

ok Valid Solution (Length = 2290).

Test #79:

score: 0
Accepted
time: 91ms
memory: 90028kb

input:

25 30
111111101111111111111111111111
111111111111111101111111110111
111111111111101111111111111111
111111111111111101101111111111
011101111111111111111111101111
111011100111111110111110111111
111111110111111111111111111111
111111111111110111111111111111
111111111111111101111111111111
111111111111111...

output:

ULLLLLLLLLLLLLLLLLLLLRDLLDRRRRRRRDLLLLLLLDRRRRRRRRRRRRRRRURRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLLURRRRRRRULLLLLLLLLLLULLLLLURRRRRRRRRRRRULLLLLLLLLLLLURRRRRRLLLLLLDRRRRRRRRURRRRRRRRRRRRRRRRRRRRRDLLDLLLLLLLLLLLLLULRRLDDLLLLLLLLRRRRRRRRRLURRRURRRRRRRRLLLLLLLLDDRDLRRRRRRRULLLLRRRRRRRRRULRDDLLLDLLRRRRRLLLURR...

result:

ok Valid Solution (Length = 2850).

Test #80:

score: 0
Accepted
time: 44ms
memory: 69564kb

input:

25 30
110101110101011111010101010111
101111101011111011111110101010
110111011101110111111101011101
101011111011101011111111111011
110111111101011111110111111111
111111111110101011111111101010
110101010101010101011111011101
101010111010101111111111101111
111101110111011101011111010111
101010101010111...

output:

-1

result:

ok No Solution.

Test #81:

score: 0
Accepted
time: 107ms
memory: 111372kb

input:

30 30
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111...

output:

RRRRRRRRRRRRRRRRRRLLUUUUUUUUUUUUUUUUUUUUUUUUDDDDDDDDDDDDLLLLLLLLLLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRRRRRRRRRRRULLLLLL...

result:

ok Valid Solution (Length = 3708).

Test #82:

score: 0
Accepted
time: 96ms
memory: 111328kb

input:

30 30
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101...

output:

UUUDRRRRRRRRDLDDDDDDDDDRLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRLDDLLLLLLLLLLLLLRUDDDLLLLLLLLLLLLLLLLUDDDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRLUULLLLLLLLLLLRUDDURRUDDURRUDDURRUDDURRUDDURRRLUDDDDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLUDDDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRLUDDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLUDDDRRRRRRRRRR...

result:

ok Valid Solution (Length = 2744).

Test #83:

score: 0
Accepted
time: 80ms
memory: 110908kb

input:

30 30
111111111111111111111111111111
100000000000000000000000000000
111111111111111111111111111111
000000000000000000000000000001
111111111111111111111111111111
100000000000000000000000000000
111111111111111111111111111111
000000000000000000000000000001
111111111111111111111111111111
100000000000000...

output:

RRRRRRRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLLLL...

result:

ok Valid Solution (Length = 2666).

Test #84:

score: 0
Accepted
time: 97ms
memory: 90244kb

input:

30 30
010110110101101010000010000110
101110000111000001001111100101
010100011111100110100001111101
101101100010111011011010001010
100101010100001011101100101100
101001111001111101101100001110
000111101010011110100001110100
111111001101000001011110000111
010000100010000100000011101000
100001010111010...

output:

-1

result:

ok No Solution.

Test #85:

score: 0
Accepted
time: 128ms
memory: 110900kb

input:

30 30
100110101011111011001000111100
111111111111111111111111111111
101001000111011110000110011110
111111111111111111111111111111
111001111110100011111000000010
111111111111111111111111111111
100111001001100000100010001101
111111111111111111111111111111
110001101000111011111010110110
111111111111111...

output:

DRLLLDDDURRRRRRRDDDDDDDDDDURRRRRRRDRRLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRLULULLLLLLLLLLLLLLLLLLLLLLLLLLLURULUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLLLLURRLLDRRRDURUDRRDRLURURLDRRRDURRURRLLDRRDRLURRURRLLDRRDURRURLDDRLURRRUDDRRLLURRRRDDLRUUUULULLLULLLLLLLLLLLLLLLLLLLLLLLL...

result:

ok Valid Solution (Length = 2774).

Test #86:

score: 0
Accepted
time: 141ms
memory: 111552kb

input:

30 30
111101111111111111111011111111
100111111111111111111111011111
111111011111111111011111111110
101111111101111111111111111111
111111111111111111111111111111
111111101111011111111110111111
111011111111111111111111111111
111111111111111111111101111111
111111111111111111111111111111
011111100111111...

output:

RULLLLULDDDDRDLDLLLLLLURRRRULLLLLLULLLLLLLLURRRRULLLLRURRRRRRRRRRRRRRRRRRRRRRULLLLULLLULLLLLLLLLLLLLLLLURRRRRRRRRRRULLLLLLLLLLLURRRRRRRRRRRRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLLULLLLLLLLLURRRRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLULLLLURRRRRRRRRRRRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLULLLLULLLLULLLDDRR...

result:

ok Valid Solution (Length = 3394).

Test #87:

score: 0
Accepted
time: 69ms
memory: 88824kb

input:

30 30
011111010101111111011101111101
111011101011111110111111101011
111111010101011101111101110101
111110101011101110111111101110
010111011101110101110101111101
101111101011101110101010111111
110101010101010111011101010101
101110101111101110101110111111
110111011101010111010111110101
101011111110111...

output:

-1

result:

ok No Solution.

Test #88:

score: 0
Accepted
time: 99ms
memory: 111588kb

input:

30 30
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111...

output:

LLLLLLLLLLLLLLLLLLLLLLLLLLLLLUUUUUUUUUUUUUUUUUUUUUUUUUUUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDRRR...

result:

ok Valid Solution (Length = 3710).

Extra Test:

score: 0
Extra Test Passed
English 繁體中文 简体中文

Server Time: 2024-12-05 05:13:50 | OpenSource Project