# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
777936 | TheSahib | Genetics (BOI18_genetics) | C++14 | 2095 ms | 9512 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.
#pragma GCC optimize("O3")
#pragma GCC target("popcnt")
#include <bits/stdc++.h>
#define ll long long
#define oo 1e9
#define pii pair<int, int>
using namespace std;
const int MAX = 4100;
int n, m, k;
bitset<MAX * 4> st[MAX];
int ans[MAX];
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();
if(c == 'G') c = 'B';
if(c == 'T') c = 'D';
st[i][(c - 'A') * MAX + j] = 1;
}
}
vector<int> v;
v.resize(n);
iota(v.begin(), v.end(), 0);
srand(time(0));
random_shuffle(v.begin(), v.end());
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
if(m - (st[v[i]] & st[v[j]]).count() == k){
ans[v[i]]++;
ans[v[j]]++;
}
}
if(ans[v[i]] == n - 1){
cout << v[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... |