Submission #1089958

#TimeUsernameProblemLanguageResultExecution timeMemory
108995812345678Nice sequence (IZhO18_sequence)C++17
9 / 100
5 ms860 KiB
#include <bits/stdc++.h>

using namespace std;

const int nx=2e5+5;

int n, m, f, _t, res[nx];

void solve()
{
    cin>>n>>m;
    f=n<m;
    if (n>m) swap(n, m);
    if (m%2==0)
    {
        for (int i=1; i<m; i++) res[i]=1;
        if (f) for (int i=1; i<m;i ++) res[i]=-res[i];
        cout<<m-1<<'\n';
        for (int i=1; i<m; i++) cout<<res[i]<<' ';
        cout<<'\n';
    }
    else
    {
        for (int i=1; i<=m; i++) res[i]=(i%2)?-nx:nx+1;
        if (f) for (int i=1; i<=m;i ++) res[i]=-res[i];
        cout<<m<<'\n';
        for (int i=1; i<=m; i++) cout<<res[i]<<' ';
        cout<<'\n';
    }
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>_t;
    while (_t--) solve();
}
#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...