oj.uz

Submission #528150

# Submission time Handle Problem Language Result Execution time Memory
528150 2022-02-19T13:07:57 Z jesus_coconut Newspapers (CEOI21_newspapers) C++17
8 / 100
 1 ms 332 KB 
#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 solve1() {

}

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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
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 1 ms 204 KB Unexpected end of file - token expected
8 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
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 1 ms 204 KB Unexpected end of file - token expected
8 Halted 0 ms 0 KB -