oj.uz

Submission #895642

# Submission time Handle Problem Language Result Execution time Memory
895642 2023-12-30T12:38:04 Z pcc Genetics (BOI18_genetics) C++14
47 / 100
 799 ms 19052 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,popcnt")

#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>


const int mxn = 4140;
bitset<mxn> dp[mxn];
int N,M,K;
string in;
int arr[mxn],pos[mxn];

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>N>>M>>K;
	for(int i = 0;i<N;i++)arr[i] = i;
	srand(time(NULL));
	random_shuffle(arr,arr+N);
	for(int i = 0;i<N;i++)pos[arr[i]] = i;
	for(int i = 0;i<N;i++){
		cin>>in;
		int now = pos[i];
		for(int j = 0;j<M;j++){
			if(in[j] == 'A')dp[now][j] = true;
		}
	}
	/*
	for(int i = 0;i<N;i++)cout<<arr[i]<<' ';cout<<endl;
	for(int i = 0;i<N;i++){
		for(int j = 0;j<M;j++)cout<<(dp[i][j]?'A':'C');
		cout<<endl;
	}

   */
	for(int i = 0;i<N;i++){
		bool flag = true;
		for(int j = 0;j<N;j++){
			if(i == j)continue;
			//cout<<i<<','<<j<<":"<<(dp[i]^dp[j]).count()<<endl;
			if(!flag)break;
			if((dp[i]^dp[j]).count() != K)flag = false;
		}
		if(flag){
			cout<<arr[i]+1;
			return 0;
		}
	}
}

Compilation message

genetics.cpp: In function 'int main()':
genetics.cpp:49:29: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   49 |    if((dp[i]^dp[j]).count() != K)flag = false;
      |       ~~~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 2652 KB Output is correct
2 Correct 11 ms 4432 KB Output is correct
3 Correct 88 ms 4188 KB Output is correct
4 Correct 11 ms 1628 KB Output is correct
5 Correct 52 ms 4448 KB Output is correct
6 Correct 112 ms 4544 KB Output is correct
7 Correct 10 ms 2136 KB Output is correct
8 Correct 21 ms 2140 KB Output is correct
9 Correct 20 ms 4052 KB Output is correct
10 Correct 30 ms 4276 KB Output is correct
11 Correct 69 ms 3776 KB Output is correct
12 Correct 41 ms 3792 KB Output is correct
13 Correct 94 ms 3900 KB Output is correct
14 Correct 61 ms 3308 KB Output is correct
15 Correct 26 ms 3344 KB Output is correct
16 Correct 75 ms 3388 KB Output is correct
17 Correct 185 ms 4372 KB Output is correct
18 Correct 59 ms 4440 KB Output is correct
19 Correct 21 ms 4280 KB Output is correct
20 Correct 63 ms 4184 KB Output is correct
21 Correct 65 ms 4364 KB Output is correct
22 Correct 19 ms 4176 KB Output is correct
23 Correct 22 ms 4276 KB Output is correct
24 Correct 51 ms 4224 KB Output is correct
25 Correct 29 ms 4176 KB Output is correct
26 Correct 45 ms 4180 KB Output is correct
27 Correct 62 ms 4188 KB Output is correct
28 Correct 22 ms 4188 KB Output is correct
29 Correct 20 ms 4152 KB Output is correct
30 Correct 8 ms 4444 KB Output is correct
31 Correct 8 ms 4440 KB Output is correct
32 Correct 20 ms 4432 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 344 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 2652 KB Output is correct
2 Correct 11 ms 4432 KB Output is correct
3 Correct 88 ms 4188 KB Output is correct
4 Correct 11 ms 1628 KB Output is correct
5 Correct 52 ms 4448 KB Output is correct
6 Correct 112 ms 4544 KB Output is correct
7 Correct 10 ms 2136 KB Output is correct
8 Correct 21 ms 2140 KB Output is correct
9 Correct 20 ms 4052 KB Output is correct
10 Correct 30 ms 4276 KB Output is correct
11 Correct 69 ms 3776 KB Output is correct
12 Correct 41 ms 3792 KB Output is correct
13 Correct 94 ms 3900 KB Output is correct
14 Correct 61 ms 3308 KB Output is correct
15 Correct 26 ms 3344 KB Output is correct
16 Correct 75 ms 3388 KB Output is correct
17 Correct 185 ms 4372 KB Output is correct
18 Correct 59 ms 4440 KB Output is correct
19 Correct 21 ms 4280 KB Output is correct
20 Correct 63 ms 4184 KB Output is correct
21 Correct 65 ms 4364 KB Output is correct
22 Correct 19 ms 4176 KB Output is correct
23 Correct 22 ms 4276 KB Output is correct
24 Correct 51 ms 4224 KB Output is correct
25 Correct 29 ms 4176 KB Output is correct
26 Correct 45 ms 4180 KB Output is correct
27 Correct 62 ms 4188 KB Output is correct
28 Correct 22 ms 4188 KB Output is correct
29 Correct 20 ms 4152 KB Output is correct
30 Correct 8 ms 4444 KB Output is correct
31 Correct 8 ms 4440 KB Output is correct
32 Correct 20 ms 4432 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 384 ms 16640 KB Output is correct
37 Correct 221 ms 18772 KB Output is correct
38 Correct 799 ms 18512 KB Output is correct
39 Correct 349 ms 8276 KB Output is correct
40 Correct 196 ms 18768 KB Output is correct
41 Correct 112 ms 9552 KB Output is correct
42 Correct 78 ms 9688 KB Output is correct
43 Correct 124 ms 13904 KB Output is correct
44 Correct 276 ms 18944 KB Output is correct
45 Correct 138 ms 19052 KB Output is correct
46 Correct 271 ms 18948 KB Output is correct
47 Correct 161 ms 16592 KB Output is correct
48 Correct 251 ms 16616 KB Output is correct
49 Correct 168 ms 14208 KB Output is correct
50 Correct 225 ms 14420 KB Output is correct
51 Correct 112 ms 16040 KB Output is correct
52 Correct 126 ms 18484 KB Output is correct
53 Correct 144 ms 18436 KB Output is correct
54 Correct 32 ms 17980 KB Output is correct
55 Correct 39 ms 18000 KB Output is correct
56 Correct 86 ms 18004 KB Output is correct
57 Correct 449 ms 18540 KB Output is correct
58 Correct 217 ms 18512 KB Output is correct
59 Correct 227 ms 18444 KB Output is correct
60 Correct 94 ms 18452 KB Output is correct
61 Correct 267 ms 18256 KB Output is correct
62 Correct 131 ms 18472 KB Output is correct
63 Correct 165 ms 18532 KB Output is correct
64 Correct 433 ms 18772 KB Output is correct
65 Correct 130 ms 18256 KB Output is correct
66 Correct 167 ms 18640 KB Output is correct
67 Correct 158 ms 18368 KB Output is correct
68 Correct 381 ms 18500 KB Output is correct
69 Correct 119 ms 18232 KB Output is correct
70 Correct 145 ms 18520 KB Output is correct
71 Correct 287 ms 18260 KB Output is correct
72 Correct 532 ms 18588 KB Output is correct
73 Correct 217 ms 18424 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 344 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -