제출 #856464

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
856464		RiverFlow	Genetics (BOI18_genetics)	C++14	46 / 100	161 ms	35504 KiB

genetics

#include <bits/stdc++.h>

#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

template<typename U, typename V> bool maxi(U &a, V b) {
    if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
    if (a > b) { a = b; return 1; } return 0;
}

const int N = (int)4100 + 9;
const int mod = (int)1e9 + 7;

void prepare(); void main_code();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    const bool MULTITEST = 0; prepare();
    int num_test = 1; if (MULTITEST) cin >> num_test;
    while (num_test--) { main_code(); }
}

void prepare() {};

string s[N];

int diff(int i, int j) {
    int res = 0;
    for(int k = 0; k < sz(s[i]); ++k)
        res += (s[i][k] != s[j][k]);
    return res;
}

bitset<1800> b[N];

int n, m, k;

int d[N][N];

void subtask2() {
    for(int i = 0; i < n; ++i) {
        for(char &c : s[i]) {
            if (c == 'A') c = '0';
            else c = '1';
        }
        b[i] = bitset<1800>(s[i]);
    }
    for(int i = 0; i < n; ++i) {
        for(int j = i + 1; j < n; ++j) {
            d[i][j] = (b[i] ^ b[j]).count();
        }
    }
    for(int i = 0; i < n; ++i) {
        int c = 0;
        FOR(j, 0, n - 1) if (j < i) c += d[j][i] == k; else
            c += d[i][j] == k;
        if (c == n - 1)
            evoid(i + 1);
    }
}

void main_code() {
    cin >> n >> m >> k;

    for(int i = 0; i < n; ++i) cin >> s[i];

    if (n <= 100) {
        FOR(i, 0, n - 1) {
            int cnt = 0; FOR(j, 0, n - 1) cnt += diff(i, j) == k;
            if (cnt == n - 1) {
                evoid(i + 1);
            }
        }
    }

    if (n <= 1800 and m <= 1800) return subtask2(), void();

}


/*     Let the river flows naturally     */

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

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

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