oj.uz

Submission #885982

# Submission time Handle Problem Language Result Execution time Memory
885982 2023-12-11T09:28:20 Z epicci23 Mutating DNA (IOI21_dna) C++17
100 / 100
 33 ms 9752 KB 
#include "dna.h"
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())

/*
 2. asama icin notlar:
   1 - sinav baslayinca her problemi oku
   en kolay gozukeni cozmeye basla

   2 - bir soruya takilma
   wa aliyorsan ve sorunu bulamadiysan hemen diger probleme gec

   3 - her problemle ugras

   4 - cozebildigin subtasklari impl et ve puanini arttir

   5 - eger tum problemlerle ugrastiysan ve yapacagin bir sey kalmadi ise
   random observationlar dene veya brute force atip pattern bulmaya calis
*/


vector<array<array<int,3>,3>> pre;
vector<array<int,3>> cnt1,cnt2;

int f(char x){
  if(x=='A') return 0;
  if(x=='T') return 1;
  return 2;
}

void init(string a,string b){
  array<array<int,3>,3> cur;
  array<int,3> cr1,cr2;

  for(int i=0;i<3;i++)
  	for(int j=0;j<3;j++)
  		cr1[i]=cr2[i]=cur[i][j]=0;

  int n = sz(a);
  pre.resize(n);
  cnt1.resize(n);
  cnt2.resize(n);

  for(int i=0;i<n;i++){
    array<int,2> val={f(a[i]),f(b[i])};
    cur[val[0]][val[1]]++;
    
    cr1[f(a[i])]++;
    cr2[f(b[i])]++;

    pre[i]=cur;
    cnt1[i]=cr1;
    cnt2[i]=cr2;
  }
}

int get_distance(int x,int y){

   array<array<int,3>,3> res=pre[y];
   array<int,3> cnt_a=cnt1[y];
   array<int,3> cnt_b=cnt2[y];

   if(x>0){
     for(int i=0;i<3;i++)
     	for(int j=0;j<3;j++)
     	  res[i][j]-=pre[x-1][i][j];

     for(int i=0;i<3;i++){
       cnt_a[i]-=cnt1[x-1][i];
       cnt_b[i]-=cnt2[x-1][i];
     }
   }

   if(cnt_a!=cnt_b) return -1;

   int cur=min(res[0][2],res[2][0]);
   int ans=cur;

   res[0][2]-=cur;
   res[2][0]-=cur;
   
   cur=min(res[0][1],res[1][0]);
   ans+=cur;

   res[0][1]-=cur;
   res[1][0]-=cur;

   cur=min(res[1][2],res[2][1]);
   ans+=cur;

   res[1][2]-=cur;
   res[2][1]-=cur;

   int c1=min({res[0][1],res[1][2],res[2][0]});
   int c2=min({res[0][2],res[2][1],res[1][0]});

   if(c1>0 && c2>0) return -1;

   ans+=c1*2;
   ans+=c2*2;

   return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 7964 KB Output is correct
2 Correct 29 ms 8028 KB Output is correct
3 Correct 28 ms 7456 KB Output is correct
4 Correct 33 ms 8028 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 0 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 4 ms 6748 KB Output is correct
5 Correct 4 ms 6748 KB Output is correct
6 Correct 4 ms 6748 KB Output is correct
7 Correct 4 ms 6236 KB Output is correct
8 Correct 5 ms 6748 KB Output is correct
9 Correct 4 ms 6744 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 4 ms 6748 KB Output is correct
5 Correct 4 ms 6748 KB Output is correct
6 Correct 4 ms 6748 KB Output is correct
7 Correct 4 ms 6236 KB Output is correct
8 Correct 5 ms 6748 KB Output is correct
9 Correct 4 ms 6744 KB Output is correct
10 Correct 28 ms 7964 KB Output is correct
11 Correct 31 ms 8020 KB Output is correct
12 Correct 28 ms 7932 KB Output is correct
13 Correct 30 ms 8216 KB Output is correct
14 Correct 29 ms 8460 KB Output is correct
15 Correct 28 ms 8464 KB Output is correct
16 Correct 29 ms 7968 KB Output is correct
17 Correct 29 ms 8228 KB Output is correct
18 Correct 28 ms 8520 KB Output is correct
19 Correct 27 ms 7976 KB Output is correct
20 Correct 28 ms 8272 KB Output is correct
21 Correct 28 ms 8472 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 4 ms 6748 KB Output is correct
5 Correct 4 ms 6748 KB Output is correct
6 Correct 4 ms 6748 KB Output is correct
7 Correct 4 ms 6236 KB Output is correct
8 Correct 5 ms 6748 KB Output is correct
9 Correct 4 ms 6744 KB Output is correct
10 Correct 4 ms 6236 KB Output is correct
11 Correct 4 ms 6748 KB Output is correct
12 Correct 4 ms 6236 KB Output is correct
13 Correct 4 ms 7000 KB Output is correct
14 Correct 5 ms 7004 KB Output is correct
15 Correct 4 ms 7100 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 7964 KB Output is correct
2 Correct 29 ms 8028 KB Output is correct
3 Correct 28 ms 7456 KB Output is correct
4 Correct 33 ms 8028 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 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 4 ms 6748 KB Output is correct
12 Correct 4 ms 6748 KB Output is correct
13 Correct 4 ms 6748 KB Output is correct
14 Correct 4 ms 6236 KB Output is correct
15 Correct 5 ms 6748 KB Output is correct
16 Correct 4 ms 6744 KB Output is correct
17 Correct 28 ms 7964 KB Output is correct
18 Correct 31 ms 8020 KB Output is correct
19 Correct 28 ms 7932 KB Output is correct
20 Correct 30 ms 8216 KB Output is correct
21 Correct 29 ms 8460 KB Output is correct
22 Correct 28 ms 8464 KB Output is correct
23 Correct 29 ms 7968 KB Output is correct
24 Correct 29 ms 8228 KB Output is correct
25 Correct 28 ms 8520 KB Output is correct
26 Correct 27 ms 7976 KB Output is correct
27 Correct 28 ms 8272 KB Output is correct
28 Correct 28 ms 8472 KB Output is correct
29 Correct 4 ms 6236 KB Output is correct
30 Correct 4 ms 6748 KB Output is correct
31 Correct 4 ms 6236 KB Output is correct
32 Correct 4 ms 7000 KB Output is correct
33 Correct 5 ms 7004 KB Output is correct
34 Correct 4 ms 7100 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 28 ms 8788 KB Output is correct
37 Correct 29 ms 9488 KB Output is correct
38 Correct 29 ms 9348 KB Output is correct
39 Correct 30 ms 9740 KB Output is correct
40 Correct 29 ms 9752 KB Output is correct
41 Correct 4 ms 7004 KB Output is correct
42 Correct 30 ms 9452 KB Output is correct
43 Correct 29 ms 9740 KB Output is correct
44 Correct 28 ms 9744 KB Output is correct
45 Correct 30 ms 9508 KB Output is correct
46 Correct 28 ms 9740 KB Output is correct
47 Correct 28 ms 9740 KB Output is correct