QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#464613#6431. Oops, It's Yesterday Twice MoreTexcavator#WA 0ms3512kbC++20864b2024-07-06 12:56:522024-07-06 12:56:53

Judging History

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

  • [2024-07-06 12:56:53]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3512kb
  • [2024-07-06 12:56:52]
  • 提交

answer

#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<vector>
#include<map>
#include<algorithm>
#include<queue>
#include <iomanip>

#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
using namespace std;
typedef long long LL;
typedef __int128 i128;
typedef unsigned long long ULL;
typedef double db;

void Asuka()
{
	int n , a , b;
	cin >> n >> a >> b;
	for(int i = 1 ; i < n ; i ++)
		cout << 'L';
	for(int i = 1 ; i < n ; i ++)
		cout << 'U';
	for(int i = 1 ; i < a ; i ++)
		cout << 'D';
	for(int i = 1 ; i < b ; i ++)
		cout << 'R';
	return;
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int t = 1;
	// cin >> t;
	while(t --){
		Asuka();
	}
	return 0;
}

详细

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3512kb

input:

3 3 3

output:

LLUUDDRR

result:

wrong answer Too long.