oj.uz

답안 #707805

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
707805 2023-03-10T07:44:01 Z josanneo22 DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 36 ms 7316 KB 
#include "dna.h"
#include<bits/stdc++.h>
 
using namespace std;
typedef long long int lld;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
 
int pref[1000000][3][3];
map<char,int> m;
void init(std::string a, std::string b) {
	m['A']=0;
	m['C']=1;
	m['T']=2;
	rep(j,0,3){
		rep(k,0,3){
			pref[0][j][k]=0;
		}
	}
	rep(i,0,(int)a.size()){
		rep(j,0,3){
			rep(k,0,3){
				pref[i+1][j][k]=pref[i][j][k];
			}
		}
		pref[i+1][m[a[i]]][m[b[i]]]++;
	}
}
int arr[3][3];
int get_distance(int x, int y) {
	y++;
	rep(i,0,3){
		rep(j,0,3){
			arr[i][j]=pref[y][i][j]-pref[x][i][j];
		}
	}
	int bal[3];
	rep(i,0,3)bal[i]=0;
	rep(i,0,3){
		rep(j,0,3){
			bal[i]+=arr[i][j];
			bal[j]-=arr[i][j];
		}
	}
	rep(i,0,3){
		if(bal[i]!=0)return -1;
	}
	int ans=0;
	rep(i,0,3){
		rep(j,0,3){
			if(i==j)arr[i][j]=0;
			int k=min(arr[i][j],arr[j][i]);
			ans+=k;
			arr[i][j]-=k;
			arr[j][i]-=k;
			//cerr<<arr[i][j]<<" ";
		}//cerr<<endl;
	}
	int tot=0;
	rep(i,0,3){
		rep(j,0,3){
			tot+=arr[i][j];
		}
	}
	tot/=3;
	tot*=2;
	ans+=tot;
	return ans;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 6988 KB Output is correct
2 Correct 32 ms 6996 KB Output is correct
3 Correct 34 ms 6628 KB Output is correct
4 Correct 34 ms 7048 KB Output is correct
5 Correct 0 ms 308 KB Output is correct
6 Correct 0 ms 312 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 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 4452 KB Output is correct
5 Correct 6 ms 4540 KB Output is correct
6 Correct 5 ms 4564 KB Output is correct
7 Correct 5 ms 4280 KB Output is correct
8 Correct 6 ms 4580 KB Output is correct
9 Correct 4 ms 4540 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 4452 KB Output is correct
5 Correct 6 ms 4540 KB Output is correct
6 Correct 5 ms 4564 KB Output is correct
7 Correct 5 ms 4280 KB Output is correct
8 Correct 6 ms 4580 KB Output is correct
9 Correct 4 ms 4540 KB Output is correct
10 Correct 35 ms 6928 KB Output is correct
11 Correct 33 ms 7028 KB Output is correct
12 Correct 35 ms 7012 KB Output is correct
13 Correct 34 ms 7148 KB Output is correct
14 Correct 35 ms 7316 KB Output is correct
15 Correct 32 ms 7312 KB Output is correct
16 Correct 33 ms 6936 KB Output is correct
17 Correct 32 ms 7064 KB Output is correct
18 Correct 35 ms 7256 KB Output is correct
19 Correct 31 ms 6948 KB Output is correct
20 Correct 31 ms 7080 KB Output is correct
21 Correct 33 ms 7288 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 4452 KB Output is correct
5 Correct 6 ms 4540 KB Output is correct
6 Correct 5 ms 4564 KB Output is correct
7 Correct 5 ms 4280 KB Output is correct
8 Correct 6 ms 4580 KB Output is correct
9 Correct 4 ms 4540 KB Output is correct
10 Correct 5 ms 4180 KB Output is correct
11 Correct 5 ms 4564 KB Output is correct
12 Correct 5 ms 4308 KB Output is correct
13 Correct 5 ms 4564 KB Output is correct
14 Correct 5 ms 4564 KB Output is correct
15 Correct 4 ms 4564 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 6988 KB Output is correct
2 Correct 32 ms 6996 KB Output is correct
3 Correct 34 ms 6628 KB Output is correct
4 Correct 34 ms 7048 KB Output is correct
5 Correct 0 ms 308 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 4 ms 4452 KB Output is correct
12 Correct 6 ms 4540 KB Output is correct
13 Correct 5 ms 4564 KB Output is correct
14 Correct 5 ms 4280 KB Output is correct
15 Correct 6 ms 4580 KB Output is correct
16 Correct 4 ms 4540 KB Output is correct
17 Correct 35 ms 6928 KB Output is correct
18 Correct 33 ms 7028 KB Output is correct
19 Correct 35 ms 7012 KB Output is correct
20 Correct 34 ms 7148 KB Output is correct
21 Correct 35 ms 7316 KB Output is correct
22 Correct 32 ms 7312 KB Output is correct
23 Correct 33 ms 6936 KB Output is correct
24 Correct 32 ms 7064 KB Output is correct
25 Correct 35 ms 7256 KB Output is correct
26 Correct 31 ms 6948 KB Output is correct
27 Correct 31 ms 7080 KB Output is correct
28 Correct 33 ms 7288 KB Output is correct
29 Correct 5 ms 4180 KB Output is correct
30 Correct 5 ms 4564 KB Output is correct
31 Correct 5 ms 4308 KB Output is correct
32 Correct 5 ms 4564 KB Output is correct
33 Correct 5 ms 4564 KB Output is correct
34 Correct 4 ms 4564 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 34 ms 6744 KB Output is correct
37 Correct 34 ms 7032 KB Output is correct
38 Correct 35 ms 7140 KB Output is correct
39 Correct 35 ms 7304 KB Output is correct
40 Correct 35 ms 7304 KB Output is correct
41 Correct 6 ms 4564 KB Output is correct
42 Correct 36 ms 7016 KB Output is correct
43 Correct 32 ms 7304 KB Output is correct
44 Correct 33 ms 7272 KB Output is correct
45 Correct 30 ms 7060 KB Output is correct
46 Correct 31 ms 7304 KB Output is correct
47 Correct 32 ms 7304 KB Output is correct