oj.uz

Submission #1109169

# Submission time Handle Problem Language Result Execution time Memory
1109169 2024-11-06T06:46:54 Z stdfloat Nice sequence (IZhO18_sequence) C++17
15 / 100
 8 ms 1004 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define int long long

#define sz(v)	(int)(v).size()

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, z = x * (n - 1);
		for (int i = 1; i <= z; i++) {
			for (int j = 1; j < n; j++)
				v.push_back(x);

			if (i < z) v.push_back(-(x * (n - 1) + 1));
		}
	}

	if (tr) {
		swap(n, m);
		for (auto &i : v)
			i *= -1;

	}

	// for (auto i : v)
	// 	cout << i << ' ';
	// cout << endl;

	// ll sm1 = 0, sm2 = 0;
	// for (int i = 0; i < sz(v); i++) {
	// 	sm1 += v[i] - (n <= i ? v[i - n] : 0);
	// 	sm2 += v[i] - (m <= i ? v[i - m] : 0);
	
	// 	if (n - 1 <= i) {
	// 		if (sm1 >= 0) {
	// 			cout << "sad1\n";
	// 			exit(false);
	// 		}
	// 		// assert(sm1 < 0);
	// 	}
	// 	if (m - 1 <= i) {
	// 		if (sm2 <= 0) {
	// 			// cout << "sad2 " << i - m + 1 << ' ' << i << '\n';
	// 			// exit(false);
	// 		}
	// 		// assert(sm2 > 0);
	// 	}
	// }

	cout << sz(v) << '\n';
	for (auto i : v)
		cout << i << ' ';
	if (!v.empty()) cout << '\n';
}

int32_t 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 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 1 ms 336 KB Ok
7 Correct 1 ms 504 KB Ok
8 Correct 1 ms 336 KB Ok
9 Correct 1 ms 336 KB Ok
10 Correct 1 ms 336 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 1 ms 336 KB Ok
7 Correct 6 ms 1004 KB Ok
8 Correct 3 ms 592 KB Ok
9 Correct 8 ms 976 KB Ok
10 Correct 7 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 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 1 ms 336 KB Ok
7 Correct 1 ms 504 KB Ok
8 Correct 1 ms 336 KB Ok
9 Correct 1 ms 336 KB Ok
10 Correct 1 ms 336 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 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 1 ms 336 KB Ok
7 Correct 1 ms 504 KB Ok
8 Correct 1 ms 336 KB Ok
9 Correct 1 ms 336 KB Ok
10 Correct 1 ms 336 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 1 ms 336 KB Ok
19 Correct 6 ms 1004 KB Ok
20 Correct 3 ms 592 KB Ok
21 Correct 8 ms 976 KB Ok
22 Correct 7 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 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 1 ms 336 KB Ok
7 Correct 1 ms 504 KB Ok
8 Correct 1 ms 336 KB Ok
9 Correct 1 ms 336 KB Ok
10 Correct 1 ms 336 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 1 ms 336 KB Ok
19 Correct 6 ms 1004 KB Ok
20 Correct 3 ms 592 KB Ok
21 Correct 8 ms 976 KB Ok
22 Correct 7 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 -