oj.uz

답안 #789730

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
789730 2023-07-21T21:07:36 Z Liudas DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 323 ms 58516 KB 
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
string s, s1;
vector<int> dif;
vector<array<int, 3>> need, got;
vector<map<string, int>> seq;
void init(string a, string b){
    s = a;
    s1 = b;
    dif.assign(s.size(), 0);
    need.assign(s.size(), {0,0,0});
    got.assign(s.size(), {0,0,0});
    map<char, int> _map = {{'A',0},{'C',1},{'T',2}};
    map<string, int> map2 = {{"AT",0},{"TA", 0},{"AC",0},{"CA",0},{"CT",0},{"TC", 0}};
    vector<int> n1(3,0), n2(3,0);
    seq.resize(s.size());
    int t = 0, diff = 0;
    for(int i = 0; i < s.size(); i ++){
        string lo = string(1, s1[i]), ol = string(1, s[i]);
        string lol = lo + ol;
        if(s1[i] != s[i]){
            map2[lol]++;
            n1[_map[s[i]]]++;
            n2[_map[s1[i]]]++;
            diff++;
        }
        for(auto[l,r]:map2){
            seq[i][l] = r;
        }
        for(int j = 0; j < 3; j ++){
            need[i][j] = n1[j];
            got[i][j] = n2[j];
        }
        dif[i] = diff;
    }
}
int get_distance(int x, int y){
    int score = 0;
    array<int, 3> d1, d2;
    map<string, int> retard;
    for(int i = 0; i < 3; i ++){
        d1[i] = need[y][i] - (x > 0 ? need[x-1][i] : 0);
        d2[i] = got[y][i] - (x > 0 ? got[x-1][i] : 0);
    }
    for(auto [l,r] : seq[y]){
        int a = r - (x > 0 ? seq[x-1][l] : 0);
        retard[l] = a;
    }
    int irl = 0;
    for(auto [l, r] : retard){
        int t = min(r, retard[string(1,l[1]) + string(1,l[0])]);
        retard[l] -= t;
        retard[string(1,l[1]) + string(1,l[0])] -= t;
        score += t;
        irl += retard[l];
    }
    if(d1 != d2){
        return -1;
    }
    else{
        return score + irl * 2 / 3;
    }
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:19:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for(int i = 0; i < s.size(); i ++){
      |                    ~~^~~~~~~~~~
dna.cpp:18:9: warning: unused variable 't' [-Wunused-variable]
   18 |     int t = 0, diff = 0;
      |         ^

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 284 ms 57452 KB Output is correct
2 Correct 292 ms 58156 KB Output is correct
3 Correct 265 ms 53292 KB Output is correct
4 Correct 274 ms 58124 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 300 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 97 ms 54932 KB Output is correct
5 Correct 91 ms 55596 KB Output is correct
6 Correct 80 ms 55148 KB Output is correct
7 Correct 78 ms 51924 KB Output is correct
8 Correct 89 ms 55680 KB Output is correct
9 Correct 83 ms 55628 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 97 ms 54932 KB Output is correct
5 Correct 91 ms 55596 KB Output is correct
6 Correct 80 ms 55148 KB Output is correct
7 Correct 78 ms 51924 KB Output is correct
8 Correct 89 ms 55680 KB Output is correct
9 Correct 83 ms 55628 KB Output is correct
10 Correct 271 ms 57608 KB Output is correct
11 Correct 265 ms 58120 KB Output is correct
12 Correct 254 ms 54588 KB Output is correct
13 Correct 263 ms 56048 KB Output is correct
14 Correct 267 ms 58420 KB Output is correct
15 Correct 323 ms 58516 KB Output is correct
16 Correct 263 ms 54584 KB Output is correct
17 Correct 259 ms 56012 KB Output is correct
18 Correct 277 ms 58420 KB Output is correct
19 Correct 226 ms 54544 KB Output is correct
20 Correct 233 ms 56128 KB Output is correct
21 Correct 238 ms 58400 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 97 ms 54932 KB Output is correct
5 Correct 91 ms 55596 KB Output is correct
6 Correct 80 ms 55148 KB Output is correct
7 Correct 78 ms 51924 KB Output is correct
8 Correct 89 ms 55680 KB Output is correct
9 Correct 83 ms 55628 KB Output is correct
10 Correct 80 ms 50840 KB Output is correct
11 Correct 88 ms 55728 KB Output is correct
12 Correct 77 ms 51988 KB Output is correct
13 Correct 82 ms 55364 KB Output is correct
14 Correct 89 ms 55600 KB Output is correct
15 Correct 99 ms 55596 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 284 ms 57452 KB Output is correct
2 Correct 292 ms 58156 KB Output is correct
3 Correct 265 ms 53292 KB Output is correct
4 Correct 274 ms 58124 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 97 ms 54932 KB Output is correct
12 Correct 91 ms 55596 KB Output is correct
13 Correct 80 ms 55148 KB Output is correct
14 Correct 78 ms 51924 KB Output is correct
15 Correct 89 ms 55680 KB Output is correct
16 Correct 83 ms 55628 KB Output is correct
17 Correct 271 ms 57608 KB Output is correct
18 Correct 265 ms 58120 KB Output is correct
19 Correct 254 ms 54588 KB Output is correct
20 Correct 263 ms 56048 KB Output is correct
21 Correct 267 ms 58420 KB Output is correct
22 Correct 323 ms 58516 KB Output is correct
23 Correct 263 ms 54584 KB Output is correct
24 Correct 259 ms 56012 KB Output is correct
25 Correct 277 ms 58420 KB Output is correct
26 Correct 226 ms 54544 KB Output is correct
27 Correct 233 ms 56128 KB Output is correct
28 Correct 238 ms 58400 KB Output is correct
29 Correct 80 ms 50840 KB Output is correct
30 Correct 88 ms 55728 KB Output is correct
31 Correct 77 ms 51988 KB Output is correct
32 Correct 82 ms 55364 KB Output is correct
33 Correct 89 ms 55600 KB Output is correct
34 Correct 99 ms 55596 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 256 ms 53324 KB Output is correct
37 Correct 275 ms 58112 KB Output is correct
38 Correct 264 ms 55100 KB Output is correct
39 Correct 271 ms 58444 KB Output is correct
40 Correct 280 ms 58496 KB Output is correct
41 Correct 80 ms 55628 KB Output is correct
42 Correct 291 ms 55056 KB Output is correct
43 Correct 264 ms 58444 KB Output is correct
44 Correct 306 ms 58416 KB Output is correct
45 Correct 237 ms 55032 KB Output is correct
46 Correct 238 ms 58480 KB Output is correct
47 Correct 236 ms 58460 KB Output is correct