Submission #811772

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
811772	2023-08-07T05:46:15 Z	enerelt14	Newspapers (CEOI21_newspapers)	C++14	4 / 100	1 ms	328 KB

newspapers

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
#define pb push_back
using namespace std;

int n, m;
vector<int> adj[1005];

int main() {
	cin >> n >> m;
	if(m >= n) {
		cout << "NO\n";
		return 0;
	}
	else {
		cout << "YES\n1\n1";
		return 0;
	}
	for(int i = 0; i < m; i++) {
		int u, v;
		cin >> u >> v;
		adj[u].pb(v);
		adj[v].pb(u);
	}
	return 0;
}

Subtask #1

0.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
3	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
4	Partially correct	1 ms	212 KB	Failed to provide a successful strategy.
5	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
6	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
7	Correct	0 ms	324 KB	Output is correct
8	Partially correct	1 ms	320 KB	Failed to provide a successful strategy.
9	Incorrect	1 ms	320 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	212 KB	Output is correct
2	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
3	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
4	Partially correct	1 ms	212 KB	Failed to provide a successful strategy.
5	Partially correct	1 ms	324 KB	Failed to provide a successful strategy.
6	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
7	Partially correct	0 ms	324 KB	Failed to provide a successful strategy.
8	Partially correct	0 ms	328 KB	Failed to provide a successful strategy.
9	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
10	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
11	Partially correct	1 ms	212 KB	Failed to provide a successful strategy.
12	Partially correct	1 ms	212 KB	Failed to provide a successful strategy.
13	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
14	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
15	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
16	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
17	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
18	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
19	Partially correct	0 ms	328 KB	Failed to provide a successful strategy.
20	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.

Subtask #3

0.0 / 80.0

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