Submission #952624

# Submission time Handle Problem Language Result Execution time Memory
952624 2024-03-24T11:33:23 Z wood Mutating DNA (IOI21_dna) C++17
35 / 100
33 ms 7460 KB
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll, ll> p32;
typedef pair<ll, ll> p64;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define MOD %1000000007

vector<ll> pref_b;
vector<ll> pref_a;
vector<ll> pref_b2;
vector<ll> pref_a2;
vector<ll> matchpref;
void init(string a, string b) {
    ll n = a.size();
    pref_a.resize(n+1);
    pref_b.resize(n+1);
    pref_a2.resize(n+1);
    pref_b2.resize(n+1);
    matchpref.resize(n+1);
    for (size_t i = 0; i < a.size(); i++) {
        pref_a[i + 1] = pref_a[i] + (a[i] == 'A');
        pref_b[i + 1] = pref_b[i] + (b[i] == 'A');
        pref_a2[i + 1] = pref_a2[i] + (a[i] == 'T');
        pref_b2[i + 1] = pref_b2[i] + (b[i] == 'T');
        matchpref[i + 1] = matchpref[i]+(((a[i] == 'A') && (b[i] != 'A'))||((a[i]=='T')&&(b[i]=='C')));
    }
}

ll get_distance(int x, int y) {
    if ((pref_a[y + 1] - pref_a[x] != pref_b[y + 1] - pref_b[x])||(pref_a2[y+1]-pref_a2[x]!= pref_b2[y+1]-pref_b2[x])) {
        return -1;
    }
    else return (matchpref[y + 1] - matchpref[x]);
}
# Verdict Execution time Memory Grader output
1 Correct 25 ms 6416 KB Output is correct
2 Correct 27 ms 6924 KB Output is correct
3 Incorrect 25 ms 6420 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 3 ms 5024 KB Output is correct
6 Correct 3 ms 4800 KB Output is correct
7 Correct 3 ms 4700 KB Output is correct
8 Correct 3 ms 4956 KB Output is correct
9 Correct 3 ms 4956 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 3 ms 5024 KB Output is correct
6 Correct 3 ms 4800 KB Output is correct
7 Correct 3 ms 4700 KB Output is correct
8 Correct 3 ms 4956 KB Output is correct
9 Correct 3 ms 4956 KB Output is correct
10 Correct 26 ms 6916 KB Output is correct
11 Correct 26 ms 6928 KB Output is correct
12 Correct 28 ms 7196 KB Output is correct
13 Correct 27 ms 6936 KB Output is correct
14 Correct 27 ms 7440 KB Output is correct
15 Correct 26 ms 6460 KB Output is correct
16 Correct 26 ms 7112 KB Output is correct
17 Correct 26 ms 6828 KB Output is correct
18 Correct 30 ms 7332 KB Output is correct
19 Correct 33 ms 7460 KB Output is correct
20 Correct 25 ms 6860 KB Output is correct
21 Correct 26 ms 7336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 3 ms 5024 KB Output is correct
6 Correct 3 ms 4800 KB Output is correct
7 Correct 3 ms 4700 KB Output is correct
8 Correct 3 ms 4956 KB Output is correct
9 Correct 3 ms 4956 KB Output is correct
10 Incorrect 3 ms 4444 KB Output isn't correct
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 25 ms 6416 KB Output is correct
2 Correct 27 ms 6924 KB Output is correct
3 Incorrect 25 ms 6420 KB Output isn't correct
4 Halted 0 ms 0 KB -