oj.uz

답안 #97864

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
97864 2019-02-19T06:17:39 Z qkxwsm Nice sequence (IZhO18_sequence) C++14
30 / 100
 109 ms 6236 KB 
#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 400013

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 TC;
int A, B, N;
int res[MAXN], dsu[MAXN];
int num[2][2], go[2];

int get(int u)
{
	return (u == dsu[u] ? u : dsu[u] = get(dsu[u]));
}
void merge(int a, int b)
{
	a = get(a);
	b = get(b);
	if (b > a) swap(a, b);
	dsu[a] = b;
}

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 >> TC;
	while(TC--)
	{
		cin >> A >> B;
		N = A + B - gcd(A, B) - 1;
		FOR(i, 0, N)
		{
			dsu[i] = i;
			res[i] = 0;
		}
		FOR(i, A, N)
		{
			merge(i, i - A);
		}
		FOR(i, B, N)
		{
			merge(i, i - B);
		}
		int ida = -1;
		FORD(i, N, 0)
		{
			if (get(i) == i && ida == -1)
			{
				ida = i;
			}
		}
		FOR(i, 0, N)
		{
			if (get(i) == ida)
			{
				res[i] = 0;
			}
			else
			{
				res[i] = 1;
			}
		}
		// FOR(i, 0, N)
		// {
		// 	cerr << res[i] << ' ';
		// }
		// cerr << endl;
		num[0][0] = num[0][1] = num[1][0] = num[1][1] = 0;
		FOR(i, 0, A)
		{
			num[0][res[i]]++;
		}
		FOR(i, 0, B)
		{
			num[1][res[i]]++;
		}
		// cerr << num[0][0] << ' ' << num[0][1] << '\n' << num[1][0] << ' ' << num[1][1] << endl;
		go[0] = num[0][1] + num[1][1];
		go[1] = -num[0][0] - num[1][0];
		if (1ll * go[0] * num[0][0] + 1ll * go[1] * num[0][1] > 0)
		{
			go[0] = -go[0];
			go[1] = -go[1];
		}
		FOR(i, 0, N)
		{
			res[i] = go[res[i]];
		}
		if (N < A)
		{
			FOR(i, 0, N)
			{
				res[i] = 69;
			}
		}
		if (N < B)
		{
			FOR(i, 0, N)
			{
				res[i] = -69;
			}
		}
		cout << N << '\n';
		FOR(i, 0, N)
		{
			if (i) cout << ' ';
			cout << res[i];
		}
		cout << '\n';
		//ok we know A < B
		//any A is negative, and any B is positive
	}
	// 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
*/

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Ok
2 Correct 2 ms 384 KB Ok
3 Correct 3 ms 384 KB Ok
4 Correct 2 ms 384 KB Ok
5 Correct 2 ms 384 KB Ok
6 Correct 2 ms 384 KB Ok
7 Correct 2 ms 384 KB Ok
8 Correct 3 ms 384 KB Ok
9 Correct 2 ms 356 KB Ok
10 Correct 2 ms 384 KB Ok
11 Correct 2 ms 384 KB Ok
12 Correct 2 ms 384 KB Ok

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Ok
2 Correct 3 ms 384 KB Ok
3 Correct 2 ms 384 KB Ok
4 Correct 3 ms 512 KB Ok
5 Correct 3 ms 384 KB Ok
6 Correct 5 ms 512 KB Ok
7 Correct 9 ms 896 KB Ok
8 Correct 8 ms 640 KB Ok
9 Correct 11 ms 896 KB Ok
10 Correct 10 ms 768 KB Ok

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Ok
2 Correct 3 ms 384 KB Ok
3 Correct 3 ms 384 KB Ok
4 Correct 2 ms 384 KB Ok
5 Correct 3 ms 384 KB Ok
6 Correct 3 ms 380 KB Ok
7 Correct 3 ms 384 KB Ok
8 Runtime error 3 ms 640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Ok
2 Correct 2 ms 384 KB Ok
3 Correct 2 ms 384 KB Ok
4 Correct 3 ms 384 KB Ok
5 Correct 2 ms 384 KB Ok
6 Correct 59 ms 4428 KB Ok
7 Correct 57 ms 3960 KB Ok
8 Correct 109 ms 6104 KB Ok
9 Correct 96 ms 6236 KB Ok
10 Correct 61 ms 2808 KB Ok
11 Correct 87 ms 5468 KB Ok

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Ok
2 Correct 2 ms 384 KB Ok
3 Correct 3 ms 384 KB Ok
4 Correct 2 ms 384 KB Ok
5 Correct 2 ms 384 KB Ok
6 Correct 2 ms 384 KB Ok
7 Correct 2 ms 384 KB Ok
8 Correct 3 ms 384 KB Ok
9 Correct 2 ms 356 KB Ok
10 Correct 2 ms 384 KB Ok
11 Correct 2 ms 384 KB Ok
12 Correct 2 ms 384 KB Ok
13 Correct 2 ms 384 KB Ok
14 Correct 3 ms 384 KB Ok
15 Correct 3 ms 384 KB Ok
16 Correct 2 ms 384 KB Ok
17 Correct 3 ms 384 KB Ok
18 Correct 3 ms 380 KB Ok
19 Correct 3 ms 384 KB Ok
20 Runtime error 3 ms 640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
21 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Ok
2 Correct 2 ms 384 KB Ok
3 Correct 3 ms 384 KB Ok
4 Correct 2 ms 384 KB Ok
5 Correct 2 ms 384 KB Ok
6 Correct 2 ms 384 KB Ok
7 Correct 2 ms 384 KB Ok
8 Correct 3 ms 384 KB Ok
9 Correct 2 ms 356 KB Ok
10 Correct 2 ms 384 KB Ok
11 Correct 2 ms 384 KB Ok
12 Correct 2 ms 384 KB Ok
13 Correct 2 ms 384 KB Ok
14 Correct 3 ms 384 KB Ok
15 Correct 2 ms 384 KB Ok
16 Correct 3 ms 512 KB Ok
17 Correct 3 ms 384 KB Ok
18 Correct 5 ms 512 KB Ok
19 Correct 9 ms 896 KB Ok
20 Correct 8 ms 640 KB Ok
21 Correct 11 ms 896 KB Ok
22 Correct 10 ms 768 KB Ok
23 Correct 2 ms 384 KB Ok
24 Correct 3 ms 384 KB Ok
25 Correct 3 ms 384 KB Ok
26 Correct 2 ms 384 KB Ok
27 Correct 3 ms 384 KB Ok
28 Correct 3 ms 380 KB Ok
29 Correct 3 ms 384 KB Ok
30 Runtime error 3 ms 640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
31 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Ok
2 Correct 2 ms 384 KB Ok
3 Correct 3 ms 384 KB Ok
4 Correct 2 ms 384 KB Ok
5 Correct 2 ms 384 KB Ok
6 Correct 2 ms 384 KB Ok
7 Correct 2 ms 384 KB Ok
8 Correct 3 ms 384 KB Ok
9 Correct 2 ms 356 KB Ok
10 Correct 2 ms 384 KB Ok
11 Correct 2 ms 384 KB Ok
12 Correct 2 ms 384 KB Ok
13 Correct 2 ms 384 KB Ok
14 Correct 3 ms 384 KB Ok
15 Correct 2 ms 384 KB Ok
16 Correct 3 ms 512 KB Ok
17 Correct 3 ms 384 KB Ok
18 Correct 5 ms 512 KB Ok
19 Correct 9 ms 896 KB Ok
20 Correct 8 ms 640 KB Ok
21 Correct 11 ms 896 KB Ok
22 Correct 10 ms 768 KB Ok
23 Correct 2 ms 384 KB Ok
24 Correct 3 ms 384 KB Ok
25 Correct 3 ms 384 KB Ok
26 Correct 2 ms 384 KB Ok
27 Correct 3 ms 384 KB Ok
28 Correct 3 ms 380 KB Ok
29 Correct 3 ms 384 KB Ok
30 Runtime error 3 ms 640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
31 Halted 0 ms 0 KB -