QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#423432 | #7516. Robot Experiment | pandapythoner | AC ✓ | 22ms | 3880kb | C++17 | 2.1kb | 2024-05-28 02:02:31 | 2024-05-28 02:02:31 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
const ll inf = 1e18;
mt19937 rnd(234);
const ll mod = 1e9 + 7;
typedef complex<flt> base;
const flt pi = atan2(1, 0) * 2;
int32_t main() {
if (1) {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int n;
cin >> n;
string s;
cin >> s;
map<char, pair<int, int>> go = {
make_pair('U', make_pair(0, 1)),
make_pair('D', make_pair(0, -1)),
make_pair('L', make_pair(-1, 0)),
make_pair('R', make_pair(1, 0)),
};
vector<int> dx(n), dy(n);
for (int i = 0; i < n; i += 1) {
dx[i] = go[s[i]].first;
dy[i] = go[s[i]].second;
}
set<pair<int, int>> st;
int usdc = 0;
vector<vector<int>> usd(2 * n + 1, vector<int>(2 * n + 1, 0));
vector<vector<int>> tp(2 * n + 1, vector<int>(2 * n + 1, 0));
for (int mask = 0; mask < (1 << n); mask += 1) {
int x = 0;
int y = 0;
++usdc;
usd[n + x][n + y] = usdc;
tp[n + x][n + y] = 0;
bool ok = true;
for (int i = 0; i < n; i += 1) {
int nx = x + dx[i];
int ny = y + dy[i];
if ((mask >> i) & 1) {
if (usd[n + nx][n + ny] == usdc and tp[n + nx][n + ny] != 1) {
ok = false;
break;
}
usd[n + nx][n + ny] = usdc;
tp[n + nx][n + ny] = 1;
} else {
if (usd[n + nx][n + ny] == usdc and tp[n + nx][n + ny] != 0) {
ok = false;
break;
}
usd[n + nx][n + ny] = usdc;
tp[n + nx][n + ny] = 0;
x = nx;
y = ny;
}
}
if (ok) {
st.insert(make_pair(x, y));
}
}
cout << (int)st.size() << "\n";
for (auto [x, y] : st) {
cout << x << " " << y << "\n";
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3572kb
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: 3664kb
input:
4 LRUD
output:
4 0 -1 0 0 1 -1 1 0
result:
ok 5 lines
Test #3:
score: 0
Accepted
time: 11ms
memory: 3676kb
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: 3624kb
input:
1 D
output:
2 0 -1 0 0
result:
ok 3 lines
Test #5:
score: 0
Accepted
time: 13ms
memory: 3572kb
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: 14ms
memory: 3804kb
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: 13ms
memory: 3516kb
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: 13ms
memory: 3880kb
input:
20 DUUDDUDUUDUDDUUDUDDU
output:
3 0 -1 0 0 0 1
result:
ok 4 lines
Test #9:
score: 0
Accepted
time: 20ms
memory: 3832kb
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: 22ms
memory: 3872kb
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