QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#322030#7699. PearlsishmealWA 1166ms3740kbC++231.9kb2024-02-06 03:46:292024-02-06 03:46:30

Judging History

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

  • [2024-02-06 03:46:30]
  • 评测
  • 测评结果:WA
  • 用时:1166ms
  • 内存:3740kb
  • [2024-02-06 03:46:29]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

int n, m;
int r, c;
bool grid[50][50];
string ans;
string s;

pair<int,int> dirs[4] {{-1,0},{0,1},{1,0},{0,-1}};
string NESW = "NESW";

void solve(int rr, int cc, int i, int d, bool forward, bool corner, bool was_corner) {
        if (min(rr,cc) < 0 or rr >= n or cc >= m) return;
        if (i and s[i] == 'B' and was_corner) return;

        if ((unsigned)i == s.size()) {
                if (r != rr or c != cc) return;
                if (s.front() == 'B' and NESW[d] == ans[0]) return;
                if (s.front() == 'W' and NESW[d] != ans[0]) return;
                if (s.front() == 'W' and NESW[d] == ans[1] and NESW[d] == ans[ans.size()-2]) return;
                cout << ans << '\n';
                exit(0);
        }

        if (grid[rr][cc]) return;
        grid[rr][cc] = true;
        // cout << rr << ' ' << cc << ' ' << i << endl;

        corner |= s[i] == 'B';
        if (i) forward |= s[i] == 'W';
        for (int dd : {1, 0, 2, 3}) {
                if (dd == (d+2)%4) continue;
                if (forward and dd != d) continue;
                if (corner and dd == d) continue;
                auto [dy,dx] = dirs[dd];
                ans += NESW[dd];

                if (s[i] == 'W')
                        solve(rr+dy,cc+dx, i+1, dd, false, !was_corner, dd!=d);
                else if (s[i] == 'B')
                        solve(rr+dy,cc+dx, i+1, dd, true, false, true);
                else
                        solve(rr+dy,cc+dx, i+1, dd, false, false, dd!=d);

                ans.pop_back();
        }

        grid[rr][cc] = false;
}

int main() {
        cin.tie(0)->sync_with_stdio(0);

        int k; cin >> k >> n >> m;
        cin >> s;
        cin >> r >> c; r--, c--;
        solve(r,c,0,-100,false,false,true);
        cout << "impossible\n";
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

16 5 6
B.B.B.BW.WB..WB.
3 1

output:

EENNEESSSSWWWWNN

result:

ok single line: 'EENNEESSSSWWWWNN'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3676kb

input:

6 5 5
W..B.B
3 3

output:

impossible

result:

ok single line: 'impossible'

Test #3:

score: 0
Accepted
time: 0ms
memory: 3612kb

input:

8 5 5
B.B.B.B.
5 5

output:

NNWWSSEE

result:

ok single line: 'NNWWSSEE'

Test #4:

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

input:

8 10 10
B.BWBWB.
2 10

output:

SSWWNNEE

result:

ok single line: 'SSWWNNEE'

Test #5:

score: 0
Accepted
time: 0ms
memory: 3672kb

input:

10 5 10
W.B.BW.B.B
4 4

output:

EENNWWWSSE

result:

ok single line: 'EENNWWWSSE'

Test #6:

score: 0
Accepted
time: 0ms
memory: 3668kb

input:

10 10 10
B.B.B.B.B.
7 3

output:

impossible

result:

ok single line: 'impossible'

Test #7:

score: 0
Accepted
time: 0ms
memory: 3608kb

input:

12 10 10
B.B.B.B.B.B.
10 1

output:

impossible

result:

ok single line: 'impossible'

Test #8:

score: 0
Accepted
time: 0ms
memory: 3608kb

input:

16 15 15
B.B.B.B.B.B.B.B.
4 4

output:

impossible

result:

ok single line: 'impossible'

Test #9:

score: 0
Accepted
time: 0ms
memory: 3736kb

input:

24 20 20
B.B.B.B.B.B.B.B.B.B.B.B.
1 8

output:

EESSEESSWWSSWWNNWWNNEENN

result:

ok single line: 'EESSEESSWWSSWWNNWWNNEENN'

Test #10:

score: 0
Accepted
time: 143ms
memory: 3680kb

input:

60 50 50
B.B.B.B.B.B.BWB.B.B.B..B.B.B.B.BWB.B.B.B.B.B.B.B.B.B.B.B.B..
10 10

output:

impossible

result:

ok single line: 'impossible'

Test #11:

score: 0
Accepted
time: 303ms
memory: 3696kb

input:

60 50 50
WW.B.WBWB.BWB.B.B.B.B.B.B.B.B...B.B.B..B.B.B.B..B.B.B.B..B.B
38 20

output:

impossible

result:

ok single line: 'impossible'

Test #12:

score: 0
Accepted
time: 83ms
memory: 3612kb

input:

60 50 50
BWBWBWB.W..B.B..WWB.WB.BWB.B..B..B.B.B.B..B.B.B..B.B.B.B.B..
5 13

output:

impossible

result:

ok single line: 'impossible'

Test #13:

score: 0
Accepted
time: 32ms
memory: 3696kb

input:

60 50 50
B.W...W.W.B.B.WB.WB.B.B.B..B.B.B.B.B..B.B..B.B.BWWBW.B.WBWB.
31 21

output:

EEENNNNEEENNEEENNNEESSEESSSWWSSWWSSWWWSSWWWSSWWNNNWWWNNNEESS

result:

ok single line: 'EEENNNNEEENNEEENNNEESSEESSSWWSSWWSSWWWSSWWWSSWWNNNWWWNNNEESS'

Test #14:

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

input:

60 50 50
W.B.B..B.B.B....B.B.B.B.B..B.B.B.B..B.BWBWWB.B.WBWB..W.B.BWB
35 20

output:

EENNEEENNEENNNEENNWWNNWWSSSWWNNWWSSSWWSSEEESSWWWSSWWSSSEENNE

result:

ok single line: 'EENNEEENNEENNNEENNWWNNWWSSSWWNNWWSSSWWSSEEESSWWWSSWWSSSEENNE'

Test #15:

score: 0
Accepted
time: 1061ms
memory: 3680kb

input:

60 50 50
W.B.BWB..WBWWBWB.BWB.B.B.B.B..B.B.B.B....B.B.B.B.B.B..BWB.BW
8 36

output:

impossible

result:

ok single line: 'impossible'

Test #16:

score: 0
Accepted
time: 1166ms
memory: 3740kb

input:

60 50 50
BW.WB.BWB.B.B.B.B...B.B.B.B.B...B.B.B.B.B.B.B.B..B..B.B.BWBW
13 29

output:

impossible

result:

ok single line: 'impossible'

Test #17:

score: 0
Accepted
time: 554ms
memory: 3736kb

input:

60 50 50
B.B..B.B.B.B.B..WB.B.B.BW.W.BWB.BW.BWWB.B..B...B.B.B.B.B.B..
16 35

output:

impossible

result:

ok single line: 'impossible'

Test #18:

score: 0
Accepted
time: 878ms
memory: 3736kb

input:

60 50 50
B.B...B..B..B..B..B.BW.WBWBWB..WBWBWB.B.B..B.B.B.B.B..B.B.B.
33 30

output:

impossible

result:

ok single line: 'impossible'

Test #19:

score: -100
Wrong Answer
time: 1ms
memory: 3696kb

input:

60 50 50
B...B.B.B..B.BWBWBWBWBWB.BWBWBW.WWB.B.B...B.B.B.B...B.B.B...
30 32

output:

EEEENNEENNNEENNEENNEENNEENNWWNNWWWSSWWSSSSWWSSWWSSWWSSWWSSES

result:

wrong answer 1st lines differ - expected: 'impossible', found: 'EEEENNEENNNEENNEENNEENNEENNWWNNWWWSSWWSSSSWWSSWWSSWWSSWWSSES'