oj.uz

답안 #97994

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
97994 2019-02-19T17:34:07 Z qkxwsm Nice sequence (IZhO18_sequence) C++14
100 / 100
 489 ms 30820 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[8][8], go[8];

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;
		if (N < A)
		{
			FOR(i, 0, N)
			{
				res[i] = 69;
			}
		}
		else if (N < B)
		{
			FOR(i, 0, N)
			{
				res[i] = -69;
			}
		}
		else
		{
			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]];
			}
		}
		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 3 ms 384 KB Ok
2 Correct 2 ms 384 KB Ok
3 Correct 3 ms 412 KB Ok
4 Correct 2 ms 384 KB Ok
5 Correct 2 ms 512 KB Ok
6 Correct 2 ms 384 KB Ok
7 Correct 2 ms 384 KB Ok
8 Correct 2 ms 384 KB Ok
9 Correct 2 ms 384 KB Ok
10 Correct 2 ms 384 KB Ok
11 Correct 3 ms 304 KB Ok
12 Correct 3 ms 384 KB Ok

Subtask #2
9.0 / 9.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 2 ms 384 KB Ok
5 Correct 2 ms 384 KB Ok
6 Correct 4 ms 384 KB Ok
7 Correct 6 ms 896 KB Ok
8 Correct 5 ms 640 KB Ok
9 Correct 11 ms 896 KB Ok
10 Correct 9 ms 640 KB Ok

Subtask #3
14.0 / 14.0

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

Subtask #4
15.0 / 15.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 71 ms 4472 KB Ok
7 Correct 54 ms 3960 KB Ok
8 Correct 118 ms 6136 KB Ok
9 Correct 93 ms 6264 KB Ok
10 Correct 48 ms 2808 KB Ok
11 Correct 79 ms 5476 KB Ok

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Ok
2 Correct 2 ms 384 KB Ok
3 Correct 3 ms 412 KB Ok
4 Correct 2 ms 384 KB Ok
5 Correct 2 ms 512 KB Ok
6 Correct 2 ms 384 KB Ok
7 Correct 2 ms 384 KB Ok
8 Correct 2 ms 384 KB Ok
9 Correct 2 ms 384 KB Ok
10 Correct 2 ms 384 KB Ok
11 Correct 3 ms 304 KB Ok
12 Correct 3 ms 384 KB Ok
13 Correct 2 ms 384 KB Ok
14 Correct 2 ms 384 KB Ok
15 Correct 3 ms 428 KB Ok
16 Correct 2 ms 384 KB Ok
17 Correct 3 ms 384 KB Ok
18 Correct 2 ms 384 KB Ok
19 Correct 3 ms 412 KB Ok
20 Correct 2 ms 384 KB Ok
21 Correct 3 ms 384 KB Ok
22 Correct 2 ms 384 KB Ok
23 Correct 2 ms 384 KB Ok
24 Correct 4 ms 512 KB Ok
25 Correct 4 ms 512 KB Ok
26 Correct 3 ms 384 KB Ok
27 Correct 3 ms 384 KB Ok
28 Correct 3 ms 640 KB Ok
29 Correct 4 ms 384 KB Ok
30 Correct 3 ms 384 KB Ok
31 Correct 4 ms 512 KB Ok
32 Correct 4 ms 384 KB Ok
33 Correct 5 ms 512 KB Ok
34 Correct 6 ms 512 KB Ok
35 Correct 5 ms 520 KB Ok
36 Correct 6 ms 512 KB Ok
37 Correct 9 ms 512 KB Ok
38 Correct 5 ms 512 KB Ok
39 Correct 6 ms 512 KB Ok
40 Correct 5 ms 512 KB Ok
41 Correct 4 ms 512 KB Ok
42 Correct 7 ms 640 KB Ok
43 Correct 6 ms 512 KB Ok

Subtask #6
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Ok
2 Correct 2 ms 384 KB Ok
3 Correct 3 ms 412 KB Ok
4 Correct 2 ms 384 KB Ok
5 Correct 2 ms 512 KB Ok
6 Correct 2 ms 384 KB Ok
7 Correct 2 ms 384 KB Ok
8 Correct 2 ms 384 KB Ok
9 Correct 2 ms 384 KB Ok
10 Correct 2 ms 384 KB Ok
11 Correct 3 ms 304 KB Ok
12 Correct 3 ms 384 KB Ok
13 Correct 2 ms 384 KB Ok
14 Correct 2 ms 384 KB Ok
15 Correct 2 ms 384 KB Ok
16 Correct 2 ms 384 KB Ok
17 Correct 2 ms 384 KB Ok
18 Correct 4 ms 384 KB Ok
19 Correct 6 ms 896 KB Ok
20 Correct 5 ms 640 KB Ok
21 Correct 11 ms 896 KB Ok
22 Correct 9 ms 640 KB Ok
23 Correct 2 ms 384 KB Ok
24 Correct 2 ms 384 KB Ok
25 Correct 3 ms 428 KB Ok
26 Correct 2 ms 384 KB Ok
27 Correct 3 ms 384 KB Ok
28 Correct 2 ms 384 KB Ok
29 Correct 3 ms 412 KB Ok
30 Correct 2 ms 384 KB Ok
31 Correct 3 ms 384 KB Ok
32 Correct 2 ms 384 KB Ok
33 Correct 2 ms 384 KB Ok
34 Correct 4 ms 512 KB Ok
35 Correct 4 ms 512 KB Ok
36 Correct 3 ms 384 KB Ok
37 Correct 3 ms 384 KB Ok
38 Correct 3 ms 640 KB Ok
39 Correct 4 ms 384 KB Ok
40 Correct 3 ms 384 KB Ok
41 Correct 4 ms 512 KB Ok
42 Correct 4 ms 384 KB Ok
43 Correct 5 ms 512 KB Ok
44 Correct 6 ms 512 KB Ok
45 Correct 5 ms 520 KB Ok
46 Correct 6 ms 512 KB Ok
47 Correct 9 ms 512 KB Ok
48 Correct 5 ms 512 KB Ok
49 Correct 6 ms 512 KB Ok
50 Correct 5 ms 512 KB Ok
51 Correct 4 ms 512 KB Ok
52 Correct 7 ms 640 KB Ok
53 Correct 6 ms 512 KB Ok
54 Correct 57 ms 3016 KB Ok
55 Correct 86 ms 3324 KB Ok
56 Correct 105 ms 3320 KB Ok
57 Correct 44 ms 2552 KB Ok
58 Correct 89 ms 2780 KB Ok
59 Correct 53 ms 2524 KB Ok
60 Correct 50 ms 2424 KB Ok
61 Correct 48 ms 2524 KB Ok
62 Correct 77 ms 3220 KB Ok
63 Correct 52 ms 2808 KB Ok
64 Correct 60 ms 3292 KB Ok
65 Correct 57 ms 2936 KB Ok
66 Correct 52 ms 2860 KB Ok
67 Correct 60 ms 2808 KB Ok
68 Correct 49 ms 2688 KB Ok
69 Correct 114 ms 7080 KB Ok
70 Correct 94 ms 7544 KB Ok
71 Correct 130 ms 7004 KB Ok
72 Correct 76 ms 7160 KB Ok
73 Correct 103 ms 7160 KB Ok
74 Correct 103 ms 7004 KB Ok
75 Correct 93 ms 6648 KB Ok
76 Correct 141 ms 7160 KB Ok
77 Correct 86 ms 6904 KB Ok
78 Correct 99 ms 7032 KB Ok
79 Correct 114 ms 7416 KB Ok
80 Correct 90 ms 7032 KB Ok
81 Correct 119 ms 7352 KB Ok
82 Correct 90 ms 7036 KB Ok
83 Correct 91 ms 6756 KB Ok

Subtask #7
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Ok
2 Correct 2 ms 384 KB Ok
3 Correct 3 ms 412 KB Ok
4 Correct 2 ms 384 KB Ok
5 Correct 2 ms 512 KB Ok
6 Correct 2 ms 384 KB Ok
7 Correct 2 ms 384 KB Ok
8 Correct 2 ms 384 KB Ok
9 Correct 2 ms 384 KB Ok
10 Correct 2 ms 384 KB Ok
11 Correct 3 ms 304 KB Ok
12 Correct 3 ms 384 KB Ok
13 Correct 2 ms 384 KB Ok
14 Correct 2 ms 384 KB Ok
15 Correct 2 ms 384 KB Ok
16 Correct 2 ms 384 KB Ok
17 Correct 2 ms 384 KB Ok
18 Correct 4 ms 384 KB Ok
19 Correct 6 ms 896 KB Ok
20 Correct 5 ms 640 KB Ok
21 Correct 11 ms 896 KB Ok
22 Correct 9 ms 640 KB Ok
23 Correct 2 ms 384 KB Ok
24 Correct 2 ms 384 KB Ok
25 Correct 3 ms 428 KB Ok
26 Correct 2 ms 384 KB Ok
27 Correct 3 ms 384 KB Ok
28 Correct 2 ms 384 KB Ok
29 Correct 3 ms 412 KB Ok
30 Correct 2 ms 384 KB Ok
31 Correct 3 ms 384 KB Ok
32 Correct 2 ms 384 KB Ok
33 Correct 2 ms 384 KB Ok
34 Correct 2 ms 384 KB Ok
35 Correct 2 ms 384 KB Ok
36 Correct 3 ms 384 KB Ok
37 Correct 2 ms 384 KB Ok
38 Correct 2 ms 384 KB Ok
39 Correct 71 ms 4472 KB Ok
40 Correct 54 ms 3960 KB Ok
41 Correct 118 ms 6136 KB Ok
42 Correct 93 ms 6264 KB Ok
43 Correct 48 ms 2808 KB Ok
44 Correct 79 ms 5476 KB Ok
45 Correct 4 ms 512 KB Ok
46 Correct 4 ms 512 KB Ok
47 Correct 3 ms 384 KB Ok
48 Correct 3 ms 384 KB Ok
49 Correct 3 ms 640 KB Ok
50 Correct 4 ms 384 KB Ok
51 Correct 3 ms 384 KB Ok
52 Correct 4 ms 512 KB Ok
53 Correct 4 ms 384 KB Ok
54 Correct 5 ms 512 KB Ok
55 Correct 6 ms 512 KB Ok
56 Correct 5 ms 520 KB Ok
57 Correct 6 ms 512 KB Ok
58 Correct 9 ms 512 KB Ok
59 Correct 5 ms 512 KB Ok
60 Correct 6 ms 512 KB Ok
61 Correct 5 ms 512 KB Ok
62 Correct 4 ms 512 KB Ok
63 Correct 7 ms 640 KB Ok
64 Correct 6 ms 512 KB Ok
65 Correct 57 ms 3016 KB Ok
66 Correct 86 ms 3324 KB Ok
67 Correct 105 ms 3320 KB Ok
68 Correct 44 ms 2552 KB Ok
69 Correct 89 ms 2780 KB Ok
70 Correct 53 ms 2524 KB Ok
71 Correct 50 ms 2424 KB Ok
72 Correct 48 ms 2524 KB Ok
73 Correct 77 ms 3220 KB Ok
74 Correct 52 ms 2808 KB Ok
75 Correct 60 ms 3292 KB Ok
76 Correct 57 ms 2936 KB Ok
77 Correct 52 ms 2860 KB Ok
78 Correct 60 ms 2808 KB Ok
79 Correct 49 ms 2688 KB Ok
80 Correct 114 ms 7080 KB Ok
81 Correct 94 ms 7544 KB Ok
82 Correct 130 ms 7004 KB Ok
83 Correct 76 ms 7160 KB Ok
84 Correct 103 ms 7160 KB Ok
85 Correct 103 ms 7004 KB Ok
86 Correct 93 ms 6648 KB Ok
87 Correct 141 ms 7160 KB Ok
88 Correct 86 ms 6904 KB Ok
89 Correct 99 ms 7032 KB Ok
90 Correct 114 ms 7416 KB Ok
91 Correct 90 ms 7032 KB Ok
92 Correct 119 ms 7352 KB Ok
93 Correct 90 ms 7036 KB Ok
94 Correct 91 ms 6756 KB Ok
95 Correct 123 ms 7476 KB Ok
96 Correct 201 ms 9832 KB Ok
97 Correct 223 ms 9040 KB Ok
98 Correct 198 ms 7644 KB Ok
99 Correct 175 ms 9352 KB Ok
100 Correct 175 ms 8184 KB Ok
101 Correct 206 ms 8232 KB Ok
102 Correct 164 ms 8952 KB Ok
103 Correct 168 ms 8312 KB Ok
104 Correct 184 ms 9724 KB Ok
105 Correct 188 ms 9976 KB Ok
106 Correct 179 ms 9772 KB Ok
107 Correct 225 ms 9176 KB Ok
108 Correct 296 ms 10872 KB Ok
109 Correct 186 ms 10488 KB Ok
110 Correct 345 ms 29004 KB Ok
111 Correct 361 ms 30564 KB Ok
112 Correct 406 ms 30200 KB Ok
113 Correct 380 ms 29704 KB Ok
114 Correct 403 ms 30672 KB Ok
115 Correct 391 ms 29576 KB Ok
116 Correct 383 ms 30820 KB Ok
117 Correct 449 ms 29984 KB Ok
118 Correct 411 ms 30136 KB Ok
119 Correct 409 ms 29360 KB Ok
120 Correct 459 ms 29776 KB Ok
121 Correct 370 ms 27512 KB Ok
122 Correct 438 ms 30076 KB Ok
123 Correct 345 ms 30584 KB Ok
124 Correct 370 ms 29408 KB Ok
125 Correct 489 ms 13272 KB Ok