# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167955 | razivo | Genetics (BOI18_genetics) | C++20 | 43 ms | 8172 KiB |
#include <iostream>
#include <set>
#include <vector>
#include <bitset>
#include <string>
#include <algorithm>
using namespace std;
vector<string> a;int N,M,K;
vector<bitset<4100>> l;
vector<bitset<4100>> c(4100);
vector<bitset<4100>> t(4100);
bool comp(int i, int j) {
if(i>j) swap(i,j);
if(c[i][j]) return t[i][j];
bool u = (l[i]^l[j]).count() != K;
c[i][j]=true;
t[i][j] = u;
return u;
}
int main()
{
cin>>N>>M>>K;
l.resize(N);
for (int i = 0; i < N; ++i) {
string s; cin>>s;
a.push_back(s);
for (int j = 0; j < M; ++j) {
l[i][j]= (s[j]=='A');
}
}
# | 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... |