oj.uz

답안 #950623

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
950623 2024-03-20T13:56:56 Z Nhoksocqt1 DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 57 ms 9912 KB 
#include<bits/stdc++.h>
using namespace std;

#define inf 0x3f3f3f3f
#define sz(x) int((x).size())
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;

template<class X, class Y>
	inline bool maximize(X &x, const Y &y) {return (x < y ? x = y, 1 : 0);}
template<class X, class Y>
	inline bool minimize(X &x, const Y &y) {return (x > y ? x = y, 1 : 0);}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Random(int l, int r) {
    return uniform_int_distribution<int>(l, r)(rng);
}

const int MAXN = 100005;

string s, t;
int sumS[MAXN][3], sumT[MAXN][3], sum[MAXN][3][3], cnt[3], strLen;
bool check_sub3;

void init(string _S, string _T) {
    strLen = sz(_S);
    s = '^' + _S;
    t = '^' + _T;

    check_sub3 = 1;
    for (int i = 1; i <= strLen; ++i) {
        s[i] = (s[i] != 'A') + (s[i] == 'C');
        t[i] = (t[i] != 'A') + (t[i] == 'C');
        check_sub3 &= (max(s[i], t[i]) < 2);
        for (int j = 0; j < 3; ++j) {
            sumS[i][j] = sumS[i - 1][j], sumT[i][j] = sumT[i - 1][j];
            for (int k = 0; k < 3; ++k)
                sum[i][j][k] = sum[i - 1][j][k];
        }

        ++sumS[i][s[i]], ++sumT[i][t[i]];
        ++sum[i][s[i]][t[i]];
    }
}

int sub1(int l, int r) {
    cnt[0] = cnt[1] = cnt[2] = 0;
    for (int i = l; i <= r; ++i)
        ++cnt[s[i]], --cnt[t[i]];

    if(cnt[0] != 0 || cnt[1] != 0 || cnt[2] != 0)
        return -1;

    map<array<int, 3>, int> dist;
    array<int, 3> startNode, endNode;
    for (int i = 0; i < 3; ++i)
        startNode[i] = endNode[i] = -1;

    for (int i = l; i <= r; ++i) {
        startNode[i - l] = s[i];
        endNode[i - l] = t[i];
    }

    queue<array<int, 3>> qu;
    qu.push(startNode);
    dist[startNode] = 1;

    int szNow(r - l + 1);
    while(sz(qu)) {
        array<int, 3> p(qu.front());
        qu.pop();

        int distNow(dist[p]);
        if(p == endNode)
            return distNow - 1;

        for (int u = 0; u < szNow; ++u) {
            for (int v = u + 1; v < szNow; ++v) {
                swap(p[u], p[v]);
                if(dist.find(p) == dist.end()) {
                    dist[p] = distNow + 1;
                    qu.push(p);
                }

                swap(p[u], p[v]);
            }
        }
    }

    return -1;
}

int sub3(int l, int r) {
    return sum[r][0][1] - sum[l - 1][0][1];
}

int magicFunc(int l, int r) {
    int cnt[3][3];
    for (int i = 0; i < 3; ++i) {
        for (int j = 0; j < 3; ++j)
            cnt[i][j] = sum[r][i][j] - sum[l - 1][i][j];
    }

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

    int sum(0);
    for (int i = 0; i < 3; ++i) {
        for (int j = 0; j < 3; ++j) {
            sum += (i != j) * cnt[i][j];
        }
    }

    assert(sum % 3 == 0);
    return res + sum / 3 * 2;
}

int get_distance(int l, int r) {
    ++l, ++r;

    for (int k = 0; k < 3; ++k) {
        if(sumT[r][k] - sumT[l - 1][k] != sumS[r][k] - sumS[l - 1][k])
            return -1;
    }

    if(r - l <= 2)
        return sub1(l, r);

    if(check_sub3)
        return sub3(l, r);

    return magicFunc(l, r);
}

#ifdef Nhoksocqt1

int main(void) {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    #define TASK "dna"
    if(fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }

    string s, t;
    cin >> s >> t;

    init(s, t);
    int numQuery;
    cin >> numQuery;
    for (int t = 0; t < numQuery; ++t) {
        int x, y;
        cin >> x >> y;
        cout << "ANSWER FOR " << x << ' ' << y << ": " << get_distance(x, y) << '\n';
    }

    return 0;
}

#endif // Nhoksocqt1

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:43:23: warning: array subscript has type 'char' [-Wchar-subscripts]
   43 |         ++sumS[i][s[i]], ++sumT[i][t[i]];
      |                       ^
dna.cpp:43:40: warning: array subscript has type 'char' [-Wchar-subscripts]
   43 |         ++sumS[i][s[i]], ++sumT[i][t[i]];
      |                                        ^
dna.cpp:44:22: warning: array subscript has type 'char' [-Wchar-subscripts]
   44 |         ++sum[i][s[i]][t[i]];
      |                      ^
dna.cpp:44:28: warning: array subscript has type 'char' [-Wchar-subscripts]
   44 |         ++sum[i][s[i]][t[i]];
      |                            ^
dna.cpp: In function 'int sub1(int, int)':
dna.cpp:51:19: warning: array subscript has type 'char' [-Wchar-subscripts]
   51 |         ++cnt[s[i]], --cnt[t[i]];
      |                   ^
dna.cpp:51:32: warning: array subscript has type 'char' [-Wchar-subscripts]
   51 |         ++cnt[s[i]], --cnt[t[i]];
      |                                ^

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 8196 KB Output is correct
2 Correct 37 ms 8440 KB Output is correct
3 Correct 39 ms 7676 KB Output is correct
4 Correct 37 ms 8304 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 4 ms 7004 KB Output is correct
5 Correct 4 ms 7004 KB Output is correct
6 Correct 4 ms 7004 KB Output is correct
7 Correct 4 ms 6492 KB Output is correct
8 Correct 4 ms 7004 KB Output is correct
9 Correct 4 ms 7004 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 4 ms 7004 KB Output is correct
5 Correct 4 ms 7004 KB Output is correct
6 Correct 4 ms 7004 KB Output is correct
7 Correct 4 ms 6492 KB Output is correct
8 Correct 4 ms 7004 KB Output is correct
9 Correct 4 ms 7004 KB Output is correct
10 Correct 55 ms 8256 KB Output is correct
11 Correct 35 ms 8280 KB Output is correct
12 Correct 29 ms 8120 KB Output is correct
13 Correct 39 ms 8264 KB Output is correct
14 Correct 42 ms 8756 KB Output is correct
15 Correct 25 ms 8516 KB Output is correct
16 Correct 26 ms 8284 KB Output is correct
17 Correct 29 ms 8528 KB Output is correct
18 Correct 37 ms 8788 KB Output is correct
19 Correct 25 ms 8372 KB Output is correct
20 Correct 35 ms 8516 KB Output is correct
21 Correct 32 ms 8788 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 4 ms 7004 KB Output is correct
5 Correct 4 ms 7004 KB Output is correct
6 Correct 4 ms 7004 KB Output is correct
7 Correct 4 ms 6492 KB Output is correct
8 Correct 4 ms 7004 KB Output is correct
9 Correct 4 ms 7004 KB Output is correct
10 Correct 3 ms 6492 KB Output is correct
11 Correct 4 ms 7004 KB Output is correct
12 Correct 4 ms 6488 KB Output is correct
13 Correct 4 ms 7004 KB Output is correct
14 Correct 6 ms 7000 KB Output is correct
15 Correct 5 ms 7024 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 8196 KB Output is correct
2 Correct 37 ms 8440 KB Output is correct
3 Correct 39 ms 7676 KB Output is correct
4 Correct 37 ms 8304 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 4 ms 7004 KB Output is correct
12 Correct 4 ms 7004 KB Output is correct
13 Correct 4 ms 7004 KB Output is correct
14 Correct 4 ms 6492 KB Output is correct
15 Correct 4 ms 7004 KB Output is correct
16 Correct 4 ms 7004 KB Output is correct
17 Correct 55 ms 8256 KB Output is correct
18 Correct 35 ms 8280 KB Output is correct
19 Correct 29 ms 8120 KB Output is correct
20 Correct 39 ms 8264 KB Output is correct
21 Correct 42 ms 8756 KB Output is correct
22 Correct 25 ms 8516 KB Output is correct
23 Correct 26 ms 8284 KB Output is correct
24 Correct 29 ms 8528 KB Output is correct
25 Correct 37 ms 8788 KB Output is correct
26 Correct 25 ms 8372 KB Output is correct
27 Correct 35 ms 8516 KB Output is correct
28 Correct 32 ms 8788 KB Output is correct
29 Correct 3 ms 6492 KB Output is correct
30 Correct 4 ms 7004 KB Output is correct
31 Correct 4 ms 6488 KB Output is correct
32 Correct 4 ms 7004 KB Output is correct
33 Correct 6 ms 7000 KB Output is correct
34 Correct 5 ms 7024 KB Output is correct
35 Correct 1 ms 516 KB Output is correct
36 Correct 57 ms 8728 KB Output is correct
37 Correct 39 ms 9312 KB Output is correct
38 Correct 29 ms 9052 KB Output is correct
39 Correct 31 ms 9388 KB Output is correct
40 Correct 29 ms 9808 KB Output is correct
41 Correct 4 ms 7260 KB Output is correct
42 Correct 29 ms 9296 KB Output is correct
43 Correct 27 ms 9624 KB Output is correct
44 Correct 28 ms 9800 KB Output is correct
45 Correct 27 ms 9136 KB Output is correct
46 Correct 28 ms 9912 KB Output is correct
47 Correct 27 ms 9552 KB Output is correct