oj.uz

Submission #1109142

# Submission time Handle Problem Language Result Execution time Memory
1109142 2024-11-06T05:36:56 Z stdfloat Nice sequence (IZhO18_sequence) C++17
15 / 100
 6 ms 1016 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;


void solve() {
	int n, m;
	cin >> n >> m;

	bool tr = false;
	if (n > m) {
		tr = true;
		swap(n, m);
	}

	vector<int> v;
	if (!(m % n)) {
		for (int i = 1; i < m; i++)
			v.push_back(-1);
	}
	else {
		int x = m / n + 1;
		for (int i = 1; i <= x * (n - 1); i++) {
			for (int j = 1; j < n; j++)
				v.push_back(x);

			if (i != x * (n - 1)) v.push_back(-(x * (n - 1) + 1));
		}
	}

	cout << (int)v.size() << '\n';
	for (auto i : v)
		cout << i * (tr ? -1 : 1) << ' ';
	if (!v.empty()) cout << '\n';
}

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

	int T;
	cin >> T;
	while (T--) solve();
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Ok
2 Correct 1 ms 508 KB Ok
3 Correct 1 ms 500 KB Ok
4 Correct 1 ms 336 KB Ok
5 Correct 1 ms 336 KB Ok
6 Correct 1 ms 336 KB Ok
7 Correct 1 ms 336 KB Ok
8 Correct 1 ms 336 KB Ok
9 Correct 1 ms 336 KB Ok
10 Correct 1 ms 504 KB Ok
11 Correct 1 ms 336 KB Ok
12 Correct 1 ms 336 KB Ok

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Ok
2 Correct 1 ms 336 KB Ok
3 Correct 1 ms 336 KB Ok
4 Correct 1 ms 336 KB Ok
5 Correct 1 ms 336 KB Ok
6 Correct 2 ms 336 KB Ok
7 Correct 5 ms 1016 KB Ok
8 Correct 5 ms 592 KB Ok
9 Correct 6 ms 848 KB Ok
10 Correct 4 ms 592 KB Ok

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Ok
2 Correct 1 ms 336 KB Ok
3 Correct 1 ms 336 KB Ok
4 Incorrect 1 ms 336 KB there is incorrect sequence
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

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

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Ok
2 Correct 1 ms 508 KB Ok
3 Correct 1 ms 500 KB Ok
4 Correct 1 ms 336 KB Ok
5 Correct 1 ms 336 KB Ok
6 Correct 1 ms 336 KB Ok
7 Correct 1 ms 336 KB Ok
8 Correct 1 ms 336 KB Ok
9 Correct 1 ms 336 KB Ok
10 Correct 1 ms 504 KB Ok
11 Correct 1 ms 336 KB Ok
12 Correct 1 ms 336 KB Ok
13 Correct 1 ms 336 KB Ok
14 Correct 1 ms 336 KB Ok
15 Correct 1 ms 336 KB Ok
16 Incorrect 1 ms 336 KB there is incorrect sequence
17 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Ok
2 Correct 1 ms 508 KB Ok
3 Correct 1 ms 500 KB Ok
4 Correct 1 ms 336 KB Ok
5 Correct 1 ms 336 KB Ok
6 Correct 1 ms 336 KB Ok
7 Correct 1 ms 336 KB Ok
8 Correct 1 ms 336 KB Ok
9 Correct 1 ms 336 KB Ok
10 Correct 1 ms 504 KB Ok
11 Correct 1 ms 336 KB Ok
12 Correct 1 ms 336 KB Ok
13 Correct 1 ms 336 KB Ok
14 Correct 1 ms 336 KB Ok
15 Correct 1 ms 336 KB Ok
16 Correct 1 ms 336 KB Ok
17 Correct 1 ms 336 KB Ok
18 Correct 2 ms 336 KB Ok
19 Correct 5 ms 1016 KB Ok
20 Correct 5 ms 592 KB Ok
21 Correct 6 ms 848 KB Ok
22 Correct 4 ms 592 KB Ok
23 Correct 1 ms 336 KB Ok
24 Correct 1 ms 336 KB Ok
25 Correct 1 ms 336 KB Ok
26 Incorrect 1 ms 336 KB there is incorrect sequence
27 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Ok
2 Correct 1 ms 508 KB Ok
3 Correct 1 ms 500 KB Ok
4 Correct 1 ms 336 KB Ok
5 Correct 1 ms 336 KB Ok
6 Correct 1 ms 336 KB Ok
7 Correct 1 ms 336 KB Ok
8 Correct 1 ms 336 KB Ok
9 Correct 1 ms 336 KB Ok
10 Correct 1 ms 504 KB Ok
11 Correct 1 ms 336 KB Ok
12 Correct 1 ms 336 KB Ok
13 Correct 1 ms 336 KB Ok
14 Correct 1 ms 336 KB Ok
15 Correct 1 ms 336 KB Ok
16 Correct 1 ms 336 KB Ok
17 Correct 1 ms 336 KB Ok
18 Correct 2 ms 336 KB Ok
19 Correct 5 ms 1016 KB Ok
20 Correct 5 ms 592 KB Ok
21 Correct 6 ms 848 KB Ok
22 Correct 4 ms 592 KB Ok
23 Correct 1 ms 336 KB Ok
24 Correct 1 ms 336 KB Ok
25 Correct 1 ms 336 KB Ok
26 Incorrect 1 ms 336 KB there is incorrect sequence
27 Halted 0 ms 0 KB -