oj.uz

Submission #110052

# Submission time Handle Problem Language Result Execution time Memory
110052 2019-05-09T03:41:13 Z qkxwsm Genetics (BOI18_genetics) C++14
74 / 100
 1260 ms 71160 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];
vl compress[MAXN];
int block = 60;
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 test(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 / block)
		{
			diffs += __builtin_popcountll(compress[u][j] ^ compress[idx][j]);
		}
		if (diffs != K) return false;
	}
	return true;
}
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)
	{
		compress[i].resize(M / block);
		FOR(j, 0, M / block)
		{
			ll num = 0;
			FOR(k, j * block, j * block + block)
			{
				num += num;
				num += grid[i][k];
			}
			compress[i][j] = num;
		}
	}
	ord.resize(N);
	FOR(i, 0, N) ord[i] = i;
	FOR(i, 0, N)
	{
		if ((N > 1800 && test(i)) || (N <= 1800 && 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:166: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 632 KB Output is correct
2 Correct 5 ms 632 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 5 ms 632 KB Output is correct
6 Correct 6 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 5 ms 632 KB Output is correct
12 Correct 5 ms 636 KB Output is correct
13 Correct 6 ms 632 KB Output is correct
14 Correct 5 ms 632 KB Output is correct
15 Correct 5 ms 556 KB Output is correct
16 Correct 5 ms 632 KB Output is correct
17 Correct 5 ms 508 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 682 ms 12024 KB Output is correct
2 Correct 947 ms 14628 KB Output is correct
3 Correct 1260 ms 13988 KB Output is correct
4 Correct 140 ms 3704 KB Output is correct
5 Correct 184 ms 14584 KB Output is correct
6 Correct 520 ms 14712 KB Output is correct
7 Correct 172 ms 6880 KB Output is correct
8 Correct 146 ms 6648 KB Output is correct
9 Correct 55 ms 13556 KB Output is correct
10 Correct 358 ms 13688 KB Output is correct
11 Correct 443 ms 12024 KB Output is correct
12 Correct 84 ms 12024 KB Output is correct
13 Correct 211 ms 12028 KB Output is correct
14 Correct 507 ms 10488 KB Output is correct
15 Correct 139 ms 10620 KB Output is correct
16 Correct 256 ms 10488 KB Output is correct
17 Correct 923 ms 13944 KB Output is correct
18 Correct 82 ms 13944 KB Output is correct
19 Correct 865 ms 14116 KB Output is correct
20 Correct 263 ms 13944 KB Output is correct
21 Correct 794 ms 14072 KB Output is correct
22 Correct 1131 ms 13816 KB Output is correct
23 Correct 1229 ms 13996 KB Output is correct
24 Correct 1178 ms 13944 KB Output is correct
25 Correct 293 ms 13816 KB Output is correct
26 Correct 560 ms 14072 KB Output is correct
27 Correct 504 ms 13944 KB Output is correct
28 Correct 484 ms 13944 KB Output is correct
29 Correct 920 ms 14072 KB Output is correct
30 Correct 51 ms 14584 KB Output is correct
31 Correct 75 ms 14584 KB Output is correct
32 Correct 66 ms 14584 KB Output is correct
33 Correct 5 ms 504 KB Output is correct
34 Correct 5 ms 632 KB Output is correct
35 Correct 5 ms 504 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 682 ms 12024 KB Output is correct
2 Correct 947 ms 14628 KB Output is correct
3 Correct 1260 ms 13988 KB Output is correct
4 Correct 140 ms 3704 KB Output is correct
5 Correct 184 ms 14584 KB Output is correct
6 Correct 520 ms 14712 KB Output is correct
7 Correct 172 ms 6880 KB Output is correct
8 Correct 146 ms 6648 KB Output is correct
9 Correct 55 ms 13556 KB Output is correct
10 Correct 358 ms 13688 KB Output is correct
11 Correct 443 ms 12024 KB Output is correct
12 Correct 84 ms 12024 KB Output is correct
13 Correct 211 ms 12028 KB Output is correct
14 Correct 507 ms 10488 KB Output is correct
15 Correct 139 ms 10620 KB Output is correct
16 Correct 256 ms 10488 KB Output is correct
17 Correct 923 ms 13944 KB Output is correct
18 Correct 82 ms 13944 KB Output is correct
19 Correct 865 ms 14116 KB Output is correct
20 Correct 263 ms 13944 KB Output is correct
21 Correct 794 ms 14072 KB Output is correct
22 Correct 1131 ms 13816 KB Output is correct
23 Correct 1229 ms 13996 KB Output is correct
24 Correct 1178 ms 13944 KB Output is correct
25 Correct 293 ms 13816 KB Output is correct
26 Correct 560 ms 14072 KB Output is correct
27 Correct 504 ms 13944 KB Output is correct
28 Correct 484 ms 13944 KB Output is correct
29 Correct 920 ms 14072 KB Output is correct
30 Correct 51 ms 14584 KB Output is correct
31 Correct 75 ms 14584 KB Output is correct
32 Correct 66 ms 14584 KB Output is correct
33 Correct 5 ms 504 KB Output is correct
34 Correct 5 ms 632 KB Output is correct
35 Correct 5 ms 504 KB Output is correct
36 Correct 519 ms 62312 KB Output is correct
37 Correct 500 ms 70264 KB Output is correct
38 Correct 1171 ms 69056 KB Output is correct
39 Correct 294 ms 25848 KB Output is correct
40 Correct 804 ms 70648 KB Output is correct
41 Correct 279 ms 35960 KB Output is correct
42 Correct 194 ms 35964 KB Output is correct
43 Correct 230 ms 50552 KB Output is correct
44 Correct 261 ms 70488 KB Output is correct
45 Correct 542 ms 69496 KB Output is correct
46 Correct 246 ms 69496 KB Output is correct
47 Correct 551 ms 60920 KB Output is correct
48 Correct 744 ms 64124 KB Output is correct
49 Correct 242 ms 55544 KB Output is correct
50 Correct 568 ms 55416 KB Output is correct
51 Correct 648 ms 62068 KB Output is correct
52 Correct 989 ms 71160 KB Output is correct
53 Correct 1042 ms 71032 KB Output is correct
54 Correct 194 ms 69036 KB Output is correct
55 Correct 368 ms 68600 KB Output is correct
56 Correct 236 ms 68728 KB Output is correct
57 Correct 1148 ms 70776 KB Output is correct
58 Correct 691 ms 70776 KB Output is correct
59 Correct 462 ms 70264 KB Output is correct
60 Correct 398 ms 70648 KB Output is correct
61 Correct 455 ms 70264 KB Output is correct
62 Correct 360 ms 70884 KB Output is correct
63 Correct 280 ms 69880 KB Output is correct
64 Correct 373 ms 70300 KB Output is correct
65 Correct 985 ms 69756 KB Output is correct
66 Correct 891 ms 69756 KB Output is correct
67 Correct 876 ms 70008 KB Output is correct
68 Correct 622 ms 70008 KB Output is correct
69 Correct 243 ms 69496 KB Output is correct
70 Correct 864 ms 69880 KB Output is correct
71 Correct 595 ms 69240 KB Output is correct
72 Correct 681 ms 68984 KB Output is correct
73 Correct 834 ms 68604 KB Output is correct
74 Correct 5 ms 504 KB Output is correct
75 Correct 5 ms 636 KB Output is correct
76 Correct 5 ms 632 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 ms 632 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 5 ms 632 KB Output is correct
6 Correct 6 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 5 ms 632 KB Output is correct
12 Correct 5 ms 636 KB Output is correct
13 Correct 6 ms 632 KB Output is correct
14 Correct 5 ms 632 KB Output is correct
15 Correct 5 ms 556 KB Output is correct
16 Correct 5 ms 632 KB Output is correct
17 Correct 5 ms 508 KB Output is correct
18 Correct 682 ms 12024 KB Output is correct
19 Correct 947 ms 14628 KB Output is correct
20 Correct 1260 ms 13988 KB Output is correct
21 Correct 140 ms 3704 KB Output is correct
22 Correct 184 ms 14584 KB Output is correct
23 Correct 520 ms 14712 KB Output is correct
24 Correct 172 ms 6880 KB Output is correct
25 Correct 146 ms 6648 KB Output is correct
26 Correct 55 ms 13556 KB Output is correct
27 Correct 358 ms 13688 KB Output is correct
28 Correct 443 ms 12024 KB Output is correct
29 Correct 84 ms 12024 KB Output is correct
30 Correct 211 ms 12028 KB Output is correct
31 Correct 507 ms 10488 KB Output is correct
32 Correct 139 ms 10620 KB Output is correct
33 Correct 256 ms 10488 KB Output is correct
34 Correct 923 ms 13944 KB Output is correct
35 Correct 82 ms 13944 KB Output is correct
36 Correct 865 ms 14116 KB Output is correct
37 Correct 263 ms 13944 KB Output is correct
38 Correct 794 ms 14072 KB Output is correct
39 Correct 1131 ms 13816 KB Output is correct
40 Correct 1229 ms 13996 KB Output is correct
41 Correct 1178 ms 13944 KB Output is correct
42 Correct 293 ms 13816 KB Output is correct
43 Correct 560 ms 14072 KB Output is correct
44 Correct 504 ms 13944 KB Output is correct
45 Correct 484 ms 13944 KB Output is correct
46 Correct 920 ms 14072 KB Output is correct
47 Correct 51 ms 14584 KB Output is correct
48 Correct 75 ms 14584 KB Output is correct
49 Correct 66 ms 14584 KB Output is correct
50 Correct 5 ms 504 KB Output is correct
51 Correct 5 ms 632 KB Output is correct
52 Correct 5 ms 504 KB Output is correct
53 Correct 519 ms 62312 KB Output is correct
54 Correct 500 ms 70264 KB Output is correct
55 Correct 1171 ms 69056 KB Output is correct
56 Correct 294 ms 25848 KB Output is correct
57 Correct 804 ms 70648 KB Output is correct
58 Correct 279 ms 35960 KB Output is correct
59 Correct 194 ms 35964 KB Output is correct
60 Correct 230 ms 50552 KB Output is correct
61 Correct 261 ms 70488 KB Output is correct
62 Correct 542 ms 69496 KB Output is correct
63 Correct 246 ms 69496 KB Output is correct
64 Correct 551 ms 60920 KB Output is correct
65 Correct 744 ms 64124 KB Output is correct
66 Correct 242 ms 55544 KB Output is correct
67 Correct 568 ms 55416 KB Output is correct
68 Correct 648 ms 62068 KB Output is correct
69 Correct 989 ms 71160 KB Output is correct
70 Correct 1042 ms 71032 KB Output is correct
71 Correct 194 ms 69036 KB Output is correct
72 Correct 368 ms 68600 KB Output is correct
73 Correct 236 ms 68728 KB Output is correct
74 Correct 1148 ms 70776 KB Output is correct
75 Correct 691 ms 70776 KB Output is correct
76 Correct 462 ms 70264 KB Output is correct
77 Correct 398 ms 70648 KB Output is correct
78 Correct 455 ms 70264 KB Output is correct
79 Correct 360 ms 70884 KB Output is correct
80 Correct 280 ms 69880 KB Output is correct
81 Correct 373 ms 70300 KB Output is correct
82 Correct 985 ms 69756 KB Output is correct
83 Correct 891 ms 69756 KB Output is correct
84 Correct 876 ms 70008 KB Output is correct
85 Correct 622 ms 70008 KB Output is correct
86 Correct 243 ms 69496 KB Output is correct
87 Correct 864 ms 69880 KB Output is correct
88 Correct 595 ms 69240 KB Output is correct
89 Correct 681 ms 68984 KB Output is correct
90 Correct 834 ms 68604 KB Output is correct
91 Correct 5 ms 504 KB Output is correct
92 Correct 5 ms 636 KB Output is correct
93 Correct 5 ms 632 KB Output is correct
94 Incorrect 514 ms 68888 KB Output isn't correct
95 Halted 0 ms 0 KB -