Submission #1049017

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1049017	2024-08-08T12:01:28 Z	EntityPlantt	Make them Meet (EGOI24_makethemmeet)	C++17	10 / 100	0 ms	592 KB

Main

#include <iostream>
using namespace std;

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n;
	cin >> n;
	cout << "3\n";
	for (int i = 0; i < n; i++) cout << "0 ";
	cout << "\n0 0";
	for (int i = 2; i < n; i++) cout << ' ' << i;
	cout << '\n';
	for (int i = 0; i < n; i++) cout << "0 ";
	return 0;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	360 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct

Subtask #2

0.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	592 KB	Output is correct
2	Incorrect	0 ms	348 KB	If people start at 0 and 1, then they can avoid each other
3	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Incorrect	0 ms	348 KB	If people start at 0 and 1, then they can avoid each other
4	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 36.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	360 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Incorrect	0 ms	348 KB	If people start at 0 and 1, then they can avoid each other
9	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	360 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	592 KB	Output is correct
7	Incorrect	0 ms	348 KB	If people start at 0 and 1, then they can avoid each other
8	Halted	0 ms	0 KB	-