oj.uz

Submission #722200

# Submission time Handle Problem Language Result Execution time Memory
722200 2023-04-11T14:59:35 Z Yell0 Mutating DNA (IOI21_dna) C++17
100 / 100
 57 ms 10108 KB 
#include <bits/stdc++.h>
 
using namespace std;
const int MN=1e5+2;
int N,pfa[2][MN],pfc[2][MN],pft[2][MN],pfsw[3][3][MN];
string S[2];

void init(string a,string b) {
  N=a.size();
  S[0]=a,S[1]=b;
  for(int i=1;i<=N;++i)
    for(int j=0;j<2;++j) {
      pfa[j][i]=pfa[j][i-1]+(S[j][i-1]=='A');
      pfc[j][i]=pfc[j][i-1]+(S[j][i-1]=='C');
      pft[j][i]=pft[j][i-1]+(S[j][i-1]=='T');
    }
  for(int i=1;i<=N;++i) {
    char xc=S[0][i-1],yc=S[1][i-1];
    int x=(xc=='A'?0:(xc=='C'?1:2)),y=(yc=='A'?0:(yc=='C'?1:2));
    for(int k=0;k<3;++k) for(int l=0;l<3;++l) pfsw[k][l][i]=pfsw[k][l][i-1]+(k==x&&l==y);
  }
}

int get_distance(int x,int y) {
  ++x,++y;
  if(pfa[0][y]-pfa[0][x-1]!=pfa[1][y]-pfa[1][x-1]||pfc[0][y]-pfc[0][x-1]!=pfc[1][y]-pfc[1][x-1]||pft[0][y]-pft[0][x-1]!=pft[1][y]-pft[1][x-1]) return -1;
  int ans=0,sw[3][3],tsw=0;
  for(int k=0;k<3;++k) for(int l=0;l<3;++l) {
    if(k==l) continue;
    sw[k][l]=pfsw[k][l][y]-pfsw[k][l][x-1];
    tsw+=sw[k][l];
  }
  for(int k=0;k<3;++k) for(int l=k+1;l<3;++l) {
    ans+=min(sw[k][l],sw[l][k]);
    tsw-=min(sw[k][l],sw[l][k])*2;
  }
  ans+=tsw*2/3;
  return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 8276 KB Output is correct
2 Correct 39 ms 9644 KB Output is correct
3 Correct 39 ms 9112 KB Output is correct
4 Correct 41 ms 9584 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 6 ms 6868 KB Output is correct
5 Correct 6 ms 7124 KB Output is correct
6 Correct 7 ms 7124 KB Output is correct
7 Correct 8 ms 6736 KB Output is correct
8 Correct 7 ms 7120 KB Output is correct
9 Correct 8 ms 7124 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 6 ms 6868 KB Output is correct
5 Correct 6 ms 7124 KB Output is correct
6 Correct 7 ms 7124 KB Output is correct
7 Correct 8 ms 6736 KB Output is correct
8 Correct 7 ms 7120 KB Output is correct
9 Correct 8 ms 7124 KB Output is correct
10 Correct 42 ms 9592 KB Output is correct
11 Correct 57 ms 9660 KB Output is correct
12 Correct 43 ms 9484 KB Output is correct
13 Correct 39 ms 9644 KB Output is correct
14 Correct 40 ms 9904 KB Output is correct
15 Correct 55 ms 9904 KB Output is correct
16 Correct 52 ms 9420 KB Output is correct
17 Correct 38 ms 9652 KB Output is correct
18 Correct 42 ms 9904 KB Output is correct
19 Correct 38 ms 9408 KB Output is correct
20 Correct 45 ms 9648 KB Output is correct
21 Correct 34 ms 9872 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 6 ms 6868 KB Output is correct
5 Correct 6 ms 7124 KB Output is correct
6 Correct 7 ms 7124 KB Output is correct
7 Correct 8 ms 6736 KB Output is correct
8 Correct 7 ms 7120 KB Output is correct
9 Correct 8 ms 7124 KB Output is correct
10 Correct 8 ms 6612 KB Output is correct
11 Correct 10 ms 7124 KB Output is correct
12 Correct 7 ms 6696 KB Output is correct
13 Correct 7 ms 7100 KB Output is correct
14 Correct 7 ms 7100 KB Output is correct
15 Correct 7 ms 7232 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 8276 KB Output is correct
2 Correct 39 ms 9644 KB Output is correct
3 Correct 39 ms 9112 KB Output is correct
4 Correct 41 ms 9584 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 6 ms 6868 KB Output is correct
12 Correct 6 ms 7124 KB Output is correct
13 Correct 7 ms 7124 KB Output is correct
14 Correct 8 ms 6736 KB Output is correct
15 Correct 7 ms 7120 KB Output is correct
16 Correct 8 ms 7124 KB Output is correct
17 Correct 42 ms 9592 KB Output is correct
18 Correct 57 ms 9660 KB Output is correct
19 Correct 43 ms 9484 KB Output is correct
20 Correct 39 ms 9644 KB Output is correct
21 Correct 40 ms 9904 KB Output is correct
22 Correct 55 ms 9904 KB Output is correct
23 Correct 52 ms 9420 KB Output is correct
24 Correct 38 ms 9652 KB Output is correct
25 Correct 42 ms 9904 KB Output is correct
26 Correct 38 ms 9408 KB Output is correct
27 Correct 45 ms 9648 KB Output is correct
28 Correct 34 ms 9872 KB Output is correct
29 Correct 8 ms 6612 KB Output is correct
30 Correct 10 ms 7124 KB Output is correct
31 Correct 7 ms 6696 KB Output is correct
32 Correct 7 ms 7100 KB Output is correct
33 Correct 7 ms 7100 KB Output is correct
34 Correct 7 ms 7232 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 38 ms 9064 KB Output is correct
37 Correct 44 ms 9592 KB Output is correct
38 Correct 53 ms 9608 KB Output is correct
39 Correct 44 ms 9916 KB Output is correct
40 Correct 40 ms 10108 KB Output is correct
41 Correct 8 ms 7124 KB Output is correct
42 Correct 51 ms 9492 KB Output is correct
43 Correct 37 ms 9864 KB Output is correct
44 Correct 39 ms 9896 KB Output is correct
45 Correct 38 ms 9508 KB Output is correct
46 Correct 37 ms 9896 KB Output is correct
47 Correct 39 ms 9952 KB Output is correct