提出 #3301321

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define endl '\n'

//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")

using namespace std;
template<class T, class T2> inline int chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline int chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const int MAXN = (1 << 20);

#define abs asdsa

int abs(int x) { return x > 0 ? x : -x; }

int n;
pair<int, int> a[MAXN];
set<int> p;

void read()
{
	cin >> n;
	for(int i = 0; i < n; i++)
	{
		cin >> a[i].first >> a[i].second;
		p.insert((abs(a[i].first) + abs(a[i].second)) % 2);	
		if(a[i].first < -10 || a[i].first > 10 || a[i].second < -10 || a[i].second > 10) exit(0);
	}
}

void solve()
{
	if(p.size() != 1)
	{
		cout << -1 << endl;
		return;
	}

	int sz = 30;
	if(*p.begin() != 0) sz--;

	cout << sz << endl;
	for(int i = 0; i < sz; i++) cout << 1 << " ";
	cout << endl;

	for(int i = 0; i < n; i++)
	{
		string ret;
		while(a[i].first != 0)
		{
			if(a[i].first < 0) a[i].first++, ret += "L";
			if(a[i].first > 0) a[i].first--, ret += "R";
		}
	
		while(a[i].second != 0)
		{
			if(a[i].second < 0) a[i].second++, ret += "D";
			if(a[i].second > 0) a[i].second--, ret += "U";
		}
		
		while((int)ret.size() < sz)
			ret += "RL";

		cout << ret << endl;
	}
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	read();
	solve();
	return 0;
}

提出情報

ジャッジ結果