oj.uz

Submission #879302

# Submission time Handle Problem Language Result Execution time Memory
879302 2023-11-27T06:05:40 Z vjudge1 Nice sequence (IZhO18_sequence) C++17
6 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10, MOD = 998244353;

void cant(int x){
    cout << x << '\n';
    for(int i = 1;i <= x;i++){
        cout << 1 << ' ';
    }
    cout << '\n';
    return;
}
void test(){
    int n,m;
    cin >> n >> m;
    if(max(n,m) % min(n,m) == 0){
        if(n > m){
            cout << n - 1 << '\n';
            for(int i = 1;i <= n - 1;i++){
                cout << 1 << ' ';
            }
        }else{
            cout << m - 1 << '\n';
            for(int i = 1;i <= m - 1;i++){
                cout << -1 << ' ';
            }
        }
        cout << '\n';
    }else{
        if(n % 2 == 0 && m % 2== 0){
            int res[N];
            cout <<max(n,m) << '\n';
            for(int i = 1;i <= max(n,m);i++){
                if(i % 2){
                    res[i] = (2e5);
                }else{
                    res[i] = (2e5 + 1) * (-1);
                }
            }
            for(int i = 1;i <= max(n,m);i++){
                cout << res[i] * (n == min(n,m) ? 1 : -1) << ' ';
            }
            cout << '\n';
        }else{
            cant(min(n,m) - 1);
        }
    }
}
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
    cin >> T;
    for(int i = 1;i <= T;i++)
    {
        test();
    }
}

Subtask #1
6.0 / 6.0

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

Subtask #2
0 / 9.0

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

Subtask #3
0 / 14.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 14.0

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

Subtask #6
0 / 18.0

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

Subtask #7
0 / 24.0

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