oj.uz

Submission #488131

# Submission time Handle Problem Language Result Execution time Memory
488131 2021-11-18T01:42:19 Z yungyao Mutating DNA (IOI21_dna) C++17
100 / 100
 40 ms 6236 KB 
using namespace std;
#pragma GCC optimize("Ofast")
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <set>
#include <map>

typedef long long LL;
typedef pair<int,int> pii;
#define F first
#define S second
#define pb push_back
#define mkp make_pair
#define iter(x) x.begin() x.end()
#define REP(n) for (int __=n;__--;)
#define REP0(i,n) for (int i=0;i<n;++i)
#define REP1(i,n) for (int i=1;i<=n;++i)

const int maxn = 1e5+10,mod = 0;
const LL inf = 0;


int pre[maxn][6];

void init(string a,string b){
    const int n = a.size();
    REP0(i,n){
        if (a[i] == 'A'){
            if (b[i] == 'C') ++pre[i+1][0];
            else if (b[i] == 'T') ++pre[i+1][4];
        }
        else if (a[i] == 'C'){
            if (b[i] == 'A') ++pre[i+1][3];
            else if (b[i] == 'T') ++pre[i+1][2];
        }
        else{
            if (b[i] == 'A') ++pre[i+1][1];
            else if (b[i] == 'C') ++pre[i+1][5];
        }
        REP0(j,6) pre[i+1][j] += pre[i][j];
    }
}

int get_distance(int x, int y){
    int ans[6];
    REP0(i,6) ans[i] = pre[y+1][i] - pre[x][i];

    int cnt = 0;
    REP0(i,3){
        int m = min(ans[i],ans[i+3]);

        cnt += m;
        ans[i] -= m;
        ans[i+3] -= m;
    }
    if (ans[0] == ans[1] and ans[1] == ans[2]) cnt += ans[0]*2;
    else return -1;
    if (ans[3] == ans[4] and ans[4] == ans[5]) cnt += ans[3]*2;
    else return -1;

    return cnt;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 5752 KB Output is correct
2 Correct 29 ms 5884 KB Output is correct
3 Correct 30 ms 5504 KB Output is correct
4 Correct 28 ms 5764 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 4 ms 3280 KB Output is correct
5 Correct 4 ms 3408 KB Output is correct
6 Correct 3 ms 3540 KB Output is correct
7 Correct 3 ms 3128 KB Output is correct
8 Correct 4 ms 3408 KB Output is correct
9 Correct 4 ms 3408 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 4 ms 3280 KB Output is correct
5 Correct 4 ms 3408 KB Output is correct
6 Correct 3 ms 3540 KB Output is correct
7 Correct 3 ms 3128 KB Output is correct
8 Correct 4 ms 3408 KB Output is correct
9 Correct 4 ms 3408 KB Output is correct
10 Correct 31 ms 5756 KB Output is correct
11 Correct 28 ms 5884 KB Output is correct
12 Correct 33 ms 5948 KB Output is correct
13 Correct 30 ms 6012 KB Output is correct
14 Correct 29 ms 6132 KB Output is correct
15 Correct 28 ms 6140 KB Output is correct
16 Correct 26 ms 5904 KB Output is correct
17 Correct 27 ms 5904 KB Output is correct
18 Correct 27 ms 6080 KB Output is correct
19 Correct 33 ms 5912 KB Output is correct
20 Correct 26 ms 5960 KB Output is correct
21 Correct 26 ms 6108 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 4 ms 3280 KB Output is correct
5 Correct 4 ms 3408 KB Output is correct
6 Correct 3 ms 3540 KB Output is correct
7 Correct 3 ms 3128 KB Output is correct
8 Correct 4 ms 3408 KB Output is correct
9 Correct 4 ms 3408 KB Output is correct
10 Correct 4 ms 3152 KB Output is correct
11 Correct 4 ms 3396 KB Output is correct
12 Correct 4 ms 3132 KB Output is correct
13 Correct 4 ms 3408 KB Output is correct
14 Correct 4 ms 3408 KB Output is correct
15 Correct 3 ms 3408 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 5752 KB Output is correct
2 Correct 29 ms 5884 KB Output is correct
3 Correct 30 ms 5504 KB Output is correct
4 Correct 28 ms 5764 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 312 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 4 ms 3280 KB Output is correct
12 Correct 4 ms 3408 KB Output is correct
13 Correct 3 ms 3540 KB Output is correct
14 Correct 3 ms 3128 KB Output is correct
15 Correct 4 ms 3408 KB Output is correct
16 Correct 4 ms 3408 KB Output is correct
17 Correct 31 ms 5756 KB Output is correct
18 Correct 28 ms 5884 KB Output is correct
19 Correct 33 ms 5948 KB Output is correct
20 Correct 30 ms 6012 KB Output is correct
21 Correct 29 ms 6132 KB Output is correct
22 Correct 28 ms 6140 KB Output is correct
23 Correct 26 ms 5904 KB Output is correct
24 Correct 27 ms 5904 KB Output is correct
25 Correct 27 ms 6080 KB Output is correct
26 Correct 33 ms 5912 KB Output is correct
27 Correct 26 ms 5960 KB Output is correct
28 Correct 26 ms 6108 KB Output is correct
29 Correct 4 ms 3152 KB Output is correct
30 Correct 4 ms 3396 KB Output is correct
31 Correct 4 ms 3132 KB Output is correct
32 Correct 4 ms 3408 KB Output is correct
33 Correct 4 ms 3408 KB Output is correct
34 Correct 3 ms 3408 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 40 ms 5604 KB Output is correct
37 Correct 40 ms 5880 KB Output is correct
38 Correct 30 ms 5996 KB Output is correct
39 Correct 29 ms 6156 KB Output is correct
40 Correct 29 ms 6236 KB Output is correct
41 Correct 3 ms 3408 KB Output is correct
42 Correct 28 ms 5904 KB Output is correct
43 Correct 27 ms 6088 KB Output is correct
44 Correct 30 ms 6096 KB Output is correct
45 Correct 26 ms 5928 KB Output is correct
46 Correct 26 ms 6176 KB Output is correct
47 Correct 29 ms 6108 KB Output is correct