Submission #290463

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
290463	2020-09-03T20:42:20 Z	luciocf	Nice sequence (IZhO18_sequence)	C++14	6 / 100	1 ms	256 KB

sequence

#include <bits/stdc++.h>

using namespace std;

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

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

		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";
		}
	}
}

Subtask #1

6.0 / 6.0

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

Subtask #2

0 / 9.0

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

Subtask #3

0 / 14.0

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

Subtask #4

0 / 15.0

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

Subtask #5

0 / 14.0

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

Subtask #6

0 / 18.0

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

Subtask #7

0 / 24.0

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