oj.uz

Submission #535192

# Submission time Handle Problem Language Result Execution time Memory
535192 2022-03-09T15:58:15 Z DJ035 Mutating DNA (IOI21_dna) C++17
100 / 100
 56 ms 15628 KB 
#include "dna.h"
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#include <bits/stdc++.h>
#define MEM 222222
#define sanic ios_base::sync_with_stdio(0)
#define x first
#define y second
#define pf push_front
#define pb push_back
#define all(v) v.begin(), v.end()
#define sz size()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
const ll INF = 1e17+7;
const ll MOD = 998244353;
ll gcd(ll a, ll b){
    if(a%b) return gcd(b, a%b);
    return b;
}
ll n,m;
ll aa[MEM][3], bb[MEM][3];
ll cc[MEM][3][3];
string c, d;
void init(std::string a, std::string b) {
    for(int i=0; i<a.sz; i++){
        aa[i+1][0] = aa[i][0] + (a[i]=='A');
        aa[i+1][1] = aa[i][1] + (a[i]=='C');
        aa[i+1][2] = aa[i][2] + (a[i]=='T');
    }
    for(int i=0; i<b.sz; i++){
        bb[i+1][0] = bb[i][0] + (b[i]=='A');
        bb[i+1][1] = bb[i][1] + (b[i]=='C');
        bb[i+1][2] = bb[i][2] + (b[i]=='T');
    }
    for(int i=0; i<b.sz; i++){
        for(int j=0; j<3; j++)
            for(int k=0; k<3; k++)
                cc[i+1][j][k] = cc[i][j][k];
        ll x=(a[i]=='A' ? 0:(a[i]=='C'?1:2));
        ll y=(b[i]=='A' ? 0:(b[i]=='C'?1:2));
        cc[i+1][x][y]++;
    }
}

int get_distance(int x, int y) {
	for(int i=0; i<3; i++)
        if(aa[y+1][i]-aa[x][i]!=bb[y+1][i]-bb[x][i]) return -1;
    ll d[3][3];
    for(int i=0; i<3; i++)
        for(int j=0; j<3; j++)
            d[i][j] = cc[y+1][i][j]-cc[x][i][j];
    /*
    for(int i=0; i<3; i++)
        for(int j=0; j<3; j++)
            if(i!=j)cout << i << ' ' << j << ' ' << d[i][j] << '\n';
    */
    ll ans = 2*(d[0][1]+d[1][0])-3*min(d[1][0], d[0][1])+min(d[0][2], d[2][0])+min(d[1][2],d[2][1]);
	return ans;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:29:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for(int i=0; i<a.sz; i++){
      |                   ^
dna.cpp:34:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for(int i=0; i<b.sz; i++){
      |                   ^
dna.cpp:39:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int i=0; i<b.sz; i++){
      |                   ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 13700 KB Output is correct
2 Correct 41 ms 15212 KB Output is correct
3 Correct 40 ms 14136 KB Output is correct
4 Correct 44 ms 15204 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 1 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 1 ms 308 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 9 ms 12644 KB Output is correct
5 Correct 9 ms 12724 KB Output is correct
6 Correct 9 ms 12732 KB Output is correct
7 Correct 8 ms 11980 KB Output is correct
8 Correct 8 ms 12760 KB Output is correct
9 Correct 8 ms 12720 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 1 ms 308 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 9 ms 12644 KB Output is correct
5 Correct 9 ms 12724 KB Output is correct
6 Correct 9 ms 12732 KB Output is correct
7 Correct 8 ms 11980 KB Output is correct
8 Correct 8 ms 12760 KB Output is correct
9 Correct 8 ms 12720 KB Output is correct
10 Correct 44 ms 15084 KB Output is correct
11 Correct 47 ms 15208 KB Output is correct
12 Correct 40 ms 14676 KB Output is correct
13 Correct 46 ms 15056 KB Output is correct
14 Correct 44 ms 15596 KB Output is correct
15 Correct 56 ms 15472 KB Output is correct
16 Correct 38 ms 14592 KB Output is correct
17 Correct 40 ms 14948 KB Output is correct
18 Correct 52 ms 15488 KB Output is correct
19 Correct 36 ms 14716 KB Output is correct
20 Correct 35 ms 14984 KB Output is correct
21 Correct 35 ms 15600 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 9 ms 12644 KB Output is correct
5 Correct 9 ms 12724 KB Output is correct
6 Correct 9 ms 12732 KB Output is correct
7 Correct 8 ms 11980 KB Output is correct
8 Correct 8 ms 12760 KB Output is correct
9 Correct 8 ms 12720 KB Output is correct
10 Correct 9 ms 11708 KB Output is correct
11 Correct 7 ms 12760 KB Output is correct
12 Correct 8 ms 11980 KB Output is correct
13 Correct 8 ms 12728 KB Output is correct
14 Correct 8 ms 12740 KB Output is correct
15 Correct 8 ms 12740 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 13700 KB Output is correct
2 Correct 41 ms 15212 KB Output is correct
3 Correct 40 ms 14136 KB Output is correct
4 Correct 44 ms 15204 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 1 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 1 ms 308 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 9 ms 12644 KB Output is correct
12 Correct 9 ms 12724 KB Output is correct
13 Correct 9 ms 12732 KB Output is correct
14 Correct 8 ms 11980 KB Output is correct
15 Correct 8 ms 12760 KB Output is correct
16 Correct 8 ms 12720 KB Output is correct
17 Correct 44 ms 15084 KB Output is correct
18 Correct 47 ms 15208 KB Output is correct
19 Correct 40 ms 14676 KB Output is correct
20 Correct 46 ms 15056 KB Output is correct
21 Correct 44 ms 15596 KB Output is correct
22 Correct 56 ms 15472 KB Output is correct
23 Correct 38 ms 14592 KB Output is correct
24 Correct 40 ms 14948 KB Output is correct
25 Correct 52 ms 15488 KB Output is correct
26 Correct 36 ms 14716 KB Output is correct
27 Correct 35 ms 14984 KB Output is correct
28 Correct 35 ms 15600 KB Output is correct
29 Correct 9 ms 11708 KB Output is correct
30 Correct 7 ms 12760 KB Output is correct
31 Correct 8 ms 11980 KB Output is correct
32 Correct 8 ms 12728 KB Output is correct
33 Correct 8 ms 12740 KB Output is correct
34 Correct 8 ms 12740 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 52 ms 14096 KB Output is correct
37 Correct 43 ms 15220 KB Output is correct
38 Correct 48 ms 14860 KB Output is correct
39 Correct 48 ms 15620 KB Output is correct
40 Correct 41 ms 15620 KB Output is correct
41 Correct 9 ms 12816 KB Output is correct
42 Correct 39 ms 14828 KB Output is correct
43 Correct 39 ms 15488 KB Output is correct
44 Correct 37 ms 15488 KB Output is correct
45 Correct 37 ms 14768 KB Output is correct
46 Correct 36 ms 15528 KB Output is correct
47 Correct 43 ms 15628 KB Output is correct