oj.uz

Submission #103641

# Submission time Handle Problem Language Result Execution time Memory
103641 2019-04-01T16:07:33 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];
bool skip[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){
        if(skip[i]) continue;
        bool ok=true;
        for(int j=n-1;j>=0;--j){
            if(i!=j){
                if((dna[i]^dna[j]).count()!=k){
                    ok=false;
                    skip[j]=true;
                    break;
                }
            }
        }
        if(ok){
            printf("%d\n", i+1);
            break;
        }
    }
}

Compilation message

genetics.cpp: In function 'int main()':
genetics.cpp:32:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if((dna[i]^dna[j]).count()!=k){
                    ~~~~~~~~~~~~~~~~~~~~~~~^~~
genetics.cpp:15: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:18: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 380 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 95 ms 1016 KB Output is correct
2 Correct 173 ms 1272 KB Output is correct
3 Correct 40 ms 1272 KB Output is correct
4 Correct 73 ms 888 KB Output is correct
5 Correct 82 ms 1272 KB Output is correct
6 Correct 147 ms 1272 KB Output is correct
7 Correct 46 ms 632 KB Output is correct
8 Correct 45 ms 632 KB Output is correct
9 Correct 57 ms 1272 KB Output is correct
10 Correct 97 ms 1144 KB Output is correct
11 Correct 288 ms 1016 KB Output is correct
12 Correct 51 ms 1144 KB Output is correct
13 Correct 78 ms 1144 KB Output is correct
14 Correct 158 ms 1016 KB Output is correct
15 Correct 46 ms 1016 KB Output is correct
16 Correct 96 ms 1016 KB Output is correct
17 Correct 414 ms 1272 KB Output is correct
18 Correct 37 ms 1144 KB Output is correct
19 Correct 322 ms 1144 KB Output is correct
20 Correct 47 ms 1148 KB Output is correct
21 Correct 118 ms 1144 KB Output is correct
22 Correct 125 ms 1144 KB Output is correct
23 Correct 118 ms 1144 KB Output is correct
24 Correct 422 ms 1272 KB Output is correct
25 Correct 174 ms 1144 KB Output is correct
26 Correct 93 ms 1144 KB Output is correct
27 Correct 186 ms 1272 KB Output is correct
28 Correct 207 ms 1144 KB Output is correct
29 Correct 212 ms 1144 KB Output is correct
30 Correct 27 ms 1276 KB Output is correct
31 Correct 30 ms 1404 KB Output is correct
32 Correct 37 ms 1272 KB Output is correct
33 Correct 4 ms 256 KB Output is correct
34 Correct 5 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 95 ms 1016 KB Output is correct
2 Correct 173 ms 1272 KB Output is correct
3 Correct 40 ms 1272 KB Output is correct
4 Correct 73 ms 888 KB Output is correct
5 Correct 82 ms 1272 KB Output is correct
6 Correct 147 ms 1272 KB Output is correct
7 Correct 46 ms 632 KB Output is correct
8 Correct 45 ms 632 KB Output is correct
9 Correct 57 ms 1272 KB Output is correct
10 Correct 97 ms 1144 KB Output is correct
11 Correct 288 ms 1016 KB Output is correct
12 Correct 51 ms 1144 KB Output is correct
13 Correct 78 ms 1144 KB Output is correct
14 Correct 158 ms 1016 KB Output is correct
15 Correct 46 ms 1016 KB Output is correct
16 Correct 96 ms 1016 KB Output is correct
17 Correct 414 ms 1272 KB Output is correct
18 Correct 37 ms 1144 KB Output is correct
19 Correct 322 ms 1144 KB Output is correct
20 Correct 47 ms 1148 KB Output is correct
21 Correct 118 ms 1144 KB Output is correct
22 Correct 125 ms 1144 KB Output is correct
23 Correct 118 ms 1144 KB Output is correct
24 Correct 422 ms 1272 KB Output is correct
25 Correct 174 ms 1144 KB Output is correct
26 Correct 93 ms 1144 KB Output is correct
27 Correct 186 ms 1272 KB Output is correct
28 Correct 207 ms 1144 KB Output is correct
29 Correct 212 ms 1144 KB Output is correct
30 Correct 27 ms 1276 KB Output is correct
31 Correct 30 ms 1404 KB Output is correct
32 Correct 37 ms 1272 KB Output is correct
33 Correct 4 ms 256 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 256 KB Output is correct
36 Correct 212 ms 2080 KB Output is correct
37 Correct 687 ms 2424 KB Output is correct
38 Correct 174 ms 2296 KB Output is correct
39 Correct 531 ms 2296 KB Output is correct
40 Correct 903 ms 2552 KB Output is correct
41 Correct 275 ms 1400 KB Output is correct
42 Correct 240 ms 1400 KB Output is correct
43 Correct 254 ms 2040 KB Output is correct
44 Correct 225 ms 2552 KB Output is correct
45 Correct 484 ms 2424 KB Output is correct
46 Correct 192 ms 2424 KB Output is correct
47 Correct 538 ms 2168 KB Output is correct
48 Correct 1838 ms 2296 KB Output is correct
49 Correct 320 ms 2040 KB Output is correct
50 Correct 232 ms 1912 KB Output is correct
51 Correct 1949 ms 2168 KB Output is correct
52 Execution timed out 2081 ms 2296 KB Time limit exceeded
53 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 380 KB Output isn't correct
3 Halted 0 ms 0 KB -