diff options
Diffstat (limited to 'contests/Round859')
47 files changed, 1222 insertions, 0 deletions
diff --git a/contests/Round859/A/main b/contests/Round859/A/main Binary files differnew file mode 100755 index 0000000..bc6e935 --- /dev/null +++ b/contests/Round859/A/main diff --git a/contests/Round859/A/main.cpp b/contests/Round859/A/main.cpp new file mode 100755 index 0000000..333bd0b --- /dev/null +++ b/contests/Round859/A/main.cpp @@ -0,0 +1,139 @@ +#include<bits/stdc++.h> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = vector<pii>; +using vi = vector<int>; +using vll = vector<long long>; +using mpii = map<int, int>; +using mpll = map<ll, ll>; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p); +template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec); +template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m); +template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m); +template<typename T> ostream& operator<<(ostream& os, const set<T>& s); +template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s); + +template<typename K, typename V> +ostream& operator<<(ostream& os, const pair<K, V>& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const vector<T>& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template<typename K, typename V> +ostream& operator<<(ostream& os, const map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename K, typename V> +ostream& operator<<(ostream& os, const unordered_map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const unordered_set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template<typename T, typename... TS> +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int a, b, c; + cin >> a >> b >> c; + if (a + b == c) { + cout << "+" << '\n'; + } else { + cout << "-" << '\n'; + } + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round859/A/main_input0.txt b/contests/Round859/A/main_input0.txt new file mode 100644 index 0000000..91dc315 --- /dev/null +++ b/contests/Round859/A/main_input0.txt @@ -0,0 +1,12 @@ +11 +1 2 3 +3 2 1 +2 9 -7 +3 4 7 +1 1 2 +1 1 0 +3 3 6 +9 9 18 +9 9 0 +1 9 -8 +1 9 10 diff --git a/contests/Round859/A/main_output0.txt b/contests/Round859/A/main_output0.txt new file mode 100644 index 0000000..a4d808b --- /dev/null +++ b/contests/Round859/A/main_output0.txt @@ -0,0 +1,11 @@ ++ +- +- ++ ++ +- ++ ++ +- +- ++ diff --git a/contests/Round859/B/main b/contests/Round859/B/main Binary files differnew file mode 100755 index 0000000..9c85033 --- /dev/null +++ b/contests/Round859/B/main diff --git a/contests/Round859/B/main.cpp b/contests/Round859/B/main.cpp new file mode 100755 index 0000000..0c93911 --- /dev/null +++ b/contests/Round859/B/main.cpp @@ -0,0 +1,150 @@ +#include<bits/stdc++.h> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = vector<pii>; +using vi = vector<int>; +using vll = vector<long long>; +using mpii = map<int, int>; +using mpll = map<ll, ll>; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p); +template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec); +template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m); +template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m); +template<typename T> ostream& operator<<(ostream& os, const set<T>& s); +template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s); + +template<typename K, typename V> +ostream& operator<<(ostream& os, const pair<K, V>& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const vector<T>& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template<typename K, typename V> +ostream& operator<<(ostream& os, const map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename K, typename V> +ostream& operator<<(ostream& os, const unordered_map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const unordered_set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template<typename T, typename... TS> +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int n; + cin >> n; + vi v(n); + for (auto &x : v) cin >> x; + int even = 0; + int odd = 0; + for (int i = 0; i < n; i++) { + if (v[i] & 1) { + odd += v[i]; + } else { + even += v[i]; + } + } + if (even > odd) { + cout << "YES\n"; + } else { + cout << "NO\n"; + } + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round859/B/main_input0.txt b/contests/Round859/B/main_input0.txt new file mode 100644 index 0000000..bdafd50 --- /dev/null +++ b/contests/Round859/B/main_input0.txt @@ -0,0 +1,7 @@ +3 +4 +1 2 3 4 +4 +1 1 1 2 +3 +1 4 3 diff --git a/contests/Round859/B/main_output0.txt b/contests/Round859/B/main_output0.txt new file mode 100644 index 0000000..c6e03a3 --- /dev/null +++ b/contests/Round859/B/main_output0.txt @@ -0,0 +1,3 @@ +YES +NO +NO diff --git a/contests/Round859/C/main b/contests/Round859/C/main Binary files differnew file mode 100755 index 0000000..17ac24c --- /dev/null +++ b/contests/Round859/C/main diff --git a/contests/Round859/C/main.cpp b/contests/Round859/C/main.cpp new file mode 100755 index 0000000..566b95c --- /dev/null +++ b/contests/Round859/C/main.cpp @@ -0,0 +1,164 @@ +#include<bits/stdc++.h> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = vector<pii>; +using vi = vector<int>; +using vll = vector<long long>; +using mpii = map<int, int>; +using mpll = map<ll, ll>; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p); +template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec); +template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m); +template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m); +template<typename T> ostream& operator<<(ostream& os, const set<T>& s); +template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s); + +template<typename K, typename V> +ostream& operator<<(ostream& os, const pair<K, V>& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const vector<T>& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template<typename K, typename V> +ostream& operator<<(ostream& os, const map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename K, typename V> +ostream& operator<<(ostream& os, const unordered_map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const unordered_set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template<typename T, typename... TS> +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int n; + cin >> n; + string s; + cin >> s; + set<char> st1; + set<char> st2; + for (int i = 0; i < n; i+=2) { + st1.insert(s[i]); + } + for (int i = 1; i < n; i++) { + st2.insert(s[i]); + } + for (auto ch : st1) { + for (int i = 0; i < n ; i++) { + if (s[i] == ch) { + s[i] = '0'; + } + } + } + for (auto ch : st2) { + for (int i = 0; i < n ; i++) { + if (s[i] == ch) { + s[i] = '1'; + } + } + } + for (int i = 0; i < n - 1; i++) { + if (s[i] == s[i + 1]) { + cout << "NO\n"; + return; + } + } + cout << "YES\n"; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round859/C/main_input0.txt b/contests/Round859/C/main_input0.txt new file mode 100644 index 0000000..e3b21b8 --- /dev/null +++ b/contests/Round859/C/main_input0.txt @@ -0,0 +1,17 @@ +8 +7 +abacaba +2 +aa +1 +y +4 +bkpt +6 +ninfia +6 +banana +10 +codeforces +8 +testcase diff --git a/contests/Round859/C/main_output0.txt b/contests/Round859/C/main_output0.txt new file mode 100644 index 0000000..3876667 --- /dev/null +++ b/contests/Round859/C/main_output0.txt @@ -0,0 +1,8 @@ +YES +NO +YES +YES +NO +YES +NO +NO diff --git a/contests/Round859/D/main b/contests/Round859/D/main Binary files differnew file mode 100755 index 0000000..7778923 --- /dev/null +++ b/contests/Round859/D/main diff --git a/contests/Round859/D/main.cpp b/contests/Round859/D/main.cpp new file mode 100755 index 0000000..62f9db4 --- /dev/null +++ b/contests/Round859/D/main.cpp @@ -0,0 +1,174 @@ +#include<bits/stdc++.h> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = vector<pii>; +using vi = vector<int>; +using vll = vector<long long>; +using mpii = map<int, int>; +using mpll = map<ll, ll>; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p); +template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec); +template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m); +template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m); +template<typename T> ostream& operator<<(ostream& os, const set<T>& s); +template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s); + +template<typename K, typename V> +ostream& operator<<(ostream& os, const pair<K, V>& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const vector<T>& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template<typename K, typename V> +ostream& operator<<(ostream& os, const map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename K, typename V> +ostream& operator<<(ostream& os, const unordered_map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const unordered_set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template<typename T, typename... TS> +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int n, q; + cin >> n >> q; + vi v(n); + vi odd(n); + for (auto &x : v) { + cin >> x; + } + odd[0] = (v[0] & 1); + for (int i = 1; i < n; i++) { + odd[i] = odd[i - 1] + (v[i] & 1); + } + int o = odd[odd.size() - 1]; + for (int i = 0; i < q; i++) { + int l, r, k; + cin >> l >> r >> k; + if (k & 1) { + int oddsInRange = odd[r - 1]; + if (l - 2 >= 0) { + oddsInRange = odd[r - 1] - odd[l - 2]; + } + int noElements = r - l + 1; + int newOdds = o + (noElements - oddsInRange); + if (newOdds & 1) { + cout << "YES\n"; + } else { + cout << "NO\n"; + } + } else { + int oddsInRange = odd[r - 1]; + if (l - 2 >= 0) { + oddsInRange = odd[r - 1] - odd[l - 2]; + } + int noElements = r - l + 1; + int newOdds = o - oddsInRange; + if (newOdds & 1) { + cout << "YES\n"; + } else { + cout << "NO\n"; + } + } + } + + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round859/D/main_input0.txt b/contests/Round859/D/main_input0.txt new file mode 100644 index 0000000..d7ea228 --- /dev/null +++ b/contests/Round859/D/main_input0.txt @@ -0,0 +1,15 @@ +2 +5 5 +2 2 1 3 2 +2 3 3 +2 3 4 +1 5 5 +1 4 9 +2 4 3 +10 5 +1 1 1 1 1 1 1 1 1 1 +3 8 13 +2 5 10 +3 8 10 +1 10 2 +1 9 100 diff --git a/contests/Round859/D/main_output0.txt b/contests/Round859/D/main_output0.txt new file mode 100644 index 0000000..aa44313 --- /dev/null +++ b/contests/Round859/D/main_output0.txt @@ -0,0 +1,10 @@ +YES +YES +YES +NO +YES +NO +NO +NO +NO +YES diff --git a/contests/Round859/E/main b/contests/Round859/E/main Binary files differnew file mode 100755 index 0000000..31ed974 --- /dev/null +++ b/contests/Round859/E/main diff --git a/contests/Round859/E/main.cpp b/contests/Round859/E/main.cpp new file mode 100755 index 0000000..e15145d --- /dev/null +++ b/contests/Round859/E/main.cpp @@ -0,0 +1,160 @@ +#include<bits/stdc++.h> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = vector<pii>; +using vi = vector<int>; +using vll = vector<long long>; +using mpii = map<int, int>; +using mpll = map<ll, ll>; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p); +template<typename T> ostream& operator<<(ostream& os, const vector<T>& |