Submission #564307

# Submission time Handle Problem Language Result Execution time Memory
564307 2022-05-18T21:51:12 Z 2fat2code Mutating DNA (IOI21_dna) C++17
100 / 100
45 ms 7368 KB
#include "dna.h"
#include <bits/stdc++.h>
#define fr first
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define sc second
#define all(s) s.begin(), s.end()
//#define int long long
using namespace std;

const int nmax = 100005;

int n, pref[3][3][nmax];

void init(string a, string b) {
    n = (int)a.size();
    for(int i=0;i<n;i++){
        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(int i=0;i<n;i++){
        pref[a[i]-'0'][b[i]-'0'][i+1]++;
        for(int j=0;j<=2;j++){
            for(int t=0;t<=2;t++){
                pref[j][t][i+1] += pref[j][t][i];
            }
        }
    }
}

int get_distance(int x, int y) {
	int dp[3][3];
	for(int i=0;i<=2;i++){
        for(int j=0;j<=2;j++){
            dp[i][j] = (pref[i][j][y+1] - pref[i][j][x]);
        }
	}
	int ans = 0;
	for(int i=0;i<=2;i++){
        int cnt1 = dp[i][0] + dp[i][1] + dp[i][2];
        int cnt2 = dp[0][i] + dp[1][i] + dp[2][i];
        if(cnt1 != cnt2) return -1;
	}
	for(int i=0;i<=2;i++){
        for(int j=i+1;j<=2;j++){
            int curr = min(dp[i][j], dp[j][i]);
            ans += curr;
            dp[i][j] -= curr;
            dp[j][i] -= curr;
        }
	}
	int cnt = 0;
	for(int i=0;i<=2;i++){
        for(int j=i+1;j<=2;j++){
            if(dp[i][j] != 0) cnt = dp[i][j];
        }
	}
	ans += 2*cnt;
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 36 ms 5644 KB Output is correct
2 Correct 34 ms 5640 KB Output is correct
3 Correct 37 ms 5360 KB Output is correct
4 Correct 36 ms 5648 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 224 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 4 ms 4308 KB Output is correct
5 Correct 4 ms 4308 KB Output is correct
6 Correct 5 ms 4308 KB Output is correct
7 Correct 4 ms 4052 KB Output is correct
8 Correct 5 ms 4308 KB Output is correct
9 Correct 4 ms 4384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 224 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 4 ms 4308 KB Output is correct
5 Correct 4 ms 4308 KB Output is correct
6 Correct 5 ms 4308 KB Output is correct
7 Correct 4 ms 4052 KB Output is correct
8 Correct 5 ms 4308 KB Output is correct
9 Correct 4 ms 4384 KB Output is correct
10 Correct 34 ms 5616 KB Output is correct
11 Correct 36 ms 5640 KB Output is correct
12 Correct 42 ms 5768 KB Output is correct
13 Correct 35 ms 5888 KB Output is correct
14 Correct 34 ms 6020 KB Output is correct
15 Correct 33 ms 5884 KB Output is correct
16 Correct 38 ms 5796 KB Output is correct
17 Correct 36 ms 5892 KB Output is correct
18 Correct 34 ms 6032 KB Output is correct
19 Correct 29 ms 5844 KB Output is correct
20 Correct 30 ms 5916 KB Output is correct
21 Correct 33 ms 6024 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 224 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 4 ms 4308 KB Output is correct
5 Correct 4 ms 4308 KB Output is correct
6 Correct 5 ms 4308 KB Output is correct
7 Correct 4 ms 4052 KB Output is correct
8 Correct 5 ms 4308 KB Output is correct
9 Correct 4 ms 4384 KB Output is correct
10 Correct 4 ms 4052 KB Output is correct
11 Correct 4 ms 4308 KB Output is correct
12 Correct 4 ms 4052 KB Output is correct
13 Correct 5 ms 4540 KB Output is correct
14 Correct 5 ms 4544 KB Output is correct
15 Correct 4 ms 4544 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 36 ms 5644 KB Output is correct
2 Correct 34 ms 5640 KB Output is correct
3 Correct 37 ms 5360 KB Output is correct
4 Correct 36 ms 5648 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 224 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 4308 KB Output is correct
12 Correct 4 ms 4308 KB Output is correct
13 Correct 5 ms 4308 KB Output is correct
14 Correct 4 ms 4052 KB Output is correct
15 Correct 5 ms 4308 KB Output is correct
16 Correct 4 ms 4384 KB Output is correct
17 Correct 34 ms 5616 KB Output is correct
18 Correct 36 ms 5640 KB Output is correct
19 Correct 42 ms 5768 KB Output is correct
20 Correct 35 ms 5888 KB Output is correct
21 Correct 34 ms 6020 KB Output is correct
22 Correct 33 ms 5884 KB Output is correct
23 Correct 38 ms 5796 KB Output is correct
24 Correct 36 ms 5892 KB Output is correct
25 Correct 34 ms 6032 KB Output is correct
26 Correct 29 ms 5844 KB Output is correct
27 Correct 30 ms 5916 KB Output is correct
28 Correct 33 ms 6024 KB Output is correct
29 Correct 4 ms 4052 KB Output is correct
30 Correct 4 ms 4308 KB Output is correct
31 Correct 4 ms 4052 KB Output is correct
32 Correct 5 ms 4540 KB Output is correct
33 Correct 5 ms 4544 KB Output is correct
34 Correct 4 ms 4544 KB Output is correct
35 Correct 0 ms 300 KB Output is correct
36 Correct 34 ms 6656 KB Output is correct
37 Correct 38 ms 7048 KB Output is correct
38 Correct 39 ms 7076 KB Output is correct
39 Correct 36 ms 7368 KB Output is correct
40 Correct 45 ms 7304 KB Output is correct
41 Correct 6 ms 4564 KB Output is correct
42 Correct 34 ms 7092 KB Output is correct
43 Correct 35 ms 7284 KB Output is correct
44 Correct 34 ms 7304 KB Output is correct
45 Correct 33 ms 7040 KB Output is correct
46 Correct 34 ms 7308 KB Output is correct
47 Correct 32 ms 7292 KB Output is correct