| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1215603 | baranj | Mutating DNA (IOI21_dna) | C++20 | 16 ms | 2368 KiB |
#include<bits/stdc++.h>
#include "dna.h"
using namespace std;
int n;
string a, b;
void init(string x, string y) {
n=x.length();
a=x; b=y;
}
int get_distance(int x, int y) {
int cnta=0, cntb=0;
for(int i=x; i<=y; i++){
if(a[i]=='A' && b[i]=='B'){cnta++;}
if(a[i]=='B' && b[i]=='A'){cntb++;}
}
if(cnta!=cntb){return -1;}
return cnta;
}
| # | 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... | ||||
