Submission #100862

#TimeUsernameProblemLanguageResultExecution timeMemory
100862OrtIspit (COCI19_ispit)C++11
0 / 90
22 ms1152 KiB
#include<iostream> #include<string> #include<algorithm> #define MAX 505 using namespace std; int n, k; bool ok = 0; string mat[MAX]; string smat[MAX]; string s; int main() { cin.sync_with_stdio(0); cin.tie(0); cin.exceptions(cin.failbit); cin >> n >> k; for(int i=0;i<n;i++) { cin >> s; mat[i] = s; sort(s.begin(),s.end()); smat[i] = s; } int cnt = 0; for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { if(i==j) continue; if(smat[i]==mat[j] || smat[j]==mat[i]) { cout << "DA"; return 0; } if(smat[i]==smat[j]) { for(int z=0;z<n;z++) { if(mat[i][z]==mat[j][z]) continue; else cnt++; if(cnt<=k) { cout << "DA"; return 0; } } cnt = 0; } } } cout << "NE"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...