제출 #202915

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
202915		admin	Genetics (BOI18_genetics)	C++14	100 / 100	273 ms	17272 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)4111;
 
ll p[N], k, sum[N][5], cur = 0, ss, ssum[N];
int n, m;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
char s[N][N];
 
int Code(char c) {
    if(c == 'A') return 1;
    if(c == 'C') return 2;
    if(c == 'T') return 3;
    return 0;
}
 
int main() {
    scanf("%d%d%d", &n, &m, &k);
    for(int i = 1; i <= n; ++i) {
        scanf("%s", s[i]);
        for(int j = 0; j < m; ++j) s[i][j] = Code(s[i][j]);
    }
    int step = 10;
    while(step --) {
        for(int i = 1; i <= n; ++i) {
            p[i] = uniform_int_distribution<ll>((ll)1e10, (ll)1e11)(rng);
            for(int j = 0; j < m; ++j) sum[j][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][s[i][j]]);
            if(cur - p[i] * k == ss) return printf("%d\n", i), 0;
        }
        if(step == 0) return printf("%d\n", n), 0;
    }
}

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

genetics.cpp: In function 'int main()':
genetics.cpp:27:31: warning: format '%d' expects argument of type 'int*', but argument 4 has type 'long long int*' [-Wformat=]
     scanf("%d%d%d", &n, &m, &k);
                             ~~^
genetics.cpp:36:54: warning: array subscript has type 'char' [-Wchar-subscripts]
             for(int j = 0; j < m; ++j) sum[j][s[i][j]] += p[i];
                                                      ^
genetics.cpp:45:71: warning: array subscript has type 'char' [-Wchar-subscripts]
             for(int j = 0; j < m; ++j) ss += (ssum[j] - sum[j][s[i][j]]);
                                                                       ^
genetics.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &n, &m, &k);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
genetics.cpp:29:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s", s[i]);
         ~~~~~^~~~~~~~~~~~

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