oj.uz

Submission #549080

# Submission time Handle Problem Language Result Execution time Memory
549080 2022-04-15T05:48:21 Z SlyGaleeb Mutating DNA (IOI21_dna) C++17
56 / 100
 39 ms 5672 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ld long double
#define vf v[i].first
#define vs v[i].second
const ll MOD = 1e9 + 7;

void print(vector<int> &v) {
	for (auto c:v)
		cout << c << " ";
	cout << "\n";
}

vector<int>pref = {0};
vector<int>prefA1 = {0};
vector<int>prefT1 = {0}; 
vector<int>prefC1 = {0}; 
vector<int>prefA2 = {0};
vector<int>prefT2 = {0};
vector<int>prefC2 = {0};

int n;
string c,d;

void init(string a, string b) {
	n = a.size();
	c = a;
	d = b;
	int a1=0,a2=0,b1=0,b2=0,c1=0,c2=0,ans=0;
	for (int i = 0; i < n; ++i) {
		if (a[i]!=b[i])
			++ans;
		pref.push_back(ans);
		if (a[i]=='A') 
			a1++;
		prefA1.push_back(a1);
		if (a[i]=='T') 
			b1++;
		prefT1.push_back(b1);
		if (b[i]=='A') 
			a2++;
		prefA2.push_back(a2);
		if (b[i]=='T') 
			b2++;
		prefT2.push_back(b2);
		if (a[i]=='C')
			c1++;
		prefC1.push_back(c1);
		if (b[i]=='C')
			c2++;
		prefC2.push_back(c2);
	}
}

int get_distance(int x, int y) {
	int ans = 0;
	if (prefA1[y+1]-prefA1[x]!=prefA2[y+1]-prefA2[x] || prefT1[y+1]-prefT1[x]!=prefT2[y+1]-prefT2[x] || prefC1[y+1]-prefC1[x]!=prefC2[y+1]-prefC2[x])
		return -1;
	return (pref[y+1]-pref[x]+1)/2;

}

/*int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	string a,b;
	cin >> a >> b;
	init(a,b);
	cout << get_distance(1,3);
	cout << "\n";
	print(pref);
	print(prefA1);
	print(prefA2);
	print(prefT1);
	print(prefT2);
}*/

Compilation message

dna.cpp: In function 'int get_distance(int, int)':
dna.cpp:57:6: warning: unused variable 'ans' [-Wunused-variable]
   57 |  int ans = 0;
      |      ^~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 5292 KB Output is correct
2 Correct 34 ms 5272 KB Output is correct
3 Correct 36 ms 4968 KB Output is correct
4 Correct 36 ms 5284 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 212 KB Output is correct
4 Correct 7 ms 3884 KB Output is correct
5 Correct 6 ms 3888 KB Output is correct
6 Correct 6 ms 3888 KB Output is correct
7 Correct 7 ms 3628 KB Output is correct
8 Correct 7 ms 3888 KB Output is correct
9 Correct 6 ms 3888 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 212 KB Output is correct
4 Correct 7 ms 3884 KB Output is correct
5 Correct 6 ms 3888 KB Output is correct
6 Correct 6 ms 3888 KB Output is correct
7 Correct 7 ms 3628 KB Output is correct
8 Correct 7 ms 3888 KB Output is correct
9 Correct 6 ms 3888 KB Output is correct
10 Correct 38 ms 5268 KB Output is correct
11 Correct 33 ms 5272 KB Output is correct
12 Correct 32 ms 5404 KB Output is correct
13 Correct 34 ms 5520 KB Output is correct
14 Correct 34 ms 5664 KB Output is correct
15 Correct 37 ms 5528 KB Output is correct
16 Correct 33 ms 5308 KB Output is correct
17 Correct 31 ms 5432 KB Output is correct
18 Correct 31 ms 5636 KB Output is correct
19 Correct 39 ms 5480 KB Output is correct
20 Correct 34 ms 5520 KB Output is correct
21 Correct 33 ms 5672 KB Output is correct

Subtask #4
0.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 212 KB Output is correct
4 Correct 7 ms 3884 KB Output is correct
5 Correct 6 ms 3888 KB Output is correct
6 Correct 6 ms 3888 KB Output is correct
7 Correct 7 ms 3628 KB Output is correct
8 Correct 7 ms 3888 KB Output is correct
9 Correct 6 ms 3888 KB Output is correct
10 Correct 7 ms 3628 KB Output is correct
11 Correct 7 ms 3888 KB Output is correct
12 Incorrect 7 ms 3756 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 5292 KB Output is correct
2 Correct 34 ms 5272 KB Output is correct
3 Correct 36 ms 4968 KB Output is correct
4 Correct 36 ms 5284 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 3884 KB Output is correct
12 Correct 6 ms 3888 KB Output is correct
13 Correct 6 ms 3888 KB Output is correct
14 Correct 7 ms 3628 KB Output is correct
15 Correct 7 ms 3888 KB Output is correct
16 Correct 6 ms 3888 KB Output is correct
17 Correct 38 ms 5268 KB Output is correct
18 Correct 33 ms 5272 KB Output is correct
19 Correct 32 ms 5404 KB Output is correct
20 Correct 34 ms 5520 KB Output is correct
21 Correct 34 ms 5664 KB Output is correct
22 Correct 37 ms 5528 KB Output is correct
23 Correct 33 ms 5308 KB Output is correct
24 Correct 31 ms 5432 KB Output is correct
25 Correct 31 ms 5636 KB Output is correct
26 Correct 39 ms 5480 KB Output is correct
27 Correct 34 ms 5520 KB Output is correct
28 Correct 33 ms 5672 KB Output is correct
29 Correct 7 ms 3628 KB Output is correct
30 Correct 7 ms 3888 KB Output is correct
31 Incorrect 7 ms 3756 KB Output isn't correct
32 Halted 0 ms 0 KB -