#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
int gcd(int a, int b) {return b == 0 ? a : gcd(b, a % b);}
#define ll int
#define pb push_back
#define ld long double
#define mp make_pair
#define F first
#define S second
#define pii pair<ll,ll>
using namespace :: std;
const ll maxn=4110;
const ll inf=1e9+800;
const ll mod=1e9+7;
ll mxx=1;
string s[maxn];
bitset<maxn> bi[maxn][4];
ll n,m,k;
bitset<maxn> vis[maxn];
bitset<maxn> ASS[maxn];
ll dif(ll i,ll j){
ll ans=0;
for(ll y=0;y<mxx;y++){
ans+=(bi[i][y]^bi[j][y]).count();
}
return ans;
}
bool is_good(ll i,ll j){
if(vis[i][j])return ASS[i][j];
bool b=(dif(i,j)==k);
vis[i][j]=1;
vis[j][i]=1;
ASS[i][j]=b;
ASS[j][i]=b;
return b;
}
bool isAns(ll a){
for(ll i=0;i<n;i++){
if(i!=a){
if(!is_good(i,a)){
return 0;
}
}
}
return 1;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>m>>k;
if(n<=100 && m<=100){
k*=2;
mxx=4;
}
for(ll i=0;i<n;i++){
cin>>s[i];
}
for(ll i=0;i<n;i++){
for(ll j=0;j<m;j++){
if(s[i][j]=='A')s[i][j]=0;
if(s[i][j]=='C')s[i][j]=1;
if(s[i][j]=='T')s[i][j]=2;
if(s[i][j]=='G')s[i][j]=3;
bi[i][s[i][j]][j]=1;
}
}
set<ll> st;
for(ll i=0;i<n;i++){
bool b=0;
for(auto e:st){
if(!is_good(e,i)){
st.erase(e);
b=1;
break;
}
}
if(!b){
st.insert(i);
}
if(st.size()>7){
exit(1);
}
}
for(auto e:st){
if(isAns(e)){
cout<<e+1;
return 0;
}
}
}
Compilation message
genetics.cpp: In function 'int main()':
genetics.cpp:121:17: warning: array subscript has type 'char' [-Wchar-subscripts]
bi[i][s[i][j]][j]=1;
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
5 ms |
632 KB |
Execution failed because the return code was nonzero |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
41 ms |
6264 KB |
Execution failed because the return code was nonzero |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
41 ms |
6264 KB |
Execution failed because the return code was nonzero |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
5 ms |
632 KB |
Execution failed because the return code was nonzero |
| 2 |
Halted |
0 ms |
0 KB |
- |
