oj.uz

Submission #984446

# Submission time Handle Problem Language Result Execution time Memory
984446 2024-05-16T16:47:30 Z Mizo_Compiler Genetics (BOI18_genetics) C++17
46 / 100
 2000 ms 59588 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("popcnt")
typedef long long ll;
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define sz(x) int(x.size())
const int N = 4100;
int n, m, k, id[30], c[N][N];
bitset<N> b[N][4];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> m >> k;
    id[int('A'-'A')] = 0;
    id[int('G'-'A')] = 2;
    id[int('T'-'A')] = 3;
    id[int('C'-'A')] = 1;
    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        for (int j = 0; j < m; j++) {
            b[i][id[int(s[j]-'A')]][j] = true;
        }
        for (int j = i-1; j >= 0; j--) {
            for (int kk = 0; kk < 4; kk++) {
                c[i][j] += (b[i][kk] & b[j][kk]).count();
            }
            c[j][i] = c[i][j];
        }
    }
    for (int i = 0; i < n; i++) {
        bool f = true;
        for (int j = 0; j < n && f; j++) {
            if (j == i)continue;
            f &= (c[i][j] == m-k);
        }
        if (f) {
            cout << i+1;
            return 0;
        }
    }
}

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 856 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 3 ms 856 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 2 ms 920 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 1 ms 348 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 422 ms 19592 KB Output is correct
2 Correct 588 ms 24452 KB Output is correct
3 Correct 620 ms 23648 KB Output is correct
4 Correct 258 ms 14412 KB Output is correct
5 Correct 603 ms 24732 KB Output is correct
6 Correct 607 ms 24616 KB Output is correct
7 Correct 111 ms 7328 KB Output is correct
8 Correct 110 ms 7284 KB Output is correct
9 Correct 585 ms 23456 KB Output is correct
10 Correct 537 ms 23336 KB Output is correct
11 Correct 414 ms 19888 KB Output is correct
12 Correct 414 ms 19792 KB Output is correct
13 Correct 435 ms 19796 KB Output is correct
14 Correct 321 ms 16372 KB Output is correct
15 Correct 311 ms 16724 KB Output is correct
16 Correct 395 ms 19124 KB Output is correct
17 Correct 533 ms 23376 KB Output is correct
18 Correct 554 ms 23096 KB Output is correct
19 Correct 551 ms 23380 KB Output is correct
20 Correct 518 ms 22868 KB Output is correct
21 Correct 558 ms 23116 KB Output is correct
22 Correct 550 ms 23120 KB Output is correct
23 Correct 540 ms 23124 KB Output is correct
24 Correct 532 ms 23152 KB Output is correct
25 Correct 521 ms 22912 KB Output is correct
26 Correct 526 ms 23232 KB Output is correct
27 Correct 535 ms 22912 KB Output is correct
28 Correct 523 ms 22972 KB Output is correct
29 Correct 524 ms 23120 KB Output is correct
30 Correct 590 ms 24416 KB Output is correct
31 Correct 584 ms 24684 KB Output is correct
32 Correct 607 ms 24940 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 3 ms 860 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 422 ms 19592 KB Output is correct
2 Correct 588 ms 24452 KB Output is correct
3 Correct 620 ms 23648 KB Output is correct
4 Correct 258 ms 14412 KB Output is correct
5 Correct 603 ms 24732 KB Output is correct
6 Correct 607 ms 24616 KB Output is correct
7 Correct 111 ms 7328 KB Output is correct
8 Correct 110 ms 7284 KB Output is correct
9 Correct 585 ms 23456 KB Output is correct
10 Correct 537 ms 23336 KB Output is correct
11 Correct 414 ms 19888 KB Output is correct
12 Correct 414 ms 19792 KB Output is correct
13 Correct 435 ms 19796 KB Output is correct
14 Correct 321 ms 16372 KB Output is correct
15 Correct 311 ms 16724 KB Output is correct
16 Correct 395 ms 19124 KB Output is correct
17 Correct 533 ms 23376 KB Output is correct
18 Correct 554 ms 23096 KB Output is correct
19 Correct 551 ms 23380 KB Output is correct
20 Correct 518 ms 22868 KB Output is correct
21 Correct 558 ms 23116 KB Output is correct
22 Correct 550 ms 23120 KB Output is correct
23 Correct 540 ms 23124 KB Output is correct
24 Correct 532 ms 23152 KB Output is correct
25 Correct 521 ms 22912 KB Output is correct
26 Correct 526 ms 23232 KB Output is correct
27 Correct 535 ms 22912 KB Output is correct
28 Correct 523 ms 22972 KB Output is correct
29 Correct 524 ms 23120 KB Output is correct
30 Correct 590 ms 24416 KB Output is correct
31 Correct 584 ms 24684 KB Output is correct
32 Correct 607 ms 24940 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 3 ms 860 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Execution timed out 2060 ms 59588 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 856 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 3 ms 856 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 2 ms 920 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 422 ms 19592 KB Output is correct
19 Correct 588 ms 24452 KB Output is correct
20 Correct 620 ms 23648 KB Output is correct
21 Correct 258 ms 14412 KB Output is correct
22 Correct 603 ms 24732 KB Output is correct
23 Correct 607 ms 24616 KB Output is correct
24 Correct 111 ms 7328 KB Output is correct
25 Correct 110 ms 7284 KB Output is correct
26 Correct 585 ms 23456 KB Output is correct
27 Correct 537 ms 23336 KB Output is correct
28 Correct 414 ms 19888 KB Output is correct
29 Correct 414 ms 19792 KB Output is correct
30 Correct 435 ms 19796 KB Output is correct
31 Correct 321 ms 16372 KB Output is correct
32 Correct 311 ms 16724 KB Output is correct
33 Correct 395 ms 19124 KB Output is correct
34 Correct 533 ms 23376 KB Output is correct
35 Correct 554 ms 23096 KB Output is correct
36 Correct 551 ms 23380 KB Output is correct
37 Correct 518 ms 22868 KB Output is correct
38 Correct 558 ms 23116 KB Output is correct
39 Correct 550 ms 23120 KB Output is correct
40 Correct 540 ms 23124 KB Output is correct
41 Correct 532 ms 23152 KB Output is correct
42 Correct 521 ms 22912 KB Output is correct
43 Correct 526 ms 23232 KB Output is correct
44 Correct 535 ms 22912 KB Output is correct
45 Correct 523 ms 22972 KB Output is correct
46 Correct 524 ms 23120 KB Output is correct
47 Correct 590 ms 24416 KB Output is correct
48 Correct 584 ms 24684 KB Output is correct
49 Correct 607 ms 24940 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 3 ms 860 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Execution timed out 2060 ms 59588 KB Time limit exceeded
54 Halted 0 ms 0 KB -