oj.uz

Submission #832114

# Submission time Handle Problem Language Result Execution time Memory
832114 2023-08-21T01:13:16 Z minhcool Mutating DNA (IOI21_dna) C++17
100 / 100
 37 ms 9676 KB 
//#define local
#ifndef local
#include "dna.h"
#endif
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 1e5 + 5;

const int oo = 1e18 + 7, mod = 1e9 + 7;

mt19937 rng(1);

int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}

int n, pref1[N][3], pref2[N][3], pref3[N][3][3];

char c[] = {'C', 'A', 'T'};

void init(string a, string b) {
    n = a.length();
    a = '*' + a, b = '*' + b;
    //cout << "OK\n";
    //cout << a.length() << " " << b.length() << "\n";
    //return;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j < 3; j++){
            pref1[i][j] = pref1[i - 1][j] + (a[i] == c[j]);
            pref2[i][j] = pref2[i - 1][j] + (b[i] == c[j]);
            for(int k = 0; k < 3; k++){
                pref3[i][j][k] = pref3[i - 1][j][k] + (a[i] == c[j] && b[i] == c[k]);
            }
        }
    }
}

int get_distance(int x, int y) {
    //return 0;
    x++, y++;
    for(int i = 0; i < 3; i++) if((pref1[y][i] - pref1[x - 1][i]) != (pref2[y][i] - pref2[x - 1][i])) return -1;
    int ca = (pref3[y][0][1] - pref3[x - 1][0][1]);
    int ct = (pref3[y][0][2] - pref3[x - 1][0][2]);
    int ac = (pref3[y][1][0] - pref3[x - 1][1][0]);
    int at = (pref3[y][1][2] - pref3[x - 1][1][2]);
    int tc = (pref3[y][2][0] - pref3[x - 1][2][0]);
    int ta = (pref3[y][2][1] - pref3[x - 1][2][1]);
    int answer = 0;
    int temp = min(ac, ca);
    ac -= temp, ca -= temp; answer += temp;
    temp = min(at, ta);
    at -= temp, ta -= temp, answer += temp;
    temp = min(ct, tc);
    ct -= temp, tc -= temp, answer += temp;
    //cout << ac << " " << ct << " " << ta << "\n";
    //cout << ca << " " << at << " " << tc << "\n";
    //assert(ac == ct && ct == ta);
    answer += ac * 2;
    //assert(ca == at && at == tc);
    answer += ca * 2;
    return answer;
	//return 0;
}

#ifdef local
void process(){

}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
    process();
}
#endif

Compilation message

dna.cpp:22:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   22 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 9420 KB Output is correct
2 Correct 28 ms 9420 KB Output is correct
3 Correct 27 ms 8812 KB Output is correct
4 Correct 28 ms 9408 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 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 1 ms 212 KB Output is correct
3 Correct 0 ms 308 KB Output is correct
4 Correct 5 ms 6980 KB Output is correct
5 Correct 5 ms 7128 KB Output is correct
6 Correct 5 ms 7108 KB Output is correct
7 Correct 5 ms 6620 KB Output is correct
8 Correct 6 ms 7124 KB Output is correct
9 Correct 5 ms 7124 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 1 ms 212 KB Output is correct
3 Correct 0 ms 308 KB Output is correct
4 Correct 5 ms 6980 KB Output is correct
5 Correct 5 ms 7128 KB Output is correct
6 Correct 5 ms 7108 KB Output is correct
7 Correct 5 ms 6620 KB Output is correct
8 Correct 6 ms 7124 KB Output is correct
9 Correct 5 ms 7124 KB Output is correct
10 Correct 28 ms 9308 KB Output is correct
11 Correct 28 ms 9420 KB Output is correct
12 Correct 28 ms 9252 KB Output is correct
13 Correct 29 ms 9404 KB Output is correct
14 Correct 29 ms 9676 KB Output is correct
15 Correct 28 ms 9632 KB Output is correct
16 Correct 32 ms 9228 KB Output is correct
17 Correct 28 ms 9312 KB Output is correct
18 Correct 28 ms 9648 KB Output is correct
19 Correct 27 ms 9172 KB Output is correct
20 Correct 28 ms 9304 KB Output is correct
21 Correct 28 ms 9660 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 1 ms 212 KB Output is correct
3 Correct 0 ms 308 KB Output is correct
4 Correct 5 ms 6980 KB Output is correct
5 Correct 5 ms 7128 KB Output is correct
6 Correct 5 ms 7108 KB Output is correct
7 Correct 5 ms 6620 KB Output is correct
8 Correct 6 ms 7124 KB Output is correct
9 Correct 5 ms 7124 KB Output is correct
10 Correct 5 ms 6484 KB Output is correct
11 Correct 5 ms 7112 KB Output is correct
12 Correct 6 ms 6740 KB Output is correct
13 Correct 5 ms 7092 KB Output is correct
14 Correct 5 ms 7140 KB Output is correct
15 Correct 5 ms 7124 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 9420 KB Output is correct
2 Correct 28 ms 9420 KB Output is correct
3 Correct 27 ms 8812 KB Output is correct
4 Correct 28 ms 9408 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 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 308 KB Output is correct
11 Correct 5 ms 6980 KB Output is correct
12 Correct 5 ms 7128 KB Output is correct
13 Correct 5 ms 7108 KB Output is correct
14 Correct 5 ms 6620 KB Output is correct
15 Correct 6 ms 7124 KB Output is correct
16 Correct 5 ms 7124 KB Output is correct
17 Correct 28 ms 9308 KB Output is correct
18 Correct 28 ms 9420 KB Output is correct
19 Correct 28 ms 9252 KB Output is correct
20 Correct 29 ms 9404 KB Output is correct
21 Correct 29 ms 9676 KB Output is correct
22 Correct 28 ms 9632 KB Output is correct
23 Correct 32 ms 9228 KB Output is correct
24 Correct 28 ms 9312 KB Output is correct
25 Correct 28 ms 9648 KB Output is correct
26 Correct 27 ms 9172 KB Output is correct
27 Correct 28 ms 9304 KB Output is correct
28 Correct 28 ms 9660 KB Output is correct
29 Correct 5 ms 6484 KB Output is correct
30 Correct 5 ms 7112 KB Output is correct
31 Correct 6 ms 6740 KB Output is correct
32 Correct 5 ms 7092 KB Output is correct
33 Correct 5 ms 7140 KB Output is correct
34 Correct 5 ms 7124 KB Output is correct
35 Correct 0 ms 312 KB Output is correct
36 Correct 27 ms 8864 KB Output is correct
37 Correct 28 ms 9428 KB Output is correct
38 Correct 29 ms 9272 KB Output is correct
39 Correct 29 ms 9660 KB Output is correct
40 Correct 29 ms 9668 KB Output is correct
41 Correct 5 ms 7124 KB Output is correct
42 Correct 28 ms 9296 KB Output is correct
43 Correct 28 ms 9604 KB Output is correct
44 Correct 28 ms 9660 KB Output is correct
45 Correct 28 ms 9276 KB Output is correct
46 Correct 28 ms 9632 KB Output is correct
47 Correct 28 ms 9660 KB Output is correct