QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#194592#7516. Robot Experimentucup-team484#AC ✓270ms3868kbC++201.3kb2023-09-30 21:14:472023-09-30 21:14:47

Judging History

你现在查看的是测评时间为 2023-09-30 21:14:47 的历史记录

  • [2023-11-04 11:40:25]
  • 自动重测本题所有获得100分的提交记录
  • 测评结果:AC
  • 用时:264ms
  • 内存:3488kb
  • [2023-09-30 21:14:47]
  • 评测
  • 测评结果:100
  • 用时:270ms
  • 内存:3868kb
  • [2023-09-30 21:14:47]
  • 提交

answer

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define LL long long
#define st first
#define nd second
#define endl '\n'
using namespace std;

int main() {
    
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  char m[n];
  for(int i = 0; i < n; ++i) {
    cin >> m[i];
  }
  set<pii> ans;
  for(int i = 0; i < (1 << n); ++i) {
    map<pii, int> set_points;
    set_points[{0, 0}] = 1;
    int x = 0, y = 0;
    bool possible = 1;
    for(int j = 0; j < n; ++j) {
      int xx = x, yy = y;
      if(m[j] == 'L') {
        xx -= 1;
      }
      else if(m[j] == 'R') {
        xx += 1;
      }
      else if(m[j] == 'D') {
        yy -= 1;
      }
      else {
        yy += 1;
      }
      if(set_points.find({xx, yy}) != set_points.end()) {
        int go = i & (1 << j);
        if(go > 0) {
          go = 1;
        }
        if(go != set_points[{xx, yy}]) {
          possible = false;
          break;
        }
      }
      if(i & (1 << j)) {
        set_points[{xx, yy}] = 1;
        x = xx;
        y = yy;
      }
      else {
        set_points[{xx, yy}] = 0;
      }
    }
    if(possible) {
      ans.insert({x, y});
    }
  }
  cout << ans.size() << endl;
  for(auto [x, y] : ans) {
    cout << x << " " << y << endl;
  }

}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 3624kb

input:

4
LRUD

output:

4
0 -1
0 0
1 -1
1 0

result:

ok 5 lines

Test #3:

score: 0
Accepted
time: 103ms
memory: 3568kb

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: 3564kb

input:

1
D

output:

2
0 -1
0 0

result:

ok 3 lines

Test #5:

score: 0
Accepted
time: 106ms
memory: 3784kb

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: 163ms
memory: 3852kb

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: 95ms
memory: 3868kb

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: 96ms
memory: 3624kb

input:

20
DUUDDUDUUDUDDUUDUDDU

output:

3
0 -1
0 0
0 1

result:

ok 4 lines

Test #9:

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

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: 270ms
memory: 3664kb

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