oj.uz

Submission #812588

# Submission time Handle Problem Language Result Execution time Memory
812588 2023-08-07T09:26:48 Z abcvuitunggio Mutating DNA (IOI21_dna) C++17
100 / 100
 33 ms 7376 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
int s[100001][3][3],cnt[3][3],n,res,d[3];
void init(string a, string b){
    n=a.length();
    for (int i=0;i<n;i++){
        if (a[i]=='T')
            a[i]='B';
        if (b[i]=='T')
            b[i]='B';
        for (int j=0;j<3;j++)
            for (int k=0;k<3;k++)
                s[i][j][k]=s[i-1][j][k];
        s[i][a[i]-'A'][b[i]-'A']++;
        for (int j=0;j<3;j++)
            s[i][j][j]=0;
    }
}
int get_distance(int x, int y){
    for (int i=0;i<3;i++)
        for (int j=0;j<3;j++)
            cnt[i][j]=s[y][i][j]-(x?s[x-1][i][j]:0);
    res=0;
    for (int i=0;i<3;i++)
        for (int j=i+1;j<3;j++){
            int val=min(cnt[i][j],cnt[j][i]);
            cnt[i][j]-=val;
            cnt[j][i]-=val;
            res+=val;
        }
    int mx=0;
    d[0]=d[1]=d[2]=0;
    for (int i=0;i<3;i++)
        for (int j=0;j<3;j++){
            d[i]+=cnt[i][j];
            d[j]-=cnt[i][j];
            mx=max(mx,cnt[i][j]);
        }
    if (d[0]|d[1]|d[2])
        return -1;
	return mx*2+res;
}

Compilation message

dna.cpp: In function 'int get_distance(int, int)':
dna.cpp:40:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   40 |     if (d[0]|d[1]|d[2])
      |     ^~
dna.cpp:42:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   42 |  return mx*2+res;
      |  ^~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 6924 KB Output is correct
2 Correct 28 ms 6984 KB Output is correct
3 Correct 27 ms 6624 KB Output is correct
4 Correct 28 ms 7036 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 308 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4436 KB Output is correct
5 Correct 4 ms 4564 KB Output is correct
6 Correct 4 ms 4540 KB Output is correct
7 Correct 3 ms 4308 KB Output is correct
8 Correct 4 ms 4564 KB Output is correct
9 Correct 4 ms 4520 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4436 KB Output is correct
5 Correct 4 ms 4564 KB Output is correct
6 Correct 4 ms 4540 KB Output is correct
7 Correct 3 ms 4308 KB Output is correct
8 Correct 4 ms 4564 KB Output is correct
9 Correct 4 ms 4520 KB Output is correct
10 Correct 28 ms 6896 KB Output is correct
11 Correct 28 ms 7028 KB Output is correct
12 Correct 29 ms 7064 KB Output is correct
13 Correct 29 ms 7092 KB Output is correct
14 Correct 33 ms 7360 KB Output is correct
15 Correct 27 ms 7244 KB Output is correct
16 Correct 28 ms 6992 KB Output is correct
17 Correct 29 ms 7124 KB Output is correct
18 Correct 28 ms 7244 KB Output is correct
19 Correct 27 ms 6932 KB Output is correct
20 Correct 27 ms 7168 KB Output is correct
21 Correct 27 ms 7304 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4436 KB Output is correct
5 Correct 4 ms 4564 KB Output is correct
6 Correct 4 ms 4540 KB Output is correct
7 Correct 3 ms 4308 KB Output is correct
8 Correct 4 ms 4564 KB Output is correct
9 Correct 4 ms 4520 KB Output is correct
10 Correct 3 ms 4124 KB Output is correct
11 Correct 3 ms 4576 KB Output is correct
12 Correct 3 ms 4316 KB Output is correct
13 Correct 3 ms 4572 KB Output is correct
14 Correct 3 ms 4540 KB Output is correct
15 Correct 3 ms 4564 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 6924 KB Output is correct
2 Correct 28 ms 6984 KB Output is correct
3 Correct 27 ms 6624 KB Output is correct
4 Correct 28 ms 7036 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 4 ms 4436 KB Output is correct
12 Correct 4 ms 4564 KB Output is correct
13 Correct 4 ms 4540 KB Output is correct
14 Correct 3 ms 4308 KB Output is correct
15 Correct 4 ms 4564 KB Output is correct
16 Correct 4 ms 4520 KB Output is correct
17 Correct 28 ms 6896 KB Output is correct
18 Correct 28 ms 7028 KB Output is correct
19 Correct 29 ms 7064 KB Output is correct
20 Correct 29 ms 7092 KB Output is correct
21 Correct 33 ms 7360 KB Output is correct
22 Correct 27 ms 7244 KB Output is correct
23 Correct 28 ms 6992 KB Output is correct
24 Correct 29 ms 7124 KB Output is correct
25 Correct 28 ms 7244 KB Output is correct
26 Correct 27 ms 6932 KB Output is correct
27 Correct 27 ms 7168 KB Output is correct
28 Correct 27 ms 7304 KB Output is correct
29 Correct 3 ms 4124 KB Output is correct
30 Correct 3 ms 4576 KB Output is correct
31 Correct 3 ms 4316 KB Output is correct
32 Correct 3 ms 4572 KB Output is correct
33 Correct 3 ms 4540 KB Output is correct
34 Correct 3 ms 4564 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 31 ms 6656 KB Output is correct
37 Correct 27 ms 7028 KB Output is correct
38 Correct 29 ms 7144 KB Output is correct
39 Correct 29 ms 7332 KB Output is correct
40 Correct 30 ms 7376 KB Output is correct
41 Correct 3 ms 4544 KB Output is correct
42 Correct 30 ms 7060 KB Output is correct
43 Correct 28 ms 7280 KB Output is correct
44 Correct 28 ms 7256 KB Output is correct
45 Correct 27 ms 7040 KB Output is correct
46 Correct 28 ms 7284 KB Output is correct
47 Correct 28 ms 7288 KB Output is correct