#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define endl '\n'
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 37
#endif
inline void solve(){
int n, m;
cin >> n >> m;
if(m != n - 1) {
cout << "NO\n";
return;
}
cout << "YES\n1\n1\n";
}
signed main(){
#ifdef LOCAL
freopen("test.in", "r", stdin);
freopen("err.txt", "w", stderr);
#endif
ios_base::sync_with_stdio(0);
cin.tie(NULL);
// signed t; cin >> t; while(t--)
solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
0 ms |
344 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
9 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
0 ms |
600 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
7 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
8 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
9 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
10 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
11 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
12 |
Partially correct |
0 ms |
344 KB |
Failed to provide a successful strategy. |
13 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
14 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
15 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
16 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
17 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
18 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
19 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
20 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
0 ms |
344 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
9 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |