Submission #1109252

#	Time	Username	Problem	Language	Result	Execution time	Memory
1109252		Muhammet	Nice sequence (IZhO18_sequence)	C++17	0 / 100	2056 ms	508 KiB

sequence

#include <bits/stdc++.h>

using namespace std;

#define ll long long

int n1, n, m;

bool tr;

vector <ll> a, p;

void f(int x){
	if(tr == 1) return;
	if(x == n1+1){
		for(int i = 1; i <= n1; i++){
			p[i] = p[i-1] + a[i];
		}
		bool tr1 = 0;
		for(int i = 1; i <= n1; i++){
			if(i >= m){
				if(p[i] <= p[i-m]){
					tr1 = 1;
					break;
				}
			}
			if(i >= n){
				if(p[i] >= p[i-n]){
					tr1 = 1;
					break;
				}
			}
		}
		if(tr1 == 0){
			tr = 1;
			cout << n1 << '\n';
			for(int i = 1;  i <= n1; i++){
				cout << a[i] << ' ';
			}
			cout << '\n';
		}
		return;
	}
	a[x] = (n < m ? (n + m) : -(n + m + 1));
	f(x+1);
	a[x] = (n < m ? -(n + m + 1) : (n + m + 1));
	f(x+1);
}

int main(){
	int t;
	cin >> t;
	while(t--){
		cin >> n >> m;
		a.resize((n+m)*2+1);
		p.assign((n+m)*2+1,0);
		for(int i = (n+m)+2; i >= 1; i--){
			tr = 0;
			n1 = i;
			f(1);
			if(tr) break;
		}
		if(tr == 0){
			cout << 0 << "\n";
		}
		// cout << '\n';
	}
}

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