제출 #979902

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
979902		vjudge1	Genetics (BOI18_genetics)	C++17	47 / 100	805 ms	25584 KiB

genetics

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int maxN  = 4'123;

const ll Mod    = 1'696'969'997;
const ll maxW   = 1'234'567;

mt19937_64 rng(Mod);
uniform_int_distribution<ll> uid(1, maxW);

ll madd(ll x, ll y) { return (x + y) % Mod; }
ll msub(ll x, ll y) { return (x - y + Mod) % Mod; }
ll mmul(ll x, ll y) { return (x * y) % Mod; }

int N, M, K;
bool A[maxN][maxN];
ll sum_w, row_w[maxN];
ll col_sum[maxN];

int main() {
    scanf("%d %d %d", &N, &M, &K);
    char buf;
    for (int i = 1; i <= N; i++) {
        row_w[i] = uid(rng);
        sum_w = madd(sum_w, row_w[i]);

        for (int j = 1; j <= M; j++) {
            scanf(" %c", &buf);
            if (buf == 'A') A[i][j] = true;
        }
    }

    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= M; j++) {
            if (A[i][j]) col_sum[j] = madd(col_sum[j], row_w[i]);
        }
    }

    for (int r = 1; r <= N; r++) {
        ll target = mmul(M - K, msub(sum_w, row_w[r])); // must match at M - K positions

        ll cur = 0;
        for (int c = 1; c <= M; c++) {
            if (A[r][c]) {
                cur = madd(cur, msub(col_sum[c], row_w[r]));
            } else {
                cur = madd(cur, msub(msub(sum_w, col_sum[c]), row_w[r]));
            }
        }

        if (target == cur) {
            printf("%d\n", r);
            exit(0);
        }
    }
}

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

genetics.cpp: In function 'int main()':
genetics.cpp:24:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |     scanf("%d %d %d", &N, &M, &K);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
genetics.cpp:31:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |             scanf(" %c", &buf);
      |             ~~~~~^~~~~~~~~~~~~

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