# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1009510 | induwara16 | Mutating DNA (IOI21_dna) | C++17 | 56 ms | 4416 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;
typedef string str;
typedef vector<int> vi;
str a, b;
void init(std::string a1, std::string b2)
{
a = a1;
b = b2;
}
int solve(str a, str b, int c)
{
;
}
int get_distance(int x, int y)
{
str a1 = a.substr(x, y);
str b1 = b.substr(x, y);
int n = a1.length(), c = 0;
int as = count(a1.begin(), a1.end(), 'A');
int cs = count(a1.begin(), a1.end(), 'C');
int ts = n - as - cs;
int as1 = count(b1.begin(), b1.end(), 'A');
int cs1 = count(b1.begin(), b1.end(), 'C');
int ts1 = n - as1 - cs1;
if ((as != as1) || (cs != cs1) || (ts != ts1))
return -1;
// if ((as == n) || (cs == n) || (ts == n))
// return 0;
// if ((as == 0) || (cs == 0) || (ts == 0))
// return 1;
// bool same = false;
// for (int i = 0; i < n; i++)
// {
// if (a1[i] == b1[i])
// {
// same = true;
// break;
// }
// }
// return same ? 1 : 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... |