Submission #922127

#	Time	Username	Problem	Language	Result	Execution time	Memory
922127		406	Mutating DNA (IOI21_dna)	C++17	100 / 100	36 ms	6172 KiB

dna

    #include "dna.h"
    #include <bits/stdc++.h>
    #define FOR(i, a, b) for (int i = (a); i < (b); i++)
    using namespace std;
    const int N = 1e5 + 50;
    int ps[N][3][3], n;
    short T[256];
     
    void init(string a, string b) {
    	T['A'] = 0;
    	T['T'] = 1;
    	T['C'] = 2;
    	n = a.size();
    	ps[0][T[a[0]]][T[b[0]]] = 1;
    	FOR(i, 1, n) {
    		FOR(j, 0, 3) FOR(k, 0, 3) ps[i][j][k] = ps[i - 1][j][k];
    		ps[i][T[a[i]]][T[b[i]]]++;
    	}
    }
     
    int get_distance(int x, int y) {
    	int dp[3][3];
    	memset(dp, 0, sizeof dp);
    	FOR(i, 0, 3) FOR(j, 0, 3) dp[i][j] = ps[y][i][j] - (x ? ps[x - 1][i][j] : 0);
    	int ans = 0;
     
    	FOR(i, 0, 3) FOR(j, i + 1, 3) {
    		int m = min(dp[i][j], dp[j][i]);
    		ans += m;
    		dp[i][j] -= m;
    		dp[j][i] -= m;
    	}
    	{
    		int m = min({dp[0][1], dp[1][2], dp[2][0]});
    		ans += 2 * m;
    		dp[0][1] -= m, dp[1][2] -= m, dp[2][0] -= m;
    	}
    	{
    		int m = min({dp[0][2], dp[2][1], dp[1][0]});
    		ans += 2 * m;
    		dp[0][2] -= m, dp[2][1] -= m, dp[1][0] -= m;
    	}
    	FOR(i, 0, 3) FOR(j, i + 1, 3) if (dp[i][j] || dp[j][i]) return -1;
    	return ans;
    }

Compilation message (stderr)

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:14:18: warning: array subscript has type 'char' [-Wchar-subscripts]
   14 |      ps[0][T[a[0]]][T[b[0]]] = 1;
      |                  ^
dna.cpp:14:27: warning: array subscript has type 'char' [-Wchar-subscripts]
   14 |      ps[0][T[a[0]]][T[b[0]]] = 1;
      |                           ^
dna.cpp:17:19: warning: array subscript has type 'char' [-Wchar-subscripts]
   17 |       ps[i][T[a[i]]][T[b[i]]]++;
      |                   ^
dna.cpp:17:28: warning: array subscript has type 'char' [-Wchar-subscripts]
   17 |       ps[i][T[a[i]]][T[b[i]]]++;
      |                            ^

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