#include <bits/stdc++.h>
using namespace std;
#define int long long
int compare(string a, string b){
int tot = 0;
for(int i = 0; i < (int)a.size(); i++){
if(a[i] != b[i]) tot++;
}
return tot;
}
map< string, int > mape;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, k;
cin >> n >> m >> k;
vector< string > v;
for(int i = 0; i < n; i++){
string a;
cin >> a;
mape[a] = i;
v.push_back(a);
}
while(v.size() > 1){
vector< string > tempo;
int tot = 0;
for(int i = 0; i < n-1; i++){
if(compare(v[i], v.back()) == k){
tempo.push_back(v[i]);
tot++;
}
}
if(tot == (int)v.size()-1){
cout << mape[v.back()]+1 << endl;
return 0;
}
v = tempo;
}
cout << mape[v.back()]+1 << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
33 ms |
8312 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
33 ms |
8312 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |