oj.uz

Submission #448577

# Submission time Handle Problem Language Result Execution time Memory
448577 2021-07-30T20:45:46 Z julian33 Mutating DNA (IOI21_dna) C++17
56 / 100
 41 ms 7420 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
    cerr<<vars<<" = ";
    string delim="";
    (...,(cerr<<delim<<values,delim=", "));
    cerr<<"\n";
}
#else
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {}
#endif

#define pb push_back
#define sz(x) (int)(x.size())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> inline void maxa(T& a,T b){a=max(a,b);}
template<typename T> inline void mina(T& a,T b){a=min(a,b);} 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mxN=1e5+5; //make sure this is right
const int mod=1e9+7;

int f[mxN][3][2],id[1000],n,cnt[mxN][3];

void init(string a,string b){
    id['A']=0;
    id['C']=1;
    id['T']=2;
    n=sz(a);
    for(int i=1;i<=n;i++){
        for(int j=0;j<3;j++){
            if(id[a[i-1]]==j)
                f[i][j][0]=f[i-1][j][0]+1;
            else
                f[i][j][0]=f[i-1][j][0];
            if(id[b[i-1]]==j)
                f[i][j][1]=f[i-1][j][1]+1;
            else
                f[i][j][1]=f[i-1][j][1];
            cnt[i][j]+=cnt[i-1][j];
        }
        if(minmax({a[i-1],b[i-1]})==minmax({'A','C'}))
            cnt[i][0]++;
        else if(minmax({a[i-1],b[i-1]})==minmax({'A','T'}))
            cnt[i][1]++;
        else if(minmax({a[i-1],b[i-1]})==minmax({'C','T'}))
            cnt[i][2]++;
    }
}

int get_distance(int x,int y){
    y++;
    for(int i=0;i<3;i++){
        if(f[y][i][0]-f[x][i][0]!=f[y][i][1]-f[x][i][1])
            return -1;
    }
    int a1=cnt[y][0]-cnt[x][0];
    int a2=cnt[y][1]-cnt[x][1];
    int a3=cnt[y][2]-cnt[x][2];
    int ans=0;
    int m=min(a1,a2);
    ans+=m;
    a1-=m;
    ans+=a1/2+(a2+a3)/2;
    return ans;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:41:25: warning: array subscript has type 'char' [-Wchar-subscripts]
   41 |             if(id[a[i-1]]==j)
      |                         ^
dna.cpp:45:25: warning: array subscript has type 'char' [-Wchar-subscripts]
   45 |             if(id[b[i-1]]==j)
      |                         ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 6908 KB Output is correct
2 Correct 41 ms 7056 KB Output is correct
3 Correct 39 ms 6616 KB Output is correct
4 Correct 40 ms 7032 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 5 ms 4556 KB Output is correct
5 Correct 5 ms 4556 KB Output is correct
6 Correct 5 ms 4556 KB Output is correct
7 Correct 5 ms 4300 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 4 ms 4516 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 5 ms 4556 KB Output is correct
5 Correct 5 ms 4556 KB Output is correct
6 Correct 5 ms 4556 KB Output is correct
7 Correct 5 ms 4300 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 4 ms 4516 KB Output is correct
10 Correct 39 ms 7024 KB Output is correct
11 Correct 39 ms 6984 KB Output is correct
12 Correct 38 ms 7056 KB Output is correct
13 Correct 39 ms 7144 KB Output is correct
14 Correct 41 ms 7420 KB Output is correct
15 Correct 37 ms 7284 KB Output is correct
16 Correct 37 ms 7016 KB Output is correct
17 Correct 37 ms 7136 KB Output is correct
18 Correct 37 ms 7296 KB Output is correct
19 Correct 35 ms 6968 KB Output is correct
20 Correct 36 ms 7156 KB Output is correct
21 Correct 35 ms 7296 KB Output is correct

Subtask #4
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 5 ms 4556 KB Output is correct
5 Correct 5 ms 4556 KB Output is correct
6 Correct 5 ms 4556 KB Output is correct
7 Correct 5 ms 4300 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 4 ms 4516 KB Output is correct
10 Correct 6 ms 4172 KB Output is correct
11 Correct 6 ms 4556 KB Output is correct
12 Incorrect 6 ms 4300 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 6908 KB Output is correct
2 Correct 41 ms 7056 KB Output is correct
3 Correct 39 ms 6616 KB Output is correct
4 Correct 40 ms 7032 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 5 ms 4556 KB Output is correct
12 Correct 5 ms 4556 KB Output is correct
13 Correct 5 ms 4556 KB Output is correct
14 Correct 5 ms 4300 KB Output is correct
15 Correct 5 ms 4556 KB Output is correct
16 Correct 4 ms 4516 KB Output is correct
17 Correct 39 ms 7024 KB Output is correct
18 Correct 39 ms 6984 KB Output is correct
19 Correct 38 ms 7056 KB Output is correct
20 Correct 39 ms 7144 KB Output is correct
21 Correct 41 ms 7420 KB Output is correct
22 Correct 37 ms 7284 KB Output is correct
23 Correct 37 ms 7016 KB Output is correct
24 Correct 37 ms 7136 KB Output is correct
25 Correct 37 ms 7296 KB Output is correct
26 Correct 35 ms 6968 KB Output is correct
27 Correct 36 ms 7156 KB Output is correct
28 Correct 35 ms 7296 KB Output is correct
29 Correct 6 ms 4172 KB Output is correct
30 Correct 6 ms 4556 KB Output is correct
31 Incorrect 6 ms 4300 KB Output isn't correct
32 Halted 0 ms 0 KB -