oj.uz

Submission #896074

# Submission time Handle Problem Language Result Execution time Memory
896074 2023-12-31T16:43:51 Z nifeshe Genetics (BOI18_genetics) C++17
46 / 100
 1336 ms 43192 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")

#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int) (x).size())
#define pb push_back
#define mp make_pair
#define int long long

using namespace std;
using namespace __gnu_pbds;

template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T> inline bool umin(T &a, const T &b) { if(a > b) { a = b; return 1; } return 0; }
template <typename T> inline bool umax(T &a, const T &b) { if(a < b) { a = b; return 1; } return 0; }

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll mod = 998244353;
const ll base = 1e6 + 9;
const ll inf = 1e18;
const int MAX = 3e5 + 42;
const int LG = 20;

random_device rd;
mt19937 gen(rd());
uniform_int_distribution<ll> dis(1, inf);

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    map<char, int> go;
    go['A'] = 'A'; go['C'] = 'B'; go['G'] = 'C'; go['T'] = 'D';
    vector<string> a(n);
    for(auto &i : a) {
        cin >> i;
        for(auto &j : i) j = go[j] - 'A';
    }
    const int BUBEN = 80;
    vector<vector<vector<int>>> have(BUBEN, vector<vector<int>>(m, vector<int>(4)));
    vector<int> cnt(BUBEN);
    vector<int> idx(n);
    for(int i = 0; i < n; i++) {
        idx[i] = dis(gen) % BUBEN;
        cnt[idx[i]]++;
        for(int j = 0; j < m; j++) {
            for(int c = 0; c < 4; c++) {
                have[idx[i]][j][c]++;
            }
        }
    }
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            have[idx[i]][j][a[i][j]]--;
        }
    }
    vector<int> p(n); iota(all(p), 0); shuffle(all(p), gen);
    for(auto i : p) {
        int need = (cnt[idx[i]] - 1) * k;
        for(int j = 0; j < m && need >= 0; j++) {
            need -= have[idx[i]][j][a[i][j]];
        }
        if(need != 0) continue;
        int ok = 1;
        for(int x = 0; x < BUBEN; x++) {
            if(cnt[x] == 0 || idx[i] == x) continue;
            need = cnt[x] * k;
            for(int j = 0; j < m && need >= 0; j++) {
                need -= have[x][j][a[i][j]];
            }
            if(need != 0) {
                ok = 0;
                break;
            }
        }
        if(ok) {
            cout << i + 1 << '\n';
            return;
        }
    }
    assert(0);
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int ttt = 1;
//    cin >> ttt;
    while(ttt--) {
        solve();
    }
}

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 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 1 ms 604 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 860 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 13104 KB Output is correct
2 Correct 76 ms 14192 KB Output is correct
3 Correct 79 ms 13800 KB Output is correct
4 Correct 33 ms 4444 KB Output is correct
5 Correct 168 ms 14096 KB Output is correct
6 Correct 153 ms 14188 KB Output is correct
7 Correct 62 ms 12120 KB Output is correct
8 Correct 73 ms 12120 KB Output is correct
9 Correct 74 ms 13396 KB Output is correct
10 Correct 85 ms 13396 KB Output is correct
11 Correct 100 ms 13108 KB Output is correct
12 Correct 77 ms 12888 KB Output is correct
13 Correct 61 ms 12936 KB Output is correct
14 Correct 135 ms 12708 KB Output is correct
15 Correct 148 ms 12740 KB Output is correct
16 Correct 75 ms 11584 KB Output is correct
17 Correct 96 ms 13892 KB Output is correct
18 Correct 82 ms 14016 KB Output is correct
19 Correct 119 ms 14044 KB Output is correct
20 Correct 147 ms 14004 KB Output is correct
21 Correct 118 ms 14044 KB Output is correct
22 Correct 222 ms 13980 KB Output is correct
23 Correct 172 ms 14268 KB Output is correct
24 Correct 123 ms 13852 KB Output is correct
25 Correct 121 ms 13784 KB Output is correct
26 Correct 63 ms 14032 KB Output is correct
27 Correct 101 ms 14012 KB Output is correct
28 Correct 86 ms 14008 KB Output is correct
29 Correct 101 ms 14012 KB Output is correct
30 Correct 56 ms 14108 KB Output is correct
31 Correct 58 ms 13908 KB Output is correct
32 Correct 64 ms 14192 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 860 KB Output is correct
35 Correct 1 ms 860 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 13104 KB Output is correct
2 Correct 76 ms 14192 KB Output is correct
3 Correct 79 ms 13800 KB Output is correct
4 Correct 33 ms 4444 KB Output is correct
5 Correct 168 ms 14096 KB Output is correct
6 Correct 153 ms 14188 KB Output is correct
7 Correct 62 ms 12120 KB Output is correct
8 Correct 73 ms 12120 KB Output is correct
9 Correct 74 ms 13396 KB Output is correct
10 Correct 85 ms 13396 KB Output is correct
11 Correct 100 ms 13108 KB Output is correct
12 Correct 77 ms 12888 KB Output is correct
13 Correct 61 ms 12936 KB Output is correct
14 Correct 135 ms 12708 KB Output is correct
15 Correct 148 ms 12740 KB Output is correct
16 Correct 75 ms 11584 KB Output is correct
17 Correct 96 ms 13892 KB Output is correct
18 Correct 82 ms 14016 KB Output is correct
19 Correct 119 ms 14044 KB Output is correct
20 Correct 147 ms 14004 KB Output is correct
21 Correct 118 ms 14044 KB Output is correct
22 Correct 222 ms 13980 KB Output is correct
23 Correct 172 ms 14268 KB Output is correct
24 Correct 123 ms 13852 KB Output is correct
25 Correct 121 ms 13784 KB Output is correct
26 Correct 63 ms 14032 KB Output is correct
27 Correct 101 ms 14012 KB Output is correct
28 Correct 86 ms 14008 KB Output is correct
29 Correct 101 ms 14012 KB Output is correct
30 Correct 56 ms 14108 KB Output is correct
31 Correct 58 ms 13908 KB Output is correct
32 Correct 64 ms 14192 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 860 KB Output is correct
35 Correct 1 ms 860 KB Output is correct
36 Correct 462 ms 40800 KB Output is correct
37 Correct 692 ms 42756 KB Output is correct
38 Correct 585 ms 42792 KB Output is correct
39 Correct 194 ms 16536 KB Output is correct
40 Correct 1336 ms 42724 KB Output is correct
41 Correct 456 ms 33112 KB Output is correct
42 Correct 290 ms 33328 KB Output is correct
43 Correct 406 ms 33116 KB Output is correct
44 Incorrect 511 ms 43192 KB Output isn't correct
45 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 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 1 ms 604 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 121 ms 13104 KB Output is correct
19 Correct 76 ms 14192 KB Output is correct
20 Correct 79 ms 13800 KB Output is correct
21 Correct 33 ms 4444 KB Output is correct
22 Correct 168 ms 14096 KB Output is correct
23 Correct 153 ms 14188 KB Output is correct
24 Correct 62 ms 12120 KB Output is correct
25 Correct 73 ms 12120 KB Output is correct
26 Correct 74 ms 13396 KB Output is correct
27 Correct 85 ms 13396 KB Output is correct
28 Correct 100 ms 13108 KB Output is correct
29 Correct 77 ms 12888 KB Output is correct
30 Correct 61 ms 12936 KB Output is correct
31 Correct 135 ms 12708 KB Output is correct
32 Correct 148 ms 12740 KB Output is correct
33 Correct 75 ms 11584 KB Output is correct
34 Correct 96 ms 13892 KB Output is correct
35 Correct 82 ms 14016 KB Output is correct
36 Correct 119 ms 14044 KB Output is correct
37 Correct 147 ms 14004 KB Output is correct
38 Correct 118 ms 14044 KB Output is correct
39 Correct 222 ms 13980 KB Output is correct
40 Correct 172 ms 14268 KB Output is correct
41 Correct 123 ms 13852 KB Output is correct
42 Correct 121 ms 13784 KB Output is correct
43 Correct 63 ms 14032 KB Output is correct
44 Correct 101 ms 14012 KB Output is correct
45 Correct 86 ms 14008 KB Output is correct
46 Correct 101 ms 14012 KB Output is correct
47 Correct 56 ms 14108 KB Output is correct
48 Correct 58 ms 13908 KB Output is correct
49 Correct 64 ms 14192 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 860 KB Output is correct
52 Correct 1 ms 860 KB Output is correct
53 Correct 462 ms 40800 KB Output is correct
54 Correct 692 ms 42756 KB Output is correct
55 Correct 585 ms 42792 KB Output is correct
56 Correct 194 ms 16536 KB Output is correct
57 Correct 1336 ms 42724 KB Output is correct
58 Correct 456 ms 33112 KB Output is correct
59 Correct 290 ms 33328 KB Output is correct
60 Correct 406 ms 33116 KB Output is correct
61 Incorrect 511 ms 43192 KB Output isn't correct
62 Halted 0 ms 0 KB -