diff options
Diffstat (limited to 'codeforces')
20 files changed, 643 insertions, 16 deletions
diff --git a/codeforces/FedyaAndArray/CompetiTestTestcases38_input0.txt b/codeforces/FedyaAndArray/CompetiTestTestcases38_input0.txt new file mode 100644 index 0000000..c734641 --- /dev/null +++ b/codeforces/FedyaAndArray/CompetiTestTestcases38_input0.txt @@ -0,0 +1,2 @@ +1 +-3 -4
\ No newline at end of file diff --git a/codeforces/FedyaAndArray/CompetiTestTestcases38_output0.txt b/codeforces/FedyaAndArray/CompetiTestTestcases38_output0.txt new file mode 100644 index 0000000..66c441f --- /dev/null +++ b/codeforces/FedyaAndArray/CompetiTestTestcases38_output0.txt @@ -0,0 +1 @@ +???
\ No newline at end of file diff --git a/codeforces/FedyaAndArray/main b/codeforces/FedyaAndArray/main Binary files differnew file mode 100755 index 0000000..cbbf0ee --- /dev/null +++ b/codeforces/FedyaAndArray/main diff --git a/codeforces/FedyaAndArray/main.cpp b/codeforces/FedyaAndArray/main.cpp new file mode 100755 index 0000000..a70b90d --- /dev/null +++ b/codeforces/FedyaAndArray/main.cpp @@ -0,0 +1,143 @@ +#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 dbg() { cerr << "\n"; } + +template <typename T, typename... TS> void dbg(T val, TS... vals) { + cerr << val << " "; + dbg(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 + */ + +// 0 1 0 1 0 1 0 -1 0 -1 +// 0 1 0 1 0 1 0 1 0 -1 0 -1 0 -1 0 -1 +// -2 -1 0 1 2 3 2 1 0 -1 +void solve() { + int x, y; + cin >> x >> y; + int n = 2 * (x - y); + cout << n << '\n'; + for (int i = y; i <= x; i++) { + cout << i << ' '; + } + for (int i = x - 1; i > y; i--) { + cout << i << " \n"[i == y - 1]; + } +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/codeforces/FedyaAndArray/main_input0.txt b/codeforces/FedyaAndArray/main_input0.txt new file mode 100644 index 0000000..ce722af --- /dev/null +++ b/codeforces/FedyaAndArray/main_input0.txt @@ -0,0 +1,5 @@ +4 +3 -2 +4 -4 +2 -1 +5 -3 diff --git a/codeforces/FedyaAndArray/main_output0.txt b/codeforces/FedyaAndArray/main_output0.txt new file mode 100644 index 0000000..084f239 --- /dev/null +++ b/codeforces/FedyaAndArray/main_output0.txt @@ -0,0 +1,8 @@ +10 +0 1 2 1 0 -1 0 -1 0 1 +16 +-2 -1 -2 -1 0 1 2 3 4 5 4 3 2 1 0 -1 +6 +1 0 -1 0 1 0 +16 +2 3 2 1 0 -1 0 -1 0 -1 0 1 2 1 0 1 diff --git a/codeforces/LongLong/main b/codeforces/LongLong/main Binary files differnew file mode 100755 index 0000000..79216e9 --- /dev/null +++ b/codeforces/LongLong/main diff --git a/codeforces/LongLong/main.cpp b/codeforces/LongLong/main.cpp new file mode 100755 index 0000000..2cb7fab --- /dev/null +++ b/codeforces/LongLong/main.cpp @@ -0,0 +1,148 @@ +#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 dbg() { cerr << "\n"; } + +template <typename T, typename... TS> void dbg(T val, TS... vals) { + cerr << val << " "; + dbg(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; + vll v(n); + ll sum = 0; + for (int i = 0; i < n; i++) { + cin >> v[i]; + sum += abs(v[i]); + } + int ops = 0; + for (int i = 0; i < n; i++) { + if (v[i] < 0) { + ops++; + while (i < n && v[i] <= 0) { + i++; + } + } + } + cout << sum << ' ' << ops << '\n'; +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/codeforces/LongLong/main_input0.txt b/codeforces/LongLong/main_input0.txt new file mode 100644 index 0000000..18e1a67 --- /dev/null +++ b/codeforces/LongLong/main_input0.txt @@ -0,0 +1,11 @@ +5 +6 +-1 7 -4 -2 5 -8 +8 +-1 0 0 -2 1 0 -3 0 +5 +2 -1 0 -3 -7 +5 +0 -17 0 1 0 +4 +-1 0 -2 -1 diff --git a/codeforces/LongLong/main_output0.txt b/codeforces/LongLong/main_output0.txt new file mode 100644 index 0000000..d3c1448 --- /dev/null +++ b/codeforces/LongLong/main_output0.txt @@ -0,0 +1,5 @@ +27 3 +7 2 +13 1 +18 1 +4 1 diff --git a/codeforces/SashaAndArrayColoring/main b/codeforces/SashaAndArrayColoring/main Binary files differnew file mode 100755 index 0000000..b3709ec --- /dev/null +++ b/codeforces/SashaAndArrayColoring/main diff --git a/codeforces/SashaAndArrayColoring/main.cpp b/codeforces/SashaAndArrayColoring/main.cpp new file mode 100755 index 0000000..f2ecfc2 --- /dev/null +++ b/codeforces/SashaAndArrayColoring/main.cpp @@ -0,0 +1,142 @@ +#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 dbg() { cerr << "\n"; } + +template <typename T, typename... TS> void dbg(T val, TS... vals) { + cerr << val << " "; + dbg(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 (int i = 0; i < n; i++) { + cin >> v[i]; + } + sort(all(v)); + int ans = 0; + for (int i = 0; i < n / 2; i++) { + ans += v[n - 1 - i] - v[i]; + } + cout << ans << '\n'; +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/codeforces/SashaAndArrayColoring/main_input0.txt b/codeforces/SashaAndArrayColoring/main_input0.txt new file mode 100644 index 0000000..579024f --- /dev/null +++ b/codeforces/SashaAndArrayColoring/main_input0.txt @@ -0,0 +1,13 @@ +6 +5 +1 5 6 3 4 +1 +5 +4 +1 6 3 9 +6 +1 13 9 3 7 2 +4 +2 2 2 2 +5 +4 5 2 2 3 diff --git a/codeforces/SashaAndArrayColoring/main_output0.txt b/codeforces/SashaAndArrayColoring/main_output0.txt new file mode 100644 index 0000000..ff21969 --- /dev/null +++ b/codeforces/SashaAndArrayColoring/main_output0.txt @@ -0,0 +1,6 @@ +7 +0 +11 +23 +0 +5 diff --git a/codeforces/SumInBinaryTree/main b/codeforces/SumInBinaryTree/main Binary files differnew file mode 100755 index 0000000..1c6bcad --- /dev/null +++ b/codeforces/SumInBinaryTree/main diff --git a/codeforces/SumInBinaryTree/main.cpp b/codeforces/SumInBinaryTree/main.cpp new file mode 100755 index 0000000..f5881db --- /dev/null +++ b/codeforces/SumInBinaryTree/main.cpp @@ -0,0 +1,138 @@ +#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 dbg() { cerr << "\n"; } + +template <typename T, typename... TS> void dbg(T val, TS... vals) { + cerr << val << " "; + dbg(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() { + ll n; + cin >> n; + ll ans = n; + while (n) { + ans += n / 2; + n /= 2; + } + cout << ans << '\n'; +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/codeforces/SumInBinaryTree/main_input0.txt b/codeforces/SumInBinaryTree/main_input0.txt new file mode 100644 index 0000000..b27450f --- /dev/null +++ b/codeforces/SumInBinaryTree/main_input0.txt @@ -0,0 +1,7 @@ +6 +3 +10 +37 +1 +10000000000000000 +15 diff --git a/codeforces/SumInBinaryTree/main_output0.txt b/codeforces/SumInBinaryTree/main_output0.txt new file mode 100644 index 0000000..158fc61 --- /dev/null +++ b/codeforces/SumInBinaryTree/main_output0.txt @@ -0,0 +1,6 @@ +4 +18 +71 +1 +19999999999999980 +26 diff --git a/codeforces/YetAnotherPromotion/main b/codeforces/YetAnotherPromotion/main Binary files differindex 9b890d0..a18a652 100755 --- a/codeforces/YetAnotherPromotion/main +++ b/codeforces/YetAnotherPromotion/main diff --git a/codeforces/YetAnotherPromotion/main.cpp b/codeforces/YetAnotherPromotion/main.cpp index a772000..641c42d 100755 --- a/codeforces/YetAnotherPromotion/main.cpp +++ b/codeforces/YetAnotherPromotion/main.cpp @@ -116,27 +116,19 @@ template <typename T, typename... TS> void print(T val, TS... vals) { * DON'T GET STUCK ON ONE APPROACH */ +// 2 * x + x = 10 +// x(m + 1) = 10 + void solve() { ll a, b, n, m; cin >> a >> b >> n >> m; - if (m >= n) { - cout << min(a, b) * n << '\n'; - return; - } ll ans = 0; - if (m < n) { - if ((a * m) / (m + 1) <= b) { - ans += (n * m / (m + 1)) * a; - int x = (n * m / (m + 1)); - n -= x + x / m; - } else { - ans += b * n; - n = 0; - } - } - if (n == 1) { - ans += min(a, b); + ll rem = n; + if (a * m <= b * (m + 1)) { + ans += a * m * (n / (m + 1)); + rem = n % (m + 1); } + ans += rem * min(a, b); cout << ans << '\n'; } |