oj.uz

Submission #175645

# Submission time Handle Problem Language Result Execution time Memory
175645 2020-01-07T09:15:41 Z VEGAnn Nice sequence (IZhO18_sequence) C++14
15 / 100
 10 ms 1272 KB 
#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define PB push_back
using namespace std;
const int N = 200100;
const int PW = 20;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    int qq; cin >> qq;
    for (; qq; qq--){
        int n, m;
        cin >> n >> m;
//        assert((max(n, m) % min(n, m)) == 0);
        if (n == m){
            cout << n - 1 << '\n';
            for (int i = 1; i < n; i++)
                cout << "1 ";
            cout << '\n';
            continue;
        }
        if (max(n, m) % min(n, m) == 0){
            if (n > m){
                cout << n - 1 << '\n';
                for (int i = 0; i < n - 1; i++)
                    if (i % m == 0)
                        cout << +int(1e8) << " " ;
                    else cout << "-1 ";
                cout << '\n';
            } else {
                cout << m - 1 << '\n';
                for (int i = 0; i < m - 1; i++)
                    if (i % n == 0)
                        cout << -int(1e8) << " " ;
                    else cout << "1 ";
                cout << '\n';
            }
            continue;
        }

        if (min(n, m) * 2 - 1 <= max(n, m)) {
            if (n > m){
                cout << n << '\n';
                for (int i = 0; i < n; i++)
                    if (i & 1)
                        cout << int(1e9) << " ";
                    else cout << -int(1e9) + 1 << " ";
                cout << '\n';
            } else {
                cout << m << '\n';
                for (int i = 0; i < m; i++)
                    if (i & 1)
                        cout << -int(1e9) << " ";
                    else cout << +int(1e9) - 1 << " ";
                cout << '\n';
            }
            continue;
        }

        if (n > m){
            cout << m + m - 1 << '\n';
            int x = 0, y = 0;
            for (;; y++){
                if (y % (m - 1) == 0) continue;
                x = y / (m - 1);
                if (x * (n - 1) > y)
                    break;
            }
            for (int i = 1; i < m; i++)
                cout << -x << " ";
            cout << y;
            for (int i = 1; i < m; i++)
                cout << " " << -x;
            cout << '\n';
        } else {
            swap(n, m);
            cout << m + m - 1 << '\n';
            int x = 0, y = 0;
            for (;; y++){
                if (y % (m - 1) == 0) continue;
                x = y / (m - 1);
                if (x * (n - 1) > y)
                    break;
            }
            for (int i = 1; i < m; i++)
                cout << x << " ";
            cout << -y;
            for (int i = 1; i < m; i++)
                cout << " " << x;
            cout << '\n';
        }
    }

    return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Ok
2 Correct 2 ms 376 KB Ok
3 Correct 2 ms 376 KB Ok
4 Correct 2 ms 376 KB Ok
5 Correct 2 ms 376 KB Ok
6 Correct 3 ms 504 KB Ok
7 Correct 10 ms 1112 KB Ok
8 Correct 5 ms 632 KB Ok
9 Correct 10 ms 1272 KB Ok
10 Correct 7 ms 892 KB Ok

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Ok
2 Correct 2 ms 380 KB Ok
3 Correct 2 ms 376 KB Ok
4 Incorrect 2 ms 256 KB Jury has the better answer : jans = 9, pans = 8
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

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

Subtask #5
0 / 14.0

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

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Ok
2 Correct 2 ms 376 KB Ok
3 Correct 2 ms 376 KB Ok
4 Correct 2 ms 376 KB Ok
5 Correct 2 ms 376 KB Ok
6 Correct 2 ms 376 KB Ok
7 Correct 2 ms 376 KB Ok
8 Correct 2 ms 376 KB Ok
9 Correct 2 ms 376 KB Ok
10 Correct 2 ms 376 KB Ok
11 Correct 2 ms 256 KB Ok
12 Correct 0 ms 376 KB Ok
13 Correct 2 ms 376 KB Ok
14 Correct 2 ms 376 KB Ok
15 Correct 2 ms 376 KB Ok
16 Correct 2 ms 376 KB Ok
17 Correct 2 ms 376 KB Ok
18 Correct 3 ms 504 KB Ok
19 Correct 10 ms 1112 KB Ok
20 Correct 5 ms 632 KB Ok
21 Correct 10 ms 1272 KB Ok
22 Correct 7 ms 892 KB Ok
23 Correct 2 ms 256 KB Ok
24 Correct 2 ms 380 KB Ok
25 Correct 2 ms 376 KB Ok
26 Incorrect 2 ms 256 KB Jury has the better answer : jans = 9, pans = 8
27 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Ok
2 Correct 2 ms 376 KB Ok
3 Correct 2 ms 376 KB Ok
4 Correct 2 ms 376 KB Ok
5 Correct 2 ms 376 KB Ok
6 Correct 2 ms 376 KB Ok
7 Correct 2 ms 376 KB Ok
8 Correct 2 ms 376 KB Ok
9 Correct 2 ms 376 KB Ok
10 Correct 2 ms 376 KB Ok
11 Correct 2 ms 256 KB Ok
12 Correct 0 ms 376 KB Ok
13 Correct 2 ms 376 KB Ok
14 Correct 2 ms 376 KB Ok
15 Correct 2 ms 376 KB Ok
16 Correct 2 ms 376 KB Ok
17 Correct 2 ms 376 KB Ok
18 Correct 3 ms 504 KB Ok
19 Correct 10 ms 1112 KB Ok
20 Correct 5 ms 632 KB Ok
21 Correct 10 ms 1272 KB Ok
22 Correct 7 ms 892 KB Ok
23 Correct 2 ms 256 KB Ok
24 Correct 2 ms 380 KB Ok
25 Correct 2 ms 376 KB Ok
26 Incorrect 2 ms 256 KB Jury has the better answer : jans = 9, pans = 8
27 Halted 0 ms 0 KB -