답안 #734140

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
734140	2023-05-01T22:34:42 Z	Edu175	DNA 돌연변이 (IOI21_dna)	C++17	100 / 100	43 ms	11164 KB

#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,ggdem=b;i<ggdem;++i)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define imp(v) for(auto messi:v)cout<<messi<<" "; cout<<"\n"
using namespace std;
typedef long long ll;
const ll MAXN=1e5+5;
ll sp[MAXN][3][3];
ll a[MAXN],b[MAXN],n;
void init(std::string s, std::string t) {
	n=SZ(s);
	fore(i,0,n){
		if(s[i]=='A')a[i]=0;
		else if(s[i]=='C')a[i]=1;
		else a[i]=2;
		if(t[i]=='A')b[i]=0;
		else if(t[i]=='C')b[i]=1;
		else b[i]=2;
	}
	fore(i,1,n+1){
		fore(j,0,3)fore(h,0,3)sp[i][j][h]=sp[i-1][j][h];
		sp[i][a[i-1]][b[i-1]]++;
	}
}

int get_distance(int l, int r) {
	r++;
	ll c[3][3]={};
	ll q[2][3]={};
	fore(i,0,3)fore(j,0,3){
		c[i][j]=sp[r][i][j]-sp[l][i][j];
		q[0][i]+=c[i][j];
		q[1][j]+=c[i][j];
	}
	ll flag=1;
	fore(i,0,3)if(q[0][i]!=q[1][i])flag=0;
	if(!flag)return -1;
	ll res=2*abs(c[0][1]-c[1][0]);
	// 01 02 12
	res+=min(c[0][1],c[1][0]);
	res+=min(c[0][2],c[2][0]);
	res+=min(c[2][1],c[1][2]);
	return res;
}

Subtask #1
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	36 ms	10636 KB	Output is correct
2	Correct	37 ms	10728 KB	Output is correct
3	Correct	37 ms	9956 KB	Output is correct
4	Correct	37 ms	10752 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct

Subtask #2
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	6 ms	9376 KB	Output is correct
5	Correct	6 ms	9428 KB	Output is correct
6	Correct	6 ms	9428 KB	Output is correct
7	Correct	5 ms	8788 KB	Output is correct
8	Correct	7 ms	9428 KB	Output is correct
9	Correct	6 ms	9408 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	6 ms	9376 KB	Output is correct
5	Correct	6 ms	9428 KB	Output is correct
6	Correct	6 ms	9428 KB	Output is correct
7	Correct	5 ms	8788 KB	Output is correct
8	Correct	7 ms	9428 KB	Output is correct
9	Correct	6 ms	9408 KB	Output is correct
10	Correct	39 ms	10628 KB	Output is correct
11	Correct	36 ms	10720 KB	Output is correct
12	Correct	35 ms	10520 KB	Output is correct
13	Correct	36 ms	10708 KB	Output is correct
14	Correct	41 ms	11072 KB	Output is correct
15	Correct	37 ms	11024 KB	Output is correct
16	Correct	34 ms	10484 KB	Output is correct
17	Correct	34 ms	10740 KB	Output is correct
18	Correct	34 ms	11144 KB	Output is correct
19	Correct	32 ms	10596 KB	Output is correct
20	Correct	32 ms	10776 KB	Output is correct
21	Correct	33 ms	11076 KB	Output is correct

Subtask #4
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	6 ms	9376 KB	Output is correct
5	Correct	6 ms	9428 KB	Output is correct
6	Correct	6 ms	9428 KB	Output is correct
7	Correct	5 ms	8788 KB	Output is correct
8	Correct	7 ms	9428 KB	Output is correct
9	Correct	6 ms	9408 KB	Output is correct
10	Correct	6 ms	8660 KB	Output is correct
11	Correct	8 ms	9484 KB	Output is correct
12	Correct	6 ms	8788 KB	Output is correct
13	Correct	6 ms	9428 KB	Output is correct
14	Correct	7 ms	9428 KB	Output is correct
15	Correct	5 ms	9428 KB	Output is correct

Subtask #5
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	36 ms	10636 KB	Output is correct
2	Correct	37 ms	10728 KB	Output is correct
3	Correct	37 ms	9956 KB	Output is correct
4	Correct	37 ms	10752 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	6 ms	9376 KB	Output is correct
12	Correct	6 ms	9428 KB	Output is correct
13	Correct	6 ms	9428 KB	Output is correct
14	Correct	5 ms	8788 KB	Output is correct
15	Correct	7 ms	9428 KB	Output is correct
16	Correct	6 ms	9408 KB	Output is correct
17	Correct	39 ms	10628 KB	Output is correct
18	Correct	36 ms	10720 KB	Output is correct
19	Correct	35 ms	10520 KB	Output is correct
20	Correct	36 ms	10708 KB	Output is correct
21	Correct	41 ms	11072 KB	Output is correct
22	Correct	37 ms	11024 KB	Output is correct
23	Correct	34 ms	10484 KB	Output is correct
24	Correct	34 ms	10740 KB	Output is correct
25	Correct	34 ms	11144 KB	Output is correct
26	Correct	32 ms	10596 KB	Output is correct
27	Correct	32 ms	10776 KB	Output is correct
28	Correct	33 ms	11076 KB	Output is correct
29	Correct	6 ms	8660 KB	Output is correct
30	Correct	8 ms	9484 KB	Output is correct
31	Correct	6 ms	8788 KB	Output is correct
32	Correct	6 ms	9428 KB	Output is correct
33	Correct	7 ms	9428 KB	Output is correct
34	Correct	5 ms	9428 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	37 ms	9976 KB	Output is correct
37	Correct	39 ms	10796 KB	Output is correct
38	Correct	43 ms	10608 KB	Output is correct
39	Correct	38 ms	11064 KB	Output is correct
40	Correct	40 ms	11144 KB	Output is correct
41	Correct	5 ms	9428 KB	Output is correct
42	Correct	34 ms	10576 KB	Output is correct
43	Correct	34 ms	11164 KB	Output is correct
44	Correct	35 ms	11144 KB	Output is correct
45	Correct	31 ms	10596 KB	Output is correct
46	Correct	32 ms	11124 KB	Output is correct
47	Correct	32 ms	11152 KB	Output is correct

답안 #734140

Compilation message

Subtask #1 21.0 / 21.0

Subtask #2 22.0 / 22.0

Subtask #3 13.0 / 13.0

Subtask #4 28.0 / 28.0

Subtask #5 16.0 / 16.0

Subtask #1
21.0 / 21.0

Subtask #2
22.0 / 22.0

Subtask #3
13.0 / 13.0

Subtask #4
28.0 / 28.0

Subtask #5
16.0 / 16.0