Codeforces Round #619 (Div. 2) D. Time to Run

很容易发现：

RDU ---  L --- D

R---L ---- U

这样能走完所有 然后模拟就行

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ls (o<<1)
#define rs (o<<1|1)
#define pb push_back
//#define a(i,j) a[(i)*(m+2)+(j)]  //m是矩阵的列数
const int M = 1e5+7;
/*
int head[M],cnt;
void init(){cnt=0,memset(head,0,sizeof(head));}
struct EDGE{int to,nxt,val;}ee[M*2];
void add(int x,int y,int z){ee[++cnt].nxt=head[x],ee[cnt].to=y,ee[cnt].val=z,head[x]=cnt;}
*/

int main()
{
	ios::sync_with_stdio(false);
  	cin.tie(0);
  	int n,m,k;
  	cin>>n>>m>>k;
  	if(k>4*n*m-2*n-2*m)
  	{
  		cout<<"NO"<<endl;
  		return 0;
	}
	cout<<"YES"<<endl;
	
	int sz=0;
	int z=k;
	for(int t=1;t<=n-1;t++)
	{
		if(m-1) 
		if(k>3*(m-1))sz++,k-=3*(m-1);
		else 
		{
			int tp=k/3;k%=3;
			if(tp)sz++;
			if(k==1)sz++;
			if(k==2)sz++;k=0;
			break;
		}
		if(m-1)
		if(k>m-1)sz++,k-=m-1;
		else if(k)
		{
			sz++;k=0;
			break;
		}
		if(k>1)sz++,k--;
		else if(k)
		{
			if(k)sz++;k=0;
			break;
		}
	}
	if(m-1)if(k>m-1)sz++,k-=m-1;
	else if(k)sz++,k=0;
	if(m-1)if(k>m-1)sz++,k-=m-1;
	else if(k)sz++,k=0;
	if(k>n-1)sz++,k-=m-1;
	else if(k)sz++,k=0;
	
	k=z;
	cout<<sz<<endl;
	for(int t=1;t<=n-1;t++)
	{
		if(m-1)
		if(k>3*(m-1))cout<<m-1<<" RDU"<<endl,k-=3*(m-1);
		else 
		{
			int tp=k/3;k%=3;
			if(tp)cout<<tp<<" RDU"<<endl;
			if(k==1)cout<<1<<" R"<<endl;
			if(k==2)cout<<1<<" RD"<<endl;
			k=0;
			break;
		}
	//	cout<<k<<"----"<<endl;
		if(m-1)
		if(k>m-1)cout<<m-1<<" L"<<endl,k-=m-1;
		else if(k)
		{
			cout<<k<<" L"<<endl;k=0;
			break;
		}
		if(k>1)cout<<1<<" D"<<endl,k--;
		else if(k)
		{
			if(k)cout<<1<<" D"<<endl;k=0;
			break;
		}
	}
//	cout<<k<<" +"<<endl;
	if(m-1) if(k>m-1)cout<<m-1<<" R"<<endl,k-=m-1;
	else if(k)cout<<k<<" R"<<endl,k=0;
	if(m-1) if(k>m-1)cout<<m-1<<" L"<<endl,k-=m-1;
	else if(k)cout<<k<<" L"<<endl,k=0;
	if(k>n-1)cout<<n-1<<" U"<<endl,k-=m-1;
	else if(k)cout<<k<<" U"<<endl,k=0;
	return 0;
}