# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
446985 | georgerapeanu | Genetics (BOI18_genetics) | C++11 | 639 ms | 33608 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;
const int NMAX = 4100;
int n,m,k;
string s[NMAX + 5];
int __map[256];
int main(){
cin >> n >> m >> k;
for(int i = 1;i <= n;i++){
cin >> s[i];
s[i] = " " + s[i];
}
vector<int> is_candidate(n + 1,true);
vector<int> weight(n + 1,0);
int cnt_cand = n;
__map['A'] = 0;
__map['C'] = 1;
__map['G'] = 2;
__map['T'] = 3;
srand(time(NULL));
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... |