QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#331971#7733. Cool, It’s Yesterday Four Times Moresuspicious-impostor#WA 1ms3592kbC++201.2kb2024-02-19 02:38:062024-02-19 02:38:06

Judging History

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

  • [2024-02-19 02:38:06]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3592kb
  • [2024-02-19 02:38:06]
  • 提交

answer

#include <bits/stdc++.h>
 
using namespace std;

#ifndef DEBUG
    #define DEBUG 0
#endif

#define ii pair<int, int>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define vll vector<long long>
#define vull vector<unsigned long long>
#define ll long long
#define ull unsigned long long
#define F(counter, start, end) for (ll counter = start; counter <= end; counter++)
#define FD(i, r, l) for(ll i = r - 1; i > (l); --i)
#define deprintf(x) if (DEBUG) {printf(x);}
#define L 20
#define W(cond) while (cond)
#define p(a, b) make_pair(a, b)
#define MAXN 1000010
#define STSZ MAXN
#define MOD 998244353
ll T, N, M, K, Q, R;

int main() {
    int a, b;
    cin >> N >> a >> b;
    if (a <= (N + 1) / 2) {
        for (int i = 1; i < N; i++) cout << "U";
        for (int i = 1; i < a; i++) cout << "D";
    } else {
        for (int i = 1; i < N; i++) cout << "D";
        for (int i = N; i > a; i--) cout << "U";
    }
    if (b <= (N + 1) / 2) {
        for (int i = 1; i < N; i++) cout << "L";
        for (int i = 1; i < b; i++) cout << "R";
    } else {
        for (int i = 1; i < N; i++) cout << "R";
        for (int i = N; i > b; i--) cout << "L";
    }
    cout << endl;
}

详细

Test #1:

score: 0
Wrong Answer
time: 1ms
memory: 3592kb

input:

4
2 5
.OO..
O..O.
1 3
O.O
1 3
.O.
2 3
OOO
OOO

output:

UUUDRRR

result:

wrong answer 1st lines differ - expected: '3', found: 'UUUDRRR'