Submission #529209

#TimeUsernameProblemLanguageResultExecution timeMemory
529209Icebear16Mutating DNA (IOI21_dna)C++17
0 / 100
18 ms4272 KiB
#include "dna.h" #include <vector> int n,q; std::string s; std::string c; std::vector<int> A(n); void init(std::string a, std::string b) { s=a,c=b; for(int i=0;i<=n;i++){ if(s[i]!=c[i]){ A[i]=1; }else{ A[i]=0; } } for(int i=1;i<n;i++){ A[i]+=A[i-1]; } while(q--){ int x,y; get_distance(x,y); } } int get_distance(int x, int y) { // int h1=0,h2=0,l1=0,l2=0,k1=0,k2=0; // for(int i=x;i<=y;i++){ // if(s[i]=='A'){ // h1++; // }else if(s[i]=='T'){ // l1++; // }else if(s[i]=='C'){ // k1++; // } // if(c[i]=='A'){ // h2++; // }else if(c[i]=='T'){ // l2++; // }else if(c[i]=='C'){ // k2++; // } // } int j=A[y]-A[x]+1; if(j%2==0){ return j/2; }else{ return -1; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...