oj.uz

Submission #895656

# Submission time Handle Problem Language Result Execution time Memory
895656 2023-12-30T13:05:37 Z pcc Genetics (BOI18_genetics) C++14
46 / 100
 2000 ms 75308 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;
int arr[mxn][mxn];
int N,M,K;
vector<int> v,cand;
const int magic = 20;
bitset<mxn> in;
const int lim = 1.95*CLOCKS_PER_SEC;
int st;

int dif(int a,int b){
	int re = 0;
	for(int i = 0;i<M;i++){
		re += (arr[a][i] != arr[b][i]);
	}
	return re;
}

void collect(){
	for(int i = 0;i<N;i++){
		for(int j = i+1;j<N;j++){
			if(dif(i,j) != K){
				if(!in[i])v.push_back(i);
				if(!in[j])v.push_back(j);
				if(v.size()>=magic)return;
				in[i] = in[j] = true;
			}
		}
		if(!in[i]){
			cout<<i+1;
			exit(0);
		}
	}
	return;
}

int main(){
	st = clock();
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>N>>M>>K;
	for(int i = 0;i<N;i++){
		for(int j = 0;j<M;j++){
			char c;
			cin>>c;
			arr[i][j] = c-'A';
		}
	}
	collect();
	for(int i = 0;i<N;i++){
		if(in[i])continue;
		bool flag = true;
		for(auto &j:v){
			if(dif(i,j) != K)flag = false;
		}
		if(flag)cand.push_back(i);
	}
	//assert(cand.size()<100);
	for(auto &i:cand){
		bool flag = true;
		for(int j = 0;j<N;j++){
			if(i == j)continue;
			if(dif(i,j) != K){
				flag = false;
				break;
			}
		}
		if(flag){
			cout<<i+1;
			return 0;
		}
	}
	assert(false);
}

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 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 37 ms 25172 KB Output is correct
2 Correct 315 ms 31308 KB Output is correct
3 Correct 55 ms 29280 KB Output is correct
4 Correct 53 ms 19004 KB Output is correct
5 Correct 73 ms 31316 KB Output is correct
6 Correct 171 ms 31364 KB Output is correct
7 Correct 76 ms 12892 KB Output is correct
8 Correct 58 ms 12892 KB Output is correct
9 Correct 45 ms 29300 KB Output is correct
10 Correct 39 ms 29268 KB Output is correct
11 Correct 37 ms 25180 KB Output is correct
12 Correct 37 ms 25180 KB Output is correct
13 Correct 35 ms 25176 KB Output is correct
14 Correct 30 ms 23132 KB Output is correct
15 Correct 30 ms 23392 KB Output is correct
16 Correct 33 ms 25204 KB Output is correct
17 Correct 46 ms 29264 KB Output is correct
18 Correct 47 ms 29272 KB Output is correct
19 Correct 48 ms 29276 KB Output is correct
20 Correct 46 ms 29284 KB Output is correct
21 Correct 47 ms 29272 KB Output is correct
22 Correct 51 ms 29264 KB Output is correct
23 Correct 49 ms 29268 KB Output is correct
24 Correct 47 ms 29276 KB Output is correct
25 Correct 45 ms 29292 KB Output is correct
26 Correct 47 ms 29276 KB Output is correct
27 Correct 46 ms 29528 KB Output is correct
28 Correct 49 ms 29264 KB Output is correct
29 Correct 50 ms 29300 KB Output is correct
30 Correct 38 ms 31312 KB Output is correct
31 Correct 38 ms 31312 KB Output is correct
32 Correct 38 ms 31324 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 348 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 25172 KB Output is correct
2 Correct 315 ms 31308 KB Output is correct
3 Correct 55 ms 29280 KB Output is correct
4 Correct 53 ms 19004 KB Output is correct
5 Correct 73 ms 31316 KB Output is correct
6 Correct 171 ms 31364 KB Output is correct
7 Correct 76 ms 12892 KB Output is correct
8 Correct 58 ms 12892 KB Output is correct
9 Correct 45 ms 29300 KB Output is correct
10 Correct 39 ms 29268 KB Output is correct
11 Correct 37 ms 25180 KB Output is correct
12 Correct 37 ms 25180 KB Output is correct
13 Correct 35 ms 25176 KB Output is correct
14 Correct 30 ms 23132 KB Output is correct
15 Correct 30 ms 23392 KB Output is correct
16 Correct 33 ms 25204 KB Output is correct
17 Correct 46 ms 29264 KB Output is correct
18 Correct 47 ms 29272 KB Output is correct
19 Correct 48 ms 29276 KB Output is correct
20 Correct 46 ms 29284 KB Output is correct
21 Correct 47 ms 29272 KB Output is correct
22 Correct 51 ms 29264 KB Output is correct
23 Correct 49 ms 29268 KB Output is correct
24 Correct 47 ms 29276 KB Output is correct
25 Correct 45 ms 29292 KB Output is correct
26 Correct 47 ms 29276 KB Output is correct
27 Correct 46 ms 29528 KB Output is correct
28 Correct 49 ms 29264 KB Output is correct
29 Correct 50 ms 29300 KB Output is correct
30 Correct 38 ms 31312 KB Output is correct
31 Correct 38 ms 31312 KB Output is correct
32 Correct 38 ms 31324 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 237 ms 60024 KB Output is correct
37 Execution timed out 2066 ms 75308 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 37 ms 25172 KB Output is correct
19 Correct 315 ms 31308 KB Output is correct
20 Correct 55 ms 29280 KB Output is correct
21 Correct 53 ms 19004 KB Output is correct
22 Correct 73 ms 31316 KB Output is correct
23 Correct 171 ms 31364 KB Output is correct
24 Correct 76 ms 12892 KB Output is correct
25 Correct 58 ms 12892 KB Output is correct
26 Correct 45 ms 29300 KB Output is correct
27 Correct 39 ms 29268 KB Output is correct
28 Correct 37 ms 25180 KB Output is correct
29 Correct 37 ms 25180 KB Output is correct
30 Correct 35 ms 25176 KB Output is correct
31 Correct 30 ms 23132 KB Output is correct
32 Correct 30 ms 23392 KB Output is correct
33 Correct 33 ms 25204 KB Output is correct
34 Correct 46 ms 29264 KB Output is correct
35 Correct 47 ms 29272 KB Output is correct
36 Correct 48 ms 29276 KB Output is correct
37 Correct 46 ms 29284 KB Output is correct
38 Correct 47 ms 29272 KB Output is correct
39 Correct 51 ms 29264 KB Output is correct
40 Correct 49 ms 29268 KB Output is correct
41 Correct 47 ms 29276 KB Output is correct
42 Correct 45 ms 29292 KB Output is correct
43 Correct 47 ms 29276 KB Output is correct
44 Correct 46 ms 29528 KB Output is correct
45 Correct 49 ms 29264 KB Output is correct
46 Correct 50 ms 29300 KB Output is correct
47 Correct 38 ms 31312 KB Output is correct
48 Correct 38 ms 31312 KB Output is correct
49 Correct 38 ms 31324 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 2396 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 237 ms 60024 KB Output is correct
54 Execution timed out 2066 ms 75308 KB Time limit exceeded
55 Halted 0 ms 0 KB -