QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#684646 | #6431. Oops, It's Yesterday Twice More | catch-up-from-behind# | WA | 0ms | 3816kb | C++17 | 1.3kb | 2024-10-28 15:01:03 | 2024-10-28 15:01:03 |
Judging History
answer
// sis puella oier
#include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
ll read(){
ll xx = 0, f = 1; char ch = getchar();
for (;!isdigit(ch); ch = getchar())f = (ch == '-' ? -1 : 1);
for (; isdigit(ch); ch = getchar())xx = (xx << 3) + (xx << 1) + ch - '0';
return xx * f;
}
signed main(){
int n = read(), a = read(), b = read();
if (a + b <= n - 1){
for (int i = 1; i < n; ++i)printf("L");
for (int i = 1; i < n; ++i)printf("U");
for (int i = 1; i < a; ++i)printf("R");
for (int i = 1; i < b; ++i)printf("D");
}
else if (n - a + n - b <= n - 1){
for (int i = 1; i < n; ++i)printf("R");
for (int i = 1; i < n; ++i)printf("D");
for (int i = a; i < n; ++i)printf("L");
for (int i = b; i < n; ++i)printf("U");
}
else if (n - a + b <= n - 1){
for (int i = 1; i < n; ++i)printf("R");
for (int i = 1; i < n; ++i)printf("U");
for (int i = a; i < n; ++i)printf("L");
for (int i = 1; i < b; ++i)printf("D");
}
else if (a + n - b <= n - 1){
for (int i = 1; i < n; ++i)printf("L");
for (int i = 1; i < n; ++i)printf("D");
for (int i = 1; i < a; ++i)printf("R");
for (int i = b; i < n; ++i)printf("U");
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3724kb
input:
3 3 3
output:
RRDD
result:
ok n=3, x=3, y=3
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3816kb
input:
4 3 2
output:
RRRDDDLUU
result:
wrong answer Failed