Submission #151151

# Submission time Handle Problem Language Result Execution time Memory
151151 2019-09-01T22:05:19 Z Blagojce Genetics (BOI18_genetics) C++11
19 / 100
2000 ms 3708 KB
#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x),end(x)

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
ll const inf = 1e9;
ll const mod = 1e9 + 7;
ld const eps = 1e-9;

bitset<4101> a[4101];
int main()
{
        int n, m, k;
        cin >> n >> m >> k;
        fr(i, 0, n){
                string s;
                cin >> s;
                fr(j, 0, m){
                        if(s[j] == 'A') a[i][j] = 1;
                }
        }
        bitset<4101> op;
        fr(i, 0, n){
                bool ok = true;
                fr(j, 0, n){
                        if(i == j) continue;
                        op = a[i]^a[j];
                        if(op.count() != k){
                                ok = false;
                                break;
                        }
                }
                if(ok){
                        cout << i + 1<< endl;
                        return 0;
                }
        }
        cout << -1 << endl;

        return 0;
}

Compilation message

genetics.cpp: In function 'int main()':
genetics.cpp:35:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                         if(op.count() != k){
                            ~~~~~~~~~~~^~~~
# 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 -
# Verdict Execution time Memory Grader output
1 Correct 761 ms 1248 KB Output is correct
2 Correct 519 ms 1400 KB Output is correct
3 Correct 1105 ms 1272 KB Output is correct
4 Correct 222 ms 888 KB Output is correct
5 Correct 223 ms 1320 KB Output is correct
6 Correct 367 ms 1272 KB Output is correct
7 Correct 162 ms 644 KB Output is correct
8 Correct 156 ms 760 KB Output is correct
9 Correct 168 ms 1160 KB Output is correct
10 Correct 737 ms 1272 KB Output is correct
11 Correct 253 ms 1016 KB Output is correct
12 Correct 156 ms 1144 KB Output is correct
13 Correct 250 ms 1144 KB Output is correct
14 Correct 395 ms 1632 KB Output is correct
15 Correct 233 ms 1656 KB Output is correct
16 Correct 270 ms 1784 KB Output is correct
17 Correct 492 ms 2004 KB Output is correct
18 Correct 196 ms 1912 KB Output is correct
19 Correct 482 ms 2004 KB Output is correct
20 Correct 341 ms 1912 KB Output is correct
21 Correct 692 ms 1992 KB Output is correct
22 Correct 965 ms 1976 KB Output is correct
23 Correct 994 ms 2116 KB Output is correct
24 Correct 625 ms 2040 KB Output is correct
25 Correct 219 ms 1912 KB Output is correct
26 Correct 509 ms 1912 KB Output is correct
27 Correct 367 ms 1912 KB Output is correct
28 Correct 327 ms 1912 KB Output is correct
29 Correct 654 ms 2040 KB Output is correct
30 Correct 167 ms 2040 KB Output is correct
31 Correct 171 ms 2044 KB Output is correct
32 Correct 181 ms 2040 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 761 ms 1248 KB Output is correct
2 Correct 519 ms 1400 KB Output is correct
3 Correct 1105 ms 1272 KB Output is correct
4 Correct 222 ms 888 KB Output is correct
5 Correct 223 ms 1320 KB Output is correct
6 Correct 367 ms 1272 KB Output is correct
7 Correct 162 ms 644 KB Output is correct
8 Correct 156 ms 760 KB Output is correct
9 Correct 168 ms 1160 KB Output is correct
10 Correct 737 ms 1272 KB Output is correct
11 Correct 253 ms 1016 KB Output is correct
12 Correct 156 ms 1144 KB Output is correct
13 Correct 250 ms 1144 KB Output is correct
14 Correct 395 ms 1632 KB Output is correct
15 Correct 233 ms 1656 KB Output is correct
16 Correct 270 ms 1784 KB Output is correct
17 Correct 492 ms 2004 KB Output is correct
18 Correct 196 ms 1912 KB Output is correct
19 Correct 482 ms 2004 KB Output is correct
20 Correct 341 ms 1912 KB Output is correct
21 Correct 692 ms 1992 KB Output is correct
22 Correct 965 ms 1976 KB Output is correct
23 Correct 994 ms 2116 KB Output is correct
24 Correct 625 ms 2040 KB Output is correct
25 Correct 219 ms 1912 KB Output is correct
26 Correct 509 ms 1912 KB Output is correct
27 Correct 367 ms 1912 KB Output is correct
28 Correct 327 ms 1912 KB Output is correct
29 Correct 654 ms 2040 KB Output is correct
30 Correct 167 ms 2040 KB Output is correct
31 Correct 171 ms 2044 KB Output is correct
32 Correct 181 ms 2040 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 256 KB Output is correct
36 Execution timed out 2020 ms 3708 KB Time limit exceeded
37 Halted 0 ms 0 KB -
# 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 -