oj.uz

Submission #837230

# Submission time Handle Problem Language Result Execution time Memory
837230 2023-08-25T08:25:18 Z ma_moutahid Mutating DNA (IOI21_dna) C++17
100 / 100
 39 ms 7428 KB 
#include "dna.h"
#include <bits/stdc++.h>
#define vi vector<int>
using namespace std;

vi at;
vi ta;
vi ac;
vi ca;
vi tc;
vi ct;
vi A;
vi T;
vi C;
void init(std::string a, std::string b) {
	int n=a.size();
	at.resize(n);
	ac.resize(n);
	ct.resize(n);
	tc.resize(n);
	ta.resize(n);
	ca.resize(n);
	C.resize(n);
	A.resize(n);
	T.resize(n);
	for(int i=0;i<n;i++){
		if(i){
			ta[i]+=ta[i-1];ca[i]+=ca[i-1];tc[i]+=tc[i-1];ac[i]+=ac[i-1];at[i]+=at[i-1];ct[i]+=ct[i-1];
			A[i]+=A[i-1];
			C[i]+=C[i-1];
			T[i]+=T[i-1];
		}
		if(a[i]=='T'){
			T[i]++;
			if(b[i]=='A')ta[i]++;
			if(b[i]=='C')tc[i]++;
		}
		if(a[i]=='A'){
			A[i]++;
			if(b[i]=='T')at[i]++;
			if(b[i]=='C')ac[i]++;
		}
		if(a[i]=='C'){
			C[i]++;
			if(b[i]=='A')ca[i]++;
			if(b[i]=='T')ct[i]++;
		}
		if(b[i]=='A')A[i]--;
		if(b[i]=='T')T[i]--;
		if(b[i]=='C')C[i]--;
	}
}

int get_distance(int x, int y) {
	int cost=0;
	int dac=0,dat=0,dta=0,dtc=0,dca=0,dct=0;
	int a=0,t=0,c=0;
	if(x){
		dac-=ac[x-1];
		dat-=at[x-1];
		dtc-=tc[x-1];
		dta-=ta[x-1];
		dca-=ca[x-1];
		dct-=ct[x-1];
		a-=A[x-1];
		t-=T[x-1];
		c-=C[x-1];
	}
	a+=A[y];
	t+=T[y];
	c+=C[y];
	if(a || t  || c)return -1;
	dac+=ac[y];
	dat+=at[y];
	dtc+=tc[y];
	dta+=ta[y];
	dca+=ca[y];
	dct+=ct[y];

	if(dac<dca)swap(dac,dca);
	if(dat<dta)swap(dat,dta);
	if(dct<dtc)swap(dtc,dct);

	cost=dca+dta+dtc;
	int left=dac+dat+dct-cost;
	cost+=2*left/3;

	return cost;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 5648 KB Output is correct
2 Correct 28 ms 7056 KB Output is correct
3 Correct 27 ms 6684 KB Output is correct
4 Correct 28 ms 7048 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 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 0 ms 212 KB Output is correct
3 Correct 0 ms 296 KB Output is correct
4 Correct 5 ms 4564 KB Output is correct
5 Correct 5 ms 4564 KB Output is correct
6 Correct 5 ms 4588 KB Output is correct
7 Correct 5 ms 4308 KB Output is correct
8 Correct 7 ms 4564 KB Output is correct
9 Correct 6 ms 4564 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 0 ms 212 KB Output is correct
3 Correct 0 ms 296 KB Output is correct
4 Correct 5 ms 4564 KB Output is correct
5 Correct 5 ms 4564 KB Output is correct
6 Correct 5 ms 4588 KB Output is correct
7 Correct 5 ms 4308 KB Output is correct
8 Correct 7 ms 4564 KB Output is correct
9 Correct 6 ms 4564 KB Output is correct
10 Correct 28 ms 6932 KB Output is correct
11 Correct 28 ms 7024 KB Output is correct
12 Correct 38 ms 7064 KB Output is correct
13 Correct 31 ms 7208 KB Output is correct
14 Correct 29 ms 7304 KB Output is correct
15 Correct 39 ms 7332 KB Output is correct
16 Correct 29 ms 6944 KB Output is correct
17 Correct 29 ms 7060 KB Output is correct
18 Correct 29 ms 7304 KB Output is correct
19 Correct 27 ms 6944 KB Output is correct
20 Correct 30 ms 7060 KB Output is correct
21 Correct 29 ms 7304 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 0 ms 212 KB Output is correct
3 Correct 0 ms 296 KB Output is correct
4 Correct 5 ms 4564 KB Output is correct
5 Correct 5 ms 4564 KB Output is correct
6 Correct 5 ms 4588 KB Output is correct
7 Correct 5 ms 4308 KB Output is correct
8 Correct 7 ms 4564 KB Output is correct
9 Correct 6 ms 4564 KB Output is correct
10 Correct 5 ms 4152 KB Output is correct
11 Correct 5 ms 4564 KB Output is correct
12 Correct 5 ms 4308 KB Output is correct
13 Correct 5 ms 4540 KB Output is correct
14 Correct 5 ms 4564 KB Output is correct
15 Correct 5 ms 4564 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 5648 KB Output is correct
2 Correct 28 ms 7056 KB Output is correct
3 Correct 27 ms 6684 KB Output is correct
4 Correct 28 ms 7048 KB Output is correct
5 Correct 0 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 296 KB Output is correct
11 Correct 5 ms 4564 KB Output is correct
12 Correct 5 ms 4564 KB Output is correct
13 Correct 5 ms 4588 KB Output is correct
14 Correct 5 ms 4308 KB Output is correct
15 Correct 7 ms 4564 KB Output is correct
16 Correct 6 ms 4564 KB Output is correct
17 Correct 28 ms 6932 KB Output is correct
18 Correct 28 ms 7024 KB Output is correct
19 Correct 38 ms 7064 KB Output is correct
20 Correct 31 ms 7208 KB Output is correct
21 Correct 29 ms 7304 KB Output is correct
22 Correct 39 ms 7332 KB Output is correct
23 Correct 29 ms 6944 KB Output is correct
24 Correct 29 ms 7060 KB Output is correct
25 Correct 29 ms 7304 KB Output is correct
26 Correct 27 ms 6944 KB Output is correct
27 Correct 30 ms 7060 KB Output is correct
28 Correct 29 ms 7304 KB Output is correct
29 Correct 5 ms 4152 KB Output is correct
30 Correct 5 ms 4564 KB Output is correct
31 Correct 5 ms 4308 KB Output is correct
32 Correct 5 ms 4540 KB Output is correct
33 Correct 5 ms 4564 KB Output is correct
34 Correct 5 ms 4564 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 28 ms 6812 KB Output is correct
37 Correct 28 ms 6968 KB Output is correct
38 Correct 39 ms 7060 KB Output is correct
39 Correct 29 ms 7428 KB Output is correct
40 Correct 30 ms 7340 KB Output is correct
41 Correct 5 ms 4564 KB Output is correct
42 Correct 29 ms 7056 KB Output is correct
43 Correct 29 ms 7328 KB Output is correct
44 Correct 29 ms 7304 KB Output is correct
45 Correct 28 ms 7068 KB Output is correct
46 Correct 28 ms 7304 KB Output is correct
47 Correct 30 ms 7304 KB Output is correct