D. Time to Run【构造】

  1 #include <bits/stdc++.h>
  2 #define dbg(x) cout << #x << "=" << x << endl
  3 #define eps 1e-8
  4 #define pi acos(-1.0)
  5 
  6 using namespace std;
  7 typedef long long LL;
  8 
  9 const int inf = 0x3f3f3f3f;
 10 
 11 template<class T>inline void read(T &res)
 12 {
 13     char c;T flag=1;
 14     while((c=getchar())<‘0‘||c>‘9‘)if(c==‘-‘)flag=-1;res=c-‘0‘;
 15     while((c=getchar())>=‘0‘&&c<=‘9‘)res=res*10+c-‘0‘;res*=flag;
 16 }
 17 
 18 namespace _buff {
 19     const size_t BUFF = 1 << 19;
 20     char ibuf[BUFF], *ib = ibuf, *ie = ibuf;
 21     char getc() {
 22         if (ib == ie) {
 23             ib = ibuf;
 24             ie = ibuf + fread(ibuf, 1, BUFF, stdin);
 25         }
 26         return ib == ie ? -1 : *ib++;
 27     }
 28 }
 29 
 30 int qread() {
 31     using namespace _buff;
 32     int ret = 0;
 33     bool pos = true;
 34     char c = getc();
 35     for (; (c < ‘0‘ || c > ‘9‘) && c != ‘-‘; c = getc()) {
 36         assert(~c);
 37     }
 38     if (c == ‘-‘) {
 39         pos = false;
 40         c = getc();
 41     }
 42     for (; c >= ‘0‘ && c <= ‘9‘; c = getc()) {
 43         ret = (ret << 3) + (ret << 1) + (c ^ 48);
 44     }
 45     return pos ? ret : -ret;
 46 }
 47 
 48 int m, n, k;
 49 
 50 map<string, int> mp;
 51 vector<pair<int, string> > vec;
 52 
 53 void write(string a) {
 54     mp[a] = 0;
 55 }
 56 
 57 int main()
 58 {
 59     scanf("%d %d %d",&n, &m, &k);
 60     if(4 * n * m - 2 * n - 2 * m < k) {
 61         puts("NO");
 62         return 0;
 63     }
 64     else {
 65         puts("YES");
 66         int cnt = 0;
 67         for ( int i = 1; i <= m - 1; ++i ) {
 68             if(cnt < k) {
 69                 ++cnt;
 70                 mp["R"]++;
 71             }
 72             else {
 73                 break;
 74             }
 75         }
 76         if(mp["R"]) {
 77             vec.push_back(make_pair(mp["R"], "R"));
 78             write("R");
 79             
 80         }
 81         for ( int i = 1; i <= m - 1; ++i ) {
 82             if(cnt < k) {
 83                 ++cnt;
 84                 mp["L"]++;
 85             }
 86             else {
 87                 break;
 88             }
 89         }
 90         if(mp["L"]) {
 91             vec.push_back(make_pair(mp["L"], "L"));
 92             write("L");
 93         }
 94         for(int j = 1; j <= n - 1; ++j) {
 95             if(cnt > k)
 96                 break;
 97             for ( int i = 1; i <= m-2; ++i ) {
 98                 if(k - cnt > 3) {
 99                     mp["DRU"]++;
100                     cnt += 3;
101                 }
102             }
103             //dbg(k-cnt);
104             if(k - cnt >= 3 && m > 1) {
105                 cnt += 3;
106                 mp["DRU"]++;
107                 //dbg(mp["DRU"]);
108             }
109             else {
110                 if(m > 1) {
111                     if(cnt < k) {
112                         mp["D"]++;
113                         cnt++;
114                         vec.push_back(make_pair(mp["D"], "D"));
115                         write("D");
116                         
117                     }
118                     if(cnt < k) {
119                         mp["R"]++;
120                         cnt++;
121                         vec.push_back(make_pair(mp["R"], "R"));
122                         write("R");
123                         
124                     }
125                 }
126             }
127             if(mp["DRU"]) {
128                 vec.push_back(make_pair(mp["DRU"], "DRU"));
129                 write("DRU");
130                 
131             }
132             if(cnt < k) {
133                 mp["D"]++;
134                 cnt++;
135                 vec.push_back(make_pair(mp["D"], "D"));
136                 write("D");
137                 
138             }
139             for ( int i = 1; i <= m - 1; ++i ) {
140                 if(cnt < k) {
141                     mp["L"]++;
142                     cnt++;
143                 }
144                 else {
145                     break;
146                 }   
147             }
148             if(mp["L"] != 0) {
149                 vec.push_back(make_pair(mp["L"], "L"));
150                 write("L");
151             }
152         }
153         for ( int i = 1; i <= n-1; ++i ) {
154             if(cnt < k) {
155                 ++cnt;
156                 mp["U"]++;
157             }
158         }
159         if(mp["U"]) {
160             vec.push_back(make_pair(mp["U"], "U"));
161         }
162         int d = vec.size();
163         printf("%d\n",d);
164         for ( int i = 0; i < d; ++i ) {
165             cout << vec[i].first << " " << vec[i].second << endl;
166         }
167     }
168     return 0;
169 }