Submission #1103561


Source Code Expand

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>

using namespace std;

char a[55][55],b[55][55];
int n,m;

bool judge(int x,int y)
{
    int i,j;
    for(i=0;i<m;i++)
    {
        for(j=0;j<m;j++)
        {
            if(a[x+i][y+j] != b[i][j])
                return false;
        }
    }
    return true;
}
int main(void)
{
    int i,j;
    while(scanf("%d%d",&n,&m)==2)
    {
        for(i=0;i<n;i++)
            scanf("%s",a[i]);
        for(i=0;i<m;i++)
            scanf("%s",b[i]);
        int f = 0;
        for(i=0;i<n-m;i++)
        {
            for(j=0;j<n-m;j++)
            {
                if(judge(i,j))
                {
                    f = 1;
                    break;
                }
            }
            if(f == 1)
                break;
        }
        if(f == 1)
            printf("Yes\n");
        else
            printf("No\n");
    }

    return 0;
}

Submission Info

Submission Time
Task B - Template Matching
User SimpleY
Language C++14 (GCC 5.4.1)
Score 0
Code Size 976 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:30:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
             scanf("%s",a[i]);
                             ^
./Main.cpp:32:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
             scanf("%s",b[i]);
                             ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
AC × 2
AC × 9
WA × 1
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
subtask_1_01.txt WA 1 ms 256 KB
subtask_1_02.txt AC 1 ms 256 KB
subtask_1_03.txt AC 1 ms 256 KB
subtask_1_04.txt AC 1 ms 256 KB
subtask_1_05.txt AC 1 ms 256 KB
subtask_1_06.txt AC 1 ms 256 KB
subtask_1_07.txt AC 1 ms 256 KB
subtask_1_08.txt AC 1 ms 256 KB