QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#957667#9667. L-Covering Checkerpb#AC ✓36ms8836kbC++141.2kb2025-03-30 15:13:032025-03-30 15:13:03

Judging History

This is the latest submission verdict.

  • [2025-03-30 15:13:03]
  • Judged
  • Verdict: AC
  • Time: 36ms
  • Memory: 8836kb
  • [2025-03-30 15:13:03]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
char p[510][510];
int cnt[505][505][5],n,m;
void solve(){
	cin>>n>>m;
		int tot=0,cnt_P=0;
		for(int i=1;i<=n;i++)
			for(int j=1;j<=m;j++)
			cnt[i][j][1]=cnt[i][j][2]=cnt[i][j][3]=cnt[i][j][4]=0;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				cin>>p[i][j];
				if(p[i][j]=='.')cnt_P++;
				else if(p[i][j]=='C')continue;
				else
				{
				tot++;
				if(p[i][j]=='U'){++cnt[i-1][j][1];}
				if(p[i][j]=='R'){++cnt[i][j+1][2];}
				if(p[i][j]=='D'){++cnt[i+1][j][3];}
				if(p[i][j]=='L'){++cnt[i][j-1][4];}
				}
			}
		}
		if((cnt_P==1&&p[1][m]!='.')||cnt_P!=1){cout<<"No\n";return;}
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				if(p[i][j]=='C'){
					tot=tot-cnt[i][j][1]-cnt[i][j][2]-cnt[i][j][3]-cnt[i][j][4];
					if(cnt[i][j][1]+cnt[i][j][2]+cnt[i][j][3]+cnt[i][j][4]!=2)
					{cout<<"No\n";return;}	
					else
					if(!((cnt[i][j][1]&&cnt[i][j][2])||(cnt[i][j][1]&&cnt[i][j][4])||(cnt[i][j][3]&&cnt[i][j][2])||(cnt[i][j][3]&&cnt[i][j][4])))	
					{cout<<"No\n";return;}	
				}
			}
		}
		cout<<(tot==0?"Yes\n":"No\n");
		return ;
}
int main(){
	int T=1;cin>>T;
	while(T--){
		solve();
	}
	return 0;
/*
2
2 3
DD.
UCL
4 4
RCL.
DDDD
CCCC
UUUU
*/
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 12ms
memory: 5944kb

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: 5888kb

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: 3712kb

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: 10ms
memory: 4224kb

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: 36ms
memory: 8300kb

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: 35ms
memory: 4608kb

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: 30ms
memory: 6892kb

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: 33ms
memory: 6864kb

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: 34ms
memory: 8836kb

input:

4
497 497
CLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCLDCL...

output:

No
Yes
No
Yes

result:

ok 4 lines

Extra Test:

score: 0
Extra Test Passed