Submission #869548

#	Time	Username	Problem	Language	Result	Execution time	Memory
869548		alexdd	Nice sequence (IZhO18_sequence)	C++17	6 / 100	1 ms	600 KiB

sequence

#include<bits/stdc++.h>
using namespace std;
int rez[400005];
int krez;
/**
n = 4
m = 11
1 1 1 -4 1 1 1 -4 1 2
*/
void solve(int n, int m)
{
    if(n==m)
    {
        krez=n-1;
        for(int i=1;i<n;i++)
            rez[i]=1;
        return;
    }
    if(m%n==0)
    {
        krez=m-1;
        for(int i=1;i<m;i++)
            rez[i]=-1;
        return;
    }
    /*if(2*n>=m)
    {

        return;
    }*/
    krez=m;
    int ult=n;
    for(int i=n;i<=m;i+=n)
    {
        if(i+n<=m || m%n==n-1)
        {
            for(int j=i-n+1;j<i;j++)
                rez[j]=1;
            rez[i]=-n;
        }
        else
        {
            rez[i-2]=n-1;
            for(int j=i-n+1;j<i-2;j++)
            {
                rez[j]=1;
                rez[i-2]--;
            }
            rez[i-1]=-n;
            ult=i-1;
        }
    }
    for(int j=ult+1;j<=m;j++)
        rez[j]=1;
}
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        int n,m;
        cin>>n>>m;
        bool bl=0;
        if(n>m)
        {
            swap(n,m);
            bl=1;
        }
        solve(n,m);
        cout<<krez<<"\n";
        for(int i=1;i<=krez;i++)
        {
            if(!bl)
                cout<<rez[i]<<" ";
            else
                cout<<-rez[i]<<" ";
        }
        cout<<"\n";
    }
    return 0;
}
/**

pref[i] - pref[i-n] < 0
pref[i] - pref[i-m] > 0

pref[i-n] > pref[i]
pref[i-m] < pref[i]


n = 4
m = 10
1 1 1 -4 1 2 -4 1 1 1

m = 13
n = 7
1 1 1 1 1 1 -7 1 1 1 1 1 1

*/

• Subtask 1: 6 / 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