Submission #851013

#	Time	Username	Problem	Language	Result	Execution time	Memory
851013		wakandaaa	Nice sequence (IZhO18_sequence)	C++17	100 / 100	295 ms	47672 KiB

sequence

#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int n, m;
int len;
int timer = 0;
int vis[N], a[N];

void dfs(int u) {
	if (u < 0 || u > len || vis[u])
		return;
	vis[u] = true;
	dfs(u - n);
	dfs(u + m);
	a[u] = timer++;
}

void solve() {
	cin >> n >> m;
	len = n + m - 1 - __gcd(m, n);
	timer = 0;
	memset(vis, 0, sizeof vis);

	for (int i = 0; i <= len; ++i)
		dfs(i);
	cout << len << '\n';
	for (int i = 0; i < len; ++i) {
		cout << a[i] - a[i + 1] << ' ';
	}
	cout << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    int q;
    cin >> q;
    while (q--) {
    	solve();
    }

    return 0;
}

/*

*/

• Subtask 1: 6 / 6
• Subtask 2: 9 / 9
• Subtask 3: 14 / 14
• Subtask 4: 15 / 15
• Subtask 5: 14 / 14
• Subtask 6: 18 / 18
• Subtask 7: 24 / 24