oj.uz

Submission #641513

# Submission time Handle Problem Language Result Execution time Memory
641513 2022-09-16T20:49:43 Z ymm Mutating DNA (IOI21_dna) C++17
100 / 100
 35 ms 7324 KB 
#include "dna.h"
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

static const int N = 100'010;
static int ps[N][3][3];


void init(std::string a, std::string b)
{
	Loop (i,0,a.size()) {
		int x = a[i]=='A'? 0: a[i]=='T'? 1: 2;
		int y = b[i]=='A'? 0: b[i]=='T'? 1: 2;
		ps[i+1][x][y] = 1;
		Loop (j,0,3) Loop (k,0,3)
			ps[i+1][j][k] += ps[i][j][k];
	}
}

int get_distance(int l, int r)
{
	++r;
	int a[3][3];
	Loop (i,0,3) Loop (j,0,3)
		a[i][j] = ps[r][i][j] - ps[l][i][j];
	int ans = 0;
	Loop (i,0,3) Loop (j,i+1,3) {
		int mn = min(a[i][j], a[j][i]);
		ans += mn;
		a[i][j] -= mn;
		a[j][i] -= mn;
	}
	if (a[0][1] != a[1][2] || a[1][2] != a[2][0])
		return -1;
	if (a[0][2] != a[2][1] || a[2][1] != a[1][0])
		return -1;
	ans += 2 * a[0][1];
	ans += 2 * a[1][0];
	return ans;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:3:40: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
      |                                        ^
dna.cpp:16:2: note: in expansion of macro 'Loop'
   16 |  Loop (i,0,a.size()) {
      |  ^~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 7004 KB Output is correct
2 Correct 32 ms 6988 KB Output is correct
3 Correct 35 ms 6628 KB Output is correct
4 Correct 33 ms 6984 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4544 KB Output is correct
5 Correct 4 ms 4564 KB Output is correct
6 Correct 4 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4564 KB Output is correct
9 Correct 3 ms 4540 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4544 KB Output is correct
5 Correct 4 ms 4564 KB Output is correct
6 Correct 4 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4564 KB Output is correct
9 Correct 3 ms 4540 KB Output is correct
10 Correct 34 ms 6896 KB Output is correct
11 Correct 34 ms 7048 KB Output is correct
12 Correct 32 ms 7060 KB Output is correct
13 Correct 31 ms 7156 KB Output is correct
14 Correct 33 ms 7288 KB Output is correct
15 Correct 30 ms 7304 KB Output is correct
16 Correct 33 ms 6984 KB Output is correct
17 Correct 30 ms 7136 KB Output is correct
18 Correct 31 ms 7304 KB Output is correct
19 Correct 30 ms 7020 KB Output is correct
20 Correct 30 ms 7156 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 308 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4544 KB Output is correct
5 Correct 4 ms 4564 KB Output is correct
6 Correct 4 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4564 KB Output is correct
9 Correct 3 ms 4540 KB Output is correct
10 Correct 4 ms 4124 KB Output is correct
11 Correct 5 ms 4532 KB Output is correct
12 Correct 4 ms 4308 KB Output is correct
13 Correct 4 ms 4576 KB Output is correct
14 Correct 4 ms 4540 KB Output is correct
15 Correct 4 ms 4564 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 7004 KB Output is correct
2 Correct 32 ms 6988 KB Output is correct
3 Correct 35 ms 6628 KB Output is correct
4 Correct 33 ms 6984 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 5 ms 4544 KB Output is correct
12 Correct 4 ms 4564 KB Output is correct
13 Correct 4 ms 4564 KB Output is correct
14 Correct 4 ms 4308 KB Output is correct
15 Correct 5 ms 4564 KB Output is correct
16 Correct 3 ms 4540 KB Output is correct
17 Correct 34 ms 6896 KB Output is correct
18 Correct 34 ms 7048 KB Output is correct
19 Correct 32 ms 7060 KB Output is correct
20 Correct 31 ms 7156 KB Output is correct
21 Correct 33 ms 7288 KB Output is correct
22 Correct 30 ms 7304 KB Output is correct
23 Correct 33 ms 6984 KB Output is correct
24 Correct 30 ms 7136 KB Output is correct
25 Correct 31 ms 7304 KB Output is correct
26 Correct 30 ms 7020 KB Output is correct
27 Correct 30 ms 7156 KB Output is correct
28 Correct 29 ms 7304 KB Output is correct
29 Correct 4 ms 4124 KB Output is correct
30 Correct 5 ms 4532 KB Output is correct
31 Correct 4 ms 4308 KB Output is correct
32 Correct 4 ms 4576 KB Output is correct
33 Correct 4 ms 4540 KB Output is correct
34 Correct 4 ms 4564 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 32 ms 6628 KB Output is correct
37 Correct 32 ms 7000 KB Output is correct
38 Correct 33 ms 7136 KB Output is correct
39 Correct 32 ms 7324 KB Output is correct
40 Correct 32 ms 7304 KB Output is correct
41 Correct 3 ms 4540 KB Output is correct
42 Correct 30 ms 7004 KB Output is correct
43 Correct 30 ms 7284 KB Output is correct
44 Correct 33 ms 7280 KB Output is correct
45 Correct 30 ms 6980 KB Output is correct
46 Correct 30 ms 7288 KB Output is correct
47 Correct 30 ms 7276 KB Output is correct