oj.uz

답안 #437074

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
437074 2021-06-25T18:27:49 Z monsoon DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 44 ms 6340 KB 
#include <bits/stdc++.h>
#include "dna.h"
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
typedef long long ll;

string A, B;
int n;
int code[256];

struct info {
  int cnt[3][3];
  info() {
    REP(a,3) REP(b,3) cnt[a][b] = 0;
  }
};
vector<info> pref;


void init(string A, string B) {
  code['A'] = 0;
  code['C'] = 1;
  code['T'] = 2;

  ::A = A;
  ::B = B;
  n = A.size();
  pref.resize(n+1);

  REP(i,n) {
    REP(a,3) REP(b,3) pref[i+1].cnt[a][b] = pref[i].cnt[a][b];
    pref[i+1].cnt[code[A[i]]][code[B[i]]]++;
  }
}

int get_distance(int x, int y) {
  info in;
  REP(a,3) REP(b,3) in.cnt[a][b] = pref[y+1].cnt[a][b] - pref[x].cnt[a][b];
  REP(a,3) in.cnt[a][a] = 0;

  int ans = 0;
  REP(a,3) REP(b,a) {
    int c = min(in.cnt[a][b], in.cnt[b][a]);
    ans += c;
    in.cnt[a][b] -= c;
    in.cnt[b][a] -= c;
  }

  int sum[3][2];
  REP(a,3) REP(w,2) sum[a][w] = 0;
  REP(a,3) REP(b,3) {
    sum[a][0] += in.cnt[a][b];
    sum[b][1] += in.cnt[a][b];
  }
  REP(a,3) if (sum[a][0] != sum[a][1]) return -1;

  ans += sum[0][0] * 2;

  return ans;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:32:28: warning: array subscript has type 'char' [-Wchar-subscripts]
   32 |     pref[i+1].cnt[code[A[i]]][code[B[i]]]++;
      |                            ^
dna.cpp:32:40: warning: array subscript has type 'char' [-Wchar-subscripts]
   32 |     pref[i+1].cnt[code[A[i]]][code[B[i]]]++;
      |                                        ^

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 5956 KB Output is correct
2 Correct 40 ms 5888 KB Output is correct
3 Correct 39 ms 5532 KB Output is correct
4 Correct 42 ms 5944 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 4556 KB Output is correct
5 Correct 5 ms 4616 KB Output is correct
6 Correct 5 ms 4580 KB Output is correct
7 Correct 5 ms 4300 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 5 ms 4556 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 4556 KB Output is correct
5 Correct 5 ms 4616 KB Output is correct
6 Correct 5 ms 4580 KB Output is correct
7 Correct 5 ms 4300 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 5 ms 4556 KB Output is correct
10 Correct 42 ms 5800 KB Output is correct
11 Correct 41 ms 5904 KB Output is correct
12 Correct 41 ms 5900 KB Output is correct
13 Correct 41 ms 6096 KB Output is correct
14 Correct 42 ms 6284 KB Output is correct
15 Correct 42 ms 6204 KB Output is correct
16 Correct 39 ms 5964 KB Output is correct
17 Correct 42 ms 6060 KB Output is correct
18 Correct 39 ms 6280 KB Output is correct
19 Correct 37 ms 5972 KB Output is correct
20 Correct 38 ms 6136 KB Output is correct
21 Correct 38 ms 6336 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 4556 KB Output is correct
5 Correct 5 ms 4616 KB Output is correct
6 Correct 5 ms 4580 KB Output is correct
7 Correct 5 ms 4300 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 5 ms 4556 KB Output is correct
10 Correct 6 ms 4172 KB Output is correct
11 Correct 5 ms 4612 KB Output is correct
12 Correct 5 ms 4300 KB Output is correct
13 Correct 5 ms 4556 KB Output is correct
14 Correct 5 ms 4556 KB Output is correct
15 Correct 5 ms 4556 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 5956 KB Output is correct
2 Correct 40 ms 5888 KB Output is correct
3 Correct 39 ms 5532 KB Output is correct
4 Correct 42 ms 5944 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 5 ms 4556 KB Output is correct
12 Correct 5 ms 4616 KB Output is correct
13 Correct 5 ms 4580 KB Output is correct
14 Correct 5 ms 4300 KB Output is correct
15 Correct 5 ms 4556 KB Output is correct
16 Correct 5 ms 4556 KB Output is correct
17 Correct 42 ms 5800 KB Output is correct
18 Correct 41 ms 5904 KB Output is correct
19 Correct 41 ms 5900 KB Output is correct
20 Correct 41 ms 6096 KB Output is correct
21 Correct 42 ms 6284 KB Output is correct
22 Correct 42 ms 6204 KB Output is correct
23 Correct 39 ms 5964 KB Output is correct
24 Correct 42 ms 6060 KB Output is correct
25 Correct 39 ms 6280 KB Output is correct
26 Correct 37 ms 5972 KB Output is correct
27 Correct 38 ms 6136 KB Output is correct
28 Correct 38 ms 6336 KB Output is correct
29 Correct 6 ms 4172 KB Output is correct
30 Correct 5 ms 4612 KB Output is correct
31 Correct 5 ms 4300 KB Output is correct
32 Correct 5 ms 4556 KB Output is correct
33 Correct 5 ms 4556 KB Output is correct
34 Correct 5 ms 4556 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 41 ms 5512 KB Output is correct
37 Correct 41 ms 5860 KB Output is correct
38 Correct 43 ms 5956 KB Output is correct
39 Correct 42 ms 6212 KB Output is correct
40 Correct 44 ms 6284 KB Output is correct
41 Correct 5 ms 4556 KB Output is correct
42 Correct 40 ms 6056 KB Output is correct
43 Correct 39 ms 6340 KB Output is correct
44 Correct 41 ms 6276 KB Output is correct
45 Correct 41 ms 6116 KB Output is correct
46 Correct 38 ms 6340 KB Output is correct
47 Correct 39 ms 6340 KB Output is correct