oj.uz

Submission #1089958

# Submission time Handle Problem Language Result Execution time Memory
1089958 2024-09-17T12:34:53 Z 12345678 Nice sequence (IZhO18_sequence) C++17
9 / 100
 5 ms 860 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=2e5+5;

int n, m, f, _t, res[nx];

void solve()
{
    cin>>n>>m;
    f=n<m;
    if (n>m) swap(n, m);
    if (m%2==0)
    {
        for (int i=1; i<m; i++) res[i]=1;
        if (f) for (int i=1; i<m;i ++) res[i]=-res[i];
        cout<<m-1<<'\n';
        for (int i=1; i<m; i++) cout<<res[i]<<' ';
        cout<<'\n';
    }
    else
    {
        for (int i=1; i<=m; i++) res[i]=(i%2)?-nx:nx+1;
        if (f) for (int i=1; i<=m;i ++) res[i]=-res[i];
        cout<<m<<'\n';
        for (int i=1; i<=m; i++) cout<<res[i]<<' ';
        cout<<'\n';
    }
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>_t;
    while (_t--) solve();
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 1 ms 348 KB Ok
7 Correct 4 ms 860 KB Ok
8 Correct 2 ms 604 KB Ok
9 Correct 5 ms 860 KB Ok
10 Correct 3 ms 720 KB Ok

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

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

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB there is incorrect sequence
2 Halted 0 ms 0 KB -