제출 #202665

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
202665		karma	Genetics (BOI18_genetics)	C++14	100 / 100	225 ms	68216 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;
typedef unsigned long long int ui;
const int N = 4200;
const ui base = 33;

ui p[N], sum[N][4], ssum[N];
int n, m, k, a[N][N];
string s;

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; p[0] = 1;
    ui cur = 0, ss;
    for(int i = 1; i <= n; ++i) {
        p[i] = p[i - 1] * base;
        cin >> s;
        for(int j = 0; j < m; ++j) {
            a[i][j] = Code(s[j]);
            sum[j][a[i][j]] += p[i];
        }
        cur += p[i] * (ui)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][a[i][j]]);
        if(cur == ss + p[i] * (ui)k) return cout << i, 0;
    }
    cout << n;
}

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

genetics.cpp: In function 'int main()':
genetics.cpp:32: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:33: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