Submission #970546

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
970546	2024-04-26T17:10:54 Z	NemanjaSo2005	Mutating DNA (IOI21_dna)	C++17	100 / 100	42 ms	23216 KB

#include "dna.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int mapa[130],N,v;
struct slog{
   int kol[5][5];
   slog operator + (const slog &a) const{
      slog ret;
      for(int i=0;i<=2;i++)
         for(int j=0;j<=2;j++)
            ret.kol[i][j]=kol[i][j]+a.kol[i][j];
      return ret;
   }
   slog operator - (const slog &a) const{
      slog ret;
      for(int i=0;i<=2;i++)
         for(int j=0;j<=2;j++)
            ret.kol[i][j]=kol[i][j]-a.kol[i][j];
      return ret;
   }
   void ispisi(){
      for(int i=0;i<=2;i++){
         for(int j=0;j<=2;j++)
            cout<<kol[i][j]<<" ";
         cout<<endl;
      }
   }
} niz[100005],prefiks[100005],tr;
void init(string a, string b){
   mapa['A']=0;
   mapa['T']=1;
   mapa['C']=2;
   N=a.size();
   a="."+a+"....";
   b="."+b+"....";
   for(int i=1;i<=N;i++)
      niz[i].kol[mapa[a[i]]][mapa[b[i]]]++;
   for(int i=1;i<=N;i++)
      prefiks[i]=prefiks[i-1]+niz[i];
  // for(int i=1;i<=N;i++){
     // cout<<i<<endl;
     // prefiks[i].ispisi();
   //}
   return;
}
bool nemoze(slog tr){
   ll vr=0;
   for(int i=0;i<=2;i++){
      vr+=tr.kol[0][i];
      vr-=tr.kol[i][0];
   }
   if(vr!=0)
      return true;
   for(int i=0;i<=2;i++){
      vr+=tr.kol[1][i];
      vr-=tr.kol[i][1];
   }
   if(vr!=0)
      return true;
   for(int i=0;i<=2;i++){
      vr+=tr.kol[2][i];
      vr-=tr.kol[i][2];
   }
   if(vr!=0)
      return true;
   return false;
}
int get_distance(int x, int y){
   x++;
   y++;
   ll ret=0;
   tr=prefiks[y]-prefiks[x-1];
  // cout<<"QUERY "<<x<<" "<<y<<endl;
  // tr.ispisi();
   if(nemoze(tr))
      return -1;
   tr.kol[0][0]=tr.kol[1][1]=tr.kol[2][2]=0;
   //tr.ispisi();
   int i,j;

   i=0;j=1;
   v=min(tr.kol[i][j],tr.kol[j][i]);
   ret+=v;
   tr.kol[i][j]-=v;
   tr.kol[j][i]-=v;
  // cout<<v<<endl;

   i=0;j=2;
   v=min(tr.kol[i][j],tr.kol[j][i]);
   ret+=v;
   tr.kol[i][j]-=v;
   tr.kol[j][i]-=v;
   //cout<<v<<endl;

   i=1;j=2;
   v=min(tr.kol[i][j],tr.kol[j][i]);
   ret+=v;
   tr.kol[i][j]-=v;
   tr.kol[j][i]-=v;
   //cout<<v<<endl;
   v=0;
   for(i=0;i<=2;i++)
      for(j=0;j<=2;j++){
         v+=tr.kol[i][j];
      }
   return ret+(v*2)/3;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:38:27: warning: array subscript has type 'char' [-Wchar-subscripts]
   38 |       niz[i].kol[mapa[a[i]]][mapa[b[i]]]++;
      |                           ^
dna.cpp:38:39: warning: array subscript has type 'char' [-Wchar-subscripts]
   38 |       niz[i].kol[mapa[a[i]]][mapa[b[i]]]++;
      |                                       ^

Subtask #1
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	29 ms	21988 KB	Output is correct
2	Correct	30 ms	22500 KB	Output is correct
3	Correct	30 ms	21596 KB	Output is correct
4	Correct	34 ms	22456 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct

Subtask #2
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	5 ms	20660 KB	Output is correct
5	Correct	6 ms	20660 KB	Output is correct
6	Correct	5 ms	20664 KB	Output is correct
7	Correct	5 ms	19912 KB	Output is correct
8	Correct	5 ms	20808 KB	Output is correct
9	Correct	6 ms	20664 KB	Output is correct

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	5 ms	20660 KB	Output is correct
5	Correct	6 ms	20660 KB	Output is correct
6	Correct	5 ms	20664 KB	Output is correct
7	Correct	5 ms	19912 KB	Output is correct
8	Correct	5 ms	20808 KB	Output is correct
9	Correct	6 ms	20664 KB	Output is correct
10	Correct	29 ms	22500 KB	Output is correct
11	Correct	30 ms	22504 KB	Output is correct
12	Correct	31 ms	22284 KB	Output is correct
13	Correct	30 ms	22532 KB	Output is correct
14	Correct	35 ms	23016 KB	Output is correct
15	Correct	31 ms	22500 KB	Output is correct
16	Correct	30 ms	22232 KB	Output is correct
17	Correct	30 ms	22108 KB	Output is correct
18	Correct	30 ms	23012 KB	Output is correct
19	Correct	27 ms	22540 KB	Output is correct
20	Correct	28 ms	22276 KB	Output is correct
21	Correct	28 ms	23012 KB	Output is correct

Subtask #4
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	5 ms	20660 KB	Output is correct
5	Correct	6 ms	20660 KB	Output is correct
6	Correct	5 ms	20664 KB	Output is correct
7	Correct	5 ms	19912 KB	Output is correct
8	Correct	5 ms	20808 KB	Output is correct
9	Correct	6 ms	20664 KB	Output is correct
10	Correct	5 ms	19920 KB	Output is correct
11	Correct	6 ms	20664 KB	Output is correct
12	Correct	5 ms	19956 KB	Output is correct
13	Correct	6 ms	20668 KB	Output is correct
14	Correct	5 ms	20660 KB	Output is correct
15	Correct	6 ms	20664 KB	Output is correct

Subtask #5
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	29 ms	21988 KB	Output is correct
2	Correct	30 ms	22500 KB	Output is correct
3	Correct	30 ms	21596 KB	Output is correct
4	Correct	34 ms	22456 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	0 ms	2396 KB	Output is correct
11	Correct	5 ms	20660 KB	Output is correct
12	Correct	6 ms	20660 KB	Output is correct
13	Correct	5 ms	20664 KB	Output is correct
14	Correct	5 ms	19912 KB	Output is correct
15	Correct	5 ms	20808 KB	Output is correct
16	Correct	6 ms	20664 KB	Output is correct
17	Correct	29 ms	22500 KB	Output is correct
18	Correct	30 ms	22504 KB	Output is correct
19	Correct	31 ms	22284 KB	Output is correct
20	Correct	30 ms	22532 KB	Output is correct
21	Correct	35 ms	23016 KB	Output is correct
22	Correct	31 ms	22500 KB	Output is correct
23	Correct	30 ms	22232 KB	Output is correct
24	Correct	30 ms	22108 KB	Output is correct
25	Correct	30 ms	23012 KB	Output is correct
26	Correct	27 ms	22540 KB	Output is correct
27	Correct	28 ms	22276 KB	Output is correct
28	Correct	28 ms	23012 KB	Output is correct
29	Correct	5 ms	19920 KB	Output is correct
30	Correct	6 ms	20664 KB	Output is correct
31	Correct	5 ms	19956 KB	Output is correct
32	Correct	6 ms	20668 KB	Output is correct
33	Correct	5 ms	20660 KB	Output is correct
34	Correct	6 ms	20664 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	30 ms	22076 KB	Output is correct
37	Correct	30 ms	22856 KB	Output is correct
38	Correct	33 ms	22364 KB	Output is correct
39	Correct	31 ms	22760 KB	Output is correct
40	Correct	42 ms	23016 KB	Output is correct
41	Correct	5 ms	20920 KB	Output is correct
42	Correct	38 ms	22460 KB	Output is correct
43	Correct	30 ms	23052 KB	Output is correct
44	Correct	30 ms	23216 KB	Output is correct
45	Correct	28 ms	22536 KB	Output is correct
46	Correct	28 ms	23208 KB	Output is correct
47	Correct	28 ms	22760 KB	Output is correct

Submission #970546

Compilation message

Subtask #1 21.0 / 21.0

Subtask #2 22.0 / 22.0

Subtask #3 13.0 / 13.0

Subtask #4 28.0 / 28.0

Subtask #5 16.0 / 16.0

Subtask #1
21.0 / 21.0

Subtask #2
22.0 / 22.0

Subtask #3
13.0 / 13.0

Subtask #4
28.0 / 28.0

Subtask #5
16.0 / 16.0