Submission #2928457


Source Code Expand

#include<cstdio>
#include<cstdlib>
using namespace std;
int n,m,c1,c2,cnt,ans;
struct sd{
    int x,y;
}n1[250005],n2[250005];
char a[505][505]; 
void x1(int v)
{
    if(v%2)
    {
        c2=0;
        if(!c1) {printf("No\n");exit(0);}
        for(int i=1;i<=c1;++i) a[n1[i].x][n1[i].y]='#';
        for(int i=1;i<=c1;++i)
        {
            if(n1[i].y!=0&&a[n1[i].x][n1[i].y-1]=='.') {n2[++c2].x=n1[i].x;n2[c2].y=n1[i].y-1;a[n2[c2].x][n2[c2].y]='#';}
            if(n1[i].y!=m-1&&a[n1[i].x][n1[i].y+1]=='.') {n2[++c2].x=n1[i].x;n2[c2].y=n1[i].y+1;a[n2[c2].x][n2[c2].y]='#';}
            if(n1[i].x!=0&&a[n1[i].x-1][n1[i].y]=='.') {n2[++c2].x=n1[i].x-1;n2[c2].y=n1[i].y;a[n2[c2].x][n2[c2].y]='#';}
            if(n1[i].x!=n-1&&a[n1[i].x+1][n1[i].y]=='.') {n2[++c2].x=n1[i].x+1;n2[c2].y=n1[i].y;a[n2[c2].x][n2[c2].y]='#';}
            if(n1[i].y!=0&&a[n1[i].x][n1[i].y-1]=='g') {n2[++c2].x=n1[i].x;n2[c2].y=n1[i].y-1;a[n2[c2].x][n2[c2].y]='#';printf("Yes\n");exit(0);}
            if(n1[i].y!=m-1&&a[n1[i].x][n1[i].y+1]=='g') {n2[++c2].x=n1[i].x;n2[c2].y=n1[i].y+1;a[n2[c2].x][n2[c2].y]='#';printf("Yes\n");exit(0);}
            if(n1[i].x!=0&&a[n1[i].x-1][n1[i].y]=='g') {n2[++c2].x=n1[i].x-1;n2[c2].y=n1[i].y;a[n2[c2].x][n2[c2].y]='#';printf("Yes\n");exit(0);}
            if(n1[i].x!=n-1&&a[n1[i].x+1][n1[i].y]=='g') {n2[++c2].x=n1[i].x+1;n2[c2].y=n1[i].y;a[n2[c2].x][n2[c2].y]='#';printf("Yes\n");exit(0);}
        }
    }
    else {
        c1=0; 
        if(!c2) {printf("No\n");exit(0);}
        for(int i=1;i<=c2;++i) a[n2[i].x][n2[i].y]='#';
        for(int i=1;i<=c2;++i)
        {
            if(n2[i].y!=0&&a[n2[i].x][n2[i].y-1]=='.') {n1[++c1].x=n2[i].x;n1[c1].y=n2[i].y-1;a[n1[c1].x][n1[c1].y]='#';}
            if(n2[i].y!=m-1&&a[n2[i].x][n2[i].y+1]=='.') {n1[++c1].x=n2[i].x;n1[c1].y=n2[i].y+1;a[n1[c1].x][n1[c1].y]='#';}
            if(n2[i].x!=0&&a[n2[i].x-1][n2[i].y]=='.') {n1[++c1].x=n2[i].x-1;n1[c1].y=n2[i].y;a[n1[c1].x][n1[c1].y]='#';}
            if(n2[i].x!=n-1&&a[n2[i].x+1][n2[i].y]=='.') {n1[++c1].x=n2[i].x+1;n1[c1].y=n2[i].y;a[n1[c1].x][n1[c1].y]='#';}
            if(n2[i].y!=0&&a[n2[i].x][n2[i].y-1]=='g') {n1[++c1].x=n2[i].x;n1[c1].y=n2[i].y-1;a[n1[c1].x][n1[c1].y]='#';printf("Yes\n");exit(0);}
            if(n2[i].y!=m-1&&a[n2[i].x][n2[i].y+1]=='g') {n1[++c1].x=n2[i].x;n1[c1].y=n2[i].y+1;a[n1[c1].x][n1[c1].y]='#';printf("Yes\n");exit(0);}
            if(n2[i].x!=0&&a[n2[i].x-1][n2[i].y]=='g') {n1[++c1].x=n2[i].x-1;n1[c1].y=n2[i].y;a[n1[c1].x][n1[c1].y]='#';printf("Yes\n");exit(0);}
            if(n2[i].x!=n-1&&a[n2[i].x+1][n2[i].y]=='g') {n1[++c1].x=n2[i].x+1;n1[c1].y=n2[i].y;a[n1[c1].x][n1[c1].y]='#';printf("Yes\n");exit(0);}
        }
    }
    if(cnt==2) return;
    x1(v+1);
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;++i) scanf("%s",a[i]);
    for(int i=0;i<n;++i)
        for(int j=0;j<m;++j)
            if(a[i][j]=='s') {n1[1].x=i;n1[1].y=j;c1=1;}
    x1(1);
    return 0;
}

Submission Info

Submission Time
Task A - 深さ優先探索
User hy1004
Language C++ (GCC 5.4.1)
Score 100
Code Size 3002 Byte
Status AC
Exec Time 5 ms
Memory 2432 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:49:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
                        ^
./Main.cpp:50:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for(int i=0;i<n;++i) scanf("%s",a[i]);
                                          ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 5
AC × 83
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt
All 00_min_01.txt, 00_min_02.txt, 00_min_03.txt, 00_min_04.txt, 00_min_05.txt, 00_min_06.txt, 00_min_07.txt, 00_min_08.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 02_rndhard_00.txt, 02_rndhard_01.txt, 02_rndhard_02.txt, 02_rndhard_03.txt, 02_rndhard_04.txt, 02_rndhard_05.txt, 02_rndhard_06.txt, 02_rndhard_07.txt, 02_rndhard_08.txt, 02_rndhard_09.txt, 02_rndhard_10.txt, 02_rndhard_11.txt, 02_rndhard_12.txt, 02_rndhard_13.txt, 02_rndhard_14.txt, 02_rndhard_15.txt, 02_rndhard_16.txt, 02_rndhard_17.txt, 02_rndhard_18.txt, 02_rndhard_19.txt, 02_rndhard_20.txt, 02_rndhard_21.txt, 02_rndhard_22.txt, 02_rndhard_23.txt, 02_rndhard_24.txt, 02_rndhard_25.txt, 02_rndhard_26.txt, 02_rndhard_27.txt, 02_rndhard_28.txt, 02_rndhard_29.txt, 02_rndhard_30.txt, 02_rndhard_31.txt, 02_rndhard_32.txt, 02_rndhard_33.txt, 02_rndhard_34.txt, 02_rndhard_35.txt, 02_rndhard_36.txt, 02_rndhard_37.txt, 02_rndhard_38.txt, 02_rndhard_39.txt, 03_rndhardsmall_00.txt, 03_rndhardsmall_01.txt, 03_rndhardsmall_02.txt, 03_rndhardsmall_03.txt, 03_rndhardsmall_04.txt, 03_rndhardsmall_05.txt, 03_rndhardsmall_06.txt, 03_rndhardsmall_07.txt, 03_rndhardsmall_08.txt, 03_rndhardsmall_09.txt
Case Name Status Exec Time Memory
00_min_01.txt AC 1 ms 2176 KB
00_min_02.txt AC 1 ms 2176 KB
00_min_03.txt AC 1 ms 2176 KB
00_min_04.txt AC 1 ms 2176 KB
00_min_05.txt AC 1 ms 2176 KB
00_min_06.txt AC 1 ms 2176 KB
00_min_07.txt AC 1 ms 2176 KB
00_min_08.txt AC 3 ms 2176 KB
00_sample_01.txt AC 1 ms 2176 KB
00_sample_02.txt AC 1 ms 2176 KB
00_sample_03.txt AC 1 ms 2176 KB
00_sample_04.txt AC 1 ms 2176 KB
00_sample_05.txt AC 1 ms 2176 KB
01_rnd_00.txt AC 2 ms 2432 KB
01_rnd_01.txt AC 2 ms 2432 KB
01_rnd_02.txt AC 3 ms 2432 KB
01_rnd_03.txt AC 4 ms 2432 KB
01_rnd_04.txt AC 3 ms 2432 KB
01_rnd_05.txt AC 2 ms 2432 KB
01_rnd_06.txt AC 4 ms 2432 KB
01_rnd_07.txt AC 4 ms 2432 KB
01_rnd_08.txt AC 2 ms 2432 KB
01_rnd_09.txt AC 2 ms 2432 KB
01_rnd_10.txt AC 4 ms 2432 KB
01_rnd_11.txt AC 2 ms 2432 KB
01_rnd_12.txt AC 5 ms 2432 KB
01_rnd_13.txt AC 2 ms 2432 KB
01_rnd_14.txt AC 2 ms 2432 KB
01_rnd_15.txt AC 4 ms 2432 KB
01_rnd_16.txt AC 2 ms 2432 KB
01_rnd_17.txt AC 5 ms 2432 KB
01_rnd_18.txt AC 2 ms 2432 KB
01_rnd_19.txt AC 3 ms 2432 KB
02_rndhard_00.txt AC 2 ms 2432 KB
02_rndhard_01.txt AC 2 ms 2432 KB
02_rndhard_02.txt AC 2 ms 2432 KB
02_rndhard_03.txt AC 2 ms 2432 KB
02_rndhard_04.txt AC 2 ms 2432 KB
02_rndhard_05.txt AC 2 ms 2432 KB
02_rndhard_06.txt AC 2 ms 2432 KB
02_rndhard_07.txt AC 2 ms 2432 KB
02_rndhard_08.txt AC 2 ms 2432 KB
02_rndhard_09.txt AC 2 ms 2432 KB
02_rndhard_10.txt AC 2 ms 2432 KB
02_rndhard_11.txt AC 2 ms 2432 KB
02_rndhard_12.txt AC 2 ms 2432 KB
02_rndhard_13.txt AC 2 ms 2432 KB
02_rndhard_14.txt AC 2 ms 2432 KB
02_rndhard_15.txt AC 2 ms 2432 KB
02_rndhard_16.txt AC 2 ms 2432 KB
02_rndhard_17.txt AC 2 ms 2432 KB
02_rndhard_18.txt AC 2 ms 2432 KB
02_rndhard_19.txt AC 2 ms 2432 KB
02_rndhard_20.txt AC 2 ms 2432 KB
02_rndhard_21.txt AC 2 ms 2432 KB
02_rndhard_22.txt AC 2 ms 2432 KB
02_rndhard_23.txt AC 2 ms 2432 KB
02_rndhard_24.txt AC 2 ms 2432 KB
02_rndhard_25.txt AC 2 ms 2432 KB
02_rndhard_26.txt AC 2 ms 2432 KB
02_rndhard_27.txt AC 2 ms 2432 KB
02_rndhard_28.txt AC 2 ms 2432 KB
02_rndhard_29.txt AC 2 ms 2432 KB
02_rndhard_30.txt AC 2 ms 2432 KB
02_rndhard_31.txt AC 2 ms 2432 KB
02_rndhard_32.txt AC 2 ms 2432 KB
02_rndhard_33.txt AC 2 ms 2432 KB
02_rndhard_34.txt AC 2 ms 2432 KB
02_rndhard_35.txt AC 2 ms 2432 KB
02_rndhard_36.txt AC 2 ms 2432 KB
02_rndhard_37.txt AC 2 ms 2432 KB
02_rndhard_38.txt AC 2 ms 2432 KB
02_rndhard_39.txt AC 2 ms 2432 KB
03_rndhardsmall_00.txt AC 1 ms 2176 KB
03_rndhardsmall_01.txt AC 1 ms 2176 KB
03_rndhardsmall_02.txt AC 1 ms 2176 KB
03_rndhardsmall_03.txt AC 1 ms 2176 KB
03_rndhardsmall_04.txt AC 1 ms 2176 KB
03_rndhardsmall_05.txt AC 1 ms 2176 KB
03_rndhardsmall_06.txt AC 1 ms 2176 KB
03_rndhardsmall_07.txt AC 1 ms 2176 KB
03_rndhardsmall_08.txt AC 1 ms 2176 KB
03_rndhardsmall_09.txt AC 1 ms 2176 KB