제출 #199261

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
199261		alextodoran	Nice sequence (IZhO18_sequence)	C++14	15 / 100	12 ms	1144 KiB

sequence

#include <bits/stdc++.h>

using namespace std;

const int N_MAX = 400002;

const int INF = 1e9;

int t;

int n, m;

int ans[N_MAX];

int pref[N_MAX];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> t;
    while(t--)
    {
        cin >> n >> m;
        bool swaped = false;
        if(n > m)
        {
            swap(n, m);
            swaped = true;
        }
        if(n == 1 || m % n == 0)
        {
            cout << m - 1 << "\n";
            for(int i = 1; i <= m - 1; i++)
                if(swaped == true)
                    cout << "1 ";
                else
                    cout << "-1 ";
            cout << "\n";
            continue;
        }
        int val = (INF - 1) / (n - 1);
        for(int i = 1; i < n; i++)
        {
            ans[i] = val;
            if(i < INF - val * (n - 1))
                ans[i]++;
        }
        ans[n] = -INF;
        for(int i = 1; i <= n; i++)
            if(swaped == true)
                ans[i] *= -1;
        cout << (m / n + 1) * n - 1 << "\n";
        long long s = 0;
        for(int i = 1; i <= (m / n + 1) * n - 1; i++)
        {
            if(i > n)
                ans[i] = ans[i - n];
            s += ans[i];
            cout << ans[i] << " ";
        }
        cout << "\n";
    }
    return 0;
}

• 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