Submission #92360

#	Time	Username	Problem	Language	Result	Execution time	Memory
92360		Abelyan	Nice sequence (IZhO18_sequence)	C++17	0 / 100	2 ms	376 KiB

sequence

#include <bits/stdc++.h>
using namespace std;


#define FOR(i,a) for (int i=0;i<(a);++i)
#define FORR(i,a) for (int i=(a)-1;i>=0;i--)
#define FORT(i,a,b) for (int i=(a);i<=(b);++i)
#define FORTR(i,a,b) for (int i=(b);i>=(a);--i)
#define trav(i,v) for (auto i : v)
#define gcd __gcd
#define fr first
#define sc second
#define x real
#define y imag

typedef long long ll;
typedef long double ld;
const int N = 4e5+6;
const int K = 406;

int pref[N],timer=1;
int n,m,qan;

void dfs(int v){
	if (v-n>=0 && !pref[v-n])dfs(v-n);
	if (v+m<=qan && !pref[v+m])dfs(v+m);
	pref[v]=timer++;
}

int main(){
	ios_base::sync_with_stdio(false);
	int t;
	cin>>t;
	while(t--){
		cin>>m>>n;
		qan=n+m-1-gcd(n,m);
		cout<<qan<<endl;
		FORT(i,1,qan){
			if (!pref[i])dfs(i);
		}
		FORT(i,1,qan){
			cout<<pref[i]-pref[i-1]<<" ";
			pref[i-1]=0;
		}
		pref[qan]=0;
		timer=1;
		cout<<endl;
	}
	return 0;
}

• 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