#include<bits/stdc++.h>
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
//01001101 01100001 01101011 01101000 01100001 01100111 01100001 01111001
using namespace std;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()
#define ld double
#define ull unsigned long long
#define ff first
#define ss second
#define fix fixed << setprecision
#define pii pair<int, int>
#define E exit (0)
const int inf = 1e8, N = 1e6 + 1, mod = 998244353;
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
main() {
//freopen("cowrect.in", "r", stdin);
//freopen("cowrect.out", "w", stdout);
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
int n, m;
cin >> n >> m;
if (max(n, m) % min(n, m) == 0) {
cout << max(n, m) - 1 << nl;
if (n > m) {
for (int i = 1; i < n; i++) cout << 1 << ' ';
}else for (int i = 1; i < m; i++) cout << -1 << ' ';
cout << nl;
continue;
}
if (n < m) {
int len = (m + n - 1) / n * n;
if (n % 2 == 0) {
cout << len - n / 2 << nl;
for (int i = 1; i <= len - n / 2; i++) {
if (i % n == 0) {
cout << -inf - 1 << ' ';
}else {
if ((i % n) <= n / 2) {
cout << inf << ' ';
}else cout << -inf << ' ';
}
}
cout << nl;
}else {
cout << len - n / 2 - 1 << nl;
for (int i = 1; i < len - n / 2; i++) {
if (i % n == 0) {
cout << -1 << ' ';
}else {
if ((i % n) <= n / 2) cout << inf << ' ';
else cout << -inf << ' ';
}
}
cout << nl;
}
}else {
int len = (n + m - 1) / m * m;
if (m % 2 == 0) {
cout << len - m / 2 << nl;
for (int i = 1; i <= len - m / 2; i++) {
if (i % m == 0) {
cout << inf + 1 << ' ';
}else {
if ((i % m) <= m / 2) {
cout << -inf << ' ';
}else cout << inf << ' ';
}
}
cout << nl;
}else {
cout << len - m / 2 + 1 << nl;
for (int i = 1; i < len - m / 2; i++) {
if (i % m == 0) {
cout << 1 << ' ';
}else {
if ((i % m) <= m / 2) cout << -inf << ' ';
else cout << inf << ' ';
}
}
cout << nl;
}
}
}
}
Compilation message
sequence.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
3 | #pragma optimize ("g",on)
|
sequence.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
9 | #pragma comment(linker, "/stack:200000000")
|
sequence.cpp:34:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
34 | main() {
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Ok |
| 2 |
Correct |
0 ms |
216 KB |
Ok |
| 3 |
Correct |
0 ms |
204 KB |
Ok |
| 4 |
Correct |
1 ms |
280 KB |
Ok |
| 5 |
Correct |
0 ms |
204 KB |
Ok |
| 6 |
Correct |
1 ms |
204 KB |
Ok |
| 7 |
Correct |
0 ms |
204 KB |
Ok |
| 8 |
Correct |
0 ms |
204 KB |
Ok |
| 9 |
Correct |
0 ms |
204 KB |
Ok |
| 10 |
Correct |
0 ms |
204 KB |
Ok |
| 11 |
Correct |
0 ms |
204 KB |
Ok |
| 12 |
Correct |
0 ms |
204 KB |
Ok |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Ok |
| 2 |
Correct |
0 ms |
204 KB |
Ok |
| 3 |
Correct |
0 ms |
204 KB |
Ok |
| 4 |
Correct |
0 ms |
204 KB |
Ok |
| 5 |
Correct |
0 ms |
204 KB |
Ok |
| 6 |
Correct |
2 ms |
332 KB |
Ok |
| 7 |
Correct |
8 ms |
844 KB |
Ok |
| 8 |
Correct |
4 ms |
460 KB |
Ok |
| 9 |
Correct |
8 ms |
844 KB |
Ok |
| 10 |
Correct |
5 ms |
588 KB |
Ok |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Ok |
| 2 |
Correct |
0 ms |
204 KB |
Ok |
| 3 |
Correct |
1 ms |
204 KB |
Ok |
| 4 |
Incorrect |
0 ms |
204 KB |
Jury has the better answer : jans = 9, pans = 7 |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
204 KB |
there is incorrect sequence |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Ok |
| 2 |
Correct |
0 ms |
216 KB |
Ok |
| 3 |
Correct |
0 ms |
204 KB |
Ok |
| 4 |
Correct |
1 ms |
280 KB |
Ok |
| 5 |
Correct |
0 ms |
204 KB |
Ok |
| 6 |
Correct |
1 ms |
204 KB |
Ok |
| 7 |
Correct |
0 ms |
204 KB |
Ok |
| 8 |
Correct |
0 ms |
204 KB |
Ok |
| 9 |
Correct |
0 ms |
204 KB |
Ok |
| 10 |
Correct |
0 ms |
204 KB |
Ok |
| 11 |
Correct |
0 ms |
204 KB |
Ok |
| 12 |
Correct |
0 ms |
204 KB |
Ok |
| 13 |
Correct |
0 ms |
204 KB |
Ok |
| 14 |
Correct |
0 ms |
204 KB |
Ok |
| 15 |
Correct |
1 ms |
204 KB |
Ok |
| 16 |
Incorrect |
0 ms |
204 KB |
Jury has the better answer : jans = 9, pans = 7 |
| 17 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Ok |
| 2 |
Correct |
0 ms |
216 KB |
Ok |
| 3 |
Correct |
0 ms |
204 KB |
Ok |
| 4 |
Correct |
1 ms |
280 KB |
Ok |
| 5 |
Correct |
0 ms |
204 KB |
Ok |
| 6 |
Correct |
1 ms |
204 KB |
Ok |
| 7 |
Correct |
0 ms |
204 KB |
Ok |
| 8 |
Correct |
0 ms |
204 KB |
Ok |
| 9 |
Correct |
0 ms |
204 KB |
Ok |
| 10 |
Correct |
0 ms |
204 KB |
Ok |
| 11 |
Correct |
0 ms |
204 KB |
Ok |
| 12 |
Correct |
0 ms |
204 KB |
Ok |
| 13 |
Correct |
0 ms |
204 KB |
Ok |
| 14 |
Correct |
0 ms |
204 KB |
Ok |
| 15 |
Correct |
0 ms |
204 KB |
Ok |
| 16 |
Correct |
0 ms |
204 KB |
Ok |
| 17 |
Correct |
0 ms |
204 KB |
Ok |
| 18 |
Correct |
2 ms |
332 KB |
Ok |
| 19 |
Correct |
8 ms |
844 KB |
Ok |
| 20 |
Correct |
4 ms |
460 KB |
Ok |
| 21 |
Correct |
8 ms |
844 KB |
Ok |
| 22 |
Correct |
5 ms |
588 KB |
Ok |
| 23 |
Correct |
0 ms |
204 KB |
Ok |
| 24 |
Correct |
0 ms |
204 KB |
Ok |
| 25 |
Correct |
1 ms |
204 KB |
Ok |
| 26 |
Incorrect |
0 ms |
204 KB |
Jury has the better answer : jans = 9, pans = 7 |
| 27 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Ok |
| 2 |
Correct |
0 ms |
216 KB |
Ok |
| 3 |
Correct |
0 ms |
204 KB |
Ok |
| 4 |
Correct |
1 ms |
280 KB |
Ok |
| 5 |
Correct |
0 ms |
204 KB |
Ok |
| 6 |
Correct |
1 ms |
204 KB |
Ok |
| 7 |
Correct |
0 ms |
204 KB |
Ok |
| 8 |
Correct |
0 ms |
204 KB |
Ok |
| 9 |
Correct |
0 ms |
204 KB |
Ok |
| 10 |
Correct |
0 ms |
204 KB |
Ok |
| 11 |
Correct |
0 ms |
204 KB |
Ok |
| 12 |
Correct |
0 ms |
204 KB |
Ok |
| 13 |
Correct |
0 ms |
204 KB |
Ok |
| 14 |
Correct |
0 ms |
204 KB |
Ok |
| 15 |
Correct |
0 ms |
204 KB |
Ok |
| 16 |
Correct |
0 ms |
204 KB |
Ok |
| 17 |
Correct |
0 ms |
204 KB |
Ok |
| 18 |
Correct |
2 ms |
332 KB |
Ok |
| 19 |
Correct |
8 ms |
844 KB |
Ok |
| 20 |
Correct |
4 ms |
460 KB |
Ok |
| 21 |
Correct |
8 ms |
844 KB |
Ok |
| 22 |
Correct |
5 ms |
588 KB |
Ok |
| 23 |
Correct |
0 ms |
204 KB |
Ok |
| 24 |
Correct |
0 ms |
204 KB |
Ok |
| 25 |
Correct |
1 ms |
204 KB |
Ok |
| 26 |
Incorrect |
0 ms |
204 KB |
Jury has the better answer : jans = 9, pans = 7 |
| 27 |
Halted |
0 ms |
0 KB |
- |
