Submission #789556

#	Time	Username	Problem	Language	Result	Execution time	Memory
789556		juggernaut	Nice sequence (IZhO18_sequence)	C++14	100 / 100	302 ms	41640 KiB

sequence

#include<bits/stdc++.h>
#define fr first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
#define USING_ORDERED_SET 0
#if USING_ORDERED_SET
#include<bits/extc++.h>
using namespace __gnu_pbds;
template<class T>using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#endif
template<class T>void umax(T &a,T b){if(a<b)a=b;}
template<class T>void umin(T &a,T b){if(b<a)a=b;}
#ifdef juggernaut
    #define printl(args...) printf(args)
#else
    #define printl(args...) 0
#endif
int n, m;
int timer, len;
bool used[800005];
int pref[400005];
void dfs(int v){
	used[v] = true;
	{
		int to = v - m;
		if(to >= 0 && !used[to])
			dfs(to);
	}
	{
		int to = v + n;
		if(to <= len && !used[to])
			dfs(to);
	}
	pref[v] = timer++;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int tests;
  	cin >> tests;
	while(tests--){
		cin >> n >> m;
		timer = 0;
		len = n + m - __gcd(n, m) - 1;
		fill(used, used + len + 1, false);
		for(int i = 0; i <= len; i++)
			if(!used[i])
				dfs(i);
		cout << len << '\n';
		fill(used, used + len + 1, false);
		if(len){
			for(int i = 1; i <= len; i++)
				cout << pref[i] - pref[i - 1] << ' ';
			cout << '\n';
		}
	}
}

• Subtask 1: 6 / 6
• Subtask 2: 9 / 9
• Subtask 3: 14 / 14
• Subtask 4: 15 / 15
• Subtask 5: 14 / 14
• Subtask 6: 18 / 18
• Subtask 7: 24 / 24