oj.uz

Submission #1109158

# Submission time Handle Problem Language Result Execution time Memory
1109158 2024-11-06T06:32:35 Z stdfloat Nice sequence (IZhO18_sequence) C++17
6 / 100
 2 ms 592 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;
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j < n; j++)
				v.push_back(x);

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

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

	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) assert(sm1 < 0);
		if (m - 1 <= i) {
			// if (sm2 <= 0) {
			// 	cout << i - m + 1 << ' ' << i << ' ' << sm2 << '\n';
			// }
			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 336 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
0 / 9.0

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

Subtask #3
0 / 14.0

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

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 592 KB Execution killed with signal 6
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 336 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 504 KB Ok
14 Correct 1 ms 336 KB Ok
15 Incorrect 1 ms 336 KB Jury has the better answer : jans = 5, pans = 3
16 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 336 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 Incorrect 1 ms 336 KB Jury has the better answer : jans = 5, pans = 3
14 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 336 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 Incorrect 1 ms 336 KB Jury has the better answer : jans = 5, pans = 3
14 Halted 0 ms 0 KB -