oj.uz

답안 #624956

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
624956 2022-08-09T08:09:38 Z iomoon191 DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 37 ms 8568 KB 
#include "dna.h"
#include <bits/stdc++.h>
using ll = long long;
//#define int ll
using namespace std;

#define sz(x) (int)(x).size()
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, l, r) for(int i = l; i >= r; i--)
#define fi first
#define se second
#define mod 998244353

#define db(x) cerr << __LINE__ << " " << #x << " " << x << "\n"
using vi = vector<int>;
using pi = pair<int, int>;

const ll N = 100005;
const ll inf = 1e18;

int cnt[N][3], sum[N][3][3];

void init(string a, string b){
	int s = sz(a);
	auto type = [&](char c){
		if(c == 'A')
			return 0;
		if(c == 'T')
			return 1;
		if(c == 'C')
			return 2;
	};
	foru(i, 1, s){
		foru(j, 0, 2){
			foru(k, 0, 2){
				sum[i][j][k] = sum[i - 1][j][k];
			}
			cnt[i][j] = cnt[i - 1][j];
		}
		sum[i][type(a[i - 1])][type(b[i - 1])]++;	
		cnt[i][type(a[i - 1])]++;
		cnt[i][type(b[i - 1])]--;
	}	
}

int get_distance(int x, int y){
	int c[3][3] = {{0}};
	foru(i, 0, 2){
		foru(j, 0, 2){
			c[i][j] = sum[y + 1][i][j] - sum[x][i][j];
		}
	}
	if(cnt[y + 1][0] != cnt[x][0] or cnt[y + 1][1] != cnt[x][1] or cnt[y + 1][2] != cnt[x][2]) return -1;
	int z, ret = 0;
	z = min(c[1][0], c[0][1]);
	c[1][0] -= z;
	c[0][1] -= z;
	ret += z;
	z = min(c[1][2], c[2][1]);
	c[1][2] -= z;
	c[2][1] -= z;
	ret += z;
	z = min(c[2][0], c[0][2]);
	c[2][0] -= z;
	c[0][2] -= z;
	ret += z;
	return ret + 2 * (c[0][1] + c[1][0]);
}

Compilation message

dna.cpp: In lambda function:
dna.cpp:32:2: warning: control reaches end of non-void function [-Wreturn-type]
   32 |  };
      |  ^

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 8048 KB Output is correct
2 Correct 37 ms 8200 KB Output is correct
3 Correct 37 ms 7648 KB Output is correct
4 Correct 34 ms 8168 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 304 KB Output is correct
4 Correct 5 ms 5600 KB Output is correct
5 Correct 6 ms 5716 KB Output is correct
6 Correct 5 ms 5716 KB Output is correct
7 Correct 5 ms 5332 KB Output is correct
8 Correct 5 ms 5716 KB Output is correct
9 Correct 4 ms 5716 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 304 KB Output is correct
4 Correct 5 ms 5600 KB Output is correct
5 Correct 6 ms 5716 KB Output is correct
6 Correct 5 ms 5716 KB Output is correct
7 Correct 5 ms 5332 KB Output is correct
8 Correct 5 ms 5716 KB Output is correct
9 Correct 4 ms 5716 KB Output is correct
10 Correct 36 ms 8172 KB Output is correct
11 Correct 35 ms 8184 KB Output is correct
12 Correct 33 ms 8088 KB Output is correct
13 Correct 33 ms 8340 KB Output is correct
14 Correct 36 ms 8488 KB Output is correct
15 Correct 36 ms 8436 KB Output is correct
16 Correct 31 ms 8088 KB Output is correct
17 Correct 33 ms 8224 KB Output is correct
18 Correct 32 ms 8440 KB Output is correct
19 Correct 33 ms 8116 KB Output is correct
20 Correct 30 ms 8180 KB Output is correct
21 Correct 30 ms 8480 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 304 KB Output is correct
4 Correct 5 ms 5600 KB Output is correct
5 Correct 6 ms 5716 KB Output is correct
6 Correct 5 ms 5716 KB Output is correct
7 Correct 5 ms 5332 KB Output is correct
8 Correct 5 ms 5716 KB Output is correct
9 Correct 4 ms 5716 KB Output is correct
10 Correct 4 ms 5204 KB Output is correct
11 Correct 5 ms 5692 KB Output is correct
12 Correct 5 ms 5332 KB Output is correct
13 Correct 5 ms 5716 KB Output is correct
14 Correct 5 ms 5696 KB Output is correct
15 Correct 5 ms 5716 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 8048 KB Output is correct
2 Correct 37 ms 8200 KB Output is correct
3 Correct 37 ms 7648 KB Output is correct
4 Correct 34 ms 8168 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 304 KB Output is correct
11 Correct 5 ms 5600 KB Output is correct
12 Correct 6 ms 5716 KB Output is correct
13 Correct 5 ms 5716 KB Output is correct
14 Correct 5 ms 5332 KB Output is correct
15 Correct 5 ms 5716 KB Output is correct
16 Correct 4 ms 5716 KB Output is correct
17 Correct 36 ms 8172 KB Output is correct
18 Correct 35 ms 8184 KB Output is correct
19 Correct 33 ms 8088 KB Output is correct
20 Correct 33 ms 8340 KB Output is correct
21 Correct 36 ms 8488 KB Output is correct
22 Correct 36 ms 8436 KB Output is correct
23 Correct 31 ms 8088 KB Output is correct
24 Correct 33 ms 8224 KB Output is correct
25 Correct 32 ms 8440 KB Output is correct
26 Correct 33 ms 8116 KB Output is correct
27 Correct 30 ms 8180 KB Output is correct
28 Correct 30 ms 8480 KB Output is correct
29 Correct 4 ms 5204 KB Output is correct
30 Correct 5 ms 5692 KB Output is correct
31 Correct 5 ms 5332 KB Output is correct
32 Correct 5 ms 5716 KB Output is correct
33 Correct 5 ms 5696 KB Output is correct
34 Correct 5 ms 5716 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 32 ms 7708 KB Output is correct
37 Correct 36 ms 8180 KB Output is correct
38 Correct 33 ms 8172 KB Output is correct
39 Correct 33 ms 8564 KB Output is correct
40 Correct 34 ms 8568 KB Output is correct
41 Correct 4 ms 5700 KB Output is correct
42 Correct 33 ms 8084 KB Output is correct
43 Correct 31 ms 8528 KB Output is correct
44 Correct 31 ms 8424 KB Output is correct
45 Correct 31 ms 8088 KB Output is correct
46 Correct 31 ms 8444 KB Output is correct
47 Correct 31 ms 8456 KB Output is correct