Submission #542389

#	Time	Username	Problem	Language	Result	Execution time	Memory
542389		rembocoder	DNA 돌연변이 (IOI21_dna)	C++17	35 / 100	39 ms	8788 KiB

dna

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#include <bits/stdc++.h>

using namespace std;

//#define int int64_t
#define forn(i, n) for (int i = 0; i < (int)(n); i++)

struct my_hash {
    inline size_t operator()(const pair<int, int>& a) const {
        return a.first * 31 + a.second;
    }
};

string s, t;
string act = "ACT";
vector<int> cnt[3];
vector<int> x[3][3];

void init(string s_, string t_) {
    s = s_;
    t = t_;
    int n = s.size();
    for (int i = 0; i < 3; i++) {
        cnt[i].resize(n + 1);
        for (int j = 0; j < n; j++) {
            cnt[i][j + 1] = cnt[i][j] + (act[i] == s[j]) - (act[i] == t[j]);
        }
    }
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 3; j++) {
            x[i][j].resize(n + 1);
            for (int k = 0; k < n; k++) {
                x[i][j][k + 1] = x[i][j][k] + (act[i] == s[k] && act[j] == t[k]);
            }
        }
    }
}

int get_distance(int l, int r) {
    r++;
    for (int i = 0; i < 3; i++) {
        if (cnt[i][r] != cnt[i][l]) {
            return -1;
        }
    }
    int ab = x[0][1][r] - x[0][1][l];
    int ba = x[1][0][r] - x[1][0][l];
    int bc = x[1][2][r] - x[1][2][l];
    int cb = x[2][1][r] - x[2][1][l];
    int ca = x[2][0][r] - x[2][0][l];
    int ac = x[0][2][r] - x[0][2][l];
    int ans = min(ab, ba) + min(bc, cb) + min(ac, ca);
    return ans;
}

Compilation message (stderr)

dna.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
dna.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      |

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