oj.uz

Submission #780162

# Submission time Handle Problem Language Result Execution time Memory
780162 2023-07-12T07:04:23 Z Lyrically Mutating DNA (IOI21_dna) C++17
100 / 100
 43 ms 8604 KB 
#include<bits/stdc++.h>
#include "dna.h"
using namespace std;
#define pii pair<int,int>
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
int pre[100005][6];
int acta[100005][3],actb[100005][3];
int n;
char trans(char p)
{
	return p=='A'?'a':(p=='C'?'b':'c');
}
void init(string a,string b)
{
	a=" "+a;b=" "+b;
	n=(int)a.size()-1;
	rep1(i,n)
	{
		a[i]=trans(a[i]);
		b[i]=trans(b[i]);
	}
	rep1(i,n)
	{
		rep(j,6){pre[i][j]=pre[i-1][j];}
		rep(j,3){acta[i][j]=acta[i-1][j];}
		acta[i][a[i]-'a']++;
		rep(j,3){actb[i][j]=actb[i-1][j];}
		actb[i][b[i]-'a']++;
		if(a[i]==b[i]){continue;}
		if(a[i]=='a'&&b[i]=='b'){pre[i][0]++;}
		if(a[i]=='a'&&b[i]=='c'){pre[i][1]++;}
		if(a[i]=='b'&&b[i]=='a'){pre[i][2]++;}
		if(a[i]=='b'&&b[i]=='c'){pre[i][3]++;}
		if(a[i]=='c'&&b[i]=='a'){pre[i][4]++;}
		if(a[i]=='c'&&b[i]=='b'){pre[i][5]++;}
	}
}
int get_distance(int x,int y)
{
	x++,y++;
	rep(i,3)
	{
		if(acta[y][i]-acta[x-1][i]!=actb[y][i]-actb[x-1][i])
		{
			return -1;
		}
	}
	int npre[6];
	rep(i,6)
	{
		npre[i]=pre[y][i]-pre[x-1][i];
	}
	int rans=min(npre[0],npre[2])+min(npre[1],npre[4])+min(npre[3],npre[5]);
	int X=min(npre[0],npre[2]),Y=min(npre[1],npre[4]),Z=min(npre[3],npre[5]);
	npre[0]-=X;
	npre[2]-=X;
	npre[1]-=Y;
	npre[4]-=Y;
	npre[3]-=Z;
	npre[5]-=Z;
	if(npre[0]||npre[1]||npre[2]||npre[3]||npre[4]||npre[5])
	{
		int mx=0;
		rep(i,6){mx=max(mx,npre[i]);}
		return rans+mx*2;
	}
	return rans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 6828 KB Output is correct
2 Correct 31 ms 6868 KB Output is correct
3 Correct 30 ms 6416 KB Output is correct
4 Correct 36 ms 6980 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 5556 KB Output is correct
5 Correct 5 ms 5588 KB Output is correct
6 Correct 5 ms 5588 KB Output is correct
7 Correct 5 ms 5204 KB Output is correct
8 Correct 5 ms 5596 KB Output is correct
9 Correct 3 ms 5588 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 5556 KB Output is correct
5 Correct 5 ms 5588 KB Output is correct
6 Correct 5 ms 5588 KB Output is correct
7 Correct 5 ms 5204 KB Output is correct
8 Correct 5 ms 5596 KB Output is correct
9 Correct 3 ms 5588 KB Output is correct
10 Correct 27 ms 6820 KB Output is correct
11 Correct 27 ms 6868 KB Output is correct
12 Correct 40 ms 6780 KB Output is correct
13 Correct 28 ms 6964 KB Output is correct
14 Correct 27 ms 7216 KB Output is correct
15 Correct 26 ms 7080 KB Output is correct
16 Correct 27 ms 6844 KB Output is correct
17 Correct 43 ms 6988 KB Output is correct
18 Correct 28 ms 7208 KB Output is correct
19 Correct 26 ms 6836 KB Output is correct
20 Correct 26 ms 7084 KB Output is correct
21 Correct 28 ms 7216 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 5556 KB Output is correct
5 Correct 5 ms 5588 KB Output is correct
6 Correct 5 ms 5588 KB Output is correct
7 Correct 5 ms 5204 KB Output is correct
8 Correct 5 ms 5596 KB Output is correct
9 Correct 3 ms 5588 KB Output is correct
10 Correct 5 ms 5204 KB Output is correct
11 Correct 6 ms 5716 KB Output is correct
12 Correct 6 ms 5452 KB Output is correct
13 Correct 6 ms 5824 KB Output is correct
14 Correct 5 ms 5860 KB Output is correct
15 Correct 4 ms 5824 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 6828 KB Output is correct
2 Correct 31 ms 6868 KB Output is correct
3 Correct 30 ms 6416 KB Output is correct
4 Correct 36 ms 6980 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 5 ms 5556 KB Output is correct
12 Correct 5 ms 5588 KB Output is correct
13 Correct 5 ms 5588 KB Output is correct
14 Correct 5 ms 5204 KB Output is correct
15 Correct 5 ms 5596 KB Output is correct
16 Correct 3 ms 5588 KB Output is correct
17 Correct 27 ms 6820 KB Output is correct
18 Correct 27 ms 6868 KB Output is correct
19 Correct 40 ms 6780 KB Output is correct
20 Correct 28 ms 6964 KB Output is correct
21 Correct 27 ms 7216 KB Output is correct
22 Correct 26 ms 7080 KB Output is correct
23 Correct 27 ms 6844 KB Output is correct
24 Correct 43 ms 6988 KB Output is correct
25 Correct 28 ms 7208 KB Output is correct
26 Correct 26 ms 6836 KB Output is correct
27 Correct 26 ms 7084 KB Output is correct
28 Correct 28 ms 7216 KB Output is correct
29 Correct 5 ms 5204 KB Output is correct
30 Correct 6 ms 5716 KB Output is correct
31 Correct 6 ms 5452 KB Output is correct
32 Correct 6 ms 5824 KB Output is correct
33 Correct 5 ms 5860 KB Output is correct
34 Correct 4 ms 5824 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 29 ms 7696 KB Output is correct
37 Correct 37 ms 8168 KB Output is correct
38 Correct 29 ms 8184 KB Output is correct
39 Correct 38 ms 8488 KB Output is correct
40 Correct 28 ms 8604 KB Output is correct
41 Correct 4 ms 5844 KB Output is correct
42 Correct 34 ms 8200 KB Output is correct
43 Correct 33 ms 8476 KB Output is correct
44 Correct 30 ms 8476 KB Output is correct
45 Correct 27 ms 8144 KB Output is correct
46 Correct 30 ms 8488 KB Output is correct
47 Correct 27 ms 8476 KB Output is correct