Submission #879308

#	Time	Username	Problem	Language	Result	Execution time	Memory
879308		vjudge1	Nice sequence (IZhO18_sequence)	C++17	15 / 100	6 ms	1116 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10, MOD = 998244353;

void cant(int x){
    cout << x << '\n';
    for(int i = 1;i <= x;i++){
        cout << -1 << ' ';
    }
    cout << '\n';
}
void test(){
    int n,m;
    cin >> n >> m;
    if(max(n,m) % min(n,m) == 0){
        if(n > m){
            cout << n - 1 << '\n';
            for(int i = 1;i <= n - 1;i++){
                cout << 1 << ' ';
            }
        }else{
            cout << m - 1 << '\n';
            for(int i = 1;i <= m - 1;i++){
                cout << -1 << ' ';
            }
        }
        cout << '\n';
    }else{
        if(min(n,m) % 2== 0){
            int res[N];
            cout <<max(n,m) << '\n';
            for(int i = 1;i <= max(n,m);i++){
                if(i % 2){
                    res[i] = (2e5);
                }else{
                    res[i] = (2e5 + 1) * (-1);
                }
            }
            for(int i = 1;i <= max(n,m);i++){
                cout << res[i] * (n == min(n,m) ? 1 : -1) << ' ';
            }
            cout << '\n';
        }else{
            int res[N];
            cout <<max(n,m) << '\n';
            for(int i = 1;i <= max(n,m);i++){
                if(i % min(n,m) == 1){
                    res[i] = (2e5);
                }else{
                    res[i] = (2e5 + 1) * (-1);
                }
            }
            for(int i = 1;i <= max(n,m);i++){
                cout << res[i] * (n == min(n,m) ? 1 : -1) << ' ';
            }
            cout << '\n';
        }
    }
}
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
    cin >> T;
    for(int i = 1;i <= T;i++)
    {
        test();
    }
}

• Subtask 1: 6 / 6
• Subtask 2: 9 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 14
• Subtask 6: 0 / 18
• Subtask 7: 0 / 24