# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1001944 | hacizadal | Mutating DNA (IOI21_dna) | C++17 | 1566 ms | 3932 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;
#define endl '\n'
#define ll long long
#define pll pair<ll, ll>
string s, t;
void init(std::string a, std::string b) {
s = a;
t = b;
}
int get_distance(int x, int y) {
string k = s.substr(x, y-x+1);
string g = t.substr(x, y-x+1);
string a = k;
string b = g;
sort(a.begin(), a.end());
sort(b.begin(), b.end());
if (a != b){
return -1;
}
if (k == g){
return 0;
}
ll c = 0, d = 0;
for (ll i = 0; i<k.length(); i++){
if (k[i] != g[i]){
if (k[i] == 'A') c++;
else d++;
}
}
if (d > c) swap(d, c);
return c;
}
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... |