QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#191272 | #7516. Robot Experiment | ucup-team1134# | TL | 672ms | 3840kb | C++17 | 1.5kb | 2023-09-29 21:13:01 | 2023-09-29 21:13:01 |
Judging History
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;
}
}
}
}
if(ok) ans.insert(mp(x,y));
}
cout<<si(ans)<<"\n";
for(auto [a,b]:ans) cout<<a<<" "<<b<<"\n";
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3548kb
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: 3548kb
input:
4 LRUD
output:
4 0 -1 0 0 1 -1 1 0
result:
ok 5 lines
Test #3:
score: 0
Accepted
time: 568ms
memory: 3840kb
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: 3612kb
input:
1 D
output:
2 0 -1 0 0
result:
ok 3 lines
Test #5:
score: 0
Accepted
time: 672ms
memory: 3808kb
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: -100
Time Limit Exceeded
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