| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1337488 | nathlol2 | DNA 돌연변이 (IOI21_dna) | C++20 | 25 ms | 3308 KiB |
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int pfa[N], pft[N];
void init(string a, string b){
for(int i = 1;i<=a.size();i++){
pfa[i] = pfa[i - 1]; pft[i] = pft[i - 1];
if(a[i - 1] == 'A' && b[i - 1] == 'T'){
pft[i]++;
}else if(a[i - 1] == 'T' && b[i - 1] == 'A'){
pfa[i]++;
}
}
}
int get_distance(int x, int y){
++x; ++y;
if(pft[y] - pft[x - 1] != pfa[y] - pfa[x - 1]) return -1;
return pft[y] - pft[x - 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... | ||||
