oj.uz

Submission #524988

# Submission time Handle Problem Language Result Execution time Memory
524988 2022-02-10T12:00:45 Z Ziel Newspapers (CEOI21_newspapers) C++17
4 / 100
 2 ms 332 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1010;
vector<vector<int>> g(N);

signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int n, m;
	cin >> n >> m;

	for (int i = 1; i <= m; i++) {
		int x, y;
		cin >> x >> y;
		g[x].push_back(y);
		g[y].push_back(x);
	}

	if (n - 1 == m) {
		cout << "YES\n" << n * 5 << '\n';
		vector<int> v(n);
		iota(v.begin(), v.end(), 1);
		srand(time(0));
		for (int rep = 0; rep < 5; rep++) {
			random_shuffle(v.begin(), v.end());
			random_shuffle(v.begin(), v.end());
			random_shuffle(v.begin(), v.end());
			for (int i = 0; i < n; i++)
				cout << v[i] << ' ';
		}
	}

	return 0;
}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Provide a successful but not optimal strategy.
2 Partially correct 1 ms 204 KB Provide a successful but not optimal strategy.
3 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 252 KB Provide a successful but not optimal strategy.
7 Incorrect 1 ms 204 KB Unexpected end of file - token expected
8 Halted 0 ms 0 KB -

Subtask #2
4.0 / 8.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
2 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
3 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
4 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
7 Partially correct 1 ms 204 KB Failed to provide a successful strategy.
8 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
9 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
10 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
11 Partially correct 2 ms 332 KB Failed to provide a successful strategy.
12 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
13 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
14 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
15 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
16 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
18 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
19 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 332 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Provide a successful but not optimal strategy.
2 Partially correct 1 ms 204 KB Provide a successful but not optimal strategy.
3 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 252 KB Provide a successful but not optimal strategy.
7 Incorrect 1 ms 204 KB Unexpected end of file - token expected
8 Halted 0 ms 0 KB -