Submission #379009

#	Time	Username	Problem	Language	Result	Execution time	Memory
379009		casperwang	Nice sequence (IZhO18_sequence)	C++14	6 / 100	2 ms	492 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }

const int MAXN = 200000;
const int INF = 1e8;
const int K = 2e6;
int t;
int n, m;
bool flag;
int len;
int a[MAXN+1];

void solve(int n, int m) {
	if (m % n == 0) {
		len = m-1;
		for (int i = 1; i <= len; i++)
			a[i] = flag ? 1 : -1;
	} else {
		len = (m + n-1) / n * n - 1;
		for (int i = 1; i <= len; i++) {
			if (i % n == 1 && i != 1)
				a[i] = flag ? -INF : INF;
			else if (i == n-1)
				a[i] = flag ? -INF : INF;
			else if (i % n == 0)
				a[i] = flag ? INF+K : -INF-K;
			else
				a[i] = 1;
		}
	}
}

signed main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	/*
	for (int i = 1; i <= 10; i++)
		for (int j = i; j <= 10; j++)
			solve(i, j), debug(i, j, len);
	return 0;
	*/
	cin >> t;
	while (t--) {
		cin >> n >> m;
		if (n > m)
			swap(n, m), flag = true;
		else
			flag = false;
		solve(n, m);
		cout << len << '\n';
		for (int i = 1; i <= len; i++)
			cout << a[i] << " \n"[i==len];
	}
}

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