# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1013329 | vjudge1 | DNA 돌연변이 (IOI21_dna) | C++17 | 15 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;
string sa, sb;
void init(std::string a, std::string b) {
sa = a, sb = b;
}
int get_distance(int x, int y) {
if(x-y == 0) {
if(sa[x] == sb[x]) return 0;
else return -1;
}
if(x-y == 1){
for(int i = x; i <= y; ++i){
bool t = false;
for(int j = x; j <= y; ++j){
if(sa[i] == sb[j]) t = true;
}
if(!t) return -1;
}
if(sa[x] = sb[x]) return 0;
else return 1;
}
if(x-y == 2){
int s = 0;
for(int i = x; i <= y; ++i){
bool t = false;
for(int j = x; j <= y; ++j){
if(sa[i] == sb[j]) {
t = true;
if(i == j) s++;
}
}
if(!t) return -1;
}
if(s == 3) return 0;
else if (s == 1) return 1;
else return 2;
}
return 0;
}
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... |