oj.uz

Submission #965064

# Submission time Handle Problem Language Result Execution time Memory
965064 2024-04-18T04:54:03 Z KasymK Mutating DNA (IOI21_dna) C++17
43 / 100
 1500 ms 3404 KB 
#include "dna.h"
#include "bits/stdc++.h"

using namespace std;

string s, s2;

void init(string a, string b){
    s = a, s2 = b;
}

int get_distance(int x, int y){
    if(y - x <= 2){
        int s_a = 0, s_c = 0, s_t = 0;
        int s2_a = 0, s2_c = 0, s2_t = 0;
        for(int i = x; i <= y; ++i){
            s_a += (s[i] == 'A');
            s_c += (s[i] == 'C');
            s_t += (s[i] == 'T');
            s2_a += (s2[i] == 'A');
            s2_c += (s2[i] == 'C');
            s2_t += (s2[i] == 'T');
        }
        if(s_a != s2_a or s_c != s2_c or s_t != s2_t)
            return -1;
        int ok = 1;
        for(int i = x; i <= y; ++i)
            ok &= (s[i] == s2[i]);
        if(ok)
            return 0;
        int ans = 0;
        for(int i = x; i <= y; ++i)
            ans += (s[i] != s2[i]);
        ans--;
        return ans;
    }
    // galan wagt dine 'A' we 'T' harplar bar
    int ans = 0;
    int s_a = 0, s_t = 0;
    int s2_a = 0, s2_t = 0;
    for(int i = x; i <= y; ++i){
        s_a += (s[i] == 'A');
        s_t += (s[i] == 'T');
        s2_a += (s2[i] == 'A');
        s2_t += (s2[i] == 'T');
    }

    if(s_a != s2_a or s_t != s2_t)
        return -1;

    for(int i = x; i <= y; ++i)
        ans += ((s[i] != s2[i]) or (s[i] != s2[i]));
    ans >>= 1;
    return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 2712 KB Output is correct
2 Correct 23 ms 3152 KB Output is correct
3 Correct 22 ms 3052 KB Output is correct
4 Correct 23 ms 3172 KB Output is correct
5 Correct 1 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 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 1112 KB Output is correct
5 Correct 2 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 2 ms 1176 KB Output is correct
8 Correct 3 ms 1112 KB Output is correct
9 Correct 3 ms 1164 KB Output is correct

Subtask #3
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 1112 KB Output is correct
5 Correct 2 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 2 ms 1176 KB Output is correct
8 Correct 3 ms 1112 KB Output is correct
9 Correct 3 ms 1164 KB Output is correct
10 Correct 27 ms 3084 KB Output is correct
11 Correct 26 ms 3404 KB Output is correct
12 Execution timed out 1519 ms 3176 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #4
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 1112 KB Output is correct
5 Correct 2 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 2 ms 1176 KB Output is correct
8 Correct 3 ms 1112 KB Output is correct
9 Correct 3 ms 1164 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Incorrect 1 ms 1116 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 2712 KB Output is correct
2 Correct 23 ms 3152 KB Output is correct
3 Correct 22 ms 3052 KB Output is correct
4 Correct 23 ms 3172 KB Output is correct
5 Correct 1 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 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 1112 KB Output is correct
12 Correct 2 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 2 ms 1176 KB Output is correct
15 Correct 3 ms 1112 KB Output is correct
16 Correct 3 ms 1164 KB Output is correct
17 Correct 27 ms 3084 KB Output is correct
18 Correct 26 ms 3404 KB Output is correct
19 Execution timed out 1519 ms 3176 KB Time limit exceeded
20 Halted 0 ms 0 KB -