oj.uz

답안 #110045

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
110045 2019-05-09T03:22:25 Z qkxwsm Genetics (BOI18_genetics) C++14
46 / 100
 2000 ms 59256 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;
int grid[MAXN][MAXN];
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)
		{
			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;
	FOR(i, 0, N)
	{
		string temps; cin >> temps;
		FOR(j, 0, M)
		{
			grid[i][j] = h(temps[j]);
		}
	}
	ord.resize(N);
	FOR(i, 0, N) ord[i] = i;
	FOR(i, 0, N)
	{
		if (test(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:164:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 760 KB Output is correct
2 Correct 5 ms 760 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 5 ms 760 KB Output is correct
6 Correct 5 ms 760 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 632 KB Output is correct
10 Correct 5 ms 760 KB Output is correct
11 Correct 5 ms 760 KB Output is correct
12 Correct 5 ms 760 KB Output is correct
13 Correct 5 ms 760 KB Output is correct
14 Correct 5 ms 760 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 376 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 747 ms 16760 KB Output is correct
2 Correct 1062 ms 21240 KB Output is correct
3 Correct 1350 ms 20344 KB Output is correct
4 Correct 157 ms 8056 KB Output is correct
5 Correct 176 ms 21272 KB Output is correct
6 Correct 568 ms 21172 KB Output is correct
7 Correct 185 ms 9464 KB Output is correct
8 Correct 163 ms 9336 KB Output is correct
9 Correct 46 ms 19832 KB Output is correct
10 Correct 370 ms 19960 KB Output is correct
11 Correct 459 ms 17528 KB Output is correct
12 Correct 73 ms 17532 KB Output is correct
13 Correct 210 ms 17656 KB Output is correct
14 Correct 574 ms 15096 KB Output is correct
15 Correct 142 ms 15352 KB Output is correct
16 Correct 252 ms 15864 KB Output is correct
17 Correct 1018 ms 20344 KB Output is correct
18 Correct 76 ms 20088 KB Output is correct
19 Correct 904 ms 20320 KB Output is correct
20 Correct 306 ms 19960 KB Output is correct
21 Correct 864 ms 20344 KB Output is correct
22 Correct 1263 ms 20220 KB Output is correct
23 Correct 1390 ms 20216 KB Output is correct
24 Correct 1298 ms 20216 KB Output is correct
25 Correct 323 ms 20092 KB Output is correct
26 Correct 587 ms 20088 KB Output is correct
27 Correct 548 ms 20216 KB Output is correct
28 Correct 533 ms 19960 KB Output is correct
29 Correct 961 ms 20216 KB Output is correct
30 Correct 43 ms 21112 KB Output is correct
31 Correct 63 ms 21112 KB Output is correct
32 Correct 55 ms 21112 KB Output is correct
33 Correct 5 ms 380 KB Output is correct
34 Correct 5 ms 892 KB Output is correct
35 Correct 5 ms 376 KB Output is correct

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 747 ms 16760 KB Output is correct
2 Correct 1062 ms 21240 KB Output is correct
3 Correct 1350 ms 20344 KB Output is correct
4 Correct 157 ms 8056 KB Output is correct
5 Correct 176 ms 21272 KB Output is correct
6 Correct 568 ms 21172 KB Output is correct
7 Correct 185 ms 9464 KB Output is correct
8 Correct 163 ms 9336 KB Output is correct
9 Correct 46 ms 19832 KB Output is correct
10 Correct 370 ms 19960 KB Output is correct
11 Correct 459 ms 17528 KB Output is correct
12 Correct 73 ms 17532 KB Output is correct
13 Correct 210 ms 17656 KB Output is correct
14 Correct 574 ms 15096 KB Output is correct
15 Correct 142 ms 15352 KB Output is correct
16 Correct 252 ms 15864 KB Output is correct
17 Correct 1018 ms 20344 KB Output is correct
18 Correct 76 ms 20088 KB Output is correct
19 Correct 904 ms 20320 KB Output is correct
20 Correct 306 ms 19960 KB Output is correct
21 Correct 864 ms 20344 KB Output is correct
22 Correct 1263 ms 20220 KB Output is correct
23 Correct 1390 ms 20216 KB Output is correct
24 Correct 1298 ms 20216 KB Output is correct
25 Correct 323 ms 20092 KB Output is correct
26 Correct 587 ms 20088 KB Output is correct
27 Correct 548 ms 20216 KB Output is correct
28 Correct 533 ms 19960 KB Output is correct
29 Correct 961 ms 20216 KB Output is correct
30 Correct 43 ms 21112 KB Output is correct
31 Correct 63 ms 21112 KB Output is correct
32 Correct 55 ms 21112 KB Output is correct
33 Correct 5 ms 380 KB Output is correct
34 Correct 5 ms 892 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Execution timed out 2045 ms 59256 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 760 KB Output is correct
2 Correct 5 ms 760 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 5 ms 760 KB Output is correct
6 Correct 5 ms 760 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 632 KB Output is correct
10 Correct 5 ms 760 KB Output is correct
11 Correct 5 ms 760 KB Output is correct
12 Correct 5 ms 760 KB Output is correct
13 Correct 5 ms 760 KB Output is correct
14 Correct 5 ms 760 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 376 KB Output is correct
18 Correct 747 ms 16760 KB Output is correct
19 Correct 1062 ms 21240 KB Output is correct
20 Correct 1350 ms 20344 KB Output is correct
21 Correct 157 ms 8056 KB Output is correct
22 Correct 176 ms 21272 KB Output is correct
23 Correct 568 ms 21172 KB Output is correct
24 Correct 185 ms 9464 KB Output is correct
25 Correct 163 ms 9336 KB Output is correct
26 Correct 46 ms 19832 KB Output is correct
27 Correct 370 ms 19960 KB Output is correct
28 Correct 459 ms 17528 KB Output is correct
29 Correct 73 ms 17532 KB Output is correct
30 Correct 210 ms 17656 KB Output is correct
31 Correct 574 ms 15096 KB Output is correct
32 Correct 142 ms 15352 KB Output is correct
33 Correct 252 ms 15864 KB Output is correct
34 Correct 1018 ms 20344 KB Output is correct
35 Correct 76 ms 20088 KB Output is correct
36 Correct 904 ms 20320 KB Output is correct
37 Correct 306 ms 19960 KB Output is correct
38 Correct 864 ms 20344 KB Output is correct
39 Correct 1263 ms 20220 KB Output is correct
40 Correct 1390 ms 20216 KB Output is correct
41 Correct 1298 ms 20216 KB Output is correct
42 Correct 323 ms 20092 KB Output is correct
43 Correct 587 ms 20088 KB Output is correct
44 Correct 548 ms 20216 KB Output is correct
45 Correct 533 ms 19960 KB Output is correct
46 Correct 961 ms 20216 KB Output is correct
47 Correct 43 ms 21112 KB Output is correct
48 Correct 63 ms 21112 KB Output is correct
49 Correct 55 ms 21112 KB Output is correct
50 Correct 5 ms 380 KB Output is correct
51 Correct 5 ms 892 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Execution timed out 2045 ms 59256 KB Time limit exceeded
54 Halted 0 ms 0 KB -