| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 811154 | math_rabbit_1028 | Mutating DNA (IOI21_dna) | C++17 | 25 ms | 4112 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 "dna.h"
int cnt[101010][3], dif[101010];
void init(std::string a, std::string b) {
for (int i = 0; i < a.length(); i++) {
cnt[i + 1][0] = cnt[i][0];
cnt[i + 1][1] = cnt[i][1];
cnt[i + 1][2] = cnt[i][2];
if (a[i] == 'A') cnt[i + 1][0]++;
if (a[i] == 'C') cnt[i + 1][1]++;
if (a[i] == 'T') cnt[i + 1][2]++;
if (b[i] == 'A') cnt[i + 1][0]--;
if (b[i] == 'C') cnt[i + 1][1]--;
if (b[i] == 'T') cnt[i + 1][2]--;
dif[i + 1] = dif[i];
if (a[i] != b[i]) dif[i + 1]++;
}
}
int get_distance(int x, int y) {
if (cnt[x][0] != cnt[y + 1][0]) return -1;
if (cnt[x][1] != cnt[y + 1][1]) return -1;
if (cnt[x][2] != cnt[y + 1][2]) return -1;
return (dif[y + 1] - dif[x])/2;
}
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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
