oj.uz

답안 #110055

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
110055 2019-05-09T03:52:14 Z qkxwsm Genetics (BOI18_genetics) C++14
46 / 100
 1147 ms 61684 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];
vector<__int128_t> compress[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 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)
		{
			__int128_t 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;
	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 ((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

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

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 595 ms 11768 KB Output is correct
2 Correct 586 ms 13816 KB Output is correct
3 Correct 1020 ms 13160 KB Output is correct
4 Correct 60 ms 3320 KB Output is correct
5 Correct 294 ms 13688 KB Output is correct
6 Correct 863 ms 13856 KB Output is correct
7 Correct 102 ms 6136 KB Output is correct
8 Correct 111 ms 6264 KB Output is correct
9 Correct 501 ms 13304 KB Output is correct
10 Correct 176 ms 13176 KB Output is correct
11 Correct 565 ms 11768 KB Output is correct
12 Correct 608 ms 11836 KB Output is correct
13 Correct 265 ms 11768 KB Output is correct
14 Correct 180 ms 10104 KB Output is correct
15 Correct 305 ms 10104 KB Output is correct
16 Correct 727 ms 9976 KB Output is correct
17 Correct 979 ms 13304 KB Output is correct
18 Correct 1147 ms 13096 KB Output is correct
19 Correct 229 ms 13304 KB Output is correct
20 Correct 335 ms 12920 KB Output is correct
21 Correct 964 ms 13176 KB Output is correct
22 Correct 974 ms 13176 KB Output is correct
23 Correct 1052 ms 13176 KB Output is correct
24 Correct 327 ms 13176 KB Output is correct
25 Correct 359 ms 13052 KB Output is correct
26 Correct 708 ms 13132 KB Output is correct
27 Correct 184 ms 13176 KB Output is correct
28 Correct 1045 ms 13048 KB Output is correct
29 Correct 566 ms 13048 KB Output is correct
30 Correct 70 ms 13816 KB Output is correct
31 Correct 38 ms 13688 KB Output is correct
32 Correct 103 ms 13688 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
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 595 ms 11768 KB Output is correct
2 Correct 586 ms 13816 KB Output is correct
3 Correct 1020 ms 13160 KB Output is correct
4 Correct 60 ms 3320 KB Output is correct
5 Correct 294 ms 13688 KB Output is correct
6 Correct 863 ms 13856 KB Output is correct
7 Correct 102 ms 6136 KB Output is correct
8 Correct 111 ms 6264 KB Output is correct
9 Correct 501 ms 13304 KB Output is correct
10 Correct 176 ms 13176 KB Output is correct
11 Correct 565 ms 11768 KB Output is correct
12 Correct 608 ms 11836 KB Output is correct
13 Correct 265 ms 11768 KB Output is correct
14 Correct 180 ms 10104 KB Output is correct
15 Correct 305 ms 10104 KB Output is correct
16 Correct 727 ms 9976 KB Output is correct
17 Correct 979 ms 13304 KB Output is correct
18 Correct 1147 ms 13096 KB Output is correct
19 Correct 229 ms 13304 KB Output is correct
20 Correct 335 ms 12920 KB Output is correct
21 Correct 964 ms 13176 KB Output is correct
22 Correct 974 ms 13176 KB Output is correct
23 Correct 1052 ms 13176 KB Output is correct
24 Correct 327 ms 13176 KB Output is correct
25 Correct 359 ms 13052 KB Output is correct
26 Correct 708 ms 13132 KB Output is correct
27 Correct 184 ms 13176 KB Output is correct
28 Correct 1045 ms 13048 KB Output is correct
29 Correct 566 ms 13048 KB Output is correct
30 Correct 70 ms 13816 KB Output is correct
31 Correct 38 ms 13688 KB Output is correct
32 Correct 103 ms 13688 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 Incorrect 416 ms 61684 KB Output isn't correct
37 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 632 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 632 KB Output is correct
6 Correct 5 ms 632 KB Output is correct
7 Correct 6 ms 632 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 6 ms 632 KB Output is correct
13 Correct 5 ms 632 KB Output is correct
14 Correct 5 ms 632 KB Output is correct
15 Correct 5 ms 632 KB Output is correct
16 Correct 5 ms 632 KB Output is correct
17 Correct 5 ms 504 KB Output is correct
18 Correct 595 ms 11768 KB Output is correct
19 Correct 586 ms 13816 KB Output is correct
20 Correct 1020 ms 13160 KB Output is correct
21 Correct 60 ms 3320 KB Output is correct
22 Correct 294 ms 13688 KB Output is correct
23 Correct 863 ms 13856 KB Output is correct
24 Correct 102 ms 6136 KB Output is correct
25 Correct 111 ms 6264 KB Output is correct
26 Correct 501 ms 13304 KB Output is correct
27 Correct 176 ms 13176 KB Output is correct
28 Correct 565 ms 11768 KB Output is correct
29 Correct 608 ms 11836 KB Output is correct
30 Correct 265 ms 11768 KB Output is correct
31 Correct 180 ms 10104 KB Output is correct
32 Correct 305 ms 10104 KB Output is correct
33 Correct 727 ms 9976 KB Output is correct
34 Correct 979 ms 13304 KB Output is correct
35 Correct 1147 ms 13096 KB Output is correct
36 Correct 229 ms 13304 KB Output is correct
37 Correct 335 ms 12920 KB Output is correct
38 Correct 964 ms 13176 KB Output is correct
39 Correct 974 ms 13176 KB Output is correct
40 Correct 1052 ms 13176 KB Output is correct
41 Correct 327 ms 13176 KB Output is correct
42 Correct 359 ms 13052 KB Output is correct
43 Correct 708 ms 13132 KB Output is correct
44 Correct 184 ms 13176 KB Output is correct
45 Correct 1045 ms 13048 KB Output is correct
46 Correct 566 ms 13048 KB Output is correct
47 Correct 70 ms 13816 KB Output is correct
48 Correct 38 ms 13688 KB Output is correct
49 Correct 103 ms 13688 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 Incorrect 416 ms 61684 KB Output isn't correct
54 Halted 0 ms 0 KB -