QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #472850 | #7516. Robot Experiment | asitshouldbe | WA | 460ms | 3828kb | C++14 | 2.1kb | 2024-07-11 19:52:31 | 2024-07-11 19:52:32 |
Judging History
answer
#include <bits/stdc++.h>
//#pragma GCC optimize(2)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#define x first
#define y second
#define endl '\n'
#define pi acos(-1.0)
using namespace std;
typedef pair<int, int> PII;
typedef pair<double, int> PDI;
typedef pair<PII, int> PIII;
typedef pair<PII, char> PIIC;
typedef long long LL;
int dx[] = {1, 0, 0, -1, -1, -1, 1, 1}, dy[] = {0, -1, 1, 0, -1, 1, -1, 1};
int mou[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int N = 1e4 + 10, M = 110, mod = 998244353, INF = 0x3f3f3f3f;
const double eps = 1e-8;
int n,m,t;
string str;
set<PII>s;
void dfs(int u,int x,int y,map<PII,bool>st)
{
if(u==n)
{
s.insert({x,y});
return;
}
char t=str[u];
st[{x,y}]=1;
if(t=='L')
{
dfs(u+1,x-1,y,st);
st[{x,y}]=0;
if(!st[{x-1,y}])
{
st[{x,y}]=1;
dfs(u+1,x,y,st);
st[{x,y}]=0;
}
}
else if(t=='R')
{
dfs(u+1,x+1,y,st);
st[{x,y}]=0;
if(!st[{x+1,y}])
{
st[{x,y}]=1;
dfs(u+1,x,y,st);
st[{x,y}]=0;
}
}
else if(t=='U')
{
dfs(u+1,x,y+1,st);
st[{x,y}]=0;
if(!st[{x,y+1}])
{
st[{x,y}]=1;
dfs(u+1,x,y,st);
st[{x,y}]=0;
}
}
else
{
dfs(u+1,x,y-1,st);
st[{x,y}]=0;
if(!st[{x,y-1}])
{
st[{x,y}]=1;
dfs(u+1,x,y,st);
st[{x,y}]=0;
}
}
}
void solve()
{
cin>>n>>str;
map<PII,bool>mt;
dfs(0,0,0,mt);
cout<<s.size()<<endl;
for(auto it:s) cout<<it.x<<" "<<it.y<<endl;
}
int main()
{
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0),cout.precision(10);
// freopen("in.in","r",stdin);
// freopen("test.out","w",stdout);
t=1; // cin >> t;
while (t--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3616kb
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: 1ms
memory: 3648kb
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: 3548kb
input:
1 D
output:
2 0 -1 0 0
result:
ok 3 lines
Test #5:
score: 0
Accepted
time: 460ms
memory: 3636kb
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: 3ms
memory: 3560kb
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: 0ms
memory: 3616kb
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: 0ms
memory: 3604kb
input:
20 DUUDDUDUUDUDDUUDUDDU
output:
3 0 -1 0 0 0 1
result:
ok 4 lines
Test #9:
score: -100
Wrong Answer
time: 2ms
memory: 3828kb
input:
20 RUDLUULDRURLDURLDURR
output:
31 -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 4 0 4 1
result:
wrong answer 1st lines differ - expected: '29', found: '31'