답안 #491544

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
491544	2021-12-03T01:29:12 Z	JerryLiu06	DNA 돌연변이 (IOI21_dna)	C++17	100 / 100	36 ms	6076 KB

dna

// https://oj.uz/problem/view/IOI21_dna
 
#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(0);
#define FASTIOF ios_base::sync_with_stdio(false); fin.tie(0);
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
 
const int MOD = 1e9 + 7;
const int MX = 1e5 + 10;
const ll INF = 1e18;
 
int N, Q; int MP[150]; int pref[MX][3][3];
 
void init(str S1, str S2) {
    N = sz(S1); 
 
    MP['A'] = 0;
    MP['C'] = 1;
    MP['T'] = 2;
 
    FOR(i, 1, N + 1) {
        int curI = MP[S1[i - 1]];
        int curJ = MP[S2[i - 1]];
 
        F0R(j, 3) {
            F0R(k, 3) {
                pref[i][j][k] = pref[i - 1][j][k];
            }
        }
        pref[i][curI][curJ]++;
    }
}
int get_distance(int x, int y) {
    x++, y++;
 
    int sub[3][3], cnt[3];
    
    F0R(i, 3) {
        cnt[i] = 0;
    }
    F0R(i, 3) {
        F0R(j, 3) {
            sub[i][j] = pref[y][i][j] - pref[x - 1][i][j];
            
            cnt[i] += sub[i][j];
            cnt[j] -= sub[i][j];
        }
    }
    F0R(i, 3) {
        if (cnt[i] != 0) {
            return -1;
        }
    }
    int ans = 0;
 
    F0R(i, 3) {
        FOR(j, i + 1, 3) {
            ans += min(sub[i][j], sub[j][i]);
        }
    }
    ans += 2 * abs(sub[0][1] - sub[1][0]);
 
    return ans;
}

Compilation message

dna.cpp: In function 'void init(str, str)':
dna.cpp:74:32: warning: array subscript has type 'char' [-Wchar-subscripts]
   74 |         int curI = MP[S1[i - 1]];
      |                                ^
dna.cpp:75:32: warning: array subscript has type 'char' [-Wchar-subscripts]
   75 |         int curJ = MP[S2[i - 1]];
      |                                ^

Subtask #1

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	32 ms	5604 KB	Output is correct
2	Correct	32 ms	5640 KB	Output is correct
3	Correct	31 ms	5344 KB	Output is correct
4	Correct	31 ms	5632 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct

Subtask #2

22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	3 ms	4300 KB	Output is correct
5	Correct	4 ms	4300 KB	Output is correct
6	Correct	3 ms	4300 KB	Output is correct
7	Correct	3 ms	4044 KB	Output is correct
8	Correct	3 ms	4300 KB	Output is correct
9	Correct	3 ms	4300 KB	Output is correct

Subtask #3

13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	3 ms	4300 KB	Output is correct
5	Correct	4 ms	4300 KB	Output is correct
6	Correct	3 ms	4300 KB	Output is correct
7	Correct	3 ms	4044 KB	Output is correct
8	Correct	3 ms	4300 KB	Output is correct
9	Correct	3 ms	4300 KB	Output is correct
10	Correct	36 ms	5632 KB	Output is correct
11	Correct	32 ms	5632 KB	Output is correct
12	Correct	33 ms	5744 KB	Output is correct
13	Correct	32 ms	5760 KB	Output is correct
14	Correct	35 ms	6056 KB	Output is correct
15	Correct	32 ms	5916 KB	Output is correct
16	Correct	30 ms	5744 KB	Output is correct
17	Correct	30 ms	5908 KB	Output is correct
18	Correct	32 ms	6016 KB	Output is correct
19	Correct	29 ms	5776 KB	Output is correct
20	Correct	29 ms	5888 KB	Output is correct
21	Correct	29 ms	6016 KB	Output is correct

Subtask #4

28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	3 ms	4300 KB	Output is correct
5	Correct	4 ms	4300 KB	Output is correct
6	Correct	3 ms	4300 KB	Output is correct
7	Correct	3 ms	4044 KB	Output is correct
8	Correct	3 ms	4300 KB	Output is correct
9	Correct	3 ms	4300 KB	Output is correct
10	Correct	3 ms	4044 KB	Output is correct
11	Correct	3 ms	4300 KB	Output is correct
12	Correct	3 ms	4044 KB	Output is correct
13	Correct	3 ms	4300 KB	Output is correct
14	Correct	3 ms	4300 KB	Output is correct
15	Correct	3 ms	4300 KB	Output is correct

Subtask #5

16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	32 ms	5604 KB	Output is correct
2	Correct	32 ms	5640 KB	Output is correct
3	Correct	31 ms	5344 KB	Output is correct
4	Correct	31 ms	5632 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	3 ms	4300 KB	Output is correct
12	Correct	4 ms	4300 KB	Output is correct
13	Correct	3 ms	4300 KB	Output is correct
14	Correct	3 ms	4044 KB	Output is correct
15	Correct	3 ms	4300 KB	Output is correct
16	Correct	3 ms	4300 KB	Output is correct
17	Correct	36 ms	5632 KB	Output is correct
18	Correct	32 ms	5632 KB	Output is correct
19	Correct	33 ms	5744 KB	Output is correct
20	Correct	32 ms	5760 KB	Output is correct
21	Correct	35 ms	6056 KB	Output is correct
22	Correct	32 ms	5916 KB	Output is correct
23	Correct	30 ms	5744 KB	Output is correct
24	Correct	30 ms	5908 KB	Output is correct
25	Correct	32 ms	6016 KB	Output is correct
26	Correct	29 ms	5776 KB	Output is correct
27	Correct	29 ms	5888 KB	Output is correct
28	Correct	29 ms	6016 KB	Output is correct
29	Correct	3 ms	4044 KB	Output is correct
30	Correct	3 ms	4300 KB	Output is correct
31	Correct	3 ms	4044 KB	Output is correct
32	Correct	3 ms	4300 KB	Output is correct
33	Correct	3 ms	4300 KB	Output is correct
34	Correct	3 ms	4300 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	33 ms	5288 KB	Output is correct
37	Correct	33 ms	5640 KB	Output is correct
38	Correct	32 ms	5748 KB	Output is correct
39	Correct	32 ms	6024 KB	Output is correct
40	Correct	32 ms	6032 KB	Output is correct
41	Correct	3 ms	4300 KB	Output is correct
42	Correct	30 ms	5832 KB	Output is correct
43	Correct	30 ms	5960 KB	Output is correct
44	Correct	31 ms	5984 KB	Output is correct
45	Correct	30 ms	5888 KB	Output is correct
46	Correct	30 ms	6076 KB	Output is correct
47	Correct	30 ms	6020 KB	Output is correct