#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i,s,e) for(int i = s; i <= (int)e; ++i)
#define DEC(i,s,e) for(int i = s; i >= (int)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{" << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define reach
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <int, int> pi;
typedef tuple<int,int,int> ti3;
typedef tuple<int,int,int,int> ti4;
int rand(int a, int b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (long long)1e18 + 500;
template <typename T> bool chmax(T& a, const T b) { return a<b ? a = b, 1 : 0; }
template <typename T> bool chmin(T& a, const T b) { return a>b ? a = b, 1 : 0; }
const int MAXN = -1;
int32_t main()
{
IAMSPEED
int n,m; cin >> n >> m;
if(n>=10000) {
cout << "NO\n";
} else {
cout << "YES\n";
if(n==1) {
cout << 1 << '\n'; cout << 1;
} else if(n==2||n==3){
cout << 2 << '\n' << 2 << ' ' << 2;
} else {
cout << 5 << '\n' << "2 2 4 4 2\n";
}
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 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 |
1 ms |
340 KB |
Failed to provide a successful strategy. |
| 7 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 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 |
Partially correct |
1 ms |
324 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 |
212 KB |
Failed to provide a successful strategy. |
| 11 |
Partially correct |
0 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 |
1 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 |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 17 |
Partially correct |
1 ms |
328 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. |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 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 |
1 ms |
340 KB |
Failed to provide a successful strategy. |
| 7 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
