diff options
Diffstat (limited to 'contests/Round859(Div4)')
47 files changed, 0 insertions, 1222 deletions
diff --git a/contests/Round859(Div4)/A/main b/contests/Round859(Div4)/A/main Binary files differdeleted file mode 100755 index bc6e935..0000000 --- a/contests/Round859(Div4)/A/main +++ /dev/null diff --git a/contests/Round859(Div4)/A/main.cpp b/contests/Round859(Div4)/A/main.cpp deleted file mode 100755 index 333bd0b..0000000 --- a/contests/Round859(Div4)/A/main.cpp +++ /dev/null @@ -1,139 +0,0 @@ -#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(Div4)/A/main_input0.txt b/contests/Round859(Div4)/A/main_input0.txt deleted file mode 100644 index 91dc315..0000000 --- a/contests/Round859(Div4)/A/main_input0.txt +++ /dev/null @@ -1,12 +0,0 @@ -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(Div4)/A/main_output0.txt b/contests/Round859(Div4)/A/main_output0.txt deleted file mode 100644 index a4d808b..0000000 --- a/contests/Round859(Div4)/A/main_output0.txt +++ /dev/null @@ -1,11 +0,0 @@ -+ -- -- -+ -+ -- -+ -+ -- -- -+ diff --git a/contests/Round859(Div4)/B/main b/contests/Round859(Div4)/B/main Binary files differdeleted file mode 100755 index 9c85033..0000000 --- a/contests/Round859(Div4)/B/main +++ /dev/null diff --git a/contests/Round859(Div4)/B/main.cpp b/contests/Round859(Div4)/B/main.cpp deleted file mode 100755 index 0c93911..0000000 --- a/contests/Round859(Div4)/B/main.cpp +++ /dev/null @@ -1,150 +0,0 @@ -#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(Div4)/B/main_input0.txt b/contests/Round859(Div4)/B/main_input0.txt deleted file mode 100644 index bdafd50..0000000 --- a/contests/Round859(Div4)/B/main_input0.txt +++ /dev/null @@ -1,7 +0,0 @@ -3 -4 -1 2 3 4 -4 -1 1 1 2 -3 -1 4 3 diff --git a/contests/Round859(Div4)/B/main_output0.txt b/contests/Round859(Div4)/B/main_output0.txt deleted file mode 100644 index c6e03a3..0000000 --- a/contests/Round859(Div4)/B/main_output0.txt +++ /dev/null @@ -1,3 +0,0 @@ -YES -NO -NO diff --git a/contests/Round859(Div4)/C/main b/contests/Round859(Div4)/C/main Binary files differdeleted file mode 100755 index 17ac24c..0000000 --- a/contests/Round859(Div4)/C/main +++ /dev/null diff --git a/contests/Round859(Div4)/C/main.cpp b/contests/Round859(Div4)/C/main.cpp deleted file mode 100755 index 566b95c..0000000 --- a/contests/Round859(Div4)/C/main.cpp +++ /dev/null @@ -1,164 +0,0 @@ -#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(Div4)/C/main_input0.txt b/contests/Round859(Div4)/C/main_input0.txt deleted file mode 100644 index e3b21b8..0000000 --- a/contests/Round859(Div4)/C/main_input0.txt +++ /dev/null @@ -1,17 +0,0 @@ -8 -7 -abacaba -2 -aa -1 -y -4 -bkpt -6 -ninfia -6 -banana -10 -codeforces -8 -testcase diff --git a/contests/Round859(Div4)/C/main_output0.txt b/contests/Round859(Div4)/C/main_output0.txt deleted file mode 100644 index 3876667..0000000 --- a/contests/Round859(Div4)/C/main_output0.txt +++ /dev/null @@ -1,8 +0,0 @@ -YES -NO -YES -YES -NO -YES -NO -NO diff --git a/contests/Round859(Div4)/D/main b/contests/Round859(Div4)/D/main Binary files differdeleted file mode 100755 index 7778923..0000000 --- a/contests/Round859(Div4)/D/main +++ /dev/null diff --git a/contests/Round859(Div4)/D/main.cpp b/contests/Round859(Div4)/D/main.cpp deleted file mode 100755 index 62f9db4..0000000 --- a/contests/Round859(Div4)/D/main.cpp +++ /dev/null @@ -1,174 +0,0 @@ -#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-- |