oj.uz

Submission #103638

# Submission time Handle Problem Language Result Execution time Memory
103638 2019-04-01T15:59:19 Z pavel Genetics (BOI18_genetics) C++14
19 / 100
 2000 ms 2552 KB 
#include <cstdio>
#include <bitset>

using namespace std;

const int MAXN = 4103;
const int MAXM = 4103;

int n,m,k;

bitset<MAXM> dna[MAXN];

int main(){
    scanf("%d%d%d", &n, &m, &k);
    for(int i=0;i<n;++i){
        char tmp[MAXM];
        scanf("%s", tmp);
        for(int j=0;j<m;++j){
            if(tmp[j]=='A'){
                dna[i].set(j, false);
            }else{
                dna[i].set(j, true);
            }
        }
    }
    for(int i=0;i<n;++i){
        bool ok=true;
        for(int j=0;j<n;++j){
            if(i!=j){
                if((dna[i]^dna[j]).count()!=k){
                    ok=false;
                    break;
                }
            }
        }
        if(ok){
            printf("%d\n", i+1);
            break;
        }
    }
}

Compilation message

genetics.cpp: In function 'int main()':
genetics.cpp:30:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if((dna[i]^dna[j]).count()!=k){
                    ~~~~~~~~~~~~~~~~~~~~~~~^~~
genetics.cpp:14: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:17:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s", tmp);
         ~~~~~^~~~~~~~~~~

Subtask #1
0 / 27.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 537 ms 1248 KB Output is correct
2 Correct 337 ms 1272 KB Output is correct
3 Correct 847 ms 1272 KB Output is correct
4 Correct 175 ms 888 KB Output is correct
5 Correct 85 ms 1192 KB Output is correct
6 Correct 208 ms 1276 KB Output is correct
7 Correct 92 ms 632 KB Output is correct
8 Correct 86 ms 632 KB Output is correct
9 Correct 36 ms 1144 KB Output is correct
10 Correct 507 ms 1276 KB Output is correct
11 Correct 133 ms 1016 KB Output is correct
12 Correct 43 ms 1016 KB Output is correct
13 Correct 119 ms 1144 KB Output is correct
14 Correct 261 ms 1016 KB Output is correct
15 Correct 98 ms 1020 KB Output is correct
16 Correct 144 ms 1016 KB Output is correct
17 Correct 292 ms 1144 KB Output is correct
18 Correct 56 ms 1144 KB Output is correct
19 Correct 299 ms 1144 KB Output is correct
20 Correct 178 ms 1272 KB Output is correct
21 Correct 486 ms 1144 KB Output is correct
22 Correct 719 ms 1260 KB Output is correct
23 Correct 764 ms 1272 KB Output is correct
24 Correct 436 ms 1272 KB Output is correct
25 Correct 81 ms 1144 KB Output is correct
26 Correct 334 ms 1144 KB Output is correct
27 Correct 211 ms 1272 KB Output is correct
28 Correct 177 ms 1144 KB Output is correct
29 Correct 478 ms 1272 KB Output is correct
30 Correct 25 ms 1144 KB Output is correct
31 Correct 27 ms 1272 KB Output is correct
32 Correct 38 ms 1272 KB Output is correct
33 Correct 5 ms 256 KB Output is correct
34 Correct 4 ms 376 KB Output is correct
35 Correct 5 ms 256 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 537 ms 1248 KB Output is correct
2 Correct 337 ms 1272 KB Output is correct
3 Correct 847 ms 1272 KB Output is correct
4 Correct 175 ms 888 KB Output is correct
5 Correct 85 ms 1192 KB Output is correct
6 Correct 208 ms 1276 KB Output is correct
7 Correct 92 ms 632 KB Output is correct
8 Correct 86 ms 632 KB Output is correct
9 Correct 36 ms 1144 KB Output is correct
10 Correct 507 ms 1276 KB Output is correct
11 Correct 133 ms 1016 KB Output is correct
12 Correct 43 ms 1016 KB Output is correct
13 Correct 119 ms 1144 KB Output is correct
14 Correct 261 ms 1016 KB Output is correct
15 Correct 98 ms 1020 KB Output is correct
16 Correct 144 ms 1016 KB Output is correct
17 Correct 292 ms 1144 KB Output is correct
18 Correct 56 ms 1144 KB Output is correct
19 Correct 299 ms 1144 KB Output is correct
20 Correct 178 ms 1272 KB Output is correct
21 Correct 486 ms 1144 KB Output is correct
22 Correct 719 ms 1260 KB Output is correct
23 Correct 764 ms 1272 KB Output is correct
24 Correct 436 ms 1272 KB Output is correct
25 Correct 81 ms 1144 KB Output is correct
26 Correct 334 ms 1144 KB Output is correct
27 Correct 211 ms 1272 KB Output is correct
28 Correct 177 ms 1144 KB Output is correct
29 Correct 478 ms 1272 KB Output is correct
30 Correct 25 ms 1144 KB Output is correct
31 Correct 27 ms 1272 KB Output is correct
32 Correct 38 ms 1272 KB Output is correct
33 Correct 5 ms 256 KB Output is correct
34 Correct 4 ms 376 KB Output is correct
35 Correct 5 ms 256 KB Output is correct
36 Correct 1814 ms 2196 KB Output is correct
37 Correct 925 ms 2552 KB Output is correct
38 Execution timed out 2086 ms 2424 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

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