제출 #495957

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
495957		ergagan	Nice sequence (IZhO18_sequence)	C++17	0 / 100	1 ms	204 KiB

sequence

//я так много думал, что опять попал
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define f first
#define s second
#define left(v) v + v
#define right(v) v + v + 1
#define ub upper_bound
#define lb lower_bound

using namespace std;
typedef long long ll;

//17 SEVENTEEN
const long double Pi = acos(-1.0);
const ll dx[] = {0,0,1,-1};
const ll dy[] = {1,-1,0,0};
const ll N = (ll) 1e6 + 17;
const ll M = (ll) 5e3 + 69;
const ll inf = (ll) 1e14 + 3;
const ll mod = (ll) 1e9 + 7;
ll sq(ll x) { return x * x; }

ll zxc = 1, a[N];

void solve() {
    ll n, m;
    cin >> n >> m;

    if(n == 1) {
        cout << m - 1 << "\n";
        for(ll i = 1; i < m; i++) cout << -i << " ";
        cout << "\n";
    }

    else if(m == 1) {
        cout << n - 1 << "\n";
        for(ll i = 1; i < n; i++) cout << i << " ";
        cout << "\n";
    }

    else if(n < m) {
        if(n % 2) {
            if(!(m % 2)) m++;
            cout << m << "\n";
            for(ll i = 1; i <= m / 2 - 1; i++) {
                cout << -m << " " << m + 1 << " ";
            }
            cout << (m + 1) << "\n";
        }
        else {
            if(!(m % 2)) m++;
            cout << m << "\n";
            for(ll i = 1; i <= m / 2; i++) {
                cout << m << " " << -(m + 1) << " ";
            }
            cout << m << "\n";
        }
    }
    else {
        if(m % 2) {
            if(!(n % 2)) n++;
            cout << n << "\n";
            for(ll i = 1; i <= n / 2 - 1; i++) {
                cout << n << " " << -(n + 1) << " ";
            }
            cout << -(n + 1) << "\n";
        }
        else {
            if(!(n % 2)) n++;
            cout << n << "\n";
            for(ll i = 1; i <= n / 2; i++) {
                cout << -n << " " << n + 1 << " ";
            }
            cout << -n << "\n";
        }
    }
}

int main(/*Уверенно*/) {
ios_base::sync_with_stdio(0);
    cin.tie(0);
/*
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
*/
    cin >> zxc;
    while(zxc--) {
        solve();
    }
  	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