819B. Mainak and Interesting Sequence.cpp

800 Codeforces Solutions/819B. Mainak and Interesting Sequence.cpp

@@ -0,0 +1,78 @@
+#pragma GCC optimize("Ofast")
+#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
+#pragma GCC optimize("unroll-loops")
+#include<bits/stdc++.h>
+using namespace std;
+#define ll int
+#define intt int
+#define sz(x) x.size()
+#define pb push_back
+#define pb2 pop_back
+#define ff first
+#define ss second
+#define lb lower_bound
+#define ub upper_bound
+#define bend(x) x.begin(), x.end()
+#define vi vector<ll>
+#define mapp map<ll, ll>
+#define sett set<ll>
+#define ve vector
+#define un_m unordered_map<ll, ll>
+#define f(i, a, b) for (i = a; i < b; i++)
+#define f2(i, a) for (auto i = a.begin(); i != a.end(); i++)
+#define maxxx INT32_MAX
+#define mpp make_pair
+#define in(t) scanf("%lld",&t)
+#define out(t) printf("%lld",t)
+#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
+#define PQ priority_queue
+#define ts(s) to_string(s)
+
+const unsigned int mod = 1000000007;
+string yes = "YES", no = "NO";
+
+
+
+ string dir[4]={"00","25","50","75"};
+
+
+void sol() {
+    int N, M;
+    cin >> N >> M;
+
+    if(((N % 2 == 0) && (M % 2 == 1)) || (M < N)){ // impossible cases, M < N and (M - odd, N - even)
+        cout << "NO\n";
+    }else if((N % 2) == 1){ // (N - odd)
+        cout << "YES\n";
+        for(int i = 1; i < N; ++i){
+            cout << "1 ";
+        }
+        cout << M - N + 1 << '\n';
+    }else{ // (N - even, M - even)
+        cout << "YES\n";
+        for(int i = 2; i < N; ++i){
+            cout << "1 ";
+        }
+        cout << (M - N + 2) / 2 << ' ' << (M - N + 2) / 2 << '\n';
+    }
+}
+
+
+
+// driver function
+int main() {
+#ifndef ONLINE_JUDGE
+    freopen("input.txt", "r", stdin);
+    freopen("output.txt", "w", stdout);
+#endif
+    fast_io;
+    ll tc = 1; cin >> tc;
+    for (int i = 1; i <= tc; i++) {
+        //    cout<<tc<<endl;
+        //    cout<<"Case #"<<i<<": ";
+        sol();
+        cout << endl;
+    }
+
+    return 0;
+}