Submission #495741

#	Time	Username	Problem	Language	Result	Execution time	Memory
495741		armashka	Nice sequence (IZhO18_sequence)	C++17	9 / 100	7 ms	828 KiB

sequence

#include <bits/stdc++.h>
 
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 3e5 + 5;
const ll M = 1e8;
const ll inf = 1e3;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }            

ll n, m;

const void solve(/*Armashka*/) {
    cin >> n >> m;
    if (n % 2 == m % 2) {
        ll len = max(n, m) - 1;
        cout << len << "\n";
        for (int i = 1; i <= len; ++ i) {
            if (min(n, m) == n) cout << -i << " ";
            else cout << i << " ";
        }
        cout << "\n";
    } else {
        cout << max(n, m) << "\n";
        if (n % 2) {
            ll a = (n + 2) / 2, b = (n + 2 - a);
            for (int i = 1; i < max(n, m); i += 2) {
                cout << -a << " " << b << " ";
            }
            cout << -a << "\n";
        } else {
            ll a = (m + 2) / 2, b = (m + 2 - a);
            for (int i = 1; i < max(n, m); i += 2) {
                cout << a << " " << -b << " ";
            }
            cout << a << "\n";
        }
    }
}
 
signed main() {
    fast;
	//freopen("divide.in", "r", stdin);
	//freopen("divide.out", "w", stdout);
    int tt = 1;
    cin >> tt;
    while (tt --) {
    	solve();
	}
}

/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/

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