// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define sz(x) int(x.size())
template<class T> using V = vector<T>;
using vi = V<int>;
using ll = long long;
using pi = pair<int, int>;
using vpi = V<pi>;
using vl = V<ll>;
int main() {
cin.tie(0)->sync_with_stdio(0);
int N, M; cin >> N >> M;
if (M != N - 1) {
cout << "NO" << nl;
return 0;
}
cout << "YES" << nl;
cout << 1 << nl;
cout << 1 << nl;
exit(0-0);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Partially correct |
0 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 |
0 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 |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 9 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 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 |
0 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 |
1 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 |
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 |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 12 |
Partially correct |
0 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 |
1 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 |
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 |
1 ms |
212 KB |
Output is correct |
| 2 |
Partially correct |
0 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 |
0 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 |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 9 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
