제출 #199249

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

sequence

#include <bits/stdc++.h>

using namespace std;

const int INF = 1e9-1;

int t;

int n, m;

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(2 * n <= m || n == 1)
        {
            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 / (n - 1);
        int sum = val * (n - 1);
        cout << m << "\n";
        for(int i = 1; i <= m; i++)
        {
            int out = val;
            if(i == n)
                out = -1 - sum;
            if(swaped == true)
                out *= -1;
            cout << out << " ";
        }
        cout << "\n";
    }
    return 0;
}

• Subtask 1: 0 / 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