oj.uz

Submission #950618

# Submission time Handle Problem Language Result Execution time Memory
950618 2024-03-20T13:54:00 Z Nhoksocqt1 Mutating DNA (IOI21_dna) C++17
56 / 100
 46 ms 9560 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 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 0;
}

#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

# Verdict Execution time Memory Grader output
1 Correct 35 ms 8436 KB Output is correct
2 Correct 46 ms 9044 KB Output is correct
3 Correct 41 ms 8308 KB Output is correct
4 Correct 37 ms 9044 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 5 ms 7004 KB Output is correct
5 Correct 4 ms 7044 KB Output is correct
6 Correct 4 ms 7004 KB Output is correct
7 Correct 4 ms 6748 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 5 ms 7004 KB Output is correct
5 Correct 4 ms 7044 KB Output is correct
6 Correct 4 ms 7004 KB Output is correct
7 Correct 4 ms 6748 KB Output is correct
8 Correct 4 ms 7004 KB Output is correct
9 Correct 4 ms 7004 KB Output is correct
10 Correct 36 ms 8920 KB Output is correct
11 Correct 35 ms 9064 KB Output is correct
12 Correct 30 ms 9052 KB Output is correct
13 Correct 26 ms 9224 KB Output is correct
14 Correct 25 ms 9560 KB Output is correct
15 Correct 29 ms 8788 KB Output is correct
16 Correct 24 ms 9040 KB Output is correct
17 Correct 28 ms 9376 KB Output is correct
18 Correct 25 ms 9552 KB Output is correct
19 Correct 24 ms 9372 KB Output is correct
20 Correct 23 ms 9044 KB Output is correct
21 Correct 33 ms 9556 KB Output is correct

Subtask #4
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 5 ms 7004 KB Output is correct
5 Correct 4 ms 7044 KB Output is correct
6 Correct 4 ms 7004 KB Output is correct
7 Correct 4 ms 6748 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 Incorrect 3 ms 6748 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 8436 KB Output is correct
2 Correct 46 ms 9044 KB Output is correct
3 Correct 41 ms 8308 KB Output is correct
4 Correct 37 ms 9044 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 444 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 5 ms 7004 KB Output is correct
12 Correct 4 ms 7044 KB Output is correct
13 Correct 4 ms 7004 KB Output is correct
14 Correct 4 ms 6748 KB Output is correct
15 Correct 4 ms 7004 KB Output is correct
16 Correct 4 ms 7004 KB Output is correct
17 Correct 36 ms 8920 KB Output is correct
18 Correct 35 ms 9064 KB Output is correct
19 Correct 30 ms 9052 KB Output is correct
20 Correct 26 ms 9224 KB Output is correct
21 Correct 25 ms 9560 KB Output is correct
22 Correct 29 ms 8788 KB Output is correct
23 Correct 24 ms 9040 KB Output is correct
24 Correct 28 ms 9376 KB Output is correct
25 Correct 25 ms 9552 KB Output is correct
26 Correct 24 ms 9372 KB Output is correct
27 Correct 23 ms 9044 KB Output is correct
28 Correct 33 ms 9556 KB Output is correct
29 Correct 3 ms 6492 KB Output is correct
30 Correct 4 ms 7004 KB Output is correct
31 Incorrect 3 ms 6748 KB Output isn't correct
32 Halted 0 ms 0 KB -