| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1365394 | vahagng | Genetics (BOI18_genetics) | C++20 | 2094 ms | 3952 KiB |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
string s[4101];
int get_diff(string s, string t){
int ans = 0;
for(int i = 0; i < s.size(); i++){
ans += (s[i] != t[i]);
}
return ans;
}
int main(){
cin >> n >> m >> k;
for(int i = 1; i <= n; i++){
cin >> s[i];
}
for(int i = 1; i < n; i += 2){
if(get_diff(s[i], s[i + 1]) == k){
bool fl = 1;
for(int j = 1; j < i; j++){
fl &= (get_diff(s[j], s[i]) == k);
if(!fl) break;
}
if(fl){
for(int j = i + 2; j <= n; j++){
fl &= (get_diff(s[j], s[i]) == k);
if(!fl) break;
}
if(fl){
cout << i << endl;
return 0;
}
}
fl = 1;
for(int j = 1; j < i; j++){
fl &= (get_diff(s[j], s[i + 1]) == k);
if(!fl) break;
}
if(fl){
for(int j = i + 2; j <= n; j++){
fl &= (get_diff(s[j], s[i + 1]) == k);
if(!fl) break;
}
if(fl){
cout << i + 1 << endl;
return 0;
}
}
}
}
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
