QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#612787#6422. Evil Coordinatelaing2122WA 38ms3900kbC++173.3kb2024-10-05 12:55:582024-10-05 12:55:59

Judging History

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

  • [2024-10-05 12:55:59]
  • 评测
  • 测评结果:WA
  • 用时:38ms
  • 内存:3900kb
  • [2024-10-05 12:55:58]
  • 提交

answer

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

const int N = 1e5 + 10;
#define int long long
int n, m;
int mx = 0;
int ans = 0;
int l, r, u, d;

void solve()
{
    int mx, my;
    cin >> mx >> my;
    l = r = u = d = 0;
    string s;
    cin >> s;
    for (int i = 0; i < s.size(); i++)
    {
        if (s[i] == 'L')l++;
        else if (s[i] == 'R')r++;
        else if (s[i] == 'U')u++;
        else d++;
    }

    if (mx == 0 && my == 0)
    {
        cout << "Impossible" << endl;
        return;
    }
    if (mx == 0)
    {
        if (l == 0 && r == 0&&((my<0&&u-d<=my)||(my>0&&u-d>=my))) {
            cout << "Impossible" << endl;
            return;
        }
    }
    if (my == 0)
    {
        if (u == 0 && d == 0&&((mx<0&&r-l<=mx)||(mx>0&&r-l>=mx)))
        {
            cout << "Impossible" << endl;
            return;
        }
    }

    if (((mx<0&&mx==r-l)&&(my<0&&my==u-d))|| ((mx > 0 && mx == r - l) && (my < 0 && my == u - d))|| ((mx < 0 && mx == r - l) && (my > 0 && my == u - d))|| ((mx > 0 && mx == r - l) && (my > 0 && my == u - d))) {
        cout << "Impossible" << endl;
        return;
    }
    
    if (mx==0)
    {
        if (l != 0) {
            cout << "L";
            l--;
        }
        else if (r != 0)
        {
            cout << "R";
            r--;
        }
        if (my < 0)
        {
            while (u)
            {
                cout << "U";
                u--;
            }
            while (d)
            {
                cout << "D";
                d--;
            }
        }
        else {
            while (d)
            {
                cout << "D";
                d--;
            }
            while (u)
            {
                cout << "U";
                u--;
            }
            
        }
        while (l) {
            cout << "L";
            l--;
        }
        while (r)
        {
            cout << "R";
            r--;
        }
        cout << endl;
        return;
    }

    if (my == 0)
    {
        if (u != 0)
        {
            cout << "U";
            u--;
        }
        else if (d != 0)
        {
            cout << "D";
            d--;
        }
        if (mx < 0)
        {while (r)
            {
                cout << "R";
                r--;
            }
            while (l) {
                cout << "L";
                l--;
            }
            
        }
        else {
            while (l) {
                cout << "L";
                l--;
            }
            while (r)
            {
                cout << "R";
                r--;
            }
        }
        while (u)
        {
            cout << "U";
            u--;
        }
        while (d)
        {
            cout << "D";
            d--;
        }
        cout << endl;
        return;
    }

    while (l) {
        cout << "L";
        l--;
    }
    while (r)
    {
        cout << "R";
        r--;
    }
    while (u)
    {
        cout << "U";
        u--;
    }
    while (d)
    {
        cout << "D";
        d--;
    }
    cout << endl;
}

signed main()
{
    int T;
    cin >> T;
    while (T--)
    {
        solve();
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

5
1 1
RURULLD
0 5
UUU
0 3
UUU
0 2
UUU
0 0
UUU

output:

LLRRUUD
UUU
Impossible
Impossible
Impossible

result:

ok 5 cases

Test #2:

score: -100
Wrong Answer
time: 38ms
memory: 3900kb

input:

11109
6 0
RUDUDR
2 0
URU
0 0
UDRU
0 0
R
-1 1
LDUUDDRUUL
-1 5
RRUUUDUUU
-8 4
RRDRLDR
2 0
UD
0 0
UUDD
3 -2
LDDLLLRR
3 -2
LDRURLDD
1 0
RRL
-1 0
DUDDLLRDU
-4 0
LL
-1 -1
DLRLDLUDUR
1 4
URDULUR
0 0
DDUUDUDDDD
0 2
UU
1 0
RRULD
0 -2
LDLRLLDRRL
0 1
RLRLLRLUR
-3 0
RL
0 0
D
0 0
L
0 0
DDLRRUDRUD
0 0
DULU
2 0
RR...

output:

URRUDD
URU
Impossible
Impossible
Impossible
RRUUUUUUD
LRRRRDD
UD
Impossible
LLLLRRDD
LLRRUDDD
Impossible
URLLUDDDD
LL
Impossible
LRRUUUD
Impossible
Impossible
ULRRD
LDDLLLLRRR
LULLLRRRR
RL
Impossible
Impossible
Impossible
Impossible
Impossible
LUULLRRRRR
LLLUD
Impossible
ULUUDDD
RRUUDD
Impossible
UR...

result:

wrong answer case 13, participant's output goes through forbidden coordinate