oj.uz

Submission #466346

# Submission time Handle Problem Language Result Execution time Memory
466346 2021-08-18T21:17:16 Z fuad27 Mutating DNA (IOI21_dna) C++17
100 / 100
 46 ms 9480 KB 
#include<bits/stdc++.h>
#include "dna.h"
 
using namespace std;
typedef long long ll;
typedef long double ld;
#define vii vector<pair<int, int>>
#define vi vector<int>
#define vl vector<long long>
#define vll vector<pair<long long, long long>>
#define mp make_pair
#define pb push_back
#define rep(i, a, b) for(int i = a;i<=b;i++)
#define f first
#define s second
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);
#define start int tt;cin>>tt;rep(testcase, 1, tt)
#define print(k) cout<<"Case #"<<testcase<<": "<<k<<"\n";
#define endl "\n"
#define DEBUG(k) cerr<<k<<"\n";
int t[100010][4][4], n;
int valt(char c) {
    return (c=='A' ? 1 : c=='T' ? 2 : 3);
}
void init(string a, string b) {
    n=a.size();
    for (int i=1; i<=n; i++) {
        int x=valt(a[i-1]), y=valt(b[i-1]);
        for (int j=1; j<=3; j++) {
            for (int k=1; k<=3; k++) {
                t[i][j][k]=t[i-1][j][k];
            }
        }
        t[i][x][y]++;
    }
}
 
int get_distance(int x, int y) {
    	y++;
	int s[4][4];
	for (int i=1; i<=3; i++) {
        for (int j=1; j<=3; j++) {
            s[i][j]=t[y][i][j]-t[x][i][j];
        }
	}
	int a=s[1][2], b=s[2][1], c=s[1][3], d=s[3][1], e=s[2][3], f=s[3][2];
	int ans=0;
	ans+=min(a, b), ans+=min(c, d), ans+=min(e, f);
	if (a-b==e-f && e-f==d-c) {
        ans+=2*abs(a-b);
        return ans;
	}
	return -1;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 8964 KB Output is correct
2 Correct 41 ms 8968 KB Output is correct
3 Correct 42 ms 8436 KB Output is correct
4 Correct 46 ms 9028 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 6 ms 7244 KB Output is correct
5 Correct 6 ms 7244 KB Output is correct
6 Correct 6 ms 7216 KB Output is correct
7 Correct 6 ms 6860 KB Output is correct
8 Correct 6 ms 7244 KB Output is correct
9 Correct 7 ms 7244 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 6 ms 7244 KB Output is correct
5 Correct 6 ms 7244 KB Output is correct
6 Correct 6 ms 7216 KB Output is correct
7 Correct 6 ms 6860 KB Output is correct
8 Correct 6 ms 7244 KB Output is correct
9 Correct 7 ms 7244 KB Output is correct
10 Correct 43 ms 8964 KB Output is correct
11 Correct 42 ms 9088 KB Output is correct
12 Correct 41 ms 8848 KB Output is correct
13 Correct 46 ms 9112 KB Output is correct
14 Correct 45 ms 9344 KB Output is correct
15 Correct 45 ms 9344 KB Output is correct
16 Correct 39 ms 8984 KB Output is correct
17 Correct 40 ms 9096 KB Output is correct
18 Correct 40 ms 9340 KB Output is correct
19 Correct 36 ms 8944 KB Output is correct
20 Correct 37 ms 9164 KB Output is correct
21 Correct 38 ms 9468 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 6 ms 7244 KB Output is correct
5 Correct 6 ms 7244 KB Output is correct
6 Correct 6 ms 7216 KB Output is correct
7 Correct 6 ms 6860 KB Output is correct
8 Correct 6 ms 7244 KB Output is correct
9 Correct 7 ms 7244 KB Output is correct
10 Correct 5 ms 6604 KB Output is correct
11 Correct 6 ms 7244 KB Output is correct
12 Correct 5 ms 6860 KB Output is correct
13 Correct 6 ms 7244 KB Output is correct
14 Correct 6 ms 7244 KB Output is correct
15 Correct 6 ms 7232 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 8964 KB Output is correct
2 Correct 41 ms 8968 KB Output is correct
3 Correct 42 ms 8436 KB Output is correct
4 Correct 46 ms 9028 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 6 ms 7244 KB Output is correct
12 Correct 6 ms 7244 KB Output is correct
13 Correct 6 ms 7216 KB Output is correct
14 Correct 6 ms 6860 KB Output is correct
15 Correct 6 ms 7244 KB Output is correct
16 Correct 7 ms 7244 KB Output is correct
17 Correct 43 ms 8964 KB Output is correct
18 Correct 42 ms 9088 KB Output is correct
19 Correct 41 ms 8848 KB Output is correct
20 Correct 46 ms 9112 KB Output is correct
21 Correct 45 ms 9344 KB Output is correct
22 Correct 45 ms 9344 KB Output is correct
23 Correct 39 ms 8984 KB Output is correct
24 Correct 40 ms 9096 KB Output is correct
25 Correct 40 ms 9340 KB Output is correct
26 Correct 36 ms 8944 KB Output is correct
27 Correct 37 ms 9164 KB Output is correct
28 Correct 38 ms 9468 KB Output is correct
29 Correct 5 ms 6604 KB Output is correct
30 Correct 6 ms 7244 KB Output is correct
31 Correct 5 ms 6860 KB Output is correct
32 Correct 6 ms 7244 KB Output is correct
33 Correct 6 ms 7244 KB Output is correct
34 Correct 6 ms 7232 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 46 ms 8412 KB Output is correct
37 Correct 41 ms 8960 KB Output is correct
38 Correct 42 ms 8932 KB Output is correct
39 Correct 42 ms 9412 KB Output is correct
40 Correct 45 ms 9476 KB Output is correct
41 Correct 5 ms 7244 KB Output is correct
42 Correct 39 ms 8936 KB Output is correct
43 Correct 38 ms 9388 KB Output is correct
44 Correct 42 ms 9344 KB Output is correct
45 Correct 37 ms 9072 KB Output is correct
46 Correct 37 ms 9468 KB Output is correct
47 Correct 38 ms 9480 KB Output is correct