QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#191273#7516. Robot Experimentucup-team1134#AC ✓258ms3824kbC++171.6kb2023-09-29 21:13:572023-11-04 11:39:10

Judging History

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

  • [2023-11-04 11:39:10]
  • 自动重测本题所有获得100分的提交记录
  • 测评结果:AC
  • 用时:258ms
  • 内存:3824kb
  • [2023-09-29 21:13:59]
  • 评测
  • 测评结果:100
  • 用时:248ms
  • 内存:3520kb
  • [2023-09-29 21:13:57]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=1<<30;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int N;cin>>N;
    string S;cin>>S;
    string U="LRDU";
    vector<int> dx={-1,1,0,0},dy={0,0,-1,1};
    set<pair<int,int>> ans;
    
    for(int bit=0;bit<(1<<N);bit++){
        set<pair<int,int>> NG,NOTNG;
        NOTNG.insert(mp(0,0));
        int x=0,y=0;
        bool ok=true;
        for(int i=0;i<N;i++){
            for(int k=0;k<4;k++){
                if(S[i]==U[k]){
                    int tox=x+dx[k],toy=y+dy[k];
                    if(bit&(1<<i)){
                        if(NOTNG.count(mp(tox,toy))) ok=false;
                        NG.insert(mp(tox,toy));
                    }else{
                        if(NG.count(mp(tox,toy))) ok=false;
                        NOTNG.insert(mp(tox,toy));
                        x=tox;
                        y=toy;
                    }
                    
                    break;
                }
            }
            if(!ok) break;
        }
        if(ok) ans.insert(mp(x,y));
    }
    
    cout<<si(ans)<<"\n";
    for(auto [a,b]:ans) cout<<a<<" "<<b<<"\n";
}

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

詳細信息

Test #1:

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

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

input:

4
LRUD

output:

4
0 -1
0 0
1 -1
1 0

result:

ok 5 lines

Test #3:

score: 0
Accepted
time: 108ms
memory: 3532kb

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

input:

1
D

output:

2
0 -1
0 0

result:

ok 3 lines

Test #5:

score: 0
Accepted
time: 123ms
memory: 3596kb

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: 173ms
memory: 3608kb

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: 113ms
memory: 3588kb

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: 124ms
memory: 3824kb

input:

20
DUUDDUDUUDUDDUUDUDDU

output:

3
0 -1
0 0
0 1

result:

ok 4 lines

Test #9:

score: 0
Accepted
time: 213ms
memory: 3616kb

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

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