Submission #982449

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
982449	2024-05-14T09:16:16 Z	duckindog	Newspapers (CEOI21_newspapers)	C++17	4 / 100	1 ms	500 KB

newspapers

#include <bits/stdc++.h>

using namespace std;

const int N = 300'000 + 10;
int n, m;

int32_t main() { 
  cin.tie(0)->sync_with_stdio(0);

  cin >> n >> m;
  if (n == 1) { cout << "YES\n1\n1\n"; return 0; }
  if (n == 2) { cout << "YES\n2\n1\n1\n"; return 0; }
  if (m != n - 1) { cout << "NO\n"; return 0; }
  cout << "YES\n1\n1\n";
}

Subtask #1

0.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
4	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
5	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
6	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
7	Correct	1 ms	348 KB	Output is correct
8	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
9	Incorrect	0 ms	348 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #2

4.0 / 8.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	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
4	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
5	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
6	Partially correct	1 ms	344 KB	Failed to provide a successful strategy.
7	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
8	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
9	Partially correct	0 ms	452 KB	Failed to provide a successful strategy.
10	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
11	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
12	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
13	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
14	Partially correct	1 ms	460 KB	Failed to provide a successful strategy.
15	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
16	Partially correct	1 ms	500 KB	Failed to provide a successful strategy.
17	Partially correct	1 ms	460 KB	Failed to provide a successful strategy.
18	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
19	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
20	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.

Subtask #3

0.0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
4	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
5	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
6	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
7	Correct	1 ms	348 KB	Output is correct
8	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
9	Incorrect	0 ms	348 KB	Output isn't correct
10	Halted	0 ms	0 KB	-