# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
966774 | SuPythony | Mutating DNA (IOI21_dna) | C++17 | 20 ms | 9676 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"
#include <bits/stdc++.h>
using namespace std;
vector<int> pf(1e5+1,0);
vector<vector<int>> pf2(3, vector<int>(1e5+1,0));
vector<vector<int>> pf3(3, vector<int>(1e5+1,0));
void init(string a, string b) {
for (int i=1; i<=a.size(); i++) {
if (a[i-1]!=b[i-1]) {
pf[i]=pf[i-1]+1;
} else {
pf[i]=pf[i-1];
}
}
for (int i=1; i<=a.size(); i++) {
if (a[i-1]=='A') pf2[0][i]=pf2[0][i-1]+1;
else pf2[0][i]=pf2[0][i-1];
if (a[i-1]=='C') pf2[1][i]=pf2[1][i-1]+1;
else pf2[1][i]=pf2[1][i-1];
if (a[i-1]=='A') pf2[2][i]=pf2[2][i-1]+1;
else pf2[2][i]=pf2[2][i-1];
}
for (int i=1; i<=a.size(); i++) {
if (b[i-1]=='A') pf3[0][i]=pf3[0][i-1]+1;
else pf3[0][i]=pf3[0][i-1];
if (b[i-1]=='C') pf3[1][i]=pf3[1][i-1]+1;
else pf3[1][i]=pf3[1][i-1];
if (b[i-1]=='A') pf3[2][i]=pf3[2][i-1]+1;
else pf3[2][i]=pf3[2][i-1];
}
}
int get_distance(int x, int y) {
x++; y++;
if ((pf2[y][0]-pf2[x-1][0])!=(pf3[y][0]-pf3[x-1][0])||(pf2[y][1]-pf2[x-1][1])!=(pf3[y][1]-pf3[x-1][1])||(pf2[y][2]-pf2[x-1][2])!=(pf3[y][2]-pf3[x-1][2])) return -1;
int c=pf[y]-pf[x-1];
return c/2+c%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... |