# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62881 | IvanC | Genetics (BOI18_genetics) | C++17 | 959 ms | 65528 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;
typedef bitset<4101> bt;
const int MAXN = 4101;
bt matriz[MAXN][4],temporario;
char entrada[MAXN];
int N,M,K,marcado[MAXN],jafoi[MAXN][MAXN],somatorio1[MAXN][4],somatorio2[MAXN][4],noconjunto[MAXN];
knuth_b gen(1337);
int func(int i){
return gen() % i;
}
int main(){
scanf("%d %d %d",&N,&M,&K);
K = M - K;
int LIM = 2;
vector<int> permutacao;
for(int i = 1 ;i<=N;i++) permutacao.push_back(i);
random_shuffle(permutacao.begin(),permutacao.end(),func);
for(int i = 0;i<permutacao.size()/2;i++) noconjunto[permutacao[i]] = 1;
for(int i = 1;i<=N;i++){
scanf("%s",entrada);
for(int j = 0;j<M;j++){
if(entrada[j] == 'A'){
matriz[i][0].set(j);
somatorio1[j][0]++;
if(noconjunto[i]) somatorio2[j][0]++;
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... |