| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1324080 | aritro_ | DNA 돌연변이 (IOI21_dna) | C++20 | 19 ms | 2592 KiB |
#include<bits/stdc++.h>
using namespace std;
#define all(a) a.begin(),a.end()
string s1,s2;
int get_distance(int x,int y){
//subtask 1
x--,y--;
int cnt=0;
for(int i=x;i<=y;i++) cnt+=(s1[i]!=s2[i]);
string t1,t2;
for(int i=x;i<=y;i++){
t1+=s1[i];
t2+=s2[i];
}
sort(all(t1));
sort(all(t2));
if(t1!=t2) return -1;
return (cnt+1)/2;
}
void init(string a,string b){
s1=a;
s2=b;
return ;
}| # | 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... | ||||
