oj.uz

Submission #984454

# Submission time Handle Problem Language Result Execution time Memory
984454 2024-05-16T16:53:45 Z Mizo_Compiler Genetics (BOI18_genetics) C++17
46 / 100
 2000 ms 85280 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops")
#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 860 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 600 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 336 ms 19936 KB Output is correct
2 Correct 452 ms 24400 KB Output is correct
3 Correct 419 ms 23188 KB Output is correct
4 Correct 187 ms 14400 KB Output is correct
5 Correct 476 ms 24740 KB Output is correct
6 Correct 463 ms 24496 KB Output is correct
7 Correct 89 ms 7252 KB Output is correct
8 Correct 85 ms 7252 KB Output is correct
9 Correct 467 ms 23240 KB Output is correct
10 Correct 437 ms 23384 KB Output is correct
11 Correct 323 ms 19796 KB Output is correct
12 Correct 337 ms 19936 KB Output is correct
13 Correct 332 ms 19792 KB Output is correct
14 Correct 248 ms 16552 KB Output is correct
15 Correct 245 ms 16700 KB Output is correct
16 Correct 318 ms 19004 KB Output is correct
17 Correct 416 ms 23380 KB Output is correct
18 Correct 414 ms 23376 KB Output is correct
19 Correct 434 ms 23380 KB Output is correct
20 Correct 408 ms 23088 KB Output is correct
21 Correct 409 ms 23120 KB Output is correct
22 Correct 424 ms 23128 KB Output is correct
23 Correct 427 ms 23124 KB Output is correct
24 Correct 430 ms 23376 KB Output is correct
25 Correct 423 ms 23112 KB Output is correct
26 Correct 416 ms 23120 KB Output is correct
27 Correct 419 ms 23120 KB Output is correct
28 Correct 410 ms 23124 KB Output is correct
29 Correct 407 ms 23176 KB Output is correct
30 Correct 472 ms 24608 KB Output is correct
31 Correct 457 ms 24640 KB Output is correct
32 Correct 457 ms 24528 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 2 ms 1064 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 336 ms 19936 KB Output is correct
2 Correct 452 ms 24400 KB Output is correct
3 Correct 419 ms 23188 KB Output is correct
4 Correct 187 ms 14400 KB Output is correct
5 Correct 476 ms 24740 KB Output is correct
6 Correct 463 ms 24496 KB Output is correct
7 Correct 89 ms 7252 KB Output is correct
8 Correct 85 ms 7252 KB Output is correct
9 Correct 467 ms 23240 KB Output is correct
10 Correct 437 ms 23384 KB Output is correct
11 Correct 323 ms 19796 KB Output is correct
12 Correct 337 ms 19936 KB Output is correct
13 Correct 332 ms 19792 KB Output is correct
14 Correct 248 ms 16552 KB Output is correct
15 Correct 245 ms 16700 KB Output is correct
16 Correct 318 ms 19004 KB Output is correct
17 Correct 416 ms 23380 KB Output is correct
18 Correct 414 ms 23376 KB Output is correct
19 Correct 434 ms 23380 KB Output is correct
20 Correct 408 ms 23088 KB Output is correct
21 Correct 409 ms 23120 KB Output is correct
22 Correct 424 ms 23128 KB Output is correct
23 Correct 427 ms 23124 KB Output is correct
24 Correct 430 ms 23376 KB Output is correct
25 Correct 423 ms 23112 KB Output is correct
26 Correct 416 ms 23120 KB Output is correct
27 Correct 419 ms 23120 KB Output is correct
28 Correct 410 ms 23124 KB Output is correct
29 Correct 407 ms 23176 KB Output is correct
30 Correct 472 ms 24608 KB Output is correct
31 Correct 457 ms 24640 KB Output is correct
32 Correct 457 ms 24528 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 2 ms 1064 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1891 ms 65124 KB Output is correct
37 Execution timed out 2033 ms 85280 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 860 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 600 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 336 ms 19936 KB Output is correct
19 Correct 452 ms 24400 KB Output is correct
20 Correct 419 ms 23188 KB Output is correct
21 Correct 187 ms 14400 KB Output is correct
22 Correct 476 ms 24740 KB Output is correct
23 Correct 463 ms 24496 KB Output is correct
24 Correct 89 ms 7252 KB Output is correct
25 Correct 85 ms 7252 KB Output is correct
26 Correct 467 ms 23240 KB Output is correct
27 Correct 437 ms 23384 KB Output is correct
28 Correct 323 ms 19796 KB Output is correct
29 Correct 337 ms 19936 KB Output is correct
30 Correct 332 ms 19792 KB Output is correct
31 Correct 248 ms 16552 KB Output is correct
32 Correct 245 ms 16700 KB Output is correct
33 Correct 318 ms 19004 KB Output is correct
34 Correct 416 ms 23380 KB Output is correct
35 Correct 414 ms 23376 KB Output is correct
36 Correct 434 ms 23380 KB Output is correct
37 Correct 408 ms 23088 KB Output is correct
38 Correct 409 ms 23120 KB Output is correct
39 Correct 424 ms 23128 KB Output is correct
40 Correct 427 ms 23124 KB Output is correct
41 Correct 430 ms 23376 KB Output is correct
42 Correct 423 ms 23112 KB Output is correct
43 Correct 416 ms 23120 KB Output is correct
44 Correct 419 ms 23120 KB Output is correct
45 Correct 410 ms 23124 KB Output is correct
46 Correct 407 ms 23176 KB Output is correct
47 Correct 472 ms 24608 KB Output is correct
48 Correct 457 ms 24640 KB Output is correct
49 Correct 457 ms 24528 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 2 ms 1064 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1891 ms 65124 KB Output is correct
54 Execution timed out 2033 ms 85280 KB Time limit exceeded
55 Halted 0 ms 0 KB -