제출 #379062

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
379062		8e7	Nice sequence (IZhO18_sequence)	C++14	6 / 100	1 ms	492 KiB

sequence

//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#define ll long long
#define maxn 500005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
int ans[maxn];
int main() {
	io
	int t;
	cin >> t;
	while(t--) {
		int n, m;
		cin >> n >> m;
		bool sw = false;
		if (n < m) swap(n, m), sw = true;
		int len = ((n - 1) / m + 1) * m - 1;
		if (n % m == 0) {
			for (int i = 0;i < len;i++) ans[i] = 1;
		} else {
			for (int i = 0;i < len;i++) ans[i] = (i % 2 ? -1 : 2);
			ans[len - 1] = 1000000;
		}
		if (sw) {
			for (int i = 0;i < len;i++) ans[i] = -ans[i];
		}
		cout << len << "\n";
		for (int i = 0;i < len;i++) {
			cout << ans[i] << " ";
		}
		cout << "\n";
	}
}
/*
3
3 1
2 3
1 1
 */

• 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