제출 #691669

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
691669		vjudge1	Mutating DNA (IOI21_dna)	C++17	100 / 100	42 ms	6080 KiB

dna

    #include <bits/stdc++.h>
    #define ll long long
    using namespace std;
    const int MX = 1e5 + 5;
    int dp[MX][3][3];
    int n;
    void init(string a, string b){
        map<char, char> mp = {{'A', 0}, {'T', 1}, {'C', 2}};
        n = a.size();
        for (int i = 0; i < n; i++)
        {
            a[i] = mp[a[i]];
            b[i] = mp[b[i]];
        }
        
        if(a[0] != b[0]) dp[0][a[0]][b[0]]++;
        for (int i = 1; i < n; i++)
        {
            for (int j = 0; j < 3; j++)
                for (int k = 0; k < 3; k++)
                    dp[i][j][k] = dp[i - 1][j][k];
            if(a[i] != b[i]) dp[i][a[i]][b[i]]++;
        }
        
    }
    int get_distance(int x, int y){
        int c[3][3];
        for (int i = 0; i < 3; i++)
        {
            for (int j = 0; j < 3; j++)
            {
                c[i][j] = dp[y][i][j];
                if(x != 0) c[i][j] -= dp[x - 1][i][j];
            }
        }
        int ans = 0;
        ans = min(c[0][1], c[1][0]) + min(c[1][2], c[2][1]) + min(c[0][2], c[2][0]);
        if((c[0][1] - c[1][0]) == (c[2][0] - c[0][2]) && (c[2][0] - c[0][2]) == (c[1][2] - c[2][1])) return (ans + 2 * abs(c[0][1] - c[1][0]));
        return -1;
    }

컴파일 시 표준 에러 (stderr) 메시지

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:16:36: warning: array subscript has type 'char' [-Wchar-subscripts]
   16 |         if(a[0] != b[0]) dp[0][a[0]][b[0]]++;
      |                                    ^
dna.cpp:16:42: warning: array subscript has type 'char' [-Wchar-subscripts]
   16 |         if(a[0] != b[0]) dp[0][a[0]][b[0]]++;
      |                                          ^
dna.cpp:22:40: warning: array subscript has type 'char' [-Wchar-subscripts]
   22 |             if(a[i] != b[i]) dp[i][a[i]][b[i]]++;
      |                                        ^
dna.cpp:22:46: warning: array subscript has type 'char' [-Wchar-subscripts]
   22 |             if(a[i] != b[i]) dp[i][a[i]][b[i]]++;
      |                                              ^

• Subtask 1: 21 / 21
• Subtask 2: 22 / 22
• Subtask 3: 13 / 13
• Subtask 4: 28 / 28
• Subtask 5: 16 / 16