Submission #939489

#	Time	Username	Problem	Language	Result	Execution time	Memory
939489		AkibAzmain	Nice sequence (IZhO18_sequence)	C++17	6 / 100	1 ms	600 KiB

sequence

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using ll = long long;
using namespace __gnu_pbds;
template < class key, class compare = less < key > >
using iset = tree < key, null_type, compare, rb_tree_tag,
                    tree_order_statistics_node_update >;

void
solve (int tc, int ttc)
{
  int n, m;
  cin >> n >> m;
  cout << max (n, m) - 1 << '\n';
  for (int i = 0; i < max (n, m) - 1; ++i) cout << (n > m ? 1 : -1) << ' ';
  cout << '\n';
}

int
main ()
{
  ios::sync_with_stdio (false);
  cin.tie (nullptr);
  int ttc = 1;
  cin >> ttc;
  for (int tc = 1; tc <= ttc; ++tc) solve (tc, ttc);
}

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