Submission #175610

# Submission time Handle Problem Language Result Execution time Memory
175610 2020-01-07T08:32:33 Z VEGAnn Nice sequence (IZhO18_sequence) C++14
6 / 100
3 ms 632 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 (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';
        }
    }

    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Ok
2 Correct 2 ms 376 KB Ok
3 Correct 2 ms 252 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 348 KB Ok
12 Correct 2 ms 376 KB Ok
# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Ok
2 Correct 2 ms 376 KB Ok
3 Correct 2 ms 252 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 348 KB Ok
12 Correct 2 ms 376 KB Ok
13 Runtime error 3 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Ok
2 Correct 2 ms 376 KB Ok
3 Correct 2 ms 252 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 348 KB Ok
12 Correct 2 ms 376 KB Ok
13 Runtime error 2 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Ok
2 Correct 2 ms 376 KB Ok
3 Correct 2 ms 252 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 348 KB Ok
12 Correct 2 ms 376 KB Ok
13 Runtime error 2 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -