#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;
string s[maxn];
bitset<maxn> bi[maxn][4];
ll n,m,k;
ll dif(ll i,ll j){
ll ans=0;
for(ll y=0;y<4;y++){
ans+=(bi[i][y]^bi[j][y]).count();
}
return ans;
}
bool is_good(ll i,ll j){
if(dif(i,j)==k)return 1;
return 0;
}
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;
k*=2;
for(ll i=0;i<n;i++){
cin>>s[i];
for(ll j=0;j<m;j++){
s[i][j]-='A';
bi[i][s[i][j]][j]=1;
}
}
for(ll i=0;i<n;i++){
if(isAns(i)){
cout<<i+1<<endl;
return 0;
}
}
}
Compilation message
genetics.cpp: In function 'int main()':
genetics.cpp:104:17: warning: array subscript has type 'char' [-Wchar-subscripts]
bi[i][s[i][j]][j]=1;
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
632 KB |
Output is correct |
| 2 |
Incorrect |
5 ms |
760 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2073 ms |
6648 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2073 ms |
6648 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
632 KB |
Output is correct |
| 2 |
Incorrect |
5 ms |
760 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
