QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#192026#7516. Robot ExperimentPhantomThreshold#AC ✓228ms3788kbC++141.3kb2023-09-30 13:20:252023-11-04 11:39:35

Judging History

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

  • [2023-11-04 11:39:35]
  • 自动重测本题所有获得100分的提交记录
  • 测评结果:AC
  • 用时:228ms
  • 内存:3788kb
  • [2023-09-30 13:20:25]
  • 评测
  • 测评结果:100
  • 用时:230ms
  • 内存:3952kb
  • [2023-09-30 13:20:25]
  • 提交

answer

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

const int dx[]={-1,1,0,0};
const int dy[]={0,0,-1,1};

int n;
string str;
int a[100050];

int main(){
	ios_base::sync_with_stdio(false);
	cin >> n;
	cin >> str;
	for (int i=0;i<n;i++){
		if (str[i]=='L') a[i]=0;
		if (str[i]=='R') a[i]=1;
		if (str[i]=='D') a[i]=2;
		if (str[i]=='U') a[i]=3;	
	}
//	for (int i=0;i<n;i++) cout << a[i] << " \n"[i==n-1];
	vector<pair<int,int>> ans;
	for (int mask=0;mask<(1<<n);mask++){
		bool flag=1;
		int nowx=0,nowy=0;
		set<pair<int,int>> s;
		set<pair<int,int>> vis;
		vis.emplace(nowx,nowy);
		for (int i=0;i<n;i++){
			int nxtx=nowx+dx[a[i]];
			int nxty=nowy+dy[a[i]];
			if ((mask>>i)&1){
				if (vis.count(make_pair(nxtx,nxty))){
					flag=0;
					break;
				}
				s.emplace(nxtx,nxty);	
			}
			else{
				if (s.count(make_pair(nxtx,nxty))){
					flag=0;
					break;
				}
				nowx=nxtx;
				nowy=nxty;
				vis.emplace(nowx,nowy);
			}
		}
	//	cerr << mask << "\n";
	//	cerr << nowx << " " << nowy << endl;
		if (flag){
			ans.emplace_back(nowx,nowy);	
		}
	}
	sort(ans.begin(),ans.end());
	ans.resize(unique(ans.begin(),ans.end())-ans.begin());
	cout << (int)ans.size() << "\n";
	for (auto [x,y]:ans){
		cout << x << " " << y << "\n";	
	}
	return 0;
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
RU

output:

4
0 0
0 1
1 0
1 1

result:

ok 5 lines

Test #2:

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

input:

4
LRUD

output:

4
0 -1
0 0
1 -1
1 0

result:

ok 5 lines

Test #3:

score: 0
Accepted
time: 91ms
memory: 3788kb

input:

20
LLLRLRLRLLLRLLRLRLLR

output:

8
-6 0
-5 0
-4 0
-3 0
-2 0
-1 0
0 0
1 0

result:

ok 9 lines

Test #4:

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

input:

1
D

output:

2
0 -1
0 0

result:

ok 3 lines

Test #5:

score: 0
Accepted
time: 93ms
memory: 3620kb

input:

20
UUUUUUUUUUUUUUUUUUUU

output:

21
0 0
0 1
0 2
0 3
0 4
0 5
0 6
0 7
0 8
0 9
0 10
0 11
0 12
0 13
0 14
0 15
0 16
0 17
0 18
0 19
0 20

result:

ok 22 lines

Test #6:

score: 0
Accepted
time: 148ms
memory: 3620kb

input:

20
LRUDDULRUDRLLRDURLUD

output:

22
-2 0
-2 1
-1 -2
-1 -1
-1 0
-1 1
-1 2
0 -2
0 -1
0 0
0 1
0 2
1 -2
1 -1
1 0
1 1
1 2
2 -2
2 -1
2 0
2 1
2 2

result:

ok 23 lines

Test #7:

score: 0
Accepted
time: 90ms
memory: 3756kb

input:

20
UUDUDUUDUDUDUDUDLLRL

output:

12
-2 -1
-2 0
-2 1
-2 2
-1 -1
-1 0
-1 1
-1 2
0 -1
0 0
0 1
0 2

result:

ok 13 lines

Test #8:

score: 0
Accepted
time: 101ms
memory: 3560kb

input:

20
DUUDDUDUUDUDDUUDUDDU

output:

3
0 -1
0 0
0 1

result:

ok 4 lines

Test #9:

score: 0
Accepted
time: 183ms
memory: 3540kb

input:

20
RUDLUULDRURLDURLDURR

output:

29
-3 3
-3 4
-2 2
-2 3
-2 4
-1 1
-1 2
-1 3
-1 4
0 -1
0 0
0 1
0 2
0 3
0 4
1 -1
1 0
1 1
1 2
1 3
2 -1
2 0
2 1
2 2
2 3
3 -1
3 0
3 1
3 2

result:

ok 30 lines

Test #10:

score: 0
Accepted
time: 228ms
memory: 3740kb

input:

20
DLDLDLDLLLDLLDLDLDLR

output:

108
-10 -8
-10 -7
-10 -6
-10 -5
-10 -4
-10 -3
-10 -2
-10 -1
-10 0
-9 -8
-9 -7
-9 -6
-9 -5
-9 -4
-9 -3
-9 -2
-9 -1
-9 0
-8 -8
-8 -7
-8 -6
-8 -5
-8 -4
-8 -3
-8 -2
-8 -1
-8 0
-7 -8
-7 -7
-7 -6
-7 -5
-7 -4
-7 -3
-7 -2
-7 -1
-7 0
-6 -8
-6 -7
-6 -6
-6 -5
-6 -4
-6 -3
-6 -2
-6 -1
-6 0
-5 -8
-5 -7
-5 -6
-5 -...

result:

ok 109 lines

Extra Test:

score: 0
Extra Test Passed