oj.uz

Submission #437177

# Submission time Handle Problem Language Result Execution time Memory
437177 2021-06-26T01:26:00 Z flashhh Mutating DNA (IOI21_dna) C++17
100 / 100
 40 ms 5188 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define tii tuple<int,int,int>
#define fi first
#define se second
#define bp __builtin_popcount
#define nmax 100010
#define pb emplace_back

int getbit(ll x,int y)
{
    return (x>>y)&1;
}
ll getoff(ll x,int y)
{
    return x^((1ll)<<y);
}

using namespace std;

struct node
{
    int AT,AC,TA,TC,CA,CT;
    node() {}
};

int n,q;
string a,b;
node pre[nmax];

void init(string aa,string bb)
{
    a=aa; b=bb;
    n=a.length();

    for (int i=0;i<n;++i)
    {
        pre[i]=pre[i-1];
        if (a[i]=='A')
        {
            if (b[i]=='C') ++pre[i].AC;
            else if (b[i]=='T') ++pre[i].AT;
        }
        else if (a[i]=='C')
        {
            if (b[i]=='A') ++pre[i].CA;
            else if (b[i]=='T') ++pre[i].CT;
        }
        else if (a[i]=='T')
        {
            if (b[i]=='A') ++pre[i].TA;
            else if (b[i]=='C') ++pre[i].TC;
        }
    }
}
int get_distance(int x,int y)
{
    int AC=pre[y].AC-pre[x-1].AC;
    int AT=pre[y].AT-pre[x-1].AT;

    int CA=pre[y].CA-pre[x-1].CA;
    int CT=pre[y].CT-pre[x-1].CT;
    int TA=pre[y].TA-pre[x-1].TA;
    int TC=pre[y].TC-pre[x-1].TC;

    if (AC+AT!=CA+TA) return -1;
    if (CA+CT!=AC+TC) return -1;
    if (TA+TC!=AT+CT) return -1;

    int ans1=AC+AT;

    if (AC>CA) ans1+=CT;
    else if (AT>TA) ans1+=TC;
    else ans1+=CT;

    int res=ans1;
    return res;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 4676 KB Output is correct
2 Correct 38 ms 4668 KB Output is correct
3 Correct 38 ms 4440 KB Output is correct
4 Correct 37 ms 4676 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 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 1 ms 204 KB Output is correct
4 Correct 5 ms 3276 KB Output is correct
5 Correct 5 ms 3364 KB Output is correct
6 Correct 4 ms 3276 KB Output is correct
7 Correct 4 ms 3148 KB Output is correct
8 Correct 4 ms 3432 KB Output is correct
9 Correct 4 ms 3404 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 1 ms 204 KB Output is correct
4 Correct 5 ms 3276 KB Output is correct
5 Correct 5 ms 3364 KB Output is correct
6 Correct 4 ms 3276 KB Output is correct
7 Correct 4 ms 3148 KB Output is correct
8 Correct 4 ms 3432 KB Output is correct
9 Correct 4 ms 3404 KB Output is correct
10 Correct 37 ms 4672 KB Output is correct
11 Correct 38 ms 4672 KB Output is correct
12 Correct 40 ms 4896 KB Output is correct
13 Correct 39 ms 4920 KB Output is correct
14 Correct 38 ms 5160 KB Output is correct
15 Correct 38 ms 5056 KB Output is correct
16 Correct 36 ms 4896 KB Output is correct
17 Correct 36 ms 4956 KB Output is correct
18 Correct 38 ms 5056 KB Output is correct
19 Correct 34 ms 4932 KB Output is correct
20 Correct 38 ms 5044 KB Output is correct
21 Correct 34 ms 5188 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 1 ms 204 KB Output is correct
4 Correct 5 ms 3276 KB Output is correct
5 Correct 5 ms 3364 KB Output is correct
6 Correct 4 ms 3276 KB Output is correct
7 Correct 4 ms 3148 KB Output is correct
8 Correct 4 ms 3432 KB Output is correct
9 Correct 4 ms 3404 KB Output is correct
10 Correct 4 ms 3040 KB Output is correct
11 Correct 5 ms 3404 KB Output is correct
12 Correct 4 ms 3148 KB Output is correct
13 Correct 4 ms 3404 KB Output is correct
14 Correct 7 ms 3404 KB Output is correct
15 Correct 4 ms 3308 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 4676 KB Output is correct
2 Correct 38 ms 4668 KB Output is correct
3 Correct 38 ms 4440 KB Output is correct
4 Correct 37 ms 4676 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 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 1 ms 204 KB Output is correct
11 Correct 5 ms 3276 KB Output is correct
12 Correct 5 ms 3364 KB Output is correct
13 Correct 4 ms 3276 KB Output is correct
14 Correct 4 ms 3148 KB Output is correct
15 Correct 4 ms 3432 KB Output is correct
16 Correct 4 ms 3404 KB Output is correct
17 Correct 37 ms 4672 KB Output is correct
18 Correct 38 ms 4672 KB Output is correct
19 Correct 40 ms 4896 KB Output is correct
20 Correct 39 ms 4920 KB Output is correct
21 Correct 38 ms 5160 KB Output is correct
22 Correct 38 ms 5056 KB Output is correct
23 Correct 36 ms 4896 KB Output is correct
24 Correct 36 ms 4956 KB Output is correct
25 Correct 38 ms 5056 KB Output is correct
26 Correct 34 ms 4932 KB Output is correct
27 Correct 38 ms 5044 KB Output is correct
28 Correct 34 ms 5188 KB Output is correct
29 Correct 4 ms 3040 KB Output is correct
30 Correct 5 ms 3404 KB Output is correct
31 Correct 4 ms 3148 KB Output is correct
32 Correct 4 ms 3404 KB Output is correct
33 Correct 7 ms 3404 KB Output is correct
34 Correct 4 ms 3308 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 38 ms 4456 KB Output is correct
37 Correct 38 ms 4676 KB Output is correct
38 Correct 38 ms 4904 KB Output is correct
39 Correct 38 ms 5056 KB Output is correct
40 Correct 39 ms 5040 KB Output is correct
41 Correct 3 ms 3404 KB Output is correct
42 Correct 38 ms 4932 KB Output is correct
43 Correct 36 ms 5132 KB Output is correct
44 Correct 37 ms 5076 KB Output is correct
45 Correct 35 ms 4932 KB Output is correct
46 Correct 34 ms 5180 KB Output is correct
47 Correct 35 ms 5116 KB Output is correct