oj.uz

Submission #480692

# Submission time Handle Problem Language Result Execution time Memory
480692 2021-10-17T19:32:54 Z Haidara Mutating DNA (IOI21_dna) C++17
100 / 100
 41 ms 8920 KB 
#include<bits/stdc++.h>
#define rep(i,x,n) for(int i=x;i<n;i++)
#define FOR(i,n) rep(i,0,n)
using namespace std;
const int maxn=100200;
int t[2][maxn],a[2][maxn],c[2][maxn],tc[maxn],ct[maxn],at[maxn],ta[maxn],ac[maxn],ca[maxn];
void compute(string s,int inx)
{
	int n=s.size();
	FOR(i,n)
	{
		a[inx][i+1]=a[inx][i]+(int)(s[i]=='A');
		t[inx][i+1]=t[inx][i]+(int)(s[i]=='T');
		c[inx][i+1]=c[inx][i]+(int)(s[i]=='C');
	}
}
string s,l;
void init(string x, string y) 
{
	s=x,l=y;
	compute(x,0);
	compute(y,1);
	int n=x.size();
	FOR(i,n)
	{
		ta[i+1]=ta[i]+(int)(s[i]=='T'&&l[i]=='A');
		at[i+1]=at[i]+(int)(s[i]=='A'&&l[i]=='T');
		ac[i+1]=ac[i]+(int)(s[i]=='A'&&l[i]=='C');
		ca[i+1]=ca[i]+(int)(s[i]=='C'&&l[i]=='A');
		tc[i+1]=tc[i]+(int)(s[i]=='T'&&l[i]=='C');
		ct[i+1]=ct[i]+(int)(s[i]=='C'&&l[i]=='T');
	}
}
int get_distance(int x,int y)
{
	x++,y++;
	if(t[0][y]-t[0][x-1]!=t[1][y]-t[1][x-1]||
		c[0][y]-c[0][x-1]!=c[1][y]-c[1][x-1]||
		a[0][y]-a[0][x-1]!=a[1][y]-a[1][x-1])
		return -1;
	int ans=0;
	int TC=tc[y]-tc[x-1];
	int CT=ct[y]-ct[x-1];
	int AC=ac[y]-ac[x-1];
	int CA=ca[y]-ca[x-1];
	int TA=ta[y]-ta[x-1];
	int AT=at[y]-at[x-1];
	int dx;
	dx=max(AT,TA)-abs(AT-TA);
	ans+=dx;
	AT-=dx;
	TA-=dx;
	dx=max(AC,CA)-abs(AC-CA);
	ans+=dx;
	AC-=dx;
	CA-=dx;
	dx=max(CT,TC)-abs(TC-CT);
	ans+=dx;
	TC-=dx;
	CT-=dx;
	ans+=((TC+CT+AT+TA+CA+AC)*2)/3;
	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 7108 KB Output is correct
2 Correct 38 ms 7240 KB Output is correct
3 Correct 38 ms 6676 KB Output is correct
4 Correct 39 ms 8500 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 296 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 5 ms 5836 KB Output is correct
5 Correct 5 ms 5836 KB Output is correct
6 Correct 5 ms 5836 KB Output is correct
7 Correct 5 ms 5456 KB Output is correct
8 Correct 5 ms 5964 KB Output is correct
9 Correct 5 ms 5964 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 5 ms 5836 KB Output is correct
5 Correct 5 ms 5836 KB Output is correct
6 Correct 5 ms 5836 KB Output is correct
7 Correct 5 ms 5456 KB Output is correct
8 Correct 5 ms 5964 KB Output is correct
9 Correct 5 ms 5964 KB Output is correct
10 Correct 41 ms 8492 KB Output is correct
11 Correct 39 ms 8572 KB Output is correct
12 Correct 39 ms 8516 KB Output is correct
13 Correct 39 ms 8644 KB Output is correct
14 Correct 40 ms 8884 KB Output is correct
15 Correct 41 ms 8776 KB Output is correct
16 Correct 38 ms 8368 KB Output is correct
17 Correct 40 ms 8644 KB Output is correct
18 Correct 35 ms 8760 KB Output is correct
19 Correct 34 ms 8388 KB Output is correct
20 Correct 33 ms 8616 KB Output is correct
21 Correct 36 ms 8880 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 5 ms 5836 KB Output is correct
5 Correct 5 ms 5836 KB Output is correct
6 Correct 5 ms 5836 KB Output is correct
7 Correct 5 ms 5456 KB Output is correct
8 Correct 5 ms 5964 KB Output is correct
9 Correct 5 ms 5964 KB Output is correct
10 Correct 5 ms 5532 KB Output is correct
11 Correct 6 ms 6068 KB Output is correct
12 Correct 5 ms 5708 KB Output is correct
13 Correct 5 ms 5964 KB Output is correct
14 Correct 7 ms 5964 KB Output is correct
15 Correct 5 ms 5972 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 7108 KB Output is correct
2 Correct 38 ms 7240 KB Output is correct
3 Correct 38 ms 6676 KB Output is correct
4 Correct 39 ms 8500 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 5 ms 5836 KB Output is correct
12 Correct 5 ms 5836 KB Output is correct
13 Correct 5 ms 5836 KB Output is correct
14 Correct 5 ms 5456 KB Output is correct
15 Correct 5 ms 5964 KB Output is correct
16 Correct 5 ms 5964 KB Output is correct
17 Correct 41 ms 8492 KB Output is correct
18 Correct 39 ms 8572 KB Output is correct
19 Correct 39 ms 8516 KB Output is correct
20 Correct 39 ms 8644 KB Output is correct
21 Correct 40 ms 8884 KB Output is correct
22 Correct 41 ms 8776 KB Output is correct
23 Correct 38 ms 8368 KB Output is correct
24 Correct 40 ms 8644 KB Output is correct
25 Correct 35 ms 8760 KB Output is correct
26 Correct 34 ms 8388 KB Output is correct
27 Correct 33 ms 8616 KB Output is correct
28 Correct 36 ms 8880 KB Output is correct
29 Correct 5 ms 5532 KB Output is correct
30 Correct 6 ms 6068 KB Output is correct
31 Correct 5 ms 5708 KB Output is correct
32 Correct 5 ms 5964 KB Output is correct
33 Correct 7 ms 5964 KB Output is correct
34 Correct 5 ms 5972 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 37 ms 8040 KB Output is correct
37 Correct 38 ms 8516 KB Output is correct
38 Correct 39 ms 8588 KB Output is correct
39 Correct 40 ms 8920 KB Output is correct
40 Correct 41 ms 8896 KB Output is correct
41 Correct 5 ms 6076 KB Output is correct
42 Correct 38 ms 8552 KB Output is correct
43 Correct 36 ms 8772 KB Output is correct
44 Correct 36 ms 8908 KB Output is correct
45 Correct 37 ms 8480 KB Output is correct
46 Correct 33 ms 8836 KB Output is correct
47 Correct 34 ms 8772 KB Output is correct