제출 #104521

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
104521		Hassoony	Ispit (COCI19_ispit)	C++17	90 / 90	226 ms	896 KiB

Main

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const ll mod=(1e9+7);
const ll inf=(1ll<<61);
const int MX=502;
int n,p,c[MX];
char a[MX][MX];
int main(){
    cin>>n>>p;
    for(int i=0;i<n;i++)scanf("%s",&a[i]);
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            for(int k='a';k<='z';k++)c[k]=0;
            int mn=MX,mx=-1;
            for(int k=0;k<n;k++){
                if(a[i][k]!=a[j][k]){
                    mn=min(mn,k);
                    mx=max(mx,k);
                    c[a[i][k]]++;
                }
            }
            if(mx-mn+1>p)continue;
            bool ok=1;
            for(int k=0;k<n;k++){
                if(a[i][k]!=a[j][k]){
                    if(c[a[j][k]])c[a[j][k]]--;
                    else ok=0;
                }
            }
            if(ok){
                puts("DA");
                return 0;
            }
        }
    }
    puts("NE");
}
/*
4 2
abcd
acbd
enaa
moze
2 2
aa
aa
3 2
nec
uuc
iti
*/

컴파일 시 표준 에러 (stderr) 메시지

ispit.cpp: In function 'int main()':
ispit.cpp:12:41: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[502]' [-Wformat=]
     for(int i=0;i<n;i++)scanf("%s",&a[i]);
                                    ~~~~~^
ispit.cpp:21:30: warning: array subscript has type 'char' [-Wchar-subscripts]
                     c[a[i][k]]++;
                              ^
ispit.cpp:28:33: warning: array subscript has type 'char' [-Wchar-subscripts]
                     if(c[a[j][k]])c[a[j][k]]--;
                                 ^
ispit.cpp:28:44: warning: array subscript has type 'char' [-Wchar-subscripts]
                     if(c[a[j][k]])c[a[j][k]]--;
                                            ^
ispit.cpp:12:30: 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]);
                         ~~~~~^~~~~~~~~~~~

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 9 / 9
• Subtask 9: 9 / 9
• Subtask 10: 9 / 9