# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
853499 | Trisanu_Das | Genetics (BOI18_genetics) | C++17 | 2035 ms | 37912 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>
using namespace std;
int n, m, k;
string a[5000];
bitset<4105> bs[4105];
bool check(int x){
for(int i = 1; i <= n; i++){
if(i == x) continue;
int cnt = 0;
for(int j = 0; j < m; j++) if(a[x][j] != a[i][j]) cnt++;
if(cnt != k) return false;
}
return true;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m >> k;
for(int i = 1; i <= n; i++) cin >> a[i];
if(n <= 100){
for(int i = 1; i <= n; i++){
if(check(i)){
cout << i << '\n';
return 0;
}
}
}
for(int i = 1; i <= n; i++){
for(int j = 0; j < m; j++){
bs[i][j] = (a[i][j] == 'A');
assert(a[i][j] == 'A' || a[i][j] == 'C');
}
}
for(int i = 1;i <= n; i++){
for(int j = 1; j <= n; j++){
if(i == j) continue;
bitset<4105> tmp = (bs[i] ^ bs[j]);
if(tmp.count() != k) goto yourmom;
}
cout << i << '\n';
return 0;
yourmom:;
}
}
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... |