oj.uz

Submission #80661

# Submission time Handle Problem Language Result Execution time Memory
80661 2018-10-22T01:11:59 Z FutymyClone Genetics (BOI18_genetics) C++14
27 / 100
 2000 ms 9464 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 4105;

int n, m, k;
char a[N][N];
bitset <N> bs[N][4];

int toint (char c) {
    if (c == 'A') return 0;
    if (c == 'C') return 1;
    if (c == 'G') return 2;
    return 3;
}

int solve (int i, int j) {
    int ans = bs[i][0].count() - (bs[i][0] & bs[j][0]).count();
    ans = ans + bs[i][1].count() - (bs[i][1] & bs[j][1]).count();
    ans = ans + bs[i][2].count() - (bs[i][2] & bs[j][2]).count();
    ans = ans + bs[i][3].count() - (bs[i][3] & bs[j][3]).count();
    return ans;
}

int main(){
    scanf("%d %d %d", &n, &m, &k);
    for (int i = 1; i <= n; i++) scanf("%s", a[i]);
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < m; j++) {
            bs[i][toint(a[i][j])].set(j);
        }
    }

    for (int i = 1; i <= n; i++) {
        bool ok = true;
        for (int j = 1; j <= n; j++) {
            if (i == j) continue;
            if (solve(i, j) != k) {
                ok = false;
                break;
            }
        }

        if (ok) return !printf("%d", i);
    }
    return 0;
}

Compilation message

genetics.cpp: In function 'int main()':
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:28:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i = 1; i <= n; i++) scanf("%s", a[i]);
                                  ~~~~~^~~~~~~~~~~~

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 888 KB Output is correct
2 Correct 5 ms 888 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 13 ms 760 KB Output is correct
5 Correct 12 ms 888 KB Output is correct
6 Correct 13 ms 888 KB Output is correct
7 Correct 7 ms 632 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 10 ms 760 KB Output is correct
10 Correct 10 ms 888 KB Output is correct
11 Correct 6 ms 760 KB Output is correct
12 Correct 21 ms 888 KB Output is correct
13 Correct 5 ms 888 KB Output is correct
14 Correct 5 ms 888 KB Output is correct
15 Correct 5 ms 888 KB Output is correct
16 Correct 5 ms 888 KB Output is correct
17 Correct 5 ms 376 KB Output is correct

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2097 ms 9464 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2097 ms 9464 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 888 KB Output is correct
2 Correct 5 ms 888 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 13 ms 760 KB Output is correct
5 Correct 12 ms 888 KB Output is correct
6 Correct 13 ms 888 KB Output is correct
7 Correct 7 ms 632 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 10 ms 760 KB Output is correct
10 Correct 10 ms 888 KB Output is correct
11 Correct 6 ms 760 KB Output is correct
12 Correct 21 ms 888 KB Output is correct
13 Correct 5 ms 888 KB Output is correct
14 Correct 5 ms 888 KB Output is correct
15 Correct 5 ms 888 KB Output is correct
16 Correct 5 ms 888 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Execution timed out 2097 ms 9464 KB Time limit exceeded
19 Halted 0 ms 0 KB -