Submission #437096

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
437096	2021-06-25T19:21:47 Z	xiaowuc1	Mutating DNA (IOI21_dna)	C++17	100 / 100	58 ms	6048 KB

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
// END NO SAD

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> matrix;

int dp[6][100005];
int cnt[3][100005];

void init(string a, string b) {
  int n = sz(a);
  for(int i = 0; i < n; i++) {
    for(int j = 0; j < 3; j++) {
      cnt[j][i+1] = cnt[j][i];
    }
    if(a[i] == 'A') cnt[0][i+1]++;
    if(b[i] == 'A') cnt[0][i+1]--;
    if(a[i] == 'C') cnt[1][i+1]++;
    if(b[i] == 'C') cnt[1][i+1]--;
    if(a[i] == 'T') cnt[2][i+1]++;
    if(b[i] == 'T') cnt[2][i+1]--;
  }
  for(int i = 0; i < n; i++) {
    for(int j = 0; j < 6; j++) {
      dp[j][i+1] = dp[j][i];
    }
    if(a[i] == 'A' && b[i] == 'C') dp[0][i+1]++;
    if(a[i] == 'C' && b[i] == 'A') dp[1][i+1]++;
    if(a[i] == 'A' && b[i] == 'T') dp[2][i+1]++;
    if(a[i] == 'T' && b[i] == 'A') dp[3][i+1]++;
    if(a[i] == 'C' && b[i] == 'T') dp[4][i+1]++;
    if(a[i] == 'T' && b[i] == 'C') dp[5][i+1]++;
  }
}

int get_distance(int a, int b) {
  b++;
  if(cnt[0][b] != cnt[0][a]) return -1;
  if(cnt[1][b] != cnt[1][a]) return -1;
  if(cnt[2][b] != cnt[2][a]) return -1;
  int ret = 0;
  int tot = 0;
  for(int i = 0; i < 6; i++) {
    tot += dp[i][b] - dp[i][a];
  }
  for(int i = 0; i < 6; i += 2) {
    int use = min(dp[i][b] - dp[i][a], dp[i+1][b] - dp[i+1][a]);
    tot -= 2 * use;
    ret += use;
  }
  assert(tot % 3 == 0);
  ret += (tot / 3) * 2;
  return ret;
}

/*
void solve() {
}

// what would chika do
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases
// are you doing geometry in floating points

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
  solve();
}
*/

Subtask #1
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	43 ms	5636 KB	Output is correct
2	Correct	43 ms	5632 KB	Output is correct
3	Correct	43 ms	5352 KB	Output is correct
4	Correct	45 ms	5624 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct

Subtask #2
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	248 KB	Output is correct
4	Correct	7 ms	4300 KB	Output is correct
5	Correct	7 ms	4300 KB	Output is correct
6	Correct	7 ms	4300 KB	Output is correct
7	Correct	6 ms	4044 KB	Output is correct
8	Correct	7 ms	4300 KB	Output is correct
9	Correct	5 ms	4300 KB	Output is correct

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	248 KB	Output is correct
4	Correct	7 ms	4300 KB	Output is correct
5	Correct	7 ms	4300 KB	Output is correct
6	Correct	7 ms	4300 KB	Output is correct
7	Correct	6 ms	4044 KB	Output is correct
8	Correct	7 ms	4300 KB	Output is correct
9	Correct	5 ms	4300 KB	Output is correct
10	Correct	43 ms	5632 KB	Output is correct
11	Correct	44 ms	5624 KB	Output is correct
12	Correct	44 ms	5776 KB	Output is correct
13	Correct	47 ms	5880 KB	Output is correct
14	Correct	43 ms	6012 KB	Output is correct
15	Correct	42 ms	5892 KB	Output is correct
16	Correct	41 ms	5776 KB	Output is correct
17	Correct	54 ms	5884 KB	Output is correct
18	Correct	43 ms	6048 KB	Output is correct
19	Correct	37 ms	5740 KB	Output is correct
20	Correct	38 ms	5900 KB	Output is correct
21	Correct	38 ms	6016 KB	Output is correct

Subtask #4
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	248 KB	Output is correct
4	Correct	7 ms	4300 KB	Output is correct
5	Correct	7 ms	4300 KB	Output is correct
6	Correct	7 ms	4300 KB	Output is correct
7	Correct	6 ms	4044 KB	Output is correct
8	Correct	7 ms	4300 KB	Output is correct
9	Correct	5 ms	4300 KB	Output is correct
10	Correct	7 ms	4004 KB	Output is correct
11	Correct	9 ms	4300 KB	Output is correct
12	Correct	7 ms	4044 KB	Output is correct
13	Correct	7 ms	4300 KB	Output is correct
14	Correct	7 ms	4332 KB	Output is correct
15	Correct	6 ms	4300 KB	Output is correct

Subtask #5
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	43 ms	5636 KB	Output is correct
2	Correct	43 ms	5632 KB	Output is correct
3	Correct	43 ms	5352 KB	Output is correct
4	Correct	45 ms	5624 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	248 KB	Output is correct
11	Correct	7 ms	4300 KB	Output is correct
12	Correct	7 ms	4300 KB	Output is correct
13	Correct	7 ms	4300 KB	Output is correct
14	Correct	6 ms	4044 KB	Output is correct
15	Correct	7 ms	4300 KB	Output is correct
16	Correct	5 ms	4300 KB	Output is correct
17	Correct	43 ms	5632 KB	Output is correct
18	Correct	44 ms	5624 KB	Output is correct
19	Correct	44 ms	5776 KB	Output is correct
20	Correct	47 ms	5880 KB	Output is correct
21	Correct	43 ms	6012 KB	Output is correct
22	Correct	42 ms	5892 KB	Output is correct
23	Correct	41 ms	5776 KB	Output is correct
24	Correct	54 ms	5884 KB	Output is correct
25	Correct	43 ms	6048 KB	Output is correct
26	Correct	37 ms	5740 KB	Output is correct
27	Correct	38 ms	5900 KB	Output is correct
28	Correct	38 ms	6016 KB	Output is correct
29	Correct	7 ms	4004 KB	Output is correct
30	Correct	9 ms	4300 KB	Output is correct
31	Correct	7 ms	4044 KB	Output is correct
32	Correct	7 ms	4300 KB	Output is correct
33	Correct	7 ms	4332 KB	Output is correct
34	Correct	6 ms	4300 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	45 ms	5296 KB	Output is correct
37	Correct	58 ms	5628 KB	Output is correct
38	Correct	57 ms	5772 KB	Output is correct
39	Correct	43 ms	6016 KB	Output is correct
40	Correct	44 ms	6016 KB	Output is correct
41	Correct	6 ms	4300 KB	Output is correct
42	Correct	41 ms	5840 KB	Output is correct
43	Correct	51 ms	6004 KB	Output is correct
44	Correct	54 ms	6012 KB	Output is correct
45	Correct	40 ms	5900 KB	Output is correct
46	Correct	41 ms	6020 KB	Output is correct
47	Correct	40 ms	6016 KB	Output is correct

Submission #437096

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