QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#716439#6431. Oops, It's Yesterday Twice MoreChihiro#WA 0ms3508kbC++17611b2024-11-06 15:16:572024-11-06 15:16:57

Judging History

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

  • [2024-11-06 15:16:57]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3508kb
  • [2024-11-06 15:16:57]
  • 提交

answer

#include <bits/stdc++.h>
#define fixed(s) fixed<<setprecision(12)<<s

using namespace std;
typedef long long ll;
typedef array<int, 3> Arr;
typedef pair<int, int> PII;

const int N = 2e5 + 7;

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

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
    //cin >> T;
    while(T--){
        solve();
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3508kb

input:

3 3 3

output:

RRDD

result:

ok n=3, x=3, y=3

Test #2:

score: 0
Accepted
time: 0ms
memory: 3508kb

input:

4 3 2

output:

RRRDDDULL

result:

ok n=4, x=3, y=2

Test #3:

score: -100
Wrong Answer
time: 0ms
memory: 3508kb

input:

2 1 1

output:

RDUL

result:

wrong answer Too long.