Submission #879778

#	Time	Username	Problem	Language	Result	Execution time	Memory
879778		KiaRez	Nice sequence (IZhO18_sequence)	C++17	100 / 100	750 ms	34744 KiB

sequence

/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 1e6+23, lg = 18;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

int t, n, m, deg[N], ord[N];

bool check(int mid) {
	for(int i=1; i<=mid; i++) {
		if(i>=m) {
			//adj[i-m].pb(i); 
			deg[i]++;
		} 
		if(i>=n) {
			//adj[i].pb(i-n); 
			deg[i-n]++;
		}
	}

	queue<int> q;
	for(int i=0; i<=mid; i++) {
		if(deg[i] == 0) q.push(i);
	}
	int cnt = 0; 
	while(size(q) > 0) {
		int i = q.front();
		q.pop();
		ord[i] = cnt++;
		if(i-n>=0) {
			deg[i-n] --;
			if(deg[i-n] == 0) q.push(i-n);
		}
		if(i+m<=mid) {
			deg[i+m] --;
			if(deg[i+m] == 0) q.push(i+m);
		}
	}
	fill(deg, deg+mid+2, 0);

	if(cnt == mid+1) return 1;
	return 0;
}

void solve() {
	cin>>n>>m;
	int l=0, r=2*(n+m)+1;
	while(r-l > 1) {
		int mid = (l+r)/2;
		if(check(mid)) l = mid;
		else r = mid;
	}
	check(l);
	cout<<l<<endl;
	for(int i=1; i<=l; i++) {
		ord[i] -= ord[0];
		cout<<(i==1?ord[i]:ord[i]-ord[i-1])<<' ';
	}
	cout<<endl;
}

int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>t;
	while(t--) {
		solve();
	}

	return 0;
}

• 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