| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1330045 | nicolo_010 | DNA 돌연변이 (IOI21_dna) | C++20 | 1595 ms | 2368 KiB |
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
string a, b;
void init(std::string A, std::string B) {
a = A, b = B;
}
int get_distance(int x, int y) {
map<char, int> mp1, mp2;
int cnt=0;
for (int i=x; i<=y; i++) {
mp1[a[i]]++, mp2[b[i]]++;
if (a[i] != b[i]) {
cnt++;
}
}
if (mp1==mp2) {
return (cnt+1)/2;
}
return -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... | ||||
