#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pii pair<int,int>
#define ll long long
const int N = 2e5 + 5, mod = 1e9 + 7;
int t;
main() {
/*
7 6
1 2
1 3
1 4
1 5
1 6
1 7 */
int n, m;
cin >> n >> m;
cout << (m == n - 1 ? "YES" : "NO") << endl;
int x = m;
while(m--) {
int u, v;
cin >> u >> v;
}
if(x == n - 1) {
cout << 1 << " " << 1 << endl;}
}
Compilation message
newspapers.cpp:9:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
9 | main() {
| ^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
1 ms |
296 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Partially correct |
1 ms |
300 KB |
Failed to provide a successful strategy. |
9 |
Incorrect |
1 ms |
296 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Partially correct |
1 ms |
304 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
0 ms |
300 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 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
8 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
9 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
10 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
11 |
Partially correct |
1 ms |
300 KB |
Failed to provide a successful strategy. |
12 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
13 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
14 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
15 |
Partially correct |
1 ms |
308 KB |
Failed to provide a successful strategy. |
16 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
17 |
Partially correct |
1 ms |
304 KB |
Failed to provide a successful strategy. |
18 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
19 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
20 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
1 ms |
296 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Partially correct |
1 ms |
300 KB |
Failed to provide a successful strategy. |
9 |
Incorrect |
1 ms |
296 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |