Submission #1186355

---

Source Code Expand

#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <map>
#include <set>
#include <array>
#include <queue>
#include <string>
#include <vector>
#include <numeric>
#include <algorithm>
#include <functional>
#define MOD 1000000007
#define INF 11234567890
#define in std::cin
#define out std::cout
#define rep(i,N) for(LL i=0;i<N;++i)
typedef long long int LL;
typedef std::pair<int, int> P;

int H, W, K, T, A[450], B[450], C[450], D[450];
std::string ans[11234];

int main()
{
	in >> H >> W >> K >> T;
	rep(i, K) { in >> A[i] >> B[i] >> C[i] >> D[i]; }

	bool areYet_flag = true;
	int seek = 0;
	while (areYet_flag == true && seek + 1 <= T)
	{
		areYet_flag = false;
		rep(i, K)
		{
			if (A[i] == C[i] && B[i] == D[i])
			{
				ans[seek] += "-";
				continue;
			}
			areYet_flag = true;
			if (A[i] < C[i])
			{
				++A[i];
				ans[seek] += "D";
			}
			else if (A[i] > C[i])
			{
				--A[i];
				ans[seek] += "U";
			}
			else if (B[i] < D[i])
			{
				++B[i];
				ans[seek] += "R";
			}
			else if (B[i] > D[i])
			{
				--B[i];
				ans[seek] += "L";
			}
		}
		++seek;
	}

	out << seek - 1 << std::endl;
	rep(i, seek - 1) { out << ans[i] << std::endl; }
	return 0;
}

Submission Info

Judge Result