oj.uz

답안 #117485

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
117485 2019-06-16T08:26:21 Z ckodser Genetics (BOI18_genetics) C++14
46 / 100
 2000 ms 30968 KB 
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif

int gcd(int a, int b) {return b == 0 ? a : gcd(b, a % b);}

#define ll int
#define pb push_back
#define ld long double
#define mp make_pair
#define F first
#define S second
#define pii pair<ll,ll> 

using namespace :: std;

const ll maxn=4110;
const ll inf=1e9+800;
const ll mod=1e9+7;
ll mxx=1;

string s[maxn];
bitset<maxn> bi[maxn][4];
ll n,m,k;

bitset<maxn> vis[maxn];
bitset<maxn> ASS[maxn];

ll dif(ll i,ll j){
	ll ans=0;
	for(ll y=0;y<mxx;y++){
		ans+=(bi[i][y]^bi[j][y]).count();
	}
	return ans;
}
bool is_good(ll i,ll j){
	if(vis[i][j])return ASS[i][j];
	bool b=(dif(i,j)==k);
	vis[i][j]=1;
	vis[j][i]=1;
	ASS[i][j]=b;
	ASS[j][i]=b;
	return b;
}
bool isAns(ll a){
	for(ll i=0;i<n;i++){
		if(i!=a){
			if(!is_good(i,a)){
				return 0;
			}
		}
	}
	return 1;
}
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);	
	cin>>n>>m>>k;
	if(n<=100 && m<=100){
		k*=2;
		mxx=4;
	}
	for(ll i=0;i<n;i++){
		cin>>s[i];
	}
	//random_shuffle(s,s+n);
	for(ll i=0;i<n;i++){
		for(ll j=0;j<m;j++){
			if(s[i][j]=='A')s[i][j]=0;
			if(s[i][j]=='C')s[i][j]=1;
			if(s[i][j]=='T')s[i][j]=2;
			if(s[i][j]=='G')s[i][j]=3;
			bi[i][s[i][j]][j]=1;
		}
	}
	for(ll i=0;i<n;i++){
		if(isAns(i)){
			cout<<i+1<<endl;
			return 0;
		}
	}

}

Compilation message

genetics.cpp: In function 'int main()':
genetics.cpp:122:17: warning: array subscript has type 'char' [-Wchar-subscripts]
    bi[i][s[i][j]][j]=1;
                 ^

Subtask #1
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 760 KB Output is correct
2 Correct 5 ms 760 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 8 ms 760 KB Output is correct
5 Correct 8 ms 760 KB Output is correct
6 Correct 9 ms 760 KB Output is correct
7 Correct 6 ms 632 KB Output is correct
8 Correct 5 ms 508 KB Output is correct
9 Correct 7 ms 632 KB Output is correct
10 Correct 9 ms 760 KB Output is correct
11 Correct 6 ms 760 KB Output is correct
12 Correct 11 ms 888 KB Output is correct
13 Correct 5 ms 760 KB Output is correct
14 Correct 6 ms 888 KB Output is correct
15 Correct 5 ms 760 KB Output is correct
16 Correct 5 ms 760 KB Output is correct
17 Correct 5 ms 504 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 471 ms 7972 KB Output is correct
2 Correct 382 ms 10360 KB Output is correct
3 Correct 659 ms 9848 KB Output is correct
4 Correct 217 ms 5112 KB Output is correct
5 Correct 107 ms 10228 KB Output is correct
6 Correct 238 ms 10232 KB Output is correct
7 Correct 100 ms 4984 KB Output is correct
8 Correct 96 ms 5100 KB Output is correct
9 Correct 53 ms 9696 KB Output is correct
10 Correct 430 ms 9848 KB Output is correct
11 Correct 164 ms 8720 KB Output is correct
12 Correct 58 ms 8696 KB Output is correct
13 Correct 141 ms 8672 KB Output is correct
14 Correct 279 ms 7792 KB Output is correct
15 Correct 141 ms 7928 KB Output is correct
16 Correct 165 ms 8184 KB Output is correct
17 Correct 351 ms 9848 KB Output is correct
18 Correct 82 ms 9848 KB Output is correct
19 Correct 326 ms 9976 KB Output is correct
20 Correct 235 ms 9720 KB Output is correct
21 Correct 457 ms 9848 KB Output is correct
22 Correct 571 ms 9720 KB Output is correct
23 Correct 628 ms 9804 KB Output is correct
24 Correct 467 ms 9720 KB Output is correct
25 Correct 80 ms 9720 KB Output is correct
26 Correct 376 ms 9848 KB Output is correct
27 Correct 201 ms 9720 KB Output is correct
28 Correct 172 ms 9720 KB Output is correct
29 Correct 366 ms 9916 KB Output is correct
30 Correct 52 ms 10236 KB Output is correct
31 Correct 54 ms 10232 KB Output is correct
32 Correct 53 ms 10232 KB Output is correct
33 Correct 5 ms 504 KB Output is correct
34 Correct 5 ms 760 KB Output is correct
35 Correct 5 ms 504 KB Output is correct

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 471 ms 7972 KB Output is correct
2 Correct 382 ms 10360 KB Output is correct
3 Correct 659 ms 9848 KB Output is correct
4 Correct 217 ms 5112 KB Output is correct
5 Correct 107 ms 10228 KB Output is correct
6 Correct 238 ms 10232 KB Output is correct
7 Correct 100 ms 4984 KB Output is correct
8 Correct 96 ms 5100 KB Output is correct
9 Correct 53 ms 9696 KB Output is correct
10 Correct 430 ms 9848 KB Output is correct
11 Correct 164 ms 8720 KB Output is correct
12 Correct 58 ms 8696 KB Output is correct
13 Correct 141 ms 8672 KB Output is correct
14 Correct 279 ms 7792 KB Output is correct
15 Correct 141 ms 7928 KB Output is correct
16 Correct 165 ms 8184 KB Output is correct
17 Correct 351 ms 9848 KB Output is correct
18 Correct 82 ms 9848 KB Output is correct
19 Correct 326 ms 9976 KB Output is correct
20 Correct 235 ms 9720 KB Output is correct
21 Correct 457 ms 9848 KB Output is correct
22 Correct 571 ms 9720 KB Output is correct
23 Correct 628 ms 9804 KB Output is correct
24 Correct 467 ms 9720 KB Output is correct
25 Correct 80 ms 9720 KB Output is correct
26 Correct 376 ms 9848 KB Output is correct
27 Correct 201 ms 9720 KB Output is correct
28 Correct 172 ms 9720 KB Output is correct
29 Correct 366 ms 9916 KB Output is correct
30 Correct 52 ms 10236 KB Output is correct
31 Correct 54 ms 10232 KB Output is correct
32 Correct 53 ms 10232 KB Output is correct
33 Correct 5 ms 504 KB Output is correct
34 Correct 5 ms 760 KB Output is correct
35 Correct 5 ms 504 KB Output is correct
36 Execution timed out 2051 ms 30968 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 760 KB Output is correct
2 Correct 5 ms 760 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 8 ms 760 KB Output is correct
5 Correct 8 ms 760 KB Output is correct
6 Correct 9 ms 760 KB Output is correct
7 Correct 6 ms 632 KB Output is correct
8 Correct 5 ms 508 KB Output is correct
9 Correct 7 ms 632 KB Output is correct
10 Correct 9 ms 760 KB Output is correct
11 Correct 6 ms 760 KB Output is correct
12 Correct 11 ms 888 KB Output is correct
13 Correct 5 ms 760 KB Output is correct
14 Correct 6 ms 888 KB Output is correct
15 Correct 5 ms 760 KB Output is correct
16 Correct 5 ms 760 KB Output is correct
17 Correct 5 ms 504 KB Output is correct
18 Correct 471 ms 7972 KB Output is correct
19 Correct 382 ms 10360 KB Output is correct
20 Correct 659 ms 9848 KB Output is correct
21 Correct 217 ms 5112 KB Output is correct
22 Correct 107 ms 10228 KB Output is correct
23 Correct 238 ms 10232 KB Output is correct
24 Correct 100 ms 4984 KB Output is correct
25 Correct 96 ms 5100 KB Output is correct
26 Correct 53 ms 9696 KB Output is correct
27 Correct 430 ms 9848 KB Output is correct
28 Correct 164 ms 8720 KB Output is correct
29 Correct 58 ms 8696 KB Output is correct
30 Correct 141 ms 8672 KB Output is correct
31 Correct 279 ms 7792 KB Output is correct
32 Correct 141 ms 7928 KB Output is correct
33 Correct 165 ms 8184 KB Output is correct
34 Correct 351 ms 9848 KB Output is correct
35 Correct 82 ms 9848 KB Output is correct
36 Correct 326 ms 9976 KB Output is correct
37 Correct 235 ms 9720 KB Output is correct
38 Correct 457 ms 9848 KB Output is correct
39 Correct 571 ms 9720 KB Output is correct
40 Correct 628 ms 9804 KB Output is correct
41 Correct 467 ms 9720 KB Output is correct
42 Correct 80 ms 9720 KB Output is correct
43 Correct 376 ms 9848 KB Output is correct
44 Correct 201 ms 9720 KB Output is correct
45 Correct 172 ms 9720 KB Output is correct
46 Correct 366 ms 9916 KB Output is correct
47 Correct 52 ms 10236 KB Output is correct
48 Correct 54 ms 10232 KB Output is correct
49 Correct 53 ms 10232 KB Output is correct
50 Correct 5 ms 504 KB Output is correct
51 Correct 5 ms 760 KB Output is correct
52 Correct 5 ms 504 KB Output is correct
53 Execution timed out 2051 ms 30968 KB Time limit exceeded
54 Halted 0 ms 0 KB -