oj.uz

Submission #290506

# Submission time Handle Problem Language Result Execution time Memory
290506 2020-09-03T22:57:06 Z luciocf Nice sequence (IZhO18_sequence) C++14
6 / 100
 1 ms 384 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 2e5+10;

int a[maxn];

int main(void)
{
	int tc;
	cin >> tc;

	while (tc--)
	{
		int n, m;
		cin >> n >> m;

		if (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";
			}
			else
			{
				cout << m-1 << "\n";
				for (int i = 1; i < m; i++)
					cout << "-1 ";
				cout << "\n";
			}
		}
		else
		{
			if (m == 2)
			{
				if (n == 3)
				{
					cout << "3\n-3 4 -3\n";
				}
				else
				{
					cout << n-1 << "\n";
					for (int i = 1; i < n; i++)
						cout << "1 ";
					cout << "\n";
				}
			}
			else
			{
				if (m == 3)
				{
					cout << "3\n3 -4 2\n";
				}
				else
				{
					cout << m-1 << "\n";
					for (int i = 1; i < m; i++)
						cout << "-1 ";
					cout << "\n";
				}
			}
		}
	}
}

Subtask #1
6.0 / 6.0

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

Subtask #2
0 / 9.0

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

Subtask #3
0 / 14.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 14.0

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

Subtask #6
0 / 18.0

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

Subtask #7
0 / 24.0

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