oj.uz

답안 #739205

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
739205 2023-05-10T07:55:55 Z bobthebuilder DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 39 ms 8608 KB 
#include "dna.h"
#include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define lowb(x) (x&(-x))
#define ALL(_x) _x.begin(),_x.end()
#define pii pair<int,int>
#define f first
#define s second
#define SORT_UNIQUE(x) sort(ALL(x)),x.erase(unique(ALL(x)),x.end())
#define ll long long
#define MNTO(x,y) x=min(x,y)
#define MXTO(x,y) x=max(x,y)
const int maxn=2e5+5;
const int INF=0x3f3f3f3f;
#define REP(i,n) for(int i=0;i<n;i++)
int to(char c){
	if(c=='A') return 0;
	if(c=='T') return 1;
	return 2;
}
int pf[9][maxn];
int cn[3][maxn];
void init(std::string a, std::string b) {
	int n=sz(a);
	REP(i,n){
		REP(j,3){
			cn[j][i+1]=cn[j][i];
		}
		REP(j,9){
			pf[j][i+1]=pf[j][i];
		}
		cn[to(a[i])][i+1]++;
		cn[to(b[i])][i+1]--;
		if(a[i]!=b[i]) pf[to(a[i])*3+to(b[i])][i+1]++;
	}
}

int get_distance(int x, int y) {
	++x,++y;
	REP(j,3){
		if(cn[j][x-1]!=cn[j][y]){
			return -1;
		}
	}
	int cnt[9];
	REP(j,9){
		cnt[j]=pf[j][y]-pf[j][x-1];
	}
	int ans=0;
	REP(i,9){
		int a=i/3,b=i%3;
		int p=b*3+a;
		if(p<i) continue;
		int z=min(cnt[i],cnt[p]);
		ans+=z;
		cnt[i]-=z,cnt[p]-=z;
	}
	int tot=0;
	REP(i,9) tot+=cnt[i];
	return ans+tot/3*2;
	return ans+tot/3*2;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 6784 KB Output is correct
2 Correct 34 ms 6888 KB Output is correct
3 Correct 33 ms 6440 KB Output is correct
4 Correct 38 ms 6924 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 5524 KB Output is correct
5 Correct 5 ms 5588 KB Output is correct
6 Correct 5 ms 5588 KB Output is correct
7 Correct 4 ms 5204 KB Output is correct
8 Correct 5 ms 5588 KB Output is correct
9 Correct 4 ms 5588 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 5524 KB Output is correct
5 Correct 5 ms 5588 KB Output is correct
6 Correct 5 ms 5588 KB Output is correct
7 Correct 4 ms 5204 KB Output is correct
8 Correct 5 ms 5588 KB Output is correct
9 Correct 4 ms 5588 KB Output is correct
10 Correct 34 ms 6788 KB Output is correct
11 Correct 35 ms 6924 KB Output is correct
12 Correct 34 ms 6896 KB Output is correct
13 Correct 35 ms 8296 KB Output is correct
14 Correct 36 ms 8572 KB Output is correct
15 Correct 38 ms 8520 KB Output is correct
16 Correct 35 ms 8088 KB Output is correct
17 Correct 36 ms 8324 KB Output is correct
18 Correct 34 ms 8532 KB Output is correct
19 Correct 30 ms 8164 KB Output is correct
20 Correct 32 ms 8308 KB Output is correct
21 Correct 32 ms 8504 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 5524 KB Output is correct
5 Correct 5 ms 5588 KB Output is correct
6 Correct 5 ms 5588 KB Output is correct
7 Correct 4 ms 5204 KB Output is correct
8 Correct 5 ms 5588 KB Output is correct
9 Correct 4 ms 5588 KB Output is correct
10 Correct 4 ms 5076 KB Output is correct
11 Correct 6 ms 5580 KB Output is correct
12 Correct 5 ms 5204 KB Output is correct
13 Correct 6 ms 5564 KB Output is correct
14 Correct 5 ms 5588 KB Output is correct
15 Correct 4 ms 5588 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 6784 KB Output is correct
2 Correct 34 ms 6888 KB Output is correct
3 Correct 33 ms 6440 KB Output is correct
4 Correct 38 ms 6924 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 5 ms 5524 KB Output is correct
12 Correct 5 ms 5588 KB Output is correct
13 Correct 5 ms 5588 KB Output is correct
14 Correct 4 ms 5204 KB Output is correct
15 Correct 5 ms 5588 KB Output is correct
16 Correct 4 ms 5588 KB Output is correct
17 Correct 34 ms 6788 KB Output is correct
18 Correct 35 ms 6924 KB Output is correct
19 Correct 34 ms 6896 KB Output is correct
20 Correct 35 ms 8296 KB Output is correct
21 Correct 36 ms 8572 KB Output is correct
22 Correct 38 ms 8520 KB Output is correct
23 Correct 35 ms 8088 KB Output is correct
24 Correct 36 ms 8324 KB Output is correct
25 Correct 34 ms 8532 KB Output is correct
26 Correct 30 ms 8164 KB Output is correct
27 Correct 32 ms 8308 KB Output is correct
28 Correct 32 ms 8504 KB Output is correct
29 Correct 4 ms 5076 KB Output is correct
30 Correct 6 ms 5580 KB Output is correct
31 Correct 5 ms 5204 KB Output is correct
32 Correct 6 ms 5564 KB Output is correct
33 Correct 5 ms 5588 KB Output is correct
34 Correct 4 ms 5588 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 37 ms 7708 KB Output is correct
37 Correct 37 ms 8184 KB Output is correct
38 Correct 36 ms 8284 KB Output is correct
39 Correct 39 ms 8608 KB Output is correct
40 Correct 37 ms 8584 KB Output is correct
41 Correct 4 ms 5784 KB Output is correct
42 Correct 34 ms 8168 KB Output is correct
43 Correct 35 ms 8468 KB Output is correct
44 Correct 33 ms 8560 KB Output is correct
45 Correct 33 ms 8212 KB Output is correct
46 Correct 32 ms 8564 KB Output is correct
47 Correct 32 ms 8584 KB Output is correct