oj.uz

Submission #497201

# Submission time Handle Problem Language Result Execution time Memory
497201 2021-12-22T17:12:53 Z Karliver Mutating DNA (IOI21_dna) C++17
100 / 100
 65 ms 7408 KB 
    
#include <bits/stdc++.h>

#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
#define sz(x) (int)x.size()
#define ff first
#define se second
#define mp make_pair
using ll = long long;
int mod = (ll)1e9 + 7;
const int INF = 1e9 + 1;
const int N = 2e5 + 100;
const double eps = 1e-7;

template <class T> using V = vector<T>;  
template <class T> using VV = V<V<T>>;  
template<class T, size_t SZ> using AR = array<T, SZ>;
template<class T> using PR = pair<T, T>;
template <typename XPAX>
bool ckma(XPAX &x, XPAX y) {
    return (x < y ? x = y, 1 : 0);
}
template <typename XPAX>
bool ckmi(XPAX &x, XPAX y) {
    return (x > y ? x = y, 1 : 0);
}  

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
int S[100000][3][3];
int n;
unordered_map<char, int> sp = {{'A', 0}, {'T', 1}, {'C', 2}};

void init(string a, string b) {
    n = sz(a);

    forn(i, n) {
        S[i+1][sp[a[i]]][sp[b[i]]]++;
        forn(x, 3) forn(y, 3) S[i+1][x][y] += S[i][x][y];
    }

}
int get_distance(int L, int R) {
    ++R;
    V<int> di(3);
    VV<int> cnt(3, V<int>(3));

    int res = 0;
    forn(i, 3) forn(j, 3) {
        if(i == j)continue;
        int ad =  S[R][i][j]-S[L][i][j];
        cnt[i][j] = ad;
        di[i] += ad;
        di[j] -= ad;
    }
    forn(i, 3) if(di[i])return -1;

    for(int i = 0;i < 3;++i) for(int j = i + 1;j < 3;++j) {
        int take = min(cnt[i][j], cnt[j][i]);
        cnt[i][j] -= take;
        cnt[j][i] -= take;
        res += take;
    
    }
    res += cnt[0][1] * 2;
    res += cnt[0][2] * 2;
    return res;

}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 6004 KB Output is correct
2 Correct 48 ms 7052 KB Output is correct
3 Correct 53 ms 6660 KB Output is correct
4 Correct 65 ms 7012 KB Output is correct
5 Correct 1 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 1 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 5 ms 4556 KB Output is correct
5 Correct 8 ms 4532 KB Output is correct
6 Correct 8 ms 4556 KB Output is correct
7 Correct 5 ms 4280 KB Output is correct
8 Correct 6 ms 4564 KB Output is correct
9 Correct 5 ms 4524 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 5 ms 4556 KB Output is correct
5 Correct 8 ms 4532 KB Output is correct
6 Correct 8 ms 4556 KB Output is correct
7 Correct 5 ms 4280 KB Output is correct
8 Correct 6 ms 4564 KB Output is correct
9 Correct 5 ms 4524 KB Output is correct
10 Correct 45 ms 6880 KB Output is correct
11 Correct 57 ms 6984 KB Output is correct
12 Correct 46 ms 7048 KB Output is correct
13 Correct 48 ms 7140 KB Output is correct
14 Correct 46 ms 7264 KB Output is correct
15 Correct 48 ms 7296 KB Output is correct
16 Correct 47 ms 6920 KB Output is correct
17 Correct 55 ms 7044 KB Output is correct
18 Correct 43 ms 7276 KB Output is correct
19 Correct 46 ms 7056 KB Output is correct
20 Correct 41 ms 7056 KB Output is correct
21 Correct 51 ms 7308 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 5 ms 4556 KB Output is correct
5 Correct 8 ms 4532 KB Output is correct
6 Correct 8 ms 4556 KB Output is correct
7 Correct 5 ms 4280 KB Output is correct
8 Correct 6 ms 4564 KB Output is correct
9 Correct 5 ms 4524 KB Output is correct
10 Correct 6 ms 4132 KB Output is correct
11 Correct 6 ms 4556 KB Output is correct
12 Correct 5 ms 4300 KB Output is correct
13 Correct 5 ms 4556 KB Output is correct
14 Correct 5 ms 4540 KB Output is correct
15 Correct 6 ms 4556 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 6004 KB Output is correct
2 Correct 48 ms 7052 KB Output is correct
3 Correct 53 ms 6660 KB Output is correct
4 Correct 65 ms 7012 KB Output is correct
5 Correct 1 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 1 ms 204 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 5 ms 4556 KB Output is correct
12 Correct 8 ms 4532 KB Output is correct
13 Correct 8 ms 4556 KB Output is correct
14 Correct 5 ms 4280 KB Output is correct
15 Correct 6 ms 4564 KB Output is correct
16 Correct 5 ms 4524 KB Output is correct
17 Correct 45 ms 6880 KB Output is correct
18 Correct 57 ms 6984 KB Output is correct
19 Correct 46 ms 7048 KB Output is correct
20 Correct 48 ms 7140 KB Output is correct
21 Correct 46 ms 7264 KB Output is correct
22 Correct 48 ms 7296 KB Output is correct
23 Correct 47 ms 6920 KB Output is correct
24 Correct 55 ms 7044 KB Output is correct
25 Correct 43 ms 7276 KB Output is correct
26 Correct 46 ms 7056 KB Output is correct
27 Correct 41 ms 7056 KB Output is correct
28 Correct 51 ms 7308 KB Output is correct
29 Correct 6 ms 4132 KB Output is correct
30 Correct 6 ms 4556 KB Output is correct
31 Correct 5 ms 4300 KB Output is correct
32 Correct 5 ms 4556 KB Output is correct
33 Correct 5 ms 4540 KB Output is correct
34 Correct 6 ms 4556 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 48 ms 6632 KB Output is correct
37 Correct 54 ms 7036 KB Output is correct
38 Correct 48 ms 7052 KB Output is correct
39 Correct 49 ms 7408 KB Output is correct
40 Correct 45 ms 7400 KB Output is correct
41 Correct 5 ms 4532 KB Output is correct
42 Correct 45 ms 7052 KB Output is correct
43 Correct 47 ms 7284 KB Output is correct
44 Correct 43 ms 7308 KB Output is correct
45 Correct 41 ms 6996 KB Output is correct
46 Correct 43 ms 7280 KB Output is correct
47 Correct 41 ms 7296 KB Output is correct