# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
596779 | serize | Mutating DNA (IOI21_dna) | C++17 | 1582 ms | 3972 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>
#include <cstdio>
#include <cassert>
#include <string>
#include <vector>
#define all(x) x.begin(),x.end()
using namespace std;
const int MAX = 1e5+2;
vector<int> dif(MAX);
string s1, s2;
void init(std::string a, std::string b) {
int n = a.size();
s1 = a, s2 = b;
for(int i = 1; i <= n; i++){
dif[i] = (a[i-1]!=b[i-1]);
dif[i] += dif[i-1];
}
}
int get_distance(int x, int y) {
string cad1 = s1.substr(x,y), cad2 = s2.substr(x,y);
sort(all(cad1));
sort(all(cad2));
if(cad1 != cad2) return -1;
int d = dif[y+1]-dif[x];
if(d&1) return ((d>>1)+1);
# | 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... |