oj.uz

Submission #965517

# Submission time Handle Problem Language Result Execution time Memory
965517 2024-04-18T18:48:37 Z marinaluca Mutating DNA (IOI21_dna) C++17
100 / 100
 30 ms 5468 KB 
#include <bits/stdc++.h>

#pragma GCC optimize ("O4")
#pragma GCC optimize ("fast-math")
#pragma GCC optimize ("unroll-loops")

using namespace std;
//#define int long long
#define ll long long
#define xx first
#define yy second

const int NMAX = 1e5;
int at[NMAX + 5], t[NMAX + 5], c[NMAX + 5];
int v[NMAX + 5];

string a, b;
void init (string as, string bs){
    int n = as.length();
    a = as;
    b = bs;
    for (int i = 1; i <= n; ++ i){
        at[i] = at[i - 1];
        t[i] = t[i - 1];
        c[i] = c[i - 1];
        v[i] = v[i - 1];
        if (a[i - 1] == b[i - 1])
            v[i] ++;
        else if (a[i - 1] == 'A' && b[i - 1] == 'T')
            at[i] ++;
        else if (a[i - 1] == 'T' && b[i - 1] == 'A')
            at[i] --;
        else if (a[i - 1] == 'T' && b[i - 1] == 'C')
            t[i] ++;
        else if (a[i - 1] == 'C' && b[i - 1] == 'T')
            t[i] --;
        else if (a[i - 1] == 'C' && b[i - 1] == 'A')
            c[i] ++;
        else
            c[i] --;
    }
}

int get_distance(int x, int y){
    y ++;
    int unu = at[y] - at[x];
    int doi = t[y] - t[x];
    int trei = c[y] - c[x];
    if (unu != doi || unu != trei)
        return -1;
    int val = abs (unu) * 2;
    int ans = y - x;
    ans -= (v[y] - v[x]);
    ans -= abs(unu) * 3;
    val += ans / 2;
    return val;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 3928 KB Output is correct
2 Correct 24 ms 4684 KB Output is correct
3 Correct 24 ms 4432 KB Output is correct
4 Correct 28 ms 4688 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 3 ms 2744 KB Output is correct
6 Correct 2 ms 2756 KB Output is correct
7 Correct 3 ms 2652 KB Output is correct
8 Correct 3 ms 2860 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 3 ms 2744 KB Output is correct
6 Correct 2 ms 2756 KB Output is correct
7 Correct 3 ms 2652 KB Output is correct
8 Correct 3 ms 2860 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 26 ms 4852 KB Output is correct
11 Correct 24 ms 4944 KB Output is correct
12 Correct 29 ms 5268 KB Output is correct
13 Correct 26 ms 4944 KB Output is correct
14 Correct 26 ms 5212 KB Output is correct
15 Correct 24 ms 4472 KB Output is correct
16 Correct 26 ms 5204 KB Output is correct
17 Correct 24 ms 4816 KB Output is correct
18 Correct 30 ms 5204 KB Output is correct
19 Correct 24 ms 5468 KB Output is correct
20 Correct 24 ms 5040 KB Output is correct
21 Correct 24 ms 5212 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 3 ms 2744 KB Output is correct
6 Correct 2 ms 2756 KB Output is correct
7 Correct 3 ms 2652 KB Output is correct
8 Correct 3 ms 2860 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 3 ms 2652 KB Output is correct
11 Correct 3 ms 2908 KB Output is correct
12 Correct 4 ms 2504 KB Output is correct
13 Correct 3 ms 2908 KB Output is correct
14 Correct 3 ms 2652 KB Output is correct
15 Correct 2 ms 2908 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 3928 KB Output is correct
2 Correct 24 ms 4684 KB Output is correct
3 Correct 24 ms 4432 KB Output is correct
4 Correct 28 ms 4688 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 3 ms 2744 KB Output is correct
13 Correct 2 ms 2756 KB Output is correct
14 Correct 3 ms 2652 KB Output is correct
15 Correct 3 ms 2860 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 26 ms 4852 KB Output is correct
18 Correct 24 ms 4944 KB Output is correct
19 Correct 29 ms 5268 KB Output is correct
20 Correct 26 ms 4944 KB Output is correct
21 Correct 26 ms 5212 KB Output is correct
22 Correct 24 ms 4472 KB Output is correct
23 Correct 26 ms 5204 KB Output is correct
24 Correct 24 ms 4816 KB Output is correct
25 Correct 30 ms 5204 KB Output is correct
26 Correct 24 ms 5468 KB Output is correct
27 Correct 24 ms 5040 KB Output is correct
28 Correct 24 ms 5212 KB Output is correct
29 Correct 3 ms 2652 KB Output is correct
30 Correct 3 ms 2908 KB Output is correct
31 Correct 4 ms 2504 KB Output is correct
32 Correct 3 ms 2908 KB Output is correct
33 Correct 3 ms 2652 KB Output is correct
34 Correct 2 ms 2908 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 24 ms 4832 KB Output is correct
37 Correct 26 ms 5200 KB Output is correct
38 Correct 25 ms 4956 KB Output is correct
39 Correct 25 ms 4944 KB Output is correct
40 Correct 26 ms 5452 KB Output is correct
41 Correct 2 ms 3160 KB Output is correct
42 Correct 25 ms 5200 KB Output is correct
43 Correct 26 ms 5204 KB Output is correct
44 Correct 25 ms 5468 KB Output is correct
45 Correct 25 ms 5320 KB Output is correct
46 Correct 24 ms 5456 KB Output is correct
47 Correct 25 ms 5204 KB Output is correct