# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
153136 | Swan | Genetics (BOI18_genetics) | C++14 | 2078 ms | 15096 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 stop system("pause")
#define INP freopen("input.txt","r",stdin)
#define OUTP freopen("solve1.txt","w",stdout)
#define int long long
using namespace std;
typedef long long ll;
const int maxn = 4111;
int cnt[maxn][5];
int n,m,k;
bool cmp(string& a,string& b){
int res = 0;
for(int i(0); i < a.size();i++){
if(a[i]!=b[i])res++;
}
return res == k;
}
int get_num(char c){
if(c == 'A')return 0;
if(c == 'C')return 1;
if(c == 'T')return 2;
return 3;
}
main()
{
ios_base::sync_with_stdio(0);
cin >> n >> m >> k;
int need = (n-1)*k;
vector<string> v;
vector<char> c;
c.push_back('A');
c.push_back('C');
c.push_back('T');
c.push_back('G');
for(int i(0); i < n;i++){
string s; cin >> s;
v.push_back(s);
for(int j(0); j < s.size();j++){
cnt[j][get_num(s[j])]++;
}
}
for(int i(0); i < n;i++){
int all = 0;
for(int j(0); j < v[i].size();j++){
int now = get_num(v[i][j]);
for(int e(0); e < 4;e++){
if(e == now)continue;
all+=cnt[j][e];
}
}
//cout << i+1 << ' ' << all << ' ' << need << endl;
if(all!=need)continue;
bool f = 1;
for(int j(0); j < n;j++){
if(i == j)continue;
if(!cmp(v[i],v[j])){
f = 0;
break;
}
}
if(f){
cout << i+1;
return 0;
}
}
return 0;
}
/*
*/
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... |