# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
777790 | TheSahib | Genetics (BOI18_genetics) | C++14 | 2054 ms | 4132 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define oo 1e9
#define pii pair<int, int>
using namespace std;
const int MAX = 5005;
int n, m, k;
string arr[MAX];
int comp(string& a, string& b){
int cnt = 0;
for (int i = 0; i < m; i++)
{
cnt += (a[i] != b[i]);
}
return cnt;
}
void solve(){
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < n; i++)
{
getchar();
for (int j = 0; j < m; j++)
{
char c = getchar();
arr[i] += c;
}
}
vector<int> v;
v.resize(n);
iota(v.begin(), v.end(), 0);
srand(time(0));
random_shuffle(v.begin(), v.end());
vector<int> p;
for(int i:v){
if(i == v[0]) continue;
if(comp(arr[i], arr[v[0]]) == k){
p.push_back(i);
}
}
if(p.size() == n - 1){
cout << v[0] + 1 << '\n';
return;
}
for(int i:p){
bool pos = true;
for(int j:v){
if(i == j) continue;
if(comp(arr[i], arr[j]) != k){
pos = false;
break;
}
}
if(pos){
cout << i + 1 << '\n';
return;
}
}
}
int main()
{
solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |