//#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << "[" << H << "]";
debug_out(T...);
}
#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)
#define MP make_pair
clock_t startTime;
double getCurrentTime() {
return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
typedef long long ll;
const int MOD = 998244353;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 1555;
void solve(int TC) {
int n, m;
cin >> n >> m;
cout << "YES\n";
cout << "1\n1";
}
int main() {
startTime = clock();
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#ifdef dddxxz
freopen("input.txt", "rg", stdin);
freopen("output.txt", "w", stdout);
#endif
int TC = 1;
//cin >> TC;
for (int test = 1; test <= TC; test++) {
//debug(test);
//cout << "Case #" << test << ": ";
solve(test);
}
#ifdef dddxxz
cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;
#endif
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
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 |
212 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 |
Incorrect |
1 ms |
324 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
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 |
212 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 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
8 |
Partially correct |
1 ms |
324 KB |
Failed to provide a successful strategy. |
9 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
10 |
Partially correct |
1 ms |
344 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 |
324 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 |
0 ms |
336 KB |
Failed to provide a successful strategy. |
16 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
17 |
Partially correct |
1 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 |
0 ms |
324 KB |
Failed to provide a successful strategy. |
# |
결과 |
실행 시간 |
메모리 |
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 |
212 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 |
Incorrect |
1 ms |
324 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |