oj.uz

Submission #94322

# Submission time Handle Problem Language Result Execution time Memory
94322 2019-01-17T17:40:02 Z dalgerok Genetics (BOI18_genetics) C++14
0 / 100
 154 ms 6520 KB 
#include<bits/stdc++.h>
#define int long long
using namespace std;



const int N = 4105;
const char letters[] = {'A', 'C', 'G', 'T'};



int n, m, k, val[N], sum, d[N][4];
char a[N][N];

inline bool check(int num){
    for(int i = 1; i <= n; i++){
        if(i == num){
            continue;
        }
        int cur = 0;
        for(int j = 1; j <= m; j++){
            cur += (a[num][j] != a[i][j]);
        }
        if(cur != k){
            return false;
        }
    }
    return true;
}

main(){
    srand(time(nullptr));
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m >> k;
    for(int i = 1; i <= n; i++){
        val[i] = (rand() ^ (rand() << 15));
        sum += val[i];
        for(int j = 1; j <= m; j++){
            cin >> a[i][j];
        }
    }
    for(int it = 0; it < 4; it++){
        for(int j = 1; j <= n; j++){
            for(int i = 1; i <= n; i++){
                if(a[i][j] == letters[it]){
                    d[j][it] += val[i];
                }
            }
        }
    }
    vector < int > q;
    for(int i = 1; i <= n; i++){
        int cur = 0;
        for(int j = 1; j <= m; j++){
            for(int l = 0; l < 4; l++){
                if(a[i][j] != letters[l]){
                    cur += d[j][l];
                }
            }
        }
        if(cur == k * (sum - val[i])){
            q.push_back(i);
        }
    }
    for(int i = 0; i < (int)q.size(); i++){
        if(check(q[i])){
            return cout << q[i], 0;
        }
    }
}

Compilation message

genetics.cpp:31:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^

Subtask #1
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 154 ms 6520 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 154 ms 6520 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 632 KB Output isn't correct
2 Halted 0 ms 0 KB -