Submission #378884

#	Time	Username	Problem	Language	Result	Execution time	Memory
378884		YJU	Nice sequence (IZhO18_sequence)	C++14	6 / 100	1 ms	364 KiB

sequence

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector,Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll N=2e5+5;
const ll MOD=1e9+7;
const ll INF=(1LL<<60);
const ld pi=acos(-1);
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define lwb lower_bound
#define ALL(_a) _a.begin(),_a.end()
#define SZ(_a) (ll)_a.size()

ll n,m,t,rev;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>t;
	while(t--){
		cin>>n>>m;
		if(n>m)swap(n,m),rev=1;
		else rev=0;
		if(m%n==0){
			cout<<m-1<<"\n";
			REP(i,m-1)cout<<1*(rev?1:-1)<<" \n"[i==m-2];
		}else{
            cout<<m-1<<"\n";
            REP(i,m-1)cout<<((i&1)?2:-1)*(rev?1:-1)<<" ";
            //cout<<10000000*(rev?1:-1)<<"\n";
		}
	}
	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