제출 #342737

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
342737		David_M	Nice sequence (IZhO18_sequence)	C++14	15 / 100	19 ms	24556 KiB

sequence

#include <bits/stdc++.h> 
#define ll long long
#define F first
#define S second
#define FF first.first
#define FS first.second
#define pb push_back
using namespace std;
const ll N=200006, INF=1e18;
     
ll pos, l, r, n, m, t, a[N], b[N], h[N], p[20][N], q, k, x, y;
vector <ll> v[N];
set <ll> s[N], S[N];

int main(){ios_base::sync_with_stdio(false), cin.tie(0);
	cin>>q;
	while(q--){
		cin>>n>>m;
	
		if (n>m){
			if(n%m==0){
				cout<<n-1<<'\n';
				for (int i=1; i<n; i++)cout<<"1 ";
				cout<<'\n';
				continue;
			}
			if(m==2){
				cout<<n<<"\n-999999999 ";
				for (int i=1; i<n; i+=2)cout<<"1000000000 -999999999 ";
				cout<<'\n';
				continue;
			}
			if(n==m+1){
				cout<<m*2-1<<'\n';
				for (int i=1; i<m; i++)cout<<"-2 ";
				cout<<2*m-1;
				for (int i=1; i<m; i++)cout<<" -2";
				cout<<'\n';
			}
			if(n==m+2){
				cout<<m*2<<'\n';
				for (int i=1; i<m-1; i++)cout<<"2 ";
				cout<<-m-1<<" 2 2 "<<-m-1;
				for (int i=1; i<m-1; i++)cout<<" 2";
				cout<<'\n';
			}
		}else{
			if(m%n==0){
				cout<<m-1<<'\n';
				for (int i=1; i<m; i++)cout<<"-1 ";
				cout<<'\n';
				continue;
			}
			if(n==2){
				cout<<m<<"\n999999999 ";
				for (int i=1; i<m; i+=2)cout<<"-1000000000 999999999 ";
				cout<<'\n';
				continue;
			}
			if(m==n+1){
				cout<<n*2-1<<'\n';
				for (int i=1; i<n; i++)cout<<"2 ";
				cout<<-2*n+1;
				for (int i=1; i<n; i++)cout<<" 2";
				cout<<'\n';
			}
			if(m==n+2){
				cout<<n*2<<'\n';
				for (int i=1; i<n-1; i++)cout<<"-2 ";
				cout<<n+1<<" -2 -2 "<<n+1;
				for (int i=1; i<n-1; i++)cout<<" -2";
				cout<<'\n';
			}
		}
	}
}

• 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