oj.uz

답안 #378353

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
378353 2021-03-16T14:23:47 Z soroush Genetics (BOI18_genetics) C++17
100 / 100
 1200 ms 93000 KB 
//*
#pragma GCC optimize("O2")
//#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx,avx2,sse,sse2,fma")
//*/
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int , int> pii;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 4110;
const ll mod = 1e9+7;
const ld PI = acos((ld)-1);

#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define migmig ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

int n , m , k;
char s[maxn][maxn];
bool bad[maxn];
int cnt[4][maxn];
bitset < maxn > a[4][maxn];
int diff[maxn][maxn];
std::chrono::duration<double> elapsed_seconds;

int Diff(int i , int j){
	if(diff[i][j] ^ -1)return diff[i][j];
	diff[i][j] = m;
	for(int k = 0 ; k < 4 ; k ++)
		diff[i][j] -= (a[k][i] & a[k][j]).count();
	diff[j][i] = diff[i][j];
	return diff[i][j];
}

void chk(int i){
	if(bad[i])return;
	if(elapsed_seconds.count() > 0.9){
		for(int j = 1 ; j <= n ; j ++)if(j^i){
			if(Diff(i , j) ^ k){
				bad[i] = bad[j] = 1;return;}
		}
	}
	else{
		for(int j = n ; j >= 1 ; j --)if(j^i){
			if(Diff(i , j) ^ k){
				bad[i] = bad[j] = 1;return;}
		}
	}
	dokme(i);
}

void add(int i){
	for(int j = 0 ; j < m ; j ++){
		if(s[i][j] == 'A')cnt[0][j]-- , a[0][i][j] = 1;
		else if(s[i][j] == 'T')cnt[1][j]-- , a[1][i][j] = 1;
		else if(s[i][j] == 'C')cnt[2][j]-- , a[2][i][j] = 1;
		else cnt[3][j]-- , a[3][i][j] = 1;
	}
}


int32_t main(){
	std::chrono::time_point<std::chrono::system_clock> start, end;
    start = std::chrono::system_clock::now();
	cin >> n >> m >> k;
	ms(diff , -1);
	for(int i = 0 ; i < m ; i ++)for(int j = 0 ; j < 4 ; j ++)cnt[j][i] = n;
	for(int i = 1 ; i <= n ; i ++)scanf("%s",s + i) , add(i);
	for(int i = n ; i >= 1 ; i --)if(!bad[i]){
		int sum = 0;
		for(int j = 0 ; j < m ; j ++){
			if(s[i][j] == 'A')sum += cnt[0][j];
			else if(s[i][j] == 'T')sum += cnt[1][j];
			else if(s[i][j] == 'C')sum += cnt[2][j];
			else sum += cnt[3][j];
		}
		if(sum == k * (n - 1))chk(i);
		end = std::chrono::system_clock::now();
		elapsed_seconds = end-start;
		if(elapsed_seconds.count() > 0.9)break;
	}
	for(int i = 1 ; i <= n ; i ++)if(!bad[i]){
		int sum = 0;
		for(int j = 0 ; j < m ; j ++){
			if(s[i][j] == 'A')sum += cnt[0][j];
			else if(s[i][j] == 'T')sum += cnt[1][j];
			else if(s[i][j] == 'C')sum += cnt[2][j];
			else sum += cnt[3][j];
		}
		if(sum == k * (n - 1))chk(i);
	}
	return(0);
}

Compilation message

genetics.cpp: In function 'int32_t main()':
genetics.cpp:78:40: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[4110]' [-Wformat=]
   78 |  for(int i = 1 ; i <= n ; i ++)scanf("%s",s + i) , add(i);
      |                                       ~^  ~~~~~
      |                                        |    |
      |                                        |    char (*)[4110]
      |                                        char*
genetics.cpp:78:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   78 |  for(int i = 1 ; i <= n ; i ++)scanf("%s",s + i) , add(i);
      |                                ~~~~~^~~~~~~~~~~~

Subtask #1
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 66924 KB Output is correct
2 Correct 36 ms 67052 KB Output is correct
3 Correct 39 ms 66540 KB Output is correct
4 Correct 37 ms 66924 KB Output is correct
5 Correct 37 ms 67052 KB Output is correct
6 Correct 37 ms 66924 KB Output is correct
7 Correct 37 ms 66796 KB Output is correct
8 Correct 36 ms 66540 KB Output is correct
9 Correct 37 ms 66924 KB Output is correct
10 Correct 41 ms 67052 KB Output is correct
11 Correct 39 ms 66924 KB Output is correct
12 Correct 41 ms 67052 KB Output is correct
13 Correct 36 ms 67052 KB Output is correct
14 Correct 36 ms 67052 KB Output is correct
15 Correct 37 ms 67052 KB Output is correct
16 Correct 37 ms 67052 KB Output is correct
17 Correct 37 ms 66540 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 74988 KB Output is correct
2 Correct 69 ms 76396 KB Output is correct
3 Correct 76 ms 75884 KB Output is correct
4 Correct 51 ms 73068 KB Output is correct
5 Correct 101 ms 76396 KB Output is correct
6 Correct 88 ms 76396 KB Output is correct
7 Correct 56 ms 71276 KB Output is correct
8 Correct 53 ms 71148 KB Output is correct
9 Correct 364 ms 76140 KB Output is correct
10 Correct 113 ms 76012 KB Output is correct
11 Correct 204 ms 75116 KB Output is correct
12 Correct 330 ms 74988 KB Output is correct
13 Correct 171 ms 74860 KB Output is correct
14 Correct 74 ms 73836 KB Output is correct
15 Correct 125 ms 73836 KB Output is correct
16 Correct 75 ms 74732 KB Output is correct
17 Correct 79 ms 76012 KB Output is correct
18 Correct 92 ms 75884 KB Output is correct
19 Correct 84 ms 76012 KB Output is correct
20 Correct 95 ms 75884 KB Output is correct
21 Correct 82 ms 75884 KB Output is correct
22 Correct 75 ms 75884 KB Output is correct
23 Correct 75 ms 75884 KB Output is correct
24 Correct 75 ms 75884 KB Output is correct
25 Correct 90 ms 75884 KB Output is correct
26 Correct 85 ms 75884 KB Output is correct
27 Correct 88 ms 75920 KB Output is correct
28 Correct 91 ms 75884 KB Output is correct
29 Correct 81 ms 75884 KB Output is correct
30 Correct 73 ms 76396 KB Output is correct
31 Correct 68 ms 76396 KB Output is correct
32 Correct 92 ms 76396 KB Output is correct
33 Correct 36 ms 66540 KB Output is correct
34 Correct 37 ms 67052 KB Output is correct
35 Correct 37 ms 66668 KB Output is correct

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 74988 KB Output is correct
2 Correct 69 ms 76396 KB Output is correct
3 Correct 76 ms 75884 KB Output is correct
4 Correct 51 ms 73068 KB Output is correct
5 Correct 101 ms 76396 KB Output is correct
6 Correct 88 ms 76396 KB Output is correct
7 Correct 56 ms 71276 KB Output is correct
8 Correct 53 ms 71148 KB Output is correct
9 Correct 364 ms 76140 KB Output is correct
10 Correct 113 ms 76012 KB Output is correct
11 Correct 204 ms 75116 KB Output is correct
12 Correct 330 ms 74988 KB Output is correct
13 Correct 171 ms 74860 KB Output is correct
14 Correct 74 ms 73836 KB Output is correct
15 Correct 125 ms 73836 KB Output is correct
16 Correct 75 ms 74732 KB Output is correct
17 Correct 79 ms 76012 KB Output is correct
18 Correct 92 ms 75884 KB Output is correct
19 Correct 84 ms 76012 KB Output is correct
20 Correct 95 ms 75884 KB Output is correct
21 Correct 82 ms 75884 KB Output is correct
22 Correct 75 ms 75884 KB Output is correct
23 Correct 75 ms 75884 KB Output is correct
24 Correct 75 ms 75884 KB Output is correct
25 Correct 90 ms 75884 KB Output is correct
26 Correct 85 ms 75884 KB Output is correct
27 Correct 88 ms 75920 KB Output is correct
28 Correct 91 ms 75884 KB Output is correct
29 Correct 81 ms 75884 KB Output is correct
30 Correct 73 ms 76396 KB Output is correct
31 Correct 68 ms 76396 KB Output is correct
32 Correct 92 ms 76396 KB Output is correct
33 Correct 36 ms 66540 KB Output is correct
34 Correct 37 ms 67052 KB Output is correct
35 Correct 37 ms 66668 KB Output is correct
36 Correct 286 ms 85428 KB Output is correct
37 Correct 195 ms 87244 KB Output is correct
38 Correct 217 ms 87404 KB Output is correct
39 Correct 132 ms 84844 KB Output is correct
40 Correct 263 ms 87148 KB Output is correct
41 Correct 145 ms 77676 KB Output is correct
42 Correct 147 ms 77676 KB Output is correct
43 Correct 571 ms 84884 KB Output is correct
44 Correct 666 ms 87660 KB Output is correct
45 Correct 494 ms 87572 KB Output is correct
46 Correct 453 ms 87660 KB Output is correct
47 Correct 446 ms 85484 KB Output is correct
48 Correct 451 ms 85356 KB Output is correct
49 Correct 813 ms 82924 KB Output is correct
50 Correct 193 ms 82796 KB Output is correct
51 Correct 220 ms 84716 KB Output is correct
52 Correct 243 ms 87404 KB Output is correct
53 Correct 231 ms 87532 KB Output is correct
54 Correct 195 ms 87404 KB Output is correct
55 Correct 173 ms 87660 KB Output is correct
56 Correct 297 ms 87532 KB Output is correct
57 Correct 217 ms 87532 KB Output is correct
58 Correct 276 ms 87660 KB Output is correct
59 Correct 286 ms 87404 KB Output is correct
60 Correct 301 ms 87788 KB Output is correct
61 Correct 289 ms 87532 KB Output is correct
62 Correct 296 ms 87276 KB Output is correct
63 Correct 307 ms 87532 KB Output is correct
64 Correct 296 ms 87404 KB Output is correct
65 Correct 234 ms 87660 KB Output is correct
66 Correct 260 ms 87532 KB Output is correct
67 Correct 247 ms 87660 KB Output is correct
68 Correct 274 ms 87532 KB Output is correct
69 Correct 309 ms 87404 KB Output is correct
70 Correct 245 ms 87532 KB Output is correct
71 Correct 271 ms 87404 KB Output is correct
72 Correct 269 ms 87660 KB Output is correct
73 Correct 253 ms 87532 KB Output is correct
74 Correct 37 ms 66540 KB Output is correct
75 Correct 37 ms 67052 KB Output is correct
76 Correct 37 ms 66540 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 66924 KB Output is correct
2 Correct 36 ms 67052 KB Output is correct
3 Correct 39 ms 66540 KB Output is correct
4 Correct 37 ms 66924 KB Output is correct
5 Correct 37 ms 67052 KB Output is correct
6 Correct 37 ms 66924 KB Output is correct
7 Correct 37 ms 66796 KB Output is correct
8 Correct 36 ms 66540 KB Output is correct
9 Correct 37 ms 66924 KB Output is correct
10 Correct 41 ms 67052 KB Output is correct
11 Correct 39 ms 66924 KB Output is correct
12 Correct 41 ms 67052 KB Output is correct
13 Correct 36 ms 67052 KB Output is correct
14 Correct 36 ms 67052 KB Output is correct
15 Correct 37 ms 67052 KB Output is correct
16 Correct 37 ms 67052 KB Output is correct
17 Correct 37 ms 66540 KB Output is correct
18 Correct 85 ms 74988 KB Output is correct
19 Correct 69 ms 76396 KB Output is correct
20 Correct 76 ms 75884 KB Output is correct
21 Correct 51 ms 73068 KB Output is correct
22 Correct 101 ms 76396 KB Output is correct
23 Correct 88 ms 76396 KB Output is correct
24 Correct 56 ms 71276 KB Output is correct
25 Correct 53 ms 71148 KB Output is correct
26 Correct 364 ms 76140 KB Output is correct
27 Correct 113 ms 76012 KB Output is correct
28 Correct 204 ms 75116 KB Output is correct
29 Correct 330 ms 74988 KB Output is correct
30 Correct 171 ms 74860 KB Output is correct
31 Correct 74 ms 73836 KB Output is correct
32 Correct 125 ms 73836 KB Output is correct
33 Correct 75 ms 74732 KB Output is correct
34 Correct 79 ms 76012 KB Output is correct
35 Correct 92 ms 75884 KB Output is correct
36 Correct 84 ms 76012 KB Output is correct
37 Correct 95 ms 75884 KB Output is correct
38 Correct 82 ms 75884 KB Output is correct
39 Correct 75 ms 75884 KB Output is correct
40 Correct 75 ms 75884 KB Output is correct
41 Correct 75 ms 75884 KB Output is correct
42 Correct 90 ms 75884 KB Output is correct
43 Correct 85 ms 75884 KB Output is correct
44 Correct 88 ms 75920 KB Output is correct
45 Correct 91 ms 75884 KB Output is correct
46 Correct 81 ms 75884 KB Output is correct
47 Correct 73 ms 76396 KB Output is correct
48 Correct 68 ms 76396 KB Output is correct
49 Correct 92 ms 76396 KB Output is correct
50 Correct 36 ms 66540 KB Output is correct
51 Correct 37 ms 67052 KB Output is correct
52 Correct 37 ms 66668 KB Output is correct
53 Correct 286 ms 85428 KB Output is correct
54 Correct 195 ms 87244 KB Output is correct
55 Correct 217 ms 87404 KB Output is correct
56 Correct 132 ms 84844 KB Output is correct
57 Correct 263 ms 87148 KB Output is correct
58 Correct 145 ms 77676 KB Output is correct
59 Correct 147 ms 77676 KB Output is correct
60 Correct 571 ms 84884 KB Output is correct
61 Correct 666 ms 87660 KB Output is correct
62 Correct 494 ms 87572 KB Output is correct
63 Correct 453 ms 87660 KB Output is correct
64 Correct 446 ms 85484 KB Output is correct
65 Correct 451 ms 85356 KB Output is correct
66 Correct 813 ms 82924 KB Output is correct
67 Correct 193 ms 82796 KB Output is correct
68 Correct 220 ms 84716 KB Output is correct
69 Correct 243 ms 87404 KB Output is correct
70 Correct 231 ms 87532 KB Output is correct
71 Correct 195 ms 87404 KB Output is correct
72 Correct 173 ms 87660 KB Output is correct
73 Correct 297 ms 87532 KB Output is correct
74 Correct 217 ms 87532 KB Output is correct
75 Correct 276 ms 87660 KB Output is correct
76 Correct 286 ms 87404 KB Output is correct
77 Correct 301 ms 87788 KB Output is correct
78 Correct 289 ms 87532 KB Output is correct
79 Correct 296 ms 87276 KB Output is correct
80 Correct 307 ms 87532 KB Output is correct
81 Correct 296 ms 87404 KB Output is correct
82 Correct 234 ms 87660 KB Output is correct
83 Correct 260 ms 87532 KB Output is correct
84 Correct 247 ms 87660 KB Output is correct
85 Correct 274 ms 87532 KB Output is correct
86 Correct 309 ms 87404 KB Output is correct
87 Correct 245 ms 87532 KB Output is correct
88 Correct 271 ms 87404 KB Output is correct
89 Correct 269 ms 87660 KB Output is correct
90 Correct 253 ms 87532 KB Output is correct
91 Correct 37 ms 66540 KB Output is correct
92 Correct 37 ms 67052 KB Output is correct
93 Correct 37 ms 66540 KB Output is correct
94 Correct 428 ms 90988 KB Output is correct
95 Correct 194 ms 91372 KB Output is correct
96 Correct 272 ms 91756 KB Output is correct
97 Correct 159 ms 80492 KB Output is correct
98 Correct 143 ms 86508 KB Output is correct
99 Correct 247 ms 87148 KB Output is correct
100 Correct 180 ms 79724 KB Output is correct
101 Correct 188 ms 79724 KB Output is correct
102 Correct 476 ms 88172 KB Output is correct
103 Correct 600 ms 87720 KB Output is correct
104 Correct 509 ms 93000 KB Output is correct
105 Correct 272 ms 91884 KB Output is correct
106 Correct 829 ms 91116 KB Output is correct
107 Correct 1200 ms 85484 KB Output is correct
108 Correct 404 ms 82796 KB Output is correct
109 Correct 359 ms 88812 KB Output is correct
110 Correct 243 ms 88300 KB Output is correct
111 Correct 353 ms 89580 KB Output is correct
112 Correct 321 ms 92604 KB Output is correct
113 Correct 170 ms 91500 KB Output is correct
114 Correct 202 ms 87452 KB Output is correct
115 Correct 288 ms 91628 KB Output is correct
116 Correct 295 ms 91884 KB Output is correct
117 Correct 353 ms 91848 KB Output is correct
118 Correct 323 ms 91756 KB Output is correct
119 Correct 353 ms 91756 KB Output is correct
120 Correct 342 ms 91756 KB Output is correct
121 Correct 287 ms 85356 KB Output is correct
122 Correct 207 ms 87256 KB Output is correct
123 Correct 220 ms 88172 KB Output is correct
124 Correct 37 ms 66668 KB Output is correct
125 Correct 37 ms 67052 KB Output is correct
126 Correct 36 ms 66540 KB Output is correct