Submission #202887

#	Time	Username	Problem	Language	Result	Execution time	Memory
202887		karma	Genetics (BOI18_genetics)	C++14	100 / 100	326 ms	20064 KiB

genetics

#include<bits/stdc++.h>
#define ll            long long
#define pb            emplace_back
#define fi            first
#define se            second
#define mp            make_pair
//#define int           int64_t

using namespace std;

typedef pair<ll, ll> pii;
const int N = (int)5e3 + 2;

ll p[N], k, sum[N][5], cur = 0, ss, ssum[N];
int n, m;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int Code(char c) {
    if(c == 'A') return 1;
    if(c == 'C') return 2;
    if(c == 'T') return 3;
    return 0;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    #define FileName      "test"
    if(fopen(FileName".inp", "r")) {
       freopen(FileName".inp", "r", stdin);
       freopen(FileName".out", "w", stdout);
    }
    cin >> n >> m >> k; vector<string> s(n + 2);
    for(int i = 1; i <= n; ++i) {
        p[i] = uniform_int_distribution<int>((int)1e7, (int)1e9)(rng);
        cin >> s[i];
        for(int j = 0; j < m; ++j) sum[j][Code(s[i][j])] += p[i];
        cur += p[i] * k;
    }
    for(int i = 0; i < m; ++i) {
        ssum[i] = 0;
        for(int j = 0; j < 4; ++j) ssum[i] += sum[i][j];
    }
    for(int i = 1; i <= n; ++i) {
        ss = 0;
        for(int j = 0; j < m; ++j) ss += (ssum[j] - sum[j][Code(s[i][j])]);
        if(cur - p[i] * k == ss) return cout << i, 0;
    }
}

Compilation message (stderr)

genetics.cpp: In function 'int main()':
genetics.cpp:30:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
        freopen(FileName".inp", "r", stdin);
        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
genetics.cpp:31:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
        freopen(FileName".out", "w", stdout);
        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 27 / 27
• Subtask 2: 19 / 19
• Subtask 3: 28 / 28
• Subtask 4: 26 / 26