oj.uz

Submission #812603

# Submission time Handle Problem Language Result Execution time Memory
812603 2023-08-07T09:29:51 Z abcvuitunggio Mutating DNA (IOI21_dna) C++17
100 / 100
 39 ms 6044 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
int s[100001][3][3],cnt[3][3],n,res,d[3],mx;
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']++;
    }
}
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=mx=0;
    d[0]=d[1]=d[2]=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;
            mx=max(mx,max(cnt[i][j],cnt[j][i]));
            d[i]+=cnt[i][j]-cnt[j][i];
            d[j]+=cnt[j][i]-cnt[i][j];
        }
	return (d[0]|d[1]|d[2]?-1:mx*2+res);
}

Compilation message

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

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 5608 KB Output is correct
2 Correct 27 ms 5644 KB Output is correct
3 Correct 27 ms 5364 KB Output is correct
4 Correct 28 ms 5664 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 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4308 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 5 ms 4308 KB Output is correct
7 Correct 3 ms 4052 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4308 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 5 ms 4308 KB Output is correct
7 Correct 3 ms 4052 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 27 ms 5672 KB Output is correct
11 Correct 27 ms 5652 KB Output is correct
12 Correct 29 ms 5792 KB Output is correct
13 Correct 28 ms 5872 KB Output is correct
14 Correct 28 ms 5956 KB Output is correct
15 Correct 39 ms 5896 KB Output is correct
16 Correct 27 ms 5784 KB Output is correct
17 Correct 28 ms 5840 KB Output is correct
18 Correct 28 ms 5992 KB Output is correct
19 Correct 26 ms 5792 KB Output is correct
20 Correct 36 ms 5936 KB Output is correct
21 Correct 26 ms 6044 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4308 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 5 ms 4308 KB Output is correct
7 Correct 3 ms 4052 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 3 ms 4004 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Correct 3 ms 4052 KB Output is correct
13 Correct 3 ms 4308 KB Output is correct
14 Correct 3 ms 4308 KB Output is correct
15 Correct 4 ms 4308 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 5608 KB Output is correct
2 Correct 27 ms 5644 KB Output is correct
3 Correct 27 ms 5364 KB Output is correct
4 Correct 28 ms 5664 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 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 5 ms 4308 KB Output is correct
12 Correct 3 ms 4308 KB Output is correct
13 Correct 5 ms 4308 KB Output is correct
14 Correct 3 ms 4052 KB Output is correct
15 Correct 3 ms 4308 KB Output is correct
16 Correct 3 ms 4308 KB Output is correct
17 Correct 27 ms 5672 KB Output is correct
18 Correct 27 ms 5652 KB Output is correct
19 Correct 29 ms 5792 KB Output is correct
20 Correct 28 ms 5872 KB Output is correct
21 Correct 28 ms 5956 KB Output is correct
22 Correct 39 ms 5896 KB Output is correct
23 Correct 27 ms 5784 KB Output is correct
24 Correct 28 ms 5840 KB Output is correct
25 Correct 28 ms 5992 KB Output is correct
26 Correct 26 ms 5792 KB Output is correct
27 Correct 36 ms 5936 KB Output is correct
28 Correct 26 ms 6044 KB Output is correct
29 Correct 3 ms 4004 KB Output is correct
30 Correct 3 ms 4308 KB Output is correct
31 Correct 3 ms 4052 KB Output is correct
32 Correct 3 ms 4308 KB Output is correct
33 Correct 3 ms 4308 KB Output is correct
34 Correct 4 ms 4308 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 27 ms 5376 KB Output is correct
37 Correct 28 ms 5624 KB Output is correct
38 Correct 28 ms 5788 KB Output is correct
39 Correct 28 ms 6028 KB Output is correct
40 Correct 28 ms 6020 KB Output is correct
41 Correct 3 ms 4308 KB Output is correct
42 Correct 27 ms 5828 KB Output is correct
43 Correct 29 ms 6032 KB Output is correct
44 Correct 27 ms 6032 KB Output is correct
45 Correct 26 ms 5828 KB Output is correct
46 Correct 26 ms 6032 KB Output is correct
47 Correct 26 ms 6028 KB Output is correct