QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#603003#6422. Evil Coordinatelonelywolf#WA 16ms3848kbC++201.4kb2024-10-01 14:04:382024-10-01 14:04:40

Judging History

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

  • [2024-10-01 14:04:40]
  • 评测
  • 测评结果:WA
  • 用时:16ms
  • 内存:3848kb
  • [2024-10-01 14:04:38]
  • 提交

answer

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

#define int long long  

string d1 = "ULDR", d2 = "DRUL";
void solve()
{
	int sx, sy;
	cin >> sx >> sy;
	string s;
	cin >> s;

	if(sx == 0 && sy == 0) {
		cout << "Impossible\n";
		return ;
	}

	map<char, int> cnt;
	for(auto &c : s) {
		++cnt[c];
	}

	int x, y;
	bool ok;

	auto mv = [&](char dir, int dis) {
		if(dir == 'U') {
			if(sx == x) {
				if(y <= sy && sy <= y + dis)
					return false;
			}
			y += dis;
		} else if(dir == 'L') {
			if(sy == y) {
				if(x >= sx && sx >= x - dis)
					return false;
			}
			x -= dis;
 		} else if(dir == 'D') {
			if(sx == x) {
				if(y >= sy && sy >= y - dis)
					return false;
			}
			y -= dis;
		} else if(dir == 'R') {
			if(sy == y) {
				if(x <= sx && sx <= x + dis)
					return false;
			}
			x += dis;			
		}
		return true;
	}; 

	x = 0, y = 0;
	ok = 1;
	for(auto &c : d1) {
		ok &= mv(c, cnt[c]);
	}
	if(ok) {
		for(auto &c : d1) {
			for(int i = 0; i < cnt[c]; ++i)
				cout << c;
		}
		cout << '\n';
		return ;
	}

	x = 0, y = 0;
	ok = 1;
	for(auto &c : d2) {
		ok &= mv(c, cnt[c]);
	}
	if(ok) {
		for(auto &c : d2) {
			for(int i = 0; i < cnt[c]; ++i)
				cout << c;
		}
		cout << '\n';
		return ;
	}

	
	cout << "Impossible\n";
}


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

    int T;
    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: 3620kb

input:

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

output:

UULLDRR
UUU
Impossible
Impossible
Impossible

result:

ok 5 cases

Test #2:

score: -100
Wrong Answer
time: 16ms
memory: 3848kb

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:

UUDDRR
UUR
Impossible
Impossible
Impossible
UUUUUUDRR
LDDRRRR
UD
Impossible
LLLLDDRR
ULLDDDRR
Impossible
UULLDDDDR
LL
Impossible
UUULDRR
Impossible
Impossible
Impossible
LLLLLDDRRR
Impossible
LR
Impossible
Impossible
Impossible
Impossible
Impossible
RRRRRUULLL
ULLLD
Impossible
UUULDDD
UUDDRR
Impossi...

result:

wrong answer case 57, participant does not find an answer but the jury does