| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1178777 | rayan_bd | Mutating DNA (IOI21_dna) | C++20 | 1595 ms | 2376 KiB |
#include <bits/stdc++.h>
#include "dna.h"
using namespace std;
#define fi first
#define se second
int n;
string A,B;
void init(string a,string b){
A=a,B=b;
n=a.size();
}
int get_distance(int l,int r){
map<char,int> a,b;
bool same=1;
int cnt=0;
for(int i=l;i<=r;++i){
++a[A[i]];
++b[B[i]];
same=same&&(A[i]==B[i]);
if(A[i]!=B[i]) ++cnt;
}
for(auto it:a){
if(it.se!=b[it.fi]) return -1;
}
if(same) return 0;
return cnt/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... | ||||
