Submission #475639

#	Time	Username	Problem	Language	Result	Execution time	Memory
475639		NhatMinh0208	Nice sequence (IZhO18_sequence)	C++14	100 / 100	1506 ms	76872 KiB

sequence

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> gtu[400001],gtd[400001],vec;
int n,m,i,j,k,t,t1,u,v,a,b;
int deg[400001];
int fin[400001];
int main()
{
	fio;
    cin>>t;
    for (t1=0;t1<t;t1++) {
        cin>>n>>m;
        k=m+n-__gcd(m,n)-1;
        cout<<k<<"\n";
        if (k) {
            for (i=0;i<=k;i++) {
                gtu[i].clear();
                gtd[i].clear();
            }
            for (i=0;i+n<=k;i++) {
                gtd[i].push_back(i+n);
                gtu[i+n].push_back(i);
                // cout<<i+n<<' '<<i<<endl;
            }
            for (i=0;i+m<=k;i++) {
                gtu[i].push_back(i+m);
                gtd[i+m].push_back(i);
                // cout<<i<<' '<<i+m<<endl;
            }
            vec.clear();
            for (i=0;i<=k;i++) {
                deg[i]=gtd[i].size();
                if (!deg[i]) vec.push_back(i);
            }
            u=0;
            while(vec.size()) {
                v=vec.back();
                // cout<<v<<' ';
                vec.pop_back();
                fin[v]=u;
                u++;
                for (auto g  : gtu[v]) {
                    deg[g]--;
                    if (!deg[g]) vec.push_back(g);
                }            
            }
            // cout<<endl;        
            // for (i=0;i<=k;i++) {
                // cout<<fin[i]<<' ';
            // }
            // cout<<endl;        
            for (i=1;i<=k;i++) {
                cout<<fin[i]-fin[i-1]<<' ';
            }
            cout<<endl;        
        }
    }
}
// N;

Compilation message (stderr)

sequence.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

• 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