# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
566333 | hoanghq2004 | Genetics (BOI18_genetics) | C++14 | 475 ms | 19796 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>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 5010;
const int mod = 1e9 + 7;
const int base = 9450;
int n, m, k;
string s[N];
int code[256];
int power[N];
int H[N][4];
int main() {
ios :: sync_with_stdio(0); cin.tie(0);
code['A'] = 0, code['C'] = 1, code['G'] = 2, code['T'] = 3;
cin >> n >> m >> k;
for (int i = 0; i < n; ++i) cin >> s[i];
power[0] = 1;
for (int i = 1; i < n; ++i) power[i] = 1LL * power[i - 1] * base % mod;
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... |