제출 #379041

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
379041		casperwang	Nice sequence (IZhO18_sequence)	C++14	15 / 100	11 ms	748 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;
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 if (n == 2) {
		len = m;
		for (int i = 1; i <= len; i++) {
			if (i % n == 1)
				a[i] = flag ? -m/2-1 : m/2+1;
			else
				a[i] = flag ? m/2+2 : -m/2-2;
		}
	} else if (abs(n - m) == 1) {
		len = m;
		int sum = 0;
		for (int i = 2; i <= len-1; i++) {
			a[i] = flag ? 2 : -2;
			sum -= a[i];
		}
		a[1] = a[len] = flag ? sum+1 : sum-1;
	} else if (abs(n - m) == 2) {
		len = m;
		for (int i = 1; i <= len; i++) {
			a[i] = flag ? 1 : -1;
		}
		a[(len+1)/2] = flag ? -len+2 : len-2;
	}
}

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: 9 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 14
• Subtask 6: 0 / 18
• Subtask 7: 0 / 24