답안 #818129

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
818129	2023-08-10T02:38:12 Z	becaido	DNA 돌연변이 (IOI21_dna)	C++17	100 / 100	36 ms	8424 KB

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifndef WAIMAI
#include "dna.h"
#endif

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 1e5 + 5;

int n;
int prea[SIZE][3];
int preb[SIZE][3];
int pre2[SIZE][3][3];

void init(string a, string b) {
    n = a.size();
    a = " " + a;
    b = " " + b;
    FOR (i, 1, n) {
        FOR (j, 0, 2) {
            prea[i][j] = prea[i - 1][j];
            preb[i][j] = preb[i - 1][j];
            FOR (k, 0, 2) pre2[i][j][k] = pre2[i - 1][j][k];
        }
        int x = (a[i] == 'A' ? 0 : a[i] == 'T' ? 1 : 2);
        int y = (b[i] == 'A' ? 0 : b[i] == 'T' ? 1 : 2);
        prea[i][x]++;
        preb[i][y]++;
        pre2[i][x][y]++;
    }
}

int cnt[3][3];
int get_distance(int l, int r) {
    l++, r++;
    FOR (i, 0, 2) if (prea[r][i] - prea[l - 1][i] != preb[r][i] - preb[l - 1][i]) return -1;
    memset(cnt, 0, sizeof(cnt));
    FOR (i, 0, 2) {
        FOR (j, 0, 2) cnt[i][j] = pre2[r][i][j] - pre2[l - 1][i][j];
        cnt[i][i] = 0;
    }
    int ans = 0, mx = 0;
    FOR (i, 0, 2) FOR (j, i + 1, 2) {
        int &x = cnt[i][j], &y = cnt[j][i];
        int delta = min(x, y);
        ans += delta;
        x -= delta, y -= delta;
    }
    FOR (i, 0, 2) FOR (j, 0, 2) mx = max(mx, cnt[i][j]);
    ans += 2 * mx;
    return ans;
}

/*
in1
6 3
ATACAT
ACTATA
1 3
4 5
3 5
out1
2
1
-1
*/

#ifdef WAIMAI
int main() {
    int n, q;
    assert(scanf("%d %d", &n, &q) == 2);
    char A[n+1], B[n+1];
    assert(scanf("%s", A) == 1);
    assert(scanf("%s", B) == 1);
    string a = string(A);
    string b = string(B);
    vector<int> x(q), y(q);
    for (int i = 0; i < q; i++) {
        assert(scanf("%d %d", &x[i], &y[i]) == 2);
    }
    fclose(stdin);
    vector<int> results(q);
    init(a, b);
    for (int i = 0; i < q; i++) {
        results[i] = get_distance(x[i], y[i]);
    }
    for (int i = 0; i < q; i++) {
        printf("%d\n", results[i]);
    }
    fclose(stdout);
    return 0;
}
#endif

Subtask #1
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	28 ms	7972 KB	Output is correct
2	Correct	32 ms	8008 KB	Output is correct
3	Correct	28 ms	7500 KB	Output is correct
4	Correct	28 ms	8020 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct

Subtask #2
22.0 / 22.0

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

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	5 ms	6740 KB	Output is correct
5	Correct	5 ms	6740 KB	Output is correct
6	Correct	5 ms	6740 KB	Output is correct
7	Correct	4 ms	6356 KB	Output is correct
8	Correct	5 ms	6740 KB	Output is correct
9	Correct	4 ms	6740 KB	Output is correct
10	Correct	30 ms	8104 KB	Output is correct
11	Correct	34 ms	8020 KB	Output is correct
12	Correct	28 ms	7912 KB	Output is correct
13	Correct	31 ms	8052 KB	Output is correct
14	Correct	31 ms	8384 KB	Output is correct
15	Correct	29 ms	8368 KB	Output is correct
16	Correct	28 ms	8004 KB	Output is correct
17	Correct	36 ms	8120 KB	Output is correct
18	Correct	28 ms	8356 KB	Output is correct
19	Correct	28 ms	7964 KB	Output is correct
20	Correct	28 ms	8124 KB	Output is correct
21	Correct	27 ms	8368 KB	Output is correct

Subtask #4
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	5 ms	6740 KB	Output is correct
5	Correct	5 ms	6740 KB	Output is correct
6	Correct	5 ms	6740 KB	Output is correct
7	Correct	4 ms	6356 KB	Output is correct
8	Correct	5 ms	6740 KB	Output is correct
9	Correct	4 ms	6740 KB	Output is correct
10	Correct	6 ms	6228 KB	Output is correct
11	Correct	6 ms	6772 KB	Output is correct
12	Correct	5 ms	6356 KB	Output is correct
13	Correct	5 ms	6868 KB	Output is correct
14	Correct	5 ms	6764 KB	Output is correct
15	Correct	5 ms	6740 KB	Output is correct

Subtask #5
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	28 ms	7972 KB	Output is correct
2	Correct	32 ms	8008 KB	Output is correct
3	Correct	28 ms	7500 KB	Output is correct
4	Correct	28 ms	8020 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	5 ms	6740 KB	Output is correct
12	Correct	5 ms	6740 KB	Output is correct
13	Correct	5 ms	6740 KB	Output is correct
14	Correct	4 ms	6356 KB	Output is correct
15	Correct	5 ms	6740 KB	Output is correct
16	Correct	4 ms	6740 KB	Output is correct
17	Correct	30 ms	8104 KB	Output is correct
18	Correct	34 ms	8020 KB	Output is correct
19	Correct	28 ms	7912 KB	Output is correct
20	Correct	31 ms	8052 KB	Output is correct
21	Correct	31 ms	8384 KB	Output is correct
22	Correct	29 ms	8368 KB	Output is correct
23	Correct	28 ms	8004 KB	Output is correct
24	Correct	36 ms	8120 KB	Output is correct
25	Correct	28 ms	8356 KB	Output is correct
26	Correct	28 ms	7964 KB	Output is correct
27	Correct	28 ms	8124 KB	Output is correct
28	Correct	27 ms	8368 KB	Output is correct
29	Correct	6 ms	6228 KB	Output is correct
30	Correct	6 ms	6772 KB	Output is correct
31	Correct	5 ms	6356 KB	Output is correct
32	Correct	5 ms	6868 KB	Output is correct
33	Correct	5 ms	6764 KB	Output is correct
34	Correct	5 ms	6740 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	28 ms	7452 KB	Output is correct
37	Correct	28 ms	8020 KB	Output is correct
38	Correct	35 ms	7952 KB	Output is correct
39	Correct	35 ms	8356 KB	Output is correct
40	Correct	29 ms	8424 KB	Output is correct
41	Correct	4 ms	6740 KB	Output is correct
42	Correct	29 ms	7976 KB	Output is correct
43	Correct	31 ms	8368 KB	Output is correct
44	Correct	30 ms	8420 KB	Output is correct
45	Correct	35 ms	7992 KB	Output is correct
46	Correct	28 ms	8380 KB	Output is correct
47	Correct	29 ms	8368 KB	Output is correct

답안 #818129

Compilation message

Subtask #1 21.0 / 21.0

Subtask #2 22.0 / 22.0

Subtask #3 13.0 / 13.0

Subtask #4 28.0 / 28.0

Subtask #5 16.0 / 16.0

Subtask #1
21.0 / 21.0

Subtask #2
22.0 / 22.0

Subtask #3
13.0 / 13.0

Subtask #4
28.0 / 28.0

Subtask #5
16.0 / 16.0