# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
202901 | renebaebae | Genetics (BOI18_genetics) | C++14 | 222 ms | 66424 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 <iostream>
#include <cstdlib>
#include <cassert>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.sync_with_stdio(false);
int N, M, K;
cin >> N >> M >> K;
vector<vector<int> > strings(N, vector<int>(M));
vector<bool> iscandidate(N, true);
int ncand = N;
string str;
for (int i = 0; i < N; ++i) {
cin >> str;
for (int j = 0; j < M; ++j)
strings[i][j] = (str[j] >> 1) & 3;
}
while (ncand > 1) {
vector<unsigned> weight(N);
unsigned totweight = 0;
for (int i = 0; i < N; ++i) {
weight[i] = rand();
totweight += weight[i];
}
vector<unsigned> count[4];
count[0].assign(M, 0);
count[1].assign(M, 0);
# | 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... |