oj.uz

Submission #722479

# Submission time Handle Problem Language Result Execution time Memory
722479 2023-04-12T05:33:11 Z Magikarp4000 Mutating DNA (IOI21_dna) C++17
100 / 100
 51 ms 8176 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

const int MAXN = 1e5+1;
int n;
int a[MAXN], b[MAXN];
int p[MAXN][3][3];
int w[3][3];

void init(std::string A, std::string B) {
	n = A.length();
	FOR(i,0,n) {
		if (A[i] == 'A') a[i] = 0;
		else if (A[i] == 'C') a[i] = 1;
		else a[i] = 2;
		if (B[i] == 'A') b[i] = 0;
		else if (B[i] == 'C') b[i] = 1;
		else b[i] = 2;
	}
	FOR(i,1,n+1) {
		FOR(j,0,3) {
			FOR(k,0,3) p[i][j][k] += p[i-1][j][k];
		}
		p[i][a[i-1]][b[i-1]]++;
	}
}

int get_distance(int x, int y) {
	int res = y-x+1;
	FOR(j,0,3) FOR(k,0,3) w[j][k] = p[y+1][j][k]-p[x][j][k];
	vector<int> c(3,0), d(3,0);
	FOR(j,0,3) {
		FOR(k,j,3) {
			if (j == k) res -= w[j][k];
			else {
				res -= min(w[j][k],w[k][j]);
				int diff = abs(w[j][k]-w[k][j]);
				if (w[j][k] > w[k][j]) {
					c[j] += diff;
					d[k] += diff;
				}
				else {
					c[k] += diff;
					d[j] += diff;
				}
			}
		}
	}
	FOR(i,0,3) if (c[i] != d[i]) return -1;
	res -= c[0];
	return res;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 6412 KB Output is correct
2 Correct 45 ms 6416 KB Output is correct
3 Correct 34 ms 6008 KB Output is correct
4 Correct 39 ms 7784 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 1 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 4 ms 5076 KB Output is correct
5 Correct 5 ms 5076 KB Output is correct
6 Correct 4 ms 5076 KB Output is correct
7 Correct 4 ms 4820 KB Output is correct
8 Correct 5 ms 5076 KB Output is correct
9 Correct 5 ms 5076 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 4 ms 5076 KB Output is correct
5 Correct 5 ms 5076 KB Output is correct
6 Correct 4 ms 5076 KB Output is correct
7 Correct 4 ms 4820 KB Output is correct
8 Correct 5 ms 5076 KB Output is correct
9 Correct 5 ms 5076 KB Output is correct
10 Correct 39 ms 6388 KB Output is correct
11 Correct 51 ms 6396 KB Output is correct
12 Correct 36 ms 6528 KB Output is correct
13 Correct 35 ms 6636 KB Output is correct
14 Correct 36 ms 6776 KB Output is correct
15 Correct 36 ms 6784 KB Output is correct
16 Correct 37 ms 6496 KB Output is correct
17 Correct 36 ms 6616 KB Output is correct
18 Correct 37 ms 6792 KB Output is correct
19 Correct 35 ms 6524 KB Output is correct
20 Correct 41 ms 6640 KB Output is correct
21 Correct 33 ms 6800 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 212 KB Output is correct
4 Correct 4 ms 5076 KB Output is correct
5 Correct 5 ms 5076 KB Output is correct
6 Correct 4 ms 5076 KB Output is correct
7 Correct 4 ms 4820 KB Output is correct
8 Correct 5 ms 5076 KB Output is correct
9 Correct 5 ms 5076 KB Output is correct
10 Correct 5 ms 4692 KB Output is correct
11 Correct 6 ms 5332 KB Output is correct
12 Correct 5 ms 5076 KB Output is correct
13 Correct 7 ms 5312 KB Output is correct
14 Correct 5 ms 5332 KB Output is correct
15 Correct 4 ms 5332 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 6412 KB Output is correct
2 Correct 45 ms 6416 KB Output is correct
3 Correct 34 ms 6008 KB Output is correct
4 Correct 39 ms 7784 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 1 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 4 ms 5076 KB Output is correct
12 Correct 5 ms 5076 KB Output is correct
13 Correct 4 ms 5076 KB Output is correct
14 Correct 4 ms 4820 KB Output is correct
15 Correct 5 ms 5076 KB Output is correct
16 Correct 5 ms 5076 KB Output is correct
17 Correct 39 ms 6388 KB Output is correct
18 Correct 51 ms 6396 KB Output is correct
19 Correct 36 ms 6528 KB Output is correct
20 Correct 35 ms 6636 KB Output is correct
21 Correct 36 ms 6776 KB Output is correct
22 Correct 36 ms 6784 KB Output is correct
23 Correct 37 ms 6496 KB Output is correct
24 Correct 36 ms 6616 KB Output is correct
25 Correct 37 ms 6792 KB Output is correct
26 Correct 35 ms 6524 KB Output is correct
27 Correct 41 ms 6640 KB Output is correct
28 Correct 33 ms 6800 KB Output is correct
29 Correct 5 ms 4692 KB Output is correct
30 Correct 6 ms 5332 KB Output is correct
31 Correct 5 ms 5076 KB Output is correct
32 Correct 7 ms 5312 KB Output is correct
33 Correct 5 ms 5332 KB Output is correct
34 Correct 4 ms 5332 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 36 ms 7388 KB Output is correct
37 Correct 38 ms 7820 KB Output is correct
38 Correct 40 ms 7904 KB Output is correct
39 Correct 38 ms 8176 KB Output is correct
40 Correct 40 ms 8172 KB Output is correct
41 Correct 5 ms 5352 KB Output is correct
42 Correct 36 ms 7836 KB Output is correct
43 Correct 38 ms 8060 KB Output is correct
44 Correct 37 ms 8072 KB Output is correct
45 Correct 36 ms 7776 KB Output is correct
46 Correct 34 ms 8092 KB Output is correct
47 Correct 35 ms 8060 KB Output is correct