oj.uz

답안 #977634

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
977634 2024-05-08T07:57:27 Z efedmrlr Genetics (BOI18_genetics) C++17
19 / 100
 2000 ms 84832 KB 
#include <bits/stdc++.h>

#define lli long long int
#define ld long double
#define pb push_back
#define MP make_pair
#define all(x) x.begin(), x.end()
#define rall(x) x.begin(), x.end()
#define REP(i, n) for(int i = 0; (i) < (n); (i)++)

using namespace std;

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}

const int N = 4102;
const int INF = 1e9 + 500;
const int MOD = 1e9 + 7;
array<bitset<N>, N> s;
array<array<int, N>, N> dif;
int n, m, k;
bitset<N> tmp;
bitset<N> vis; 
void solve() {
    cin >> n >> m >> k;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            char t;
            cin >> t;
            s[i][j] = (t == 'A');
        }
    }

    REP(i, n) REP(j, n) dif[i][j] = -1;

    for(int i = 0; i < n; i++) {
        if(vis[i]) continue;
        for(int j = 0; j < n; j++) {
            if(i == j) continue;
            if(dif[i][j] == -1) {   
                tmp = s[i] ^ s[j];
                dif[i][j] = dif[j][i] = (int)tmp.count();
            }
            if(dif[i][j] != k) {
                vis[i] = vis[j] = 1;
            }
        }
        if(!vis[i]) {
            cout << i + 1 << "\n";
            return;
        }
    }
}

signed main() {
    fastio();
    solve();
}

Subtask #1
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 2 ms 2520 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 356 ms 28536 KB Output is correct
2 Correct 355 ms 33364 KB Output is correct
3 Correct 449 ms 33096 KB Output is correct
4 Correct 147 ms 20060 KB Output is correct
5 Correct 139 ms 33492 KB Output is correct
6 Correct 273 ms 33360 KB Output is correct
7 Correct 84 ms 14596 KB Output is correct
8 Correct 81 ms 14428 KB Output is correct
9 Correct 74 ms 33092 KB Output is correct
10 Correct 424 ms 33112 KB Output is correct
11 Correct 304 ms 28540 KB Output is correct
12 Correct 80 ms 28560 KB Output is correct
13 Correct 182 ms 28540 KB Output is correct
14 Correct 264 ms 25976 KB Output is correct
15 Correct 117 ms 25936 KB Output is correct
16 Correct 190 ms 28032 KB Output is correct
17 Correct 431 ms 33296 KB Output is correct
18 Correct 76 ms 33108 KB Output is correct
19 Correct 407 ms 33164 KB Output is correct
20 Correct 189 ms 33392 KB Output is correct
21 Correct 398 ms 33104 KB Output is correct
22 Correct 455 ms 33188 KB Output is correct
23 Correct 449 ms 33208 KB Output is correct
24 Correct 459 ms 33364 KB Output is correct
25 Correct 211 ms 33104 KB Output is correct
26 Correct 336 ms 33364 KB Output is correct
27 Correct 298 ms 33056 KB Output is correct
28 Correct 291 ms 33364 KB Output is correct
29 Correct 418 ms 33108 KB Output is correct
30 Correct 56 ms 33364 KB Output is correct
31 Correct 55 ms 33176 KB Output is correct
32 Correct 56 ms 33224 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 356 ms 28536 KB Output is correct
2 Correct 355 ms 33364 KB Output is correct
3 Correct 449 ms 33096 KB Output is correct
4 Correct 147 ms 20060 KB Output is correct
5 Correct 139 ms 33492 KB Output is correct
6 Correct 273 ms 33360 KB Output is correct
7 Correct 84 ms 14596 KB Output is correct
8 Correct 81 ms 14428 KB Output is correct
9 Correct 74 ms 33092 KB Output is correct
10 Correct 424 ms 33112 KB Output is correct
11 Correct 304 ms 28540 KB Output is correct
12 Correct 80 ms 28560 KB Output is correct
13 Correct 182 ms 28540 KB Output is correct
14 Correct 264 ms 25976 KB Output is correct
15 Correct 117 ms 25936 KB Output is correct
16 Correct 190 ms 28032 KB Output is correct
17 Correct 431 ms 33296 KB Output is correct
18 Correct 76 ms 33108 KB Output is correct
19 Correct 407 ms 33164 KB Output is correct
20 Correct 189 ms 33392 KB Output is correct
21 Correct 398 ms 33104 KB Output is correct
22 Correct 455 ms 33188 KB Output is correct
23 Correct 449 ms 33208 KB Output is correct
24 Correct 459 ms 33364 KB Output is correct
25 Correct 211 ms 33104 KB Output is correct
26 Correct 336 ms 33364 KB Output is correct
27 Correct 298 ms 33056 KB Output is correct
28 Correct 291 ms 33364 KB Output is correct
29 Correct 418 ms 33108 KB Output is correct
30 Correct 56 ms 33364 KB Output is correct
31 Correct 55 ms 33176 KB Output is correct
32 Correct 56 ms 33224 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1534 ms 74276 KB Output is correct
37 Correct 1355 ms 84832 KB Output is correct
38 Execution timed out 2012 ms 84180 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 2 ms 2520 KB Output isn't correct
3 Halted 0 ms 0 KB -