oj.uz

Submission #869564

# Submission time Handle Problem Language Result Execution time Memory
869564 2023-11-04T18:13:22 Z alexdd Nice sequence (IZhO18_sequence) C++17
6 / 100
 1 ms 348 KB 
#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 || n==2)
    {
        krez=m-1;
        for(int i=1;i<m;i++)
            rez[i]=-1;
        return;
    }
    while(m%n!=n-1)
        m++;
    krez=m;
    int ult=n;
    for(int i=n;i<=m;i+=n)
    {
        for(int j=i-n+1;j<i;j++)
            rez[j]=1;
        rez[i]=-n;
        ult=i;
    }
    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 = 11
1 1 1 -4 1 1 1 -4 1 1 1

m - 2 * m/n > 0

n = 2
m = 11
1 -2 1 -2

*/

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Ok
2 Correct 0 ms 348 KB Ok
3 Correct 0 ms 348 KB Ok
4 Correct 0 ms 348 KB Ok
5 Correct 0 ms 348 KB Ok
6 Correct 0 ms 348 KB Ok
7 Correct 1 ms 348 KB Ok
8 Correct 1 ms 348 KB Ok
9 Correct 0 ms 348 KB Ok
10 Correct 0 ms 348 KB Ok
11 Correct 1 ms 348 KB Ok
12 Correct 1 ms 348 KB Ok

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Jury has the better answer : jans = 3, pans = 2
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Jury has the better answer : jans = 3, pans = 2
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Jury has the better answer : jans = 3, pans = 2
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Ok
2 Correct 0 ms 348 KB Ok
3 Correct 0 ms 348 KB Ok
4 Correct 0 ms 348 KB Ok
5 Correct 0 ms 348 KB Ok
6 Correct 0 ms 348 KB Ok
7 Correct 1 ms 348 KB Ok
8 Correct 1 ms 348 KB Ok
9 Correct 0 ms 348 KB Ok
10 Correct 0 ms 348 KB Ok
11 Correct 1 ms 348 KB Ok
12 Correct 1 ms 348 KB Ok
13 Incorrect 1 ms 348 KB Jury has the better answer : jans = 3, pans = 2
14 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Ok
2 Correct 0 ms 348 KB Ok
3 Correct 0 ms 348 KB Ok
4 Correct 0 ms 348 KB Ok
5 Correct 0 ms 348 KB Ok
6 Correct 0 ms 348 KB Ok
7 Correct 1 ms 348 KB Ok
8 Correct 1 ms 348 KB Ok
9 Correct 0 ms 348 KB Ok
10 Correct 0 ms 348 KB Ok
11 Correct 1 ms 348 KB Ok
12 Correct 1 ms 348 KB Ok
13 Incorrect 1 ms 348 KB Jury has the better answer : jans = 3, pans = 2
14 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Ok
2 Correct 0 ms 348 KB Ok
3 Correct 0 ms 348 KB Ok
4 Correct 0 ms 348 KB Ok
5 Correct 0 ms 348 KB Ok
6 Correct 0 ms 348 KB Ok
7 Correct 1 ms 348 KB Ok
8 Correct 1 ms 348 KB Ok
9 Correct 0 ms 348 KB Ok
10 Correct 0 ms 348 KB Ok
11 Correct 1 ms 348 KB Ok
12 Correct 1 ms 348 KB Ok
13 Incorrect 1 ms 348 KB Jury has the better answer : jans = 3, pans = 2
14 Halted 0 ms 0 KB -