QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#192033#7516. Robot Experimentucup-team045#AC ✓36ms3816kbC++201.7kb2023-09-30 13:21:312023-09-30 13:21:32

Judging History

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

  • [2023-11-04 11:39:35]
  • 自动重测本题所有获得100分的提交记录
  • 测评结果:AC
  • 用时:36ms
  • 内存:3832kb
  • [2023-09-30 13:21:32]
  • 评测
  • 测评结果:100
  • 用时:36ms
  • 内存:3816kb
  • [2023-09-30 13:21:31]
  • 提交

answer

#include<iostream>
#include<cstring>
#include<vector>
#include<array>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n; string s;
    cin >> n >> s;
    bool v[50][50] = {0};
    int g[50][50] = {0};
    vector<pair<int, int> > p;
    for(int i = 0; i < 1 << n; i++){
        int x = 25, y = 25;
        bool ok = true;
        for(int j = 0; j < n; j++){
            int xx = x, yy = y;
            if (s[j] == 'L') xx--;
            else if (s[j] == 'R') xx++;
            else if (s[j] == 'D') yy--;
            else yy++;
            if (i >> j & 1){
                if (g[xx][yy] == 1 || (xx == 25 && yy == 25)){
                    ok = false;
                    break;
                }
                g[xx][yy] = 2;
                p.push_back({xx, yy});
            }
            else{
                if (g[xx][yy] == 2){
                    ok = false;
                    break;
                }
                x = xx, y = yy;
                g[xx][yy] = 1;
                p.push_back({xx, yy});
            }
        }
        if (ok){
            v[x][y] = true;
        }
        for(auto [xx, yy] : p) g[xx][yy] = 0;
        p.clear();
    }
    vector<pair<int, int> > ans;
    for(int i = 0; i < 50; i++){
        for(int j = 0; j < 50; j++){
            if (v[i][j]){
                ans.push_back({i - 25, j - 25});
            }
        }
    }
    sort(ans.begin(), ans.end());
    cout << ans.size() << '\n';
    for(auto [x, y] : ans) cout << x << ' ' << y << '\n';

}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

input:

4
LRUD

output:

4
0 -1
0 0
1 -1
1 0

result:

ok 5 lines

Test #3:

score: 0
Accepted
time: 16ms
memory: 3488kb

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

input:

1
D

output:

2
0 -1
0 0

result:

ok 3 lines

Test #5:

score: 0
Accepted
time: 17ms
memory: 3528kb

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: 20ms
memory: 3536kb

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: 16ms
memory: 3600kb

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: 16ms
memory: 3788kb

input:

20
DUUDDUDUUDUDDUUDUDDU

output:

3
0 -1
0 0
0 1

result:

ok 4 lines

Test #9:

score: 0
Accepted
time: 25ms
memory: 3816kb

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: 36ms
memory: 3788kb

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