aboutsummaryrefslogtreecommitdiff
path: root/Odd-EvenIncrements/Odd-EvenIncrements.cpp
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
commit3a89fc707253f75f46fd5a4822817f1fd5156c40 (patch)
tree474b08b187895af91c10838aae21142b2ba2514d /Odd-EvenIncrements/Odd-EvenIncrements.cpp
parentf5ff62a26052f084b6b807cba220c86785fd45e3 (diff)
downloadcompetitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.tar.xz
competitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.zip
Made that every problem is its own folder to make building the code a smooth operation with a shortcut
Diffstat (limited to 'Odd-EvenIncrements/Odd-EvenIncrements.cpp')
-rw-r--r--Odd-EvenIncrements/Odd-EvenIncrements.cpp59
1 files changed, 59 insertions, 0 deletions
diff --git a/Odd-EvenIncrements/Odd-EvenIncrements.cpp b/Odd-EvenIncrements/Odd-EvenIncrements.cpp
new file mode 100644
index 0000000..dad00f5
--- /dev/null
+++ b/Odd-EvenIncrements/Odd-EvenIncrements.cpp
@@ -0,0 +1,59 @@
+#include<bits/stdc++.h>
+using namespace std;
+bool isEvenOrOdd(vector<int> v) {
+ bool even = false;
+ bool odd = false;
+ for(int x : v) {
+ if(x % 2 != 0) {
+ even = false;
+ break;
+ }
+ else{
+ even = true;
+ }
+ }
+ for(int x : v) {
+ if(x % 2 == 0) {
+ odd = false;
+ break;
+ }
+ else{
+ odd = true;
+ }
+ }
+ return odd || even;
+}
+
+int main() {
+ int tt;
+ cin >> tt;
+ while(tt--) {
+ int n;
+ cin >> n;
+ vector<int> v(n);
+ vector<int> vEven;
+ vector<int> vOdd;
+ for(int &x : v) {
+ cin >> x;
+ }
+ bool ok = isEvenOrOdd(v);
+ for(int x : v) {
+ vEven.push_back(x);
+ vOdd.push_back(x);
+ }
+ for(int i = 0; i < v.size(); i++) {
+ if(i % 2 == 0){
+ vEven[i]++;
+ }
+ }
+ bool evenOp = isEvenOrOdd(vEven);
+ for(int i = 0; i < v.size(); i++) {
+ if(i % 2 != 0){
+ vOdd[i]++;
+ }
+ }
+ bool oddOp = isEvenOrOdd(vOdd);
+ cout << (ok ? "YES" : (evenOp || oddOp ? "YES" : "NO")) << endl;
+
+ }
+}