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>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <pi, int>
#define vi vector <int>
const ll mod = 1000000007;
#define int ll
int n, m, k;
string s[101];
bitset <4101> ss[4100];
int gcd(int a, int b){
if(a==0) return b;
else return gcd(b%a, a);
}
int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
cin>>n>>m>>k;
if(n<=100 && m<=100){
for(int i=1; i<=n; i++) cin>>s[i];
for(int i=1; i<=n; i++){
bool ctrl=1;
for(int j=1; j<=n; j++){
if(j!=i){
int dif=0;
for(int ix=0; ix<m; ix++)
if(s[i][ix]!=s[j][ix]) dif++;
if(dif!=k){
ctrl=0;
continue;
}
}
}
if(ctrl) return cout<<i, 0;
}
}
for(int i=0; i<n; i++){
string xd;
cin>>xd;
for(int j=0; j<m; j++) ss[i]|=((1<<j)*(xd[j]=='A'));
}
for(int i=0; i<n; i++){
bool ctrl=1;
for(int j=0; j<n; j++){
if(i==j) continue;
if((ss[i]^ss[j]).count()!=k){
//cout<<i<<" "<<j<<" "<<(ss[i]^ss[j]).count()<<endl;
ctrl=0;
continue;
}
}
if(ctrl) return cout<<i+1, 0;
}
}
Compilation message (stderr)
genetics.cpp: In function 'int32_t main()':
genetics.cpp:54:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if((ss[i]^ss[j]).count()!=k){
~~~~~~~~~~~~~~~~~~~~~^~~
# | 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... |