oj.uz

Submission #483688

# Submission time Handle Problem Language Result Execution time Memory
483688 2021-10-31T18:21:05 Z StrawHatWess Mutating DNA (IOI21_dna) C++17
100 / 100
 49 ms 9216 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std; 

typedef long long ll;
typedef vector<int>vi; 
typedef string str;

#define pb push_back
#define sz(v) (int)v.size()

#define FOR(i,a,b) for(int i=a; i<b; i++)
//-------------------------------------------------

const int MX=1e5+10;
int p[3][3][MX],pref[3][MX],pref2[3][MX];

void init(str a, str b){
	memset(p,0,sizeof(p));
	memset(pref,0,sizeof(pref)); 
	memset(pref2,0,sizeof(pref2));

	int N=sz(a);
	map<char,int>mp; 
	mp['A']=0; mp['C']=1; mp['T']=2;
	FOR(i,0,N){
		p[mp[a[i]]][mp[b[i]]][i]=1;
		pref[mp[a[i]]][i]=1; pref2[mp[b[i]]][i]=1; 
	}
	FOR(x,0,3) FOR(y,0,3) FOR(i,1,N) p[x][y][i]+=p[x][y][i-1];
	FOR(x,0,3) FOR(i,1,N) pref[x][i]+=pref[x][i-1],pref2[x][i]+=pref2[x][i-1];
}

int get_distance(int l, int r) {
	int n=0,ans=0;
	FOR(x,0,3) FOR(y,x+1,3){
		int v1=p[x][y][r];
		if(l) v1-=p[x][y][l-1];

		int v2=p[y][x][r];
		if(l) v2-=p[y][x][l-1];

		int a=pref[0][r],b=pref[1][r],c=pref[2][r];
		if(l) a-=pref[0][l-1],b-=pref[1][l-1],c-=pref[2][l-1];
		int aa=pref2[0][r],bb=pref2[1][r],cc=pref2[2][r];
		if(l) aa-=pref2[0][l-1],bb-=pref2[1][l-1],cc-=pref2[2][l-1];
		if(a!=aa || b!=bb || c!=cc) return -1;

		ans+=min(v1,v2);
		n+=max(v1,v2)-min(v1,v2);
	}
	if(n%3) return -1;
	ans+=(n/3)*2;
	return ans; 
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 7928 KB Output is correct
2 Correct 38 ms 8704 KB Output is correct
3 Correct 48 ms 8704 KB Output is correct
4 Correct 41 ms 8780 KB Output is correct
5 Correct 4 ms 6092 KB Output is correct
6 Correct 3 ms 6092 KB Output is correct
7 Correct 2 ms 6092 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6092 KB Output is correct
2 Correct 2 ms 6092 KB Output is correct
3 Correct 2 ms 6092 KB Output is correct
4 Correct 10 ms 6732 KB Output is correct
5 Correct 10 ms 6956 KB Output is correct
6 Correct 10 ms 6948 KB Output is correct
7 Correct 10 ms 6896 KB Output is correct
8 Correct 11 ms 6964 KB Output is correct
9 Correct 11 ms 6860 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6092 KB Output is correct
2 Correct 2 ms 6092 KB Output is correct
3 Correct 2 ms 6092 KB Output is correct
4 Correct 10 ms 6732 KB Output is correct
5 Correct 10 ms 6956 KB Output is correct
6 Correct 10 ms 6948 KB Output is correct
7 Correct 10 ms 6896 KB Output is correct
8 Correct 11 ms 6964 KB Output is correct
9 Correct 11 ms 6860 KB Output is correct
10 Correct 46 ms 8800 KB Output is correct
11 Correct 44 ms 8804 KB Output is correct
12 Correct 41 ms 8992 KB Output is correct
13 Correct 41 ms 9132 KB Output is correct
14 Correct 43 ms 9088 KB Output is correct
15 Correct 44 ms 9024 KB Output is correct
16 Correct 38 ms 9104 KB Output is correct
17 Correct 37 ms 9136 KB Output is correct
18 Correct 42 ms 9144 KB Output is correct
19 Correct 48 ms 9104 KB Output is correct
20 Correct 36 ms 9160 KB Output is correct
21 Correct 35 ms 9216 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6092 KB Output is correct
2 Correct 2 ms 6092 KB Output is correct
3 Correct 2 ms 6092 KB Output is correct
4 Correct 10 ms 6732 KB Output is correct
5 Correct 10 ms 6956 KB Output is correct
6 Correct 10 ms 6948 KB Output is correct
7 Correct 10 ms 6896 KB Output is correct
8 Correct 11 ms 6964 KB Output is correct
9 Correct 11 ms 6860 KB Output is correct
10 Correct 10 ms 6860 KB Output is correct
11 Correct 11 ms 6860 KB Output is correct
12 Correct 10 ms 6900 KB Output is correct
13 Correct 11 ms 6860 KB Output is correct
14 Correct 11 ms 6840 KB Output is correct
15 Correct 10 ms 6860 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 7928 KB Output is correct
2 Correct 38 ms 8704 KB Output is correct
3 Correct 48 ms 8704 KB Output is correct
4 Correct 41 ms 8780 KB Output is correct
5 Correct 4 ms 6092 KB Output is correct
6 Correct 3 ms 6092 KB Output is correct
7 Correct 2 ms 6092 KB Output is correct
8 Correct 2 ms 6092 KB Output is correct
9 Correct 2 ms 6092 KB Output is correct
10 Correct 2 ms 6092 KB Output is correct
11 Correct 10 ms 6732 KB Output is correct
12 Correct 10 ms 6956 KB Output is correct
13 Correct 10 ms 6948 KB Output is correct
14 Correct 10 ms 6896 KB Output is correct
15 Correct 11 ms 6964 KB Output is correct
16 Correct 11 ms 6860 KB Output is correct
17 Correct 46 ms 8800 KB Output is correct
18 Correct 44 ms 8804 KB Output is correct
19 Correct 41 ms 8992 KB Output is correct
20 Correct 41 ms 9132 KB Output is correct
21 Correct 43 ms 9088 KB Output is correct
22 Correct 44 ms 9024 KB Output is correct
23 Correct 38 ms 9104 KB Output is correct
24 Correct 37 ms 9136 KB Output is correct
25 Correct 42 ms 9144 KB Output is correct
26 Correct 48 ms 9104 KB Output is correct
27 Correct 36 ms 9160 KB Output is correct
28 Correct 35 ms 9216 KB Output is correct
29 Correct 10 ms 6860 KB Output is correct
30 Correct 11 ms 6860 KB Output is correct
31 Correct 10 ms 6900 KB Output is correct
32 Correct 11 ms 6860 KB Output is correct
33 Correct 11 ms 6840 KB Output is correct
34 Correct 10 ms 6860 KB Output is correct
35 Correct 2 ms 6092 KB Output is correct
36 Correct 46 ms 8716 KB Output is correct
37 Correct 40 ms 8948 KB Output is correct
38 Correct 41 ms 9076 KB Output is correct
39 Correct 40 ms 9128 KB Output is correct
40 Correct 40 ms 9088 KB Output is correct
41 Correct 10 ms 6860 KB Output is correct
42 Correct 37 ms 9116 KB Output is correct
43 Correct 43 ms 9088 KB Output is correct
44 Correct 49 ms 9216 KB Output is correct
45 Correct 35 ms 9100 KB Output is correct
46 Correct 36 ms 9200 KB Output is correct
47 Correct 35 ms 9140 KB Output is correct