| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1343745 | ElyesChaabouni | DNA 돌연변이 (IOI21_dna) | C++20 | 1592 ms | 2352 KiB |
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
string a,b;
void init(string f, string s) {
a=f;b=s;
}
int get_distance(int x, int y) {
int c=0;
map<char,int> mp;
for(int i=x;i<=y;i++){
mp[a[i]]++;
}
for(int i=x;i<=y;i++){
mp[b[i]]--;
}
for(int i=x;i<=y;i++){
if(mp[a[i]]!=0)return -1;
}
for(int i=x;i<=y;i++){
if(a[i]!=b[i])++c;
}
return c/2;
}| # | 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... | ||||
