Submission #683861

#	Time	Username	Problem	Language	Result	Execution time	Memory
683861		opPO	Nice sequence (IZhO18_sequence)	C++17	6 / 100	1 ms	212 KiB

sequence

#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define f first
#define s second
#define pb push_back
#define ld long double
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vec vector

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
const ld eps = 1e-6;
const int mod = 998244353;
const int oo = 2e9;
const ll OO = 2e18;
const int N = 1e5 + 10;

void solve()
{
    int n, m;
    cin >> n >> m;
    int neg = 1;
    if (n > m)
    {
        swap(n, m);
        neg *= -1;
    }
    if (m % n == 0 || n == 2)
    {
        vec<int> ans;
        for (int i = 1; i < m; i++) ans.pb(-1);
        cout << sz(ans) << "\n";
        for (int &x : ans) cout << x * neg << " ";
        cout << "\n";
        return;
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--)
        solve();
    return 0;
}

• 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