oj.uz

Submission #110056

# Submission time Handle Problem Language Result Execution time Memory
110056 2019-05-09T04:04:33 Z qkxwsm Genetics (BOI18_genetics) C++14
100 / 100
 1890 ms 70264 KB 
//clever
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
	unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM;
		// x += 11400714819323198485ull;
		// x = (x ^ (x >> 30)) * 13787848793156543929ull;
		x = (x ^ (x >> 27)) * 10723151780598845931ull;
		return x ^ (x >> 31);
	}
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
template<class T>
void readi(T &x)
{
	x = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		x = x * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		x = -x;
	}
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int buf[20], n = 0;
	while(output)
	{
		buf[n] = ((output % 10));
		output /= 10;
		n++;
	}
	for (n--; n >= 0; n--)
	{
		putchar(buf[n] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 4113

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;

int N, M, K;
vi grid[MAXN];
int ways[MAXN][4];
int bad[MAXN];
int block = 120;
vi ord;

int h (char c)
{
	if (c == 'A') return 0;
	if (c == 'C') return 1;
	if (c == 'T') return 2;
	if (c == 'G') return 3;
}
bool test1(int idx)
{
	FOR(i, 1, N)
	{
		swap(ord[i], ord[randomize(i + 1)]);
	}
	for (int u : ord)
	{
		if (u == idx) continue;
		int diffs = 0;
		FOR(j, 0, M)
		{
			if (grid[u][j] != grid[idx][j]) diffs++;
		}
		if (diffs != K) return false;
	}
	return true;
}

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// if (fopen("file.in", "r"))
	// {
	// 	freopen ("file.in", "r", stdin);
	// 	freopen ("file.out", "w", stdout);
	// }
	cin >> N >> M >> K;
	// M = ((M + block - 1) / block) * block;
	FOR(i, 0, N)
	{
		grid[i].resize(M);
		string temps; cin >> temps;
		FOR(j, 0, SZ(temps))
		{
			grid[i][j] = h(temps[j]);
		}
	}
	FOR(i, 0, N)
	{
		FOR(j, 0, M)
		{
			ways[j][grid[i][j]]++;
		}
	}
	FOR(i, 0, N)
	{
		FOR(j, 0, M)
		{
			bad[i] += (N - ways[j][grid[i][j]]);
		}
	}
	ord.resize(N);
	FOR(i, 0, N) ord[i] = i;
	vi ord1(N);
	FOR(i, 0, N) ord1[i] = i;
	FOR(i, 1, N) swap(ord1[i], ord1[randomize(i + 1)]);
	for (int i : ord1)
	{
		if (bad[i] == K * (N - 1) && test1(i))
		{
			cout << i + 1 << '\n';
			return 0;
		}
	}
	cout << "-1\n";
	//they share exactly M - K things?
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/

Compilation message

genetics.cpp: In function 'int h(char)':
genetics.cpp:167:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 508 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 5 ms 552 KB Output is correct
17 Correct 5 ms 504 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 10744 KB Output is correct
2 Correct 46 ms 13176 KB Output is correct
3 Correct 57 ms 12664 KB Output is correct
4 Correct 17 ms 3064 KB Output is correct
5 Correct 58 ms 13176 KB Output is correct
6 Correct 58 ms 13176 KB Output is correct
7 Correct 28 ms 5880 KB Output is correct
8 Correct 25 ms 5884 KB Output is correct
9 Correct 79 ms 12152 KB Output is correct
10 Correct 127 ms 12408 KB Output is correct
11 Correct 162 ms 10744 KB Output is correct
12 Correct 97 ms 10744 KB Output is correct
13 Correct 104 ms 10744 KB Output is correct
14 Correct 99 ms 9336 KB Output is correct
15 Correct 120 ms 9464 KB Output is correct
16 Correct 43 ms 9336 KB Output is correct
17 Correct 57 ms 12668 KB Output is correct
18 Correct 58 ms 12536 KB Output is correct
19 Correct 56 ms 12664 KB Output is correct
20 Correct 56 ms 12536 KB Output is correct
21 Correct 50 ms 12664 KB Output is correct
22 Correct 56 ms 12536 KB Output is correct
23 Correct 56 ms 12536 KB Output is correct
24 Correct 56 ms 12536 KB Output is correct
25 Correct 55 ms 12536 KB Output is correct
26 Correct 57 ms 12536 KB Output is correct
27 Correct 56 ms 12540 KB Output is correct
28 Correct 56 ms 12536 KB Output is correct
29 Correct 55 ms 12536 KB Output is correct
30 Correct 47 ms 13176 KB Output is correct
31 Correct 48 ms 13176 KB Output is correct
32 Correct 60 ms 13176 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 504 KB Output is correct
35 Correct 5 ms 380 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 10744 KB Output is correct
2 Correct 46 ms 13176 KB Output is correct
3 Correct 57 ms 12664 KB Output is correct
4 Correct 17 ms 3064 KB Output is correct
5 Correct 58 ms 13176 KB Output is correct
6 Correct 58 ms 13176 KB Output is correct
7 Correct 28 ms 5880 KB Output is correct
8 Correct 25 ms 5884 KB Output is correct
9 Correct 79 ms 12152 KB Output is correct
10 Correct 127 ms 12408 KB Output is correct
11 Correct 162 ms 10744 KB Output is correct
12 Correct 97 ms 10744 KB Output is correct
13 Correct 104 ms 10744 KB Output is correct
14 Correct 99 ms 9336 KB Output is correct
15 Correct 120 ms 9464 KB Output is correct
16 Correct 43 ms 9336 KB Output is correct
17 Correct 57 ms 12668 KB Output is correct
18 Correct 58 ms 12536 KB Output is correct
19 Correct 56 ms 12664 KB Output is correct
20 Correct 56 ms 12536 KB Output is correct
21 Correct 50 ms 12664 KB Output is correct
22 Correct 56 ms 12536 KB Output is correct
23 Correct 56 ms 12536 KB Output is correct
24 Correct 56 ms 12536 KB Output is correct
25 Correct 55 ms 12536 KB Output is correct
26 Correct 57 ms 12536 KB Output is correct
27 Correct 56 ms 12540 KB Output is correct
28 Correct 56 ms 12536 KB Output is correct
29 Correct 55 ms 12536 KB Output is correct
30 Correct 47 ms 13176 KB Output is correct
31 Correct 48 ms 13176 KB Output is correct
32 Correct 60 ms 13176 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 504 KB Output is correct
35 Correct 5 ms 380 KB Output is correct
36 Correct 1890 ms 58232 KB Output is correct
37 Correct 231 ms 67576 KB Output is correct
38 Correct 271 ms 66040 KB Output is correct
39 Correct 106 ms 24952 KB Output is correct
40 Correct 274 ms 67704 KB Output is correct
41 Correct 142 ms 34552 KB Output is correct
42 Correct 137 ms 34424 KB Output is correct
43 Correct 403 ms 48888 KB Output is correct
44 Correct 1179 ms 67836 KB Output is correct
45 Correct 319 ms 67448 KB Output is correct
46 Correct 323 ms 67448 KB Output is correct
47 Correct 1812 ms 59652 KB Output is correct
48 Correct 702 ms 59000 KB Output is correct
49 Correct 690 ms 50808 KB Output is correct
50 Correct 1318 ms 50680 KB Output is correct
51 Correct 237 ms 56824 KB Output is correct
52 Correct 266 ms 65272 KB Output is correct
53 Correct 270 ms 65272 KB Output is correct
54 Correct 219 ms 64116 KB Output is correct
55 Correct 214 ms 63992 KB Output is correct
56 Correct 265 ms 63992 KB Output is correct
57 Correct 279 ms 65656 KB Output is correct
58 Correct 276 ms 65656 KB Output is correct
59 Correct 272 ms 65144 KB Output is correct
60 Correct 271 ms 65632 KB Output is correct
61 Correct 276 ms 65356 KB Output is correct
62 Correct 267 ms 65240 KB Output is correct
63 Correct 277 ms 65528 KB Output is correct
64 Correct 272 ms 65572 KB Output is correct
65 Correct 267 ms 65272 KB Output is correct
66 Correct 277 ms 65272 KB Output is correct
67 Correct 271 ms 65528 KB Output is correct
68 Correct 283 ms 65532 KB Output is correct
69 Correct 275 ms 65272 KB Output is correct
70 Correct 266 ms 65528 KB Output is correct
71 Correct 268 ms 65144 KB Output is correct
72 Correct 276 ms 65656 KB Output is correct
73 Correct 269 ms 65400 KB Output is correct
74 Correct 5 ms 376 KB Output is correct
75 Correct 6 ms 504 KB Output is correct
76 Correct 5 ms 376 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 508 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 5 ms 552 KB Output is correct
17 Correct 5 ms 504 KB Output is correct
18 Correct 77 ms 10744 KB Output is correct
19 Correct 46 ms 13176 KB Output is correct
20 Correct 57 ms 12664 KB Output is correct
21 Correct 17 ms 3064 KB Output is correct
22 Correct 58 ms 13176 KB Output is correct
23 Correct 58 ms 13176 KB Output is correct
24 Correct 28 ms 5880 KB Output is correct
25 Correct 25 ms 5884 KB Output is correct
26 Correct 79 ms 12152 KB Output is correct
27 Correct 127 ms 12408 KB Output is correct
28 Correct 162 ms 10744 KB Output is correct
29 Correct 97 ms 10744 KB Output is correct
30 Correct 104 ms 10744 KB Output is correct
31 Correct 99 ms 9336 KB Output is correct
32 Correct 120 ms 9464 KB Output is correct
33 Correct 43 ms 9336 KB Output is correct
34 Correct 57 ms 12668 KB Output is correct
35 Correct 58 ms 12536 KB Output is correct
36 Correct 56 ms 12664 KB Output is correct
37 Correct 56 ms 12536 KB Output is correct
38 Correct 50 ms 12664 KB Output is correct
39 Correct 56 ms 12536 KB Output is correct
40 Correct 56 ms 12536 KB Output is correct
41 Correct 56 ms 12536 KB Output is correct
42 Correct 55 ms 12536 KB Output is correct
43 Correct 57 ms 12536 KB Output is correct
44 Correct 56 ms 12540 KB Output is correct
45 Correct 56 ms 12536 KB Output is correct
46 Correct 55 ms 12536 KB Output is correct
47 Correct 47 ms 13176 KB Output is correct
48 Correct 48 ms 13176 KB Output is correct
49 Correct 60 ms 13176 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 504 KB Output is correct
52 Correct 5 ms 380 KB Output is correct
53 Correct 1890 ms 58232 KB Output is correct
54 Correct 231 ms 67576 KB Output is correct
55 Correct 271 ms 66040 KB Output is correct
56 Correct 106 ms 24952 KB Output is correct
57 Correct 274 ms 67704 KB Output is correct
58 Correct 142 ms 34552 KB Output is correct
59 Correct 137 ms 34424 KB Output is correct
60 Correct 403 ms 48888 KB Output is correct
61 Correct 1179 ms 67836 KB Output is correct
62 Correct 319 ms 67448 KB Output is correct
63 Correct 323 ms 67448 KB Output is correct
64 Correct 1812 ms 59652 KB Output is correct
65 Correct 702 ms 59000 KB Output is correct
66 Correct 690 ms 50808 KB Output is correct
67 Correct 1318 ms 50680 KB Output is correct
68 Correct 237 ms 56824 KB Output is correct
69 Correct 266 ms 65272 KB Output is correct
70 Correct 270 ms 65272 KB Output is correct
71 Correct 219 ms 64116 KB Output is correct
72 Correct 214 ms 63992 KB Output is correct
73 Correct 265 ms 63992 KB Output is correct
74 Correct 279 ms 65656 KB Output is correct
75 Correct 276 ms 65656 KB Output is correct
76 Correct 272 ms 65144 KB Output is correct
77 Correct 271 ms 65632 KB Output is correct
78 Correct 276 ms 65356 KB Output is correct
79 Correct 267 ms 65240 KB Output is correct
80 Correct 277 ms 65528 KB Output is correct
81 Correct 272 ms 65572 KB Output is correct
82 Correct 267 ms 65272 KB Output is correct
83 Correct 277 ms 65272 KB Output is correct
84 Correct 271 ms 65528 KB Output is correct
85 Correct 283 ms 65532 KB Output is correct
86 Correct 275 ms 65272 KB Output is correct
87 Correct 266 ms 65528 KB Output is correct
88 Correct 268 ms 65144 KB Output is correct
89 Correct 276 ms 65656 KB Output is correct
90 Correct 269 ms 65400 KB Output is correct
91 Correct 5 ms 376 KB Output is correct
92 Correct 6 ms 504 KB Output is correct
93 Correct 5 ms 376 KB Output is correct
94 Correct 1253 ms 63352 KB Output is correct
95 Correct 249 ms 69496 KB Output is correct
96 Correct 316 ms 69240 KB Output is correct
97 Correct 176 ms 39800 KB Output is correct
98 Correct 120 ms 28408 KB Output is correct
99 Correct 282 ms 70204 KB Output is correct
100 Correct 171 ms 37752 KB Output is correct
101 Correct 161 ms 37800 KB Output is correct
102 Correct 309 ms 51448 KB Output is correct
103 Correct 366 ms 70136 KB Output is correct
104 Correct 709 ms 70264 KB Output is correct
105 Correct 369 ms 70136 KB Output is correct
106 Correct 483 ms 66424 KB Output is correct
107 Correct 1201 ms 61536 KB Output is correct
108 Correct 1188 ms 53240 KB Output is correct
109 Correct 1191 ms 60664 KB Output is correct
110 Correct 271 ms 58232 KB Output is correct
111 Correct 305 ms 69372 KB Output is correct
112 Correct 318 ms 68600 KB Output is correct
113 Correct 224 ms 66168 KB Output is correct
114 Correct 219 ms 66040 KB Output is correct
115 Correct 314 ms 66180 KB Output is correct
116 Correct 317 ms 68216 KB Output is correct
117 Correct 320 ms 68352 KB Output is correct
118 Correct 317 ms 68344 KB Output is correct
119 Correct 315 ms 68088 KB Output is correct
120 Correct 315 ms 68216 KB Output is correct
121 Correct 1047 ms 61132 KB Output is correct
122 Correct 218 ms 69112 KB Output is correct
123 Correct 260 ms 67576 KB Output is correct
124 Correct 5 ms 504 KB Output is correct
125 Correct 5 ms 504 KB Output is correct
126 Correct 5 ms 504 KB Output is correct