oj.uz

답안 #957149

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
957149 2024-04-03T05:15:13 Z DeltaStruct DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 126 ms 6472 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
 
string x,y,u="ACT"; int n; map<string,vector<int>> acc;
void init(string a,string b){
  x = a,y = b,n = a.size();
  for (auto c:u) for (auto d:u) if (c!=d){
    string i = {c,d}; acc[i] = {0};
    for (int k(0);k < n;++k) acc[i].emplace_back(acc[i].back()+(x[k]==c&&y[k]==d));
  }
}
 
int get_distance(int l,int r){
  ++r;
  auto sb = [&acc,&l,&r](string s,string t){return (acc[s][r]-acc[s][l])-(acc[t][r]-acc[t][l]); };
  if (sb("AC","CA")!=sb("CT","TC")||sb("AC","CA")!=sb("TA","AT")) return -1;
  int res = abs(sb("AC","CA"))*2;
  for (int i(0);i < 3;++i) for (int k(i+1);k < 3;++k){
    string s = {u[i],u[k]},t = {u[k],u[i]};
    res += min(acc[s][r]-acc[s][l],acc[t][r]-acc[t][l]);
  }
  return res;
}

Compilation message

dna.cpp: In function 'int get_distance(int, int)':
dna.cpp:16:15: warning: capture of variable 'acc' with non-automatic storage duration
   16 |   auto sb = [&acc,&l,&r](string s,string t){return (acc[s][r]-acc[s][l])-(acc[t][r]-acc[t][l]); };
      |               ^~~
dna.cpp:5:52: note: 'std::map<std::__cxx11::basic_string<char>, std::vector<int> > acc' declared here
    5 | string x,y,u="ACT"; int n; map<string,vector<int>> acc;
      |                                                    ^~~

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 104 ms 5080 KB Output is correct
2 Correct 106 ms 5756 KB Output is correct
3 Correct 99 ms 5348 KB Output is correct
4 Correct 101 ms 5620 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 20 ms 3988 KB Output is correct
5 Correct 20 ms 3808 KB Output is correct
6 Correct 20 ms 3804 KB Output is correct
7 Correct 18 ms 3812 KB Output is correct
8 Correct 20 ms 3944 KB Output is correct
9 Correct 18 ms 4064 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 20 ms 3988 KB Output is correct
5 Correct 20 ms 3808 KB Output is correct
6 Correct 20 ms 3804 KB Output is correct
7 Correct 18 ms 3812 KB Output is correct
8 Correct 20 ms 3944 KB Output is correct
9 Correct 18 ms 4064 KB Output is correct
10 Correct 115 ms 5592 KB Output is correct
11 Correct 109 ms 5852 KB Output is correct
12 Correct 109 ms 6084 KB Output is correct
13 Correct 106 ms 5960 KB Output is correct
14 Correct 119 ms 6324 KB Output is correct
15 Correct 106 ms 5448 KB Output is correct
16 Correct 101 ms 5964 KB Output is correct
17 Correct 102 ms 5684 KB Output is correct
18 Correct 111 ms 6236 KB Output is correct
19 Correct 126 ms 6220 KB Output is correct
20 Correct 106 ms 5964 KB Output is correct
21 Correct 109 ms 6240 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 20 ms 3988 KB Output is correct
5 Correct 20 ms 3808 KB Output is correct
6 Correct 20 ms 3804 KB Output is correct
7 Correct 18 ms 3812 KB Output is correct
8 Correct 20 ms 3944 KB Output is correct
9 Correct 18 ms 4064 KB Output is correct
10 Correct 18 ms 3812 KB Output is correct
11 Correct 20 ms 4068 KB Output is correct
12 Correct 19 ms 3792 KB Output is correct
13 Correct 20 ms 4068 KB Output is correct
14 Correct 21 ms 3800 KB Output is correct
15 Correct 20 ms 4076 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 104 ms 5080 KB Output is correct
2 Correct 106 ms 5756 KB Output is correct
3 Correct 99 ms 5348 KB Output is correct
4 Correct 101 ms 5620 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 20 ms 3988 KB Output is correct
12 Correct 20 ms 3808 KB Output is correct
13 Correct 20 ms 3804 KB Output is correct
14 Correct 18 ms 3812 KB Output is correct
15 Correct 20 ms 3944 KB Output is correct
16 Correct 18 ms 4064 KB Output is correct
17 Correct 115 ms 5592 KB Output is correct
18 Correct 109 ms 5852 KB Output is correct
19 Correct 109 ms 6084 KB Output is correct
20 Correct 106 ms 5960 KB Output is correct
21 Correct 119 ms 6324 KB Output is correct
22 Correct 106 ms 5448 KB Output is correct
23 Correct 101 ms 5964 KB Output is correct
24 Correct 102 ms 5684 KB Output is correct
25 Correct 111 ms 6236 KB Output is correct
26 Correct 126 ms 6220 KB Output is correct
27 Correct 106 ms 5964 KB Output is correct
28 Correct 109 ms 6240 KB Output is correct
29 Correct 18 ms 3812 KB Output is correct
30 Correct 20 ms 4068 KB Output is correct
31 Correct 19 ms 3792 KB Output is correct
32 Correct 20 ms 4068 KB Output is correct
33 Correct 21 ms 3800 KB Output is correct
34 Correct 20 ms 4076 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 103 ms 5768 KB Output is correct
37 Correct 102 ms 6172 KB Output is correct
38 Correct 104 ms 5892 KB Output is correct
39 Correct 111 ms 5928 KB Output is correct
40 Correct 108 ms 6188 KB Output is correct
41 Correct 18 ms 4084 KB Output is correct
42 Correct 111 ms 6040 KB Output is correct
43 Correct 102 ms 6236 KB Output is correct
44 Correct 103 ms 6240 KB Output is correct
45 Correct 102 ms 5984 KB Output is correct
46 Correct 104 ms 6472 KB Output is correct
47 Correct 105 ms 5984 KB Output is correct