제출 #378920

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

sequence

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii; typedef pair<ll, ll> pll;
#define ff first
#define ss second
#define pb emplace_back
#define AI(x) begin(x),end(x)
template<typename I> bool chmax(I &a, I b){ return a < b ? (a = b, true) : false;}
template<typename I> bool chmin(I &a, I b){ return a > b ? (a = b, true) : false;}
#ifdef OWO
#define debug(args...) LKJ("[ " + string(#args) + " ]", args)
void LKJ(){ cerr<<endl;}
template<class I, class...T> void LKJ(I x, T... t){ cerr<<x<<", ", LKJ(t...);}
template<class I> void DE(I a, I b){ while(a < b) cerr<<*a<<" \n"[next(a) == b], ++a;}
#else
#define debug(...) 0
#define DE(...) 0
#endif


void solve(){
	int n, m; cin >> n >> m;
	int rev = 1;
	if(n < m) swap(n, m), rev = -1;

	cout << n - 1 << '\n';
	if(n - 1 == 0) return;

	for(int i = 0; i < n - 1; ++i)
		cout << 1 * rev << ' ';
	cout << '\n';
	return;
}

int32_t main(){
	ios_base::sync_with_stdio(0);
	int t;
	cin >> t;
	for(; t; --t) solve();
	return 0;
}

• 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