diff options
| author | Omar Magdy <omar.professional8777@gmail.com> | 2022-05-09 16:54:41 +0200 |
|---|---|---|
| committer | Omar Magdy <omar.professional8777@gmail.com> | 2022-05-09 16:54:41 +0200 |
| commit | 79d618f6b9a45d82023792140e70d271485cf005 (patch) | |
| tree | 55dd529dbea2327d0a23e80b78f8912e73633e6d /Odd-EvenIncrements.cpp | |
| parent | c7cecfca5337473def7f1c9adba208ab33a11c8e (diff) | |
| download | competitive-programming-79d618f6b9a45d82023792140e70d271485cf005.tar.xz competitive-programming-79d618f6b9a45d82023792140e70d271485cf005.zip | |
Added some new problems
Diffstat (limited to 'Odd-EvenIncrements.cpp')
| -rw-r--r-- | Odd-EvenIncrements.cpp | 59 |
1 files changed, 59 insertions, 0 deletions
diff --git a/Odd-EvenIncrements.cpp b/Odd-EvenIncrements.cpp new file mode 100644 index 0000000..dad00f5 --- /dev/null +++ b/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; + + } +} |
