oj.uz

Submission #895676

# Submission time Handle Problem Language Result Execution time Memory
895676 2023-12-30T13:33:04 Z pcc Genetics (BOI18_genetics) C++14
46 / 100
 2000 ms 68844 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>
 
int N,M,K;
 
namespace SMALL{

const int mxn = 4140;
int perm[mxn],pos[mxn];
int arr[mxn][mxn];
vector<int> v,cand;
const int magic = sqrt(mxn)/2;
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<<perm[i]+1;
			exit(0);
		}
	}
	return;
}

void solve(){
	for(int i = 0;i<N;i++)perm[i] = i;
	srand(time(NULL));
	random_shuffle(perm,perm+N);
	for(int i = 0;i<N;i++)pos[perm[i]] = i;
	for(int i = 0;i<N;i++){
		for(int j = 0;j<M;j++){
			char c;
			cin>>c;
			arr[pos[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()<magic);
	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<<perm[i]+1;
			return;
		}
	}
	assert(false);
}

}

namespace TWO{
 
const int mxn = 4140;
bitset<mxn> dp[mxn];
string in;
int arr[mxn],pos[mxn];
 
void solve(){
	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;
		}
	}
}
 
}
 
int main(){
	ios::sync_with_stdio(0);cin.tie(0);
	cin>>N>>M>>K;
	SMALL::solve();return 0;
	if(N*M<=1e6)SMALL::solve();
	else TWO::solve();
}

Compilation message

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

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4516 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 27220 KB Output is correct
2 Correct 169 ms 33304 KB Output is correct
3 Correct 69 ms 31240 KB Output is correct
4 Correct 22 ms 22884 KB Output is correct
5 Correct 356 ms 33308 KB Output is correct
6 Correct 238 ms 33548 KB Output is correct
7 Correct 52 ms 16728 KB Output is correct
8 Correct 38 ms 16728 KB Output is correct
9 Correct 50 ms 31320 KB Output is correct
10 Correct 57 ms 31068 KB Output is correct
11 Correct 42 ms 26972 KB Output is correct
12 Correct 43 ms 26972 KB Output is correct
13 Correct 45 ms 26968 KB Output is correct
14 Correct 39 ms 24924 KB Output is correct
15 Correct 38 ms 24920 KB Output is correct
16 Correct 47 ms 27156 KB Output is correct
17 Correct 63 ms 31240 KB Output is correct
18 Correct 57 ms 31068 KB Output is correct
19 Correct 60 ms 31068 KB Output is correct
20 Correct 77 ms 31068 KB Output is correct
21 Correct 59 ms 31068 KB Output is correct
22 Correct 70 ms 31240 KB Output is correct
23 Correct 58 ms 31064 KB Output is correct
24 Correct 62 ms 31236 KB Output is correct
25 Correct 56 ms 31068 KB Output is correct
26 Correct 68 ms 31252 KB Output is correct
27 Correct 73 ms 31244 KB Output is correct
28 Correct 63 ms 31240 KB Output is correct
29 Correct 64 ms 31068 KB Output is correct
30 Correct 42 ms 33288 KB Output is correct
31 Correct 42 ms 33116 KB Output is correct
32 Correct 42 ms 33116 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 27220 KB Output is correct
2 Correct 169 ms 33304 KB Output is correct
3 Correct 69 ms 31240 KB Output is correct
4 Correct 22 ms 22884 KB Output is correct
5 Correct 356 ms 33308 KB Output is correct
6 Correct 238 ms 33548 KB Output is correct
7 Correct 52 ms 16728 KB Output is correct
8 Correct 38 ms 16728 KB Output is correct
9 Correct 50 ms 31320 KB Output is correct
10 Correct 57 ms 31068 KB Output is correct
11 Correct 42 ms 26972 KB Output is correct
12 Correct 43 ms 26972 KB Output is correct
13 Correct 45 ms 26968 KB Output is correct
14 Correct 39 ms 24924 KB Output is correct
15 Correct 38 ms 24920 KB Output is correct
16 Correct 47 ms 27156 KB Output is correct
17 Correct 63 ms 31240 KB Output is correct
18 Correct 57 ms 31068 KB Output is correct
19 Correct 60 ms 31068 KB Output is correct
20 Correct 77 ms 31068 KB Output is correct
21 Correct 59 ms 31068 KB Output is correct
22 Correct 70 ms 31240 KB Output is correct
23 Correct 58 ms 31064 KB Output is correct
24 Correct 62 ms 31236 KB Output is correct
25 Correct 56 ms 31068 KB Output is correct
26 Correct 68 ms 31252 KB Output is correct
27 Correct 73 ms 31244 KB Output is correct
28 Correct 63 ms 31240 KB Output is correct
29 Correct 64 ms 31068 KB Output is correct
30 Correct 42 ms 33288 KB Output is correct
31 Correct 42 ms 33116 KB Output is correct
32 Correct 42 ms 33116 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 304 ms 62044 KB Output is correct
37 Execution timed out 2041 ms 68844 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 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4516 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 47 ms 27220 KB Output is correct
19 Correct 169 ms 33304 KB Output is correct
20 Correct 69 ms 31240 KB Output is correct
21 Correct 22 ms 22884 KB Output is correct
22 Correct 356 ms 33308 KB Output is correct
23 Correct 238 ms 33548 KB Output is correct
24 Correct 52 ms 16728 KB Output is correct
25 Correct 38 ms 16728 KB Output is correct
26 Correct 50 ms 31320 KB Output is correct
27 Correct 57 ms 31068 KB Output is correct
28 Correct 42 ms 26972 KB Output is correct
29 Correct 43 ms 26972 KB Output is correct
30 Correct 45 ms 26968 KB Output is correct
31 Correct 39 ms 24924 KB Output is correct
32 Correct 38 ms 24920 KB Output is correct
33 Correct 47 ms 27156 KB Output is correct
34 Correct 63 ms 31240 KB Output is correct
35 Correct 57 ms 31068 KB Output is correct
36 Correct 60 ms 31068 KB Output is correct
37 Correct 77 ms 31068 KB Output is correct
38 Correct 59 ms 31068 KB Output is correct
39 Correct 70 ms 31240 KB Output is correct
40 Correct 58 ms 31064 KB Output is correct
41 Correct 62 ms 31236 KB Output is correct
42 Correct 56 ms 31068 KB Output is correct
43 Correct 68 ms 31252 KB Output is correct
44 Correct 73 ms 31244 KB Output is correct
45 Correct 63 ms 31240 KB Output is correct
46 Correct 64 ms 31068 KB Output is correct
47 Correct 42 ms 33288 KB Output is correct
48 Correct 42 ms 33116 KB Output is correct
49 Correct 42 ms 33116 KB Output is correct
50 Correct 1 ms 4444 KB Output is correct
51 Correct 1 ms 4444 KB Output is correct
52 Correct 1 ms 4444 KB Output is correct
53 Correct 304 ms 62044 KB Output is correct
54 Execution timed out 2041 ms 68844 KB Time limit exceeded
55 Halted 0 ms 0 KB -