QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#850302	#9667. L-Covering Checker	1903331632	AC ✓	19ms	4652kb	C++23	2.4kb	2025-01-09 23:39:14	2025-01-09 23:39:15

Judging History

This is the latest submission verdict.

[2025-01-09 23:39:15]
Judged

Verdict: AC
Time: 19ms
Memory: 4652kb

Show

[2025-01-09 23:39:14]
Submitted

answer

#include <bits/stdc++.h>
using namespace std;
const int N = 1002;
int n, m;
void solve()
{

    cin >> n >> m;
    vector<vector<char>> mp(n + 11, vector<char>(m + 11, ' '));
    vector<vector<int>> op(n + 11, vector<int>(m + 11, 0));
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            cin >> mp[i][j];
        }
    }
    // for (int i = 1; i <= n; i++)
    // {
    //     for (int j = 1; j <= n; j++)
    //     {
    //         cout << mp[i][j] << ' ';
    //     }
    //     cout << endl;
    // }
    bool ok = true;
    if (mp[1][m] != '.')
    {
        cout << "No" << endl;
        return;
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            if (i == 1 && j == m)
                continue;
            if (mp[i][j] == '.')
            {
                cout << "No" << endl;
                return;
            }
            if (mp[i][j] == 'C' && mp[i + 1][j] == 'U' && mp[i - 1][j] == 'D')
            {
                cout << "No" << endl;
                return;
            }
            if (mp[i][j] == 'C' && mp[i][j - 1] == 'R' && mp[i][j + 1] == 'L')
            {
                cout << "No" << endl;
                return;
            }
            if (mp[i][j] == 'L')
            {
                op[i][j - 1]++;
            }
            if (mp[i][j] == 'R')
            {
                op[i][j + 1]++;
            }
            if (mp[i][j] == 'D')
            {
                op[i + 1][j]++;
            }
            if (mp[i][j] == 'U')
            {
                op[i - 1][j]++;
            }
        }
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            if (mp[i][j] == 'C')
            {
                if (op[i][j] != 2)
                {
                    cout << "No" << endl;
                    return;
                }
            }
            else
            {
                if (op[i][j] != 0)
                {
                    cout << "No" << endl;
                    return;
                }
            }
        }
    }

    cout << "Yes" << endl;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}

Source code, Language: C++23

这程序好像有点Bug，我给组数据试试？

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3628kb

input:

2
4 4
CLD.
UDCL
DCLD
CLRC
2 3
DRC
CLU

output:

Yes
No

result:

ok 2 lines

Test #2:

score: 0

Accepted

time: 3ms

memory: 3936kb

input:

100
47 81
UCRRRCR.CLURRCU.LLURDDRUDCC.DCUD.R.CURL.RURLC.LULLRDCDDDCC.CCUCLRLDLULULLUD.RL.R.
LC.UDUDCL.RRCLRRURDRDL.CRD.LDURRCRU.D..LCUD.UDRCCURDLDCD.DDUC..ULLLDDCLDCL..C.R.C
LLLLLULD.RLU.L.RURDLRCULCD.RCC..URD.LD.UCURDR.DUULUUD..LULR.RDURDDLRRRD.LCLLCD.D.
LUCR.RCR.RRCL..DRURU.CLLDRCUULULRULCU.RD.UDR...

output:

No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No

result:

ok 100 lines

Test #3:

score: 0

Accepted

time: 1ms

memory: 3568kb

input:

100
10 10
D.D....D..
CLCLCLRCRC
CL..U.CL.U
UCL.RCU.D.
.UDRCUCLCL
..CLU.U.RC
.CL.CL.DDU
.UCLUDRCCL
D.U.RCDCLD
CL...RCURC
11 5
.CLCL
.U.U.
..RC.
DRCU.
CLU.D
.CLRC
DUDRC
CLCLU
D....
CLD.D
.RCRC
2 8
D.RCCLD.
CL.UURC.
7 10
.CL...CLCL
.U.D.DU.U.
.RCCLCL.RC
..UD.RCRCU
D.RCD.U.U.
CL.RCD.RC.
.....CL.U.
7 10
...

output:

No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No

result:

ok 100 lines

Test #4:

score: 0

Accepted

time: 1ms

memory: 3884kb

input:

100
5 32
.DCL.DCLRC.RCDRC...CLD.CLCL.....
RCUDRCUCLU..UCLU.RCURC.U.UCL..CL
CL.CL..U.RC...D.RCU.D.D...U.CLU.
U.D.D.CL.DUD.RCCLUDRCDCL.DD.UD.D
.RC.CLU..CLCL..U..CL.CL.RCCLRCRC
8 41
.RCDRCRCRCD..CL.RCD.CL..CLCL.RCRC.RCCL.RC
RCUCLUDUDUCL.URC.UCLUDRCU.U...UDUD.UUCL.U
DUCL..CLCLD...DUCL..RC.UCL.RCD.CLCLD....

output:

No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No

result:

ok 100 lines

Test #5:

score: 0

Accepted

time: 0ms

memory: 3768kb

input:

100
92 77
.RC.RCCL.D.CLCLD......D.RC.RCRCCLD.CL.RCCLCL..D.D.RCCL.DCL.D.CLRCD.D.D.CLRCD.
..U..UUCLCLU.UDCL.CL.RCRCUD.U.UU.CLU.RCUUDURCRC.CLDUUDRCU..CLUCLUCLCLCLURCUCL
D.D.D.DUCLCL..CLD.U.CLCLURCCLD....CLCLU.DCL.UCL.DRCDRCDRC..CLDUCL.D..CL.DUD..
CLCLCLCLUDUDRC..CLCLU.U.D..URCCLDDU.U..RC.RC.U.RCRCCLRCD...

output:

No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No

result:

ok 100 lines

Test #6:

score: 0

Accepted

time: 19ms

memory: 3924kb

input:

1059
2 2
RC
.U
5 2
D.
CL
CL
UD
RC
2 8
DRCDRCD.
CLUCLUCL
4 4
CLRC
URCU
RCUD
.URC
11 2
D.
CL
RC
DU
CL
RC
DU
CL
RC
DU
CL
5 5
CLRC.
URCUD
CLURC
UDDRC
RCCLU
14 2
RC
DU
CL
RC
DU
CL
RC
DU
CL
RC
DU
CL
RC
.U
4 7
CLDCLD.
URCUDCL
DRCDCLD
CLUCLRC
17 2
D.
CL
RC
DU
CL
RC
DU
CL
RC
DU
CL
RC
DU
CL
RC
DU
CL
20 2
D.
C...

output:

No
Yes
Yes
No
Yes
Yes
No
Yes
Yes
Yes
Yes
No
No
No
No
No
No
No
Yes
Yes
Yes
Yes
Yes
No
No
No
No
Yes
No
No
No
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
No
No
Yes
No
No
Yes
Yes
Yes
Yes
No
Yes
No
Yes
Yes
Yes
No
No
Yes
No
No
No
Yes
No
No
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
No
No
No
No
Yes
Yes
No
No
No
Yes
Yes
...

result:

ok 1059 lines

Test #7:

score: 0

Accepted

time: 11ms

memory: 3684kb

input:

81
100 100
CLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLD.
URCURCURCURCURCURCURCURCURCURCURCURCURCURCURCURCURCURCURCURCURCURCURCURCURCURCURCURCURCURCURCURCUDCL
CLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLD...

output:

Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
Yes
Yes
No
Yes
Yes
No
Yes
No
No
No
No
Yes
No
No
Yes
No
Yes
Yes
No
No
Yes
No
No
Yes
No
Yes
Yes
Yes
Yes
No
No
Yes
No
Yes
Yes
No
No
No
Yes
No
No
No
Yes
No
No
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
No
No
Yes
No
Yes
No
No
No
No
No
Yes
Yes
Yes
No
No
No
Yes
Yes

result:

ok 81 lines

Test #8:

score: 0

Accepted

time: 11ms

memory: 3696kb

input:

15
250 250
CLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLD.
URCURCURCURCURCURCURCURCURCURCURCURCUR...

output:

Yes
No
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
No
No
Yes
Yes
Yes

result:

ok 15 lines

Test #9:

score: 0

Accepted

time: 5ms

memory: 3768kb

input:

10
301 301
CLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCCLCLRCC...

output:

No
Yes
Yes
No
No
Yes
No
No
Yes
Yes

result:

ok 10 lines

Test #10:

score: 0

Accepted

time: 12ms

memory: 4652kb

input:

4
497 497
CLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCL...

output:

No
Yes
No
Yes

result:

ok 4 lines

Extra Test:

score: 0

Extra Test Passed