oj.uz

Submission #612409

# Submission time Handle Problem Language Result Execution time Memory
612409 2022-07-29T14:27:35 Z PanTkd Mutating DNA (IOI21_dna) C++17
100 / 100
 43 ms 7348 KB 
//
//  main.cpp
//
//  Created by Panagiotis Chadjicostas on
//  Copyright © Panagiotis Hadjicostas. All rights reserved.
//

#include <iostream>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <unordered_map>

using namespace std;

typedef int ll;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
#define fo(i,a,b) for(int i = a; i<=b; i++)
#define f(i,b) for(int i=0;i<b;i++)
#define F first
#define S second
#define sz size
#define ls s,m,idx<<1
#define rs m+1,e,idx<<1|1
const ll MOD=ll(1e9)+7;
const ll MAXN=2*ll(1e6);
void checker(){
    ll n=rand()%20+2;
    vi a(n,ll());
    for(ll i=0;i<n;i++){
        a[i]=rand()%20+2;
    }
    for(ll b=0;b<(1<<n);b++){
        vi on,off;
        for(ll i=0;i<n;i++){
            if(i&(1<<i)){
                on.push_back(i);
            }
            else{
                off.push_back(i);
            }
        }
    }
}
///////////////////////////////////////////////////////////////////////
int pre[200005][3][3], mp[ll('Z')+1];
 
void init(string a, string b){
    mp['A'] = 0, mp['C'] = 1, mp['T'] = 2;
    for (ll i = 1; i <= a.size(); i++)
        for (ll j = 0; j < 3; j++)
            for (ll k = 0; k < 3; k++)
                pre[i][j][k] = pre[i-1][j][k]+(mp[a[i-1]] == j and mp[b[i-1]] == k);
}

int get_distance(int x, int y){
    x++,y++;
    ll temp=0;
    ll ans=0;
    for(ll i=0;i<3;i++){
        ll j=(i+1)%3;

        ll c1=pre[y][i][j]-pre[x-1][i][j];
        ll c2=pre[y][j][i]-pre[x-1][j][i];
        if(!i)
            temp=c1-c2;
        if(temp!=c1-c2)
            return -1;
        ans+=min(c1,c2);
    }
    ans+=2*abs(temp);
    return ans;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:64:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     for (ll i = 1; i <= a.size(); i++)
      |                    ~~^~~~~~~~~~~
dna.cpp:67:57: warning: array subscript has type 'char' [-Wchar-subscripts]
   67 |                 pre[i][j][k] = pre[i-1][j][k]+(mp[a[i-1]] == j and mp[b[i-1]] == k);
      |                                                         ^
dna.cpp:67:77: warning: array subscript has type 'char' [-Wchar-subscripts]
   67 |                 pre[i][j][k] = pre[i-1][j][k]+(mp[a[i-1]] == j and mp[b[i-1]] == k);
      |                                                                             ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 5772 KB Output is correct
2 Correct 35 ms 5804 KB Output is correct
3 Correct 33 ms 5500 KB Output is correct
4 Correct 33 ms 5776 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4436 KB Output is correct
5 Correct 5 ms 4564 KB Output is correct
6 Correct 5 ms 4436 KB Output is correct
7 Correct 4 ms 4204 KB Output is correct
8 Correct 5 ms 4436 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 1 ms 308 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4436 KB Output is correct
5 Correct 5 ms 4564 KB Output is correct
6 Correct 5 ms 4436 KB Output is correct
7 Correct 4 ms 4204 KB Output is correct
8 Correct 5 ms 4436 KB Output is correct
9 Correct 4 ms 4516 KB Output is correct
10 Correct 34 ms 5716 KB Output is correct
11 Correct 35 ms 5760 KB Output is correct
12 Correct 35 ms 5872 KB Output is correct
13 Correct 36 ms 6004 KB Output is correct
14 Correct 43 ms 6128 KB Output is correct
15 Correct 33 ms 6076 KB Output is correct
16 Correct 30 ms 5824 KB Output is correct
17 Correct 31 ms 5928 KB Output is correct
18 Correct 31 ms 6084 KB Output is correct
19 Correct 30 ms 5944 KB Output is correct
20 Correct 29 ms 6036 KB Output is correct
21 Correct 30 ms 6136 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4436 KB Output is correct
5 Correct 5 ms 4564 KB Output is correct
6 Correct 5 ms 4436 KB Output is correct
7 Correct 4 ms 4204 KB Output is correct
8 Correct 5 ms 4436 KB Output is correct
9 Correct 4 ms 4516 KB Output is correct
10 Correct 4 ms 4076 KB Output is correct
11 Correct 5 ms 4544 KB Output is correct
12 Correct 4 ms 4288 KB Output is correct
13 Correct 5 ms 4540 KB Output is correct
14 Correct 5 ms 4540 KB Output is correct
15 Correct 4 ms 4564 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 5772 KB Output is correct
2 Correct 35 ms 5804 KB Output is correct
3 Correct 33 ms 5500 KB Output is correct
4 Correct 33 ms 5776 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 5 ms 4436 KB Output is correct
12 Correct 5 ms 4564 KB Output is correct
13 Correct 5 ms 4436 KB Output is correct
14 Correct 4 ms 4204 KB Output is correct
15 Correct 5 ms 4436 KB Output is correct
16 Correct 4 ms 4516 KB Output is correct
17 Correct 34 ms 5716 KB Output is correct
18 Correct 35 ms 5760 KB Output is correct
19 Correct 35 ms 5872 KB Output is correct
20 Correct 36 ms 6004 KB Output is correct
21 Correct 43 ms 6128 KB Output is correct
22 Correct 33 ms 6076 KB Output is correct
23 Correct 30 ms 5824 KB Output is correct
24 Correct 31 ms 5928 KB Output is correct
25 Correct 31 ms 6084 KB Output is correct
26 Correct 30 ms 5944 KB Output is correct
27 Correct 29 ms 6036 KB Output is correct
28 Correct 30 ms 6136 KB Output is correct
29 Correct 4 ms 4076 KB Output is correct
30 Correct 5 ms 4544 KB Output is correct
31 Correct 4 ms 4288 KB Output is correct
32 Correct 5 ms 4540 KB Output is correct
33 Correct 5 ms 4540 KB Output is correct
34 Correct 4 ms 4564 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 42 ms 6664 KB Output is correct
37 Correct 33 ms 7040 KB Output is correct
38 Correct 33 ms 7136 KB Output is correct
39 Correct 36 ms 7336 KB Output is correct
40 Correct 35 ms 7304 KB Output is correct
41 Correct 5 ms 4564 KB Output is correct
42 Correct 30 ms 6992 KB Output is correct
43 Correct 31 ms 7348 KB Output is correct
44 Correct 32 ms 7280 KB Output is correct
45 Correct 32 ms 7104 KB Output is correct
46 Correct 31 ms 7280 KB Output is correct
47 Correct 29 ms 7304 KB Output is correct