Submission #379213

#TimeUsernameProblemLanguageResultExecution timeMemory
3792138e7Nice sequence (IZhO18_sequence)C++14
15 / 100
9 ms876 KiB
//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 ? 2 * len : -(2 * len - 1));
		}
		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
 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...