답안 #528149

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
528149	2022-02-19T12:59:32 Z	jesus_coconut	Newspapers (CEOI21_newspapers)	C++17	6 / 100	1 ms	460 KB

newspapers

#include <bits/stdc++.h>

using namespace std;

int n, m;
vector<vector<int>> adj;

void load() {
  cin >> n >> m;
  adj.resize(n);
  for (int i = 0; i < m; ++i) {
	int a, b;
	cin >> a >> b;
	--a; --b;
	adj[a].push_back(b);
	adj[b].push_back(a);
  }
}

void solve2() {
  if (n <= 3) {
	cout << "YES\n";
	cout << "2\n2 2\n";
	return;
  }
  cout << "YES\n";
  cout << 2 * n - 1 << '\n';
  for (int i = 1; i <= n; ++i) {
	cout << i << ' ';
  }
  for (int i = n; i > 1; --i) {
	cout << i << ' ';
  }
  cout << '\n';
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  load();
  if (n == 1) {
	cout << "YES\n";
	cout << "1\n1\n";
	return 0;
  }

  if (m == n-1) {
	solve2();
  }

  return 0;
}

Subtask #1

0.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Partially correct	1 ms	312 KB	Provide a successful but not optimal strategy.
4	Partially correct	0 ms	204 KB	Provide a successful but not optimal strategy.
5	Partially correct	1 ms	204 KB	Failed to provide a successful strategy.
6	Partially correct	1 ms	204 KB	Failed to provide a successful strategy.
7	Incorrect	0 ms	204 KB	Unexpected end of file - token expected
8	Halted	0 ms	0 KB	-

Subtask #2

6.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Partially correct	1 ms	204 KB	Provide a successful but not optimal strategy.
5	Partially correct	0 ms	204 KB	Provide a successful but not optimal strategy.
6	Partially correct	1 ms	204 KB	Provide a successful but not optimal strategy.
7	Partially correct	1 ms	204 KB	Provide a successful but not optimal strategy.
8	Partially correct	1 ms	204 KB	Provide a successful but not optimal strategy.
9	Partially correct	1 ms	204 KB	Provide a successful but not optimal strategy.
10	Partially correct	0 ms	204 KB	Provide a successful but not optimal strategy.
11	Partially correct	1 ms	460 KB	Provide a successful but not optimal strategy.
12	Partially correct	1 ms	332 KB	Provide a successful but not optimal strategy.
13	Partially correct	1 ms	332 KB	Provide a successful but not optimal strategy.
14	Partially correct	1 ms	320 KB	Provide a successful but not optimal strategy.
15	Partially correct	1 ms	332 KB	Provide a successful but not optimal strategy.
16	Partially correct	1 ms	332 KB	Provide a successful but not optimal strategy.
17	Partially correct	1 ms	332 KB	Provide a successful but not optimal strategy.
18	Partially correct	1 ms	332 KB	Provide a successful but not optimal strategy.
19	Partially correct	1 ms	320 KB	Provide a successful but not optimal strategy.
20	Partially correct	1 ms	332 KB	Provide a successful but not optimal strategy.

Subtask #3

0.0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Partially correct	1 ms	312 KB	Provide a successful but not optimal strategy.
4	Partially correct	0 ms	204 KB	Provide a successful but not optimal strategy.
5	Partially correct	1 ms	204 KB	Failed to provide a successful strategy.
6	Partially correct	1 ms	204 KB	Failed to provide a successful strategy.
7	Incorrect	0 ms	204 KB	Unexpected end of file - token expected
8	Halted	0 ms	0 KB	-