Submission #734139

# Submission time Handle Problem Language Result Execution time Memory
734139 2023-05-01T22:32:38 Z Edu175 Mutating DNA (IOI21_dna) C++17
100 / 100
42 ms 12472 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) {
	//cout<<"\n";
	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];
	}
	//fore(i,0,3)fore(j,0,3)cout<<i<<" "<<j<<": "<<c[i][j]<<"\n";
	/*fore(h,0,2){
		fore(i,0,3)cout<<q[h][i]<<" ";
		cout<<"\n";
	}*/
	ll flag=1;
	fore(i,0,3)if(q[0][i]!=q[1][i])flag=0;
	if(!flag)return -1;
	ll res=0;
	ll e0,e1,e2;
	// 01 02 12
	res+=min(c[0][1],c[1][0]); e0=abs(c[0][1]-c[1][0]);
	res+=min(c[0][2],c[2][0]); e1=abs(c[0][2]-c[2][0]);
	res+=min(c[2][1],c[1][2]); e2=abs(c[2][1]-c[1][2]);
	//cout<<res<<": "<<e0<<" "<<e1<<" "<<e2<<"\n";
	if(!(e0==e1&&e1==e2))return -1;
	return res+2*e0;
}
# Verdict Execution time Memory Grader output
1 Correct 36 ms 10632 KB Output is correct
2 Correct 37 ms 10752 KB Output is correct
3 Correct 33 ms 9988 KB Output is correct
4 Correct 37 ms 12028 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 7 ms 9328 KB Output is correct
5 Correct 6 ms 9428 KB Output is correct
6 Correct 5 ms 9428 KB Output is correct
7 Correct 5 ms 8860 KB Output is correct
8 Correct 6 ms 9428 KB Output is correct
9 Correct 6 ms 9428 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 7 ms 9328 KB Output is correct
5 Correct 6 ms 9428 KB Output is correct
6 Correct 5 ms 9428 KB Output is correct
7 Correct 5 ms 8860 KB Output is correct
8 Correct 6 ms 9428 KB Output is correct
9 Correct 6 ms 9428 KB Output is correct
10 Correct 37 ms 10636 KB Output is correct
11 Correct 35 ms 10736 KB Output is correct
12 Correct 35 ms 10412 KB Output is correct
13 Correct 42 ms 10748 KB Output is correct
14 Correct 37 ms 11144 KB Output is correct
15 Correct 35 ms 11020 KB Output is correct
16 Correct 33 ms 10500 KB Output is correct
17 Correct 33 ms 10644 KB Output is correct
18 Correct 33 ms 11144 KB Output is correct
19 Correct 31 ms 10552 KB Output is correct
20 Correct 31 ms 10760 KB Output is correct
21 Correct 35 ms 11200 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 7 ms 9328 KB Output is correct
5 Correct 6 ms 9428 KB Output is correct
6 Correct 5 ms 9428 KB Output is correct
7 Correct 5 ms 8860 KB Output is correct
8 Correct 6 ms 9428 KB Output is correct
9 Correct 6 ms 9428 KB Output is correct
10 Correct 6 ms 8660 KB Output is correct
11 Correct 8 ms 9636 KB Output is correct
12 Correct 6 ms 9004 KB Output is correct
13 Correct 8 ms 9556 KB Output is correct
14 Correct 7 ms 9684 KB Output is correct
15 Correct 6 ms 9684 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 36 ms 10632 KB Output is correct
2 Correct 37 ms 10752 KB Output is correct
3 Correct 33 ms 9988 KB Output is correct
4 Correct 37 ms 12028 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 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 0 ms 212 KB Output is correct
11 Correct 7 ms 9328 KB Output is correct
12 Correct 6 ms 9428 KB Output is correct
13 Correct 5 ms 9428 KB Output is correct
14 Correct 5 ms 8860 KB Output is correct
15 Correct 6 ms 9428 KB Output is correct
16 Correct 6 ms 9428 KB Output is correct
17 Correct 37 ms 10636 KB Output is correct
18 Correct 35 ms 10736 KB Output is correct
19 Correct 35 ms 10412 KB Output is correct
20 Correct 42 ms 10748 KB Output is correct
21 Correct 37 ms 11144 KB Output is correct
22 Correct 35 ms 11020 KB Output is correct
23 Correct 33 ms 10500 KB Output is correct
24 Correct 33 ms 10644 KB Output is correct
25 Correct 33 ms 11144 KB Output is correct
26 Correct 31 ms 10552 KB Output is correct
27 Correct 31 ms 10760 KB Output is correct
28 Correct 35 ms 11200 KB Output is correct
29 Correct 6 ms 8660 KB Output is correct
30 Correct 8 ms 9636 KB Output is correct
31 Correct 6 ms 9004 KB Output is correct
32 Correct 8 ms 9556 KB Output is correct
33 Correct 7 ms 9684 KB Output is correct
34 Correct 6 ms 9684 KB Output is correct
35 Correct 1 ms 312 KB Output is correct
36 Correct 35 ms 11240 KB Output is correct
37 Correct 39 ms 12040 KB Output is correct
38 Correct 42 ms 11908 KB Output is correct
39 Correct 38 ms 12444 KB Output is correct
40 Correct 39 ms 12472 KB Output is correct
41 Correct 6 ms 9684 KB Output is correct
42 Correct 35 ms 11804 KB Output is correct
43 Correct 35 ms 12424 KB Output is correct
44 Correct 34 ms 12316 KB Output is correct
45 Correct 31 ms 11848 KB Output is correct
46 Correct 41 ms 12404 KB Output is correct
47 Correct 33 ms 12396 KB Output is correct