Submission #1172406

#	Time	Username	Problem	Language	Result	Execution time	Memory
1172406		Vovamatrix	Nice sequence (IZhO18_sequence)	C++20	100 / 100	1140 ms	62496 KiB

sequence

//https://oj.uz/problem/view/IZhO18_sequence
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define PI acos(-1)
#define LSB(i) ((i) & -(i))
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define sc second
#define th third
#define fo fourth
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
#define INF 1e15
#define MOD 1000000007
#define endl "\n"

#define all(data)       data.begin(),data.end()
#define TYPEMAX(type)   std::numeric_limits<type>::max()
#define TYPEMIN(type)   std::numeric_limits<type>::min()
#define MAXN 400007
ll degin[MAXN],psum[MAXN],a[MAXN];
vector<ll> adj[MAXN],tp;
void TopSort(ll k)
{
    queue<ll> q;
    for(int i=0;i<=k;i++)
    {
        if(degin[i]==0) q.push(i);
    }
    while(!q.empty())
    {
        ll u=q.front(); q.pop(); tp.pb(u);
        for(auto v:adj[u])
        {
            degin[v]--;
            if(degin[v]==0) q.push(v);
        }
    }
}
int main()
{
    ios::sync_with_stdio(false); cin.tie(0);
    ll tt; cin>>tt;
    while(tt--)
    {
        ll n,m; cin>>n>>m; tp.clear();
        ll k=n+m-__gcd(n,m)-1;
        for(int i=0;i<=k;i++) {adj[i].clear(); degin[i]=0;}
        for(int i=1;i<=k;i++)
        {
            if(i+m-1<=k) {adj[i-1].pb(i+m-1); degin[i+m-1]++;}
            if(i+n-1<=k) {adj[i+n-1].pb(i-1); degin[i-1]++;}
        }
        TopSort(k);
        ll idx;
        for(int i=0;i<=k;i++)
        {
            if(tp[i]==0) {idx=i; break;}
        }
        psum[0]=0;
        for(int i=idx-1;i>=0;i--) psum[tp[i]]=psum[tp[i+1]]-1;
        for(int i=idx+1;i<=k;i++) psum[tp[i]]=psum[tp[i-1]]+1;
        for(int i=1;i<=k;i++) a[i]=psum[i]-psum[i-1];
        cout<<k<<endl;
        for(int i=1;i<=k;i++) cout<<a[i]<<" ";
        cout<<endl;
    }
    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