제출 #497149

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
497149		Karliver	DNA 돌연변이 (IOI21_dna)	C++17	56 / 100	45 ms	6528 KiB

dna

    
#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 A[100000][3];
int B[100000][3];
int P[100000];
int n;
unordered_map<char, int> sp = {{'A', 0}, {'T', 1}, {'C', 2}};

int sma(int l, int r, int i) {
    return (A[r][i] - (l == 0 ? 0 : A[l-1][i]));
}

int smb(int l, int r, int i) {
    
    return (B[r][i] - (l == 0 ? 0 : B[l-1][i]));
}
int cnt(int l, int r) {
    
    return (P[r] - (l == 0 ? 0 : P[l-1]));
}

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

    forn(i, n) {
        A[i][sp[a[i]]]++;
        B[i][sp[b[i]]]++;
        forn(j, 3) {
            if(i) {
                A[i][j] += A[i-1][j];
                B[i][j] += B[i-1][j];
            }
        }
    }
    forn(i, n) {
        if(a[i] == b[i])
            ++P[i];

        if(i)
            P[i] += P[i-1];
    }
    
}
int get_distance(int x, int y) {
    forn(j, 3) {
        if(sma(x, y, j) != smb(x, y, j))
            return -1;
    }

    int tot = y - x + 1 - cnt(x, y);
    return (tot + 1) / 2;
}

• Subtask 1: 21 / 21
• Subtask 2: 22 / 22
• Subtask 3: 13 / 13
• Subtask 4: 0 / 28
• Subtask 5: 0 / 16