Submission #1218979

#	Time	Username	Problem	Language	Result	Execution time	Memory
1218979		M_SH_O	Nice sequence (IZhO18_sequence)	C++20	15 / 100	7 ms	968 KiB

sequence

#include <bits/stdc++.h>
//#include "grader.h"
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/

#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
//#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define all(a) a.begin(), a.end()
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 1000000000000000000
#define ordered_set tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

mt19937 rng(1488);
ll randll(ll l, ll r){
    return uniform_int_distribution<ll>(l, r)(rng);
}

/*vvll s1;
vll p;

ll find(ll v) {
    if (p[v] == v) return v;
    return p[v] = find(p[v]);
}

vll unite(ll a, ll b) {
    a = find(a);
    b = find(b);

    if (a == b) return {};
    if (s1[a].size() < s1[b].size()) {
        p[a] = b;
        for (auto i : s1[a]) {
            s1[b].pb(i);

        }
        return s1[a];
    }
    else {
        p[b] = a;
        for (auto i : s1[b]) {
            s1[a].pb(i);

        }
        return s1[b];
    }
}

vvll g;
vll d;
vector<multiset<ll>> tree1;

void push(ll v, ll tl, ll tr) {
    if (tl == tr) return;
    tree1[v*2] += d[v];
    tree1[v*2+1] += d[v];
    d[v*2] += d[v];
    d[v*2+1] += d[v];
    d[v] = 0;
    tree1[v] = tree1[v*2]+tree1[v*2+1];
}

void bt(ll v, ll tl, ll tr, vll& a, vll& b) {
    if (tl == tr) {
        tree1[v].insert(a[tl]);
        tree1[v].insert(b[tl]);
        return;
    }

    ll tm = (tl+tr)/2;
    bt(v*2, tl, tm, a, b);
    bt(v*2, tm+1, tr, a, b);

    for (int i : tree1[v*2]) {
        tree1[v].insert(i);
    }
    for (int i : tree1[v*2+1]) {
        tree1[v].insert(i);
    }
}

ll get(ll l, ll r, ll k, ll v, ll tl, ll tr) {
    if (l <= tl && tr <= r) {
        if (tree1[v].find(k) != tree1[v].end()) return 1;
        return 0;
    }
    if (tl > r || tr < l) return 0;

    ll tm = (tl+tr)/2;
    //push(v, tl, tr);
    return max(get(l, r, k, v*2, tl, tm), get(l, r, k, v*2+1, tm+1, tr));
}

void update(ll idx, ll val, ll newval, ll val_a, ll newval_a, ll v, ll tl, ll tr) {
    tree1[v].erase(tree1[v].find(val));
    tree1[v].insert(newval);
    tree1[v].erase(tree1[v].find(val_a));
    tree1[v].insert(newval_a);
    if (tl == tr) {
        //tree1[v] += val;

        //d[v] += val;
        //push(v, tl, tr);
        return;
    }

    ll tm = (tl+tr)/2;
    //push(v, tl, tr);

    if (idx <= tm)update(idx, val, newval, val_a, newval_a, v*2, tl, tm);
    else update(idx, val, newval, val_a, newval_a, v*2+1, tm+1, tr);
}*/

int main() {
    ll t;
    cin >> t;
    while (t --) {
        ll n, m;
        cin >> n >> m;
        bool q = 0;
        if (m < n) {
            q = 1;
            swap(n, m);
        }
        vll a;

        if (m % n == 0) {
            for (int i = 0; i < m-1; i ++) {
                a.pb(-1);
            }
        }
        else {
            vll b(n);
            for (int i = 0; i < n; i ++) {
                b[i] = 5000;
            }
            b[n-1] = -n*5000;
            b[0] += 4999;
            vll c;
            while (a.size() < m) {
                for (int i : b) {
                    a.pb(i);
                }
            }
            a.pop_back();
            /*
            ll s = 0;
            for (int i = 0; i < m; i ++) {
                s += c[i];
                a.pb(c[i]);
            }
            a.pop_back();
            ll l = m-1;
            while (s > 0) {
                a.pb(c[l++]);
                s += c[l];
                s -= c[l-m];
            }*/
        }
        if (q) {
            for (ll& i : a) {
                i *= -1;
            }
        }
        cout << a.size() << endl;
        for (int i : a) {
            cout << i << ' ';
        }
        cout << endl;
    }
}

• 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