From 60214bc8d0cfa68c1e3b74b62d9dcd1f548390eb Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Sun, 24 Sep 2023 21:04:29 +0300 Subject: Solved 5 problem in the last Div.4 --- contests/Round897/A/main.cpp | 146 +++++++++++++++++++++++++++++++ contests/Round897/A/main_input0.txt | 7 ++ contests/Round897/A/main_input1.txt | 3 + contests/Round897/A/main_input2.txt | 3 + contests/Round897/A/main_output0.txt | 3 + contests/Round897/A/main_output1.txt | 1 + contests/Round897/A/main_output2.txt | 1 + contests/Round897/B/main.cpp | 165 +++++++++++++++++++++++++++++++++++ contests/Round897/B/main_input0.txt | 11 +++ contests/Round897/B/main_input1.txt | 3 + contests/Round897/B/main_output0.txt | 5 ++ contests/Round897/B/main_output1.txt | 1 + contests/Round897/C/main.cpp | 129 +++++++++++++++++++++++++++ contests/Round897/D/main.cpp | 129 +++++++++++++++++++++++++++ contests/Round897/E/main.cpp | 129 +++++++++++++++++++++++++++ contests/Round897/F/main.cpp | 129 +++++++++++++++++++++++++++ 16 files changed, 865 insertions(+) create mode 100755 contests/Round897/A/main.cpp create mode 100644 contests/Round897/A/main_input0.txt create mode 100644 contests/Round897/A/main_input1.txt create mode 100644 contests/Round897/A/main_input2.txt create mode 100644 contests/Round897/A/main_output0.txt create mode 100644 contests/Round897/A/main_output1.txt create mode 100644 contests/Round897/A/main_output2.txt create mode 100755 contests/Round897/B/main.cpp create mode 100644 contests/Round897/B/main_input0.txt create mode 100644 contests/Round897/B/main_input1.txt create mode 100644 contests/Round897/B/main_output0.txt create mode 100644 contests/Round897/B/main_output1.txt create mode 100755 contests/Round897/C/main.cpp create mode 100755 contests/Round897/D/main.cpp create mode 100755 contests/Round897/E/main.cpp create mode 100755 contests/Round897/F/main.cpp (limited to 'contests/Round897') diff --git a/contests/Round897/A/main.cpp b/contests/Round897/A/main.cpp new file mode 100755 index 0000000..7f5ebac --- /dev/null +++ b/contests/Round897/A/main.cpp @@ -0,0 +1,146 @@ +#include +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +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 +ostream &operator<<(ostream &os, const pair &p); +template ostream &operator<<(ostream &os, const vector &vec); +template +ostream &operator<<(ostream &os, const map &m); +template +ostream &operator<<(ostream &os, const unordered_map &m); +template ostream &operator<<(ostream &os, const set &s); +template +ostream &operator<<(ostream &os, const unordered_set &s); + +template +ostream &operator<<(ostream &os, const pair &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template ostream &operator<<(ostream &os, const vector &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template ostream &operator<<(ostream &os, const set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_set &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 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; + vector v(n); + vi b(n); + for (int i = 0; i < n; i++) { + cin >> v[i].first; + v[i].second = i; + } + sort(rall(v)); + for (int i = 0; i < n; i++) { + b[v[i].second] = i + 1; + } + for (int i = 0; i < n; i++) { + cout << b[i] << " \n"[i == n - 1]; + } +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/contests/Round897/A/main_input0.txt b/contests/Round897/A/main_input0.txt new file mode 100644 index 0000000..5ffc211 --- /dev/null +++ b/contests/Round897/A/main_input0.txt @@ -0,0 +1,7 @@ +3 +1 +100000 +2 +1 1 +3 +10 3 3 diff --git a/contests/Round897/A/main_input1.txt b/contests/Round897/A/main_input1.txt new file mode 100644 index 0000000..e598f55 --- /dev/null +++ b/contests/Round897/A/main_input1.txt @@ -0,0 +1,3 @@ +1 +5 +8 7 6 5 3 \ No newline at end of file diff --git a/contests/Round897/A/main_input2.txt b/contests/Round897/A/main_input2.txt new file mode 100644 index 0000000..05d1ebb --- /dev/null +++ b/contests/Round897/A/main_input2.txt @@ -0,0 +1,3 @@ +1 +5 +9 5 3 7 4 \ No newline at end of file diff --git a/contests/Round897/A/main_output0.txt b/contests/Round897/A/main_output0.txt new file mode 100644 index 0000000..bd92684 --- /dev/null +++ b/contests/Round897/A/main_output0.txt @@ -0,0 +1,3 @@ +1 +2 1 +1 3 2 diff --git a/contests/Round897/A/main_output1.txt b/contests/Round897/A/main_output1.txt new file mode 100644 index 0000000..3cacc0b --- /dev/null +++ b/contests/Round897/A/main_output1.txt @@ -0,0 +1 @@ +12 \ No newline at end of file diff --git a/contests/Round897/A/main_output2.txt b/contests/Round897/A/main_output2.txt new file mode 100644 index 0000000..a5b4030 --- /dev/null +++ b/contests/Round897/A/main_output2.txt @@ -0,0 +1 @@ +1 3 5 2 4 \ No newline at end of file diff --git a/contests/Round897/B/main.cpp b/contests/Round897/B/main.cpp new file mode 100755 index 0000000..ad96ddc --- /dev/null +++ b/contests/Round897/B/main.cpp @@ -0,0 +1,165 @@ +#include +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +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 +ostream &operator<<(ostream &os, const pair &p); +template ostream &operator<<(ostream &os, const vector &vec); +template +ostream &operator<<(ostream &os, const map &m); +template +ostream &operator<<(ostream &os, const unordered_map &m); +template ostream &operator<<(ostream &os, const set &s); +template +ostream &operator<<(ostream &os, const unordered_set &s); + +template +ostream &operator<<(ostream &os, const pair &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template ostream &operator<<(ostream &os, const vector &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template ostream &operator<<(ostream &os, const set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_set &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 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 + */ + +// ones = 2 +// zrs = 4 +// 2 -> (0, 6) +// 3 -> (3, 3) +// 3 -> (3, 3) +// ones = 1 +// zrs = 1 + +void solve() { + int n; + cin >> n; + string s; + cin >> s; + int mn = 0, mx = n % 2; + for (int i = 0; i < n / 2; i++) { + if (s[i] == s[n - 1 - i]) { + mn += 0; + mx += 2; + } else { + mn += 1; + mx += 1; + } + } + dbg(mn, mx); + string ans = string(n + 1, '0'); + if (n % 2 == 0) { + for (int i = mn; i <= mx; i += 2) { + ans[i] = '1'; + } + } else { + for (int i = mn; i <= mx; i++) { + ans[i] = '1'; + } + } + cout << ans << '\n'; +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/contests/Round897/B/main_input0.txt b/contests/Round897/B/main_input0.txt new file mode 100644 index 0000000..10a3274 --- /dev/null +++ b/contests/Round897/B/main_input0.txt @@ -0,0 +1,11 @@ +5 +6 +101011 +5 +00000 +9 +100100011 +3 +100 +1 +1 diff --git a/contests/Round897/B/main_input1.txt b/contests/Round897/B/main_input1.txt new file mode 100644 index 0000000..c64122e --- /dev/null +++ b/contests/Round897/B/main_input1.txt @@ -0,0 +1,3 @@ +1 +2 +10 \ No newline at end of file diff --git a/contests/Round897/B/main_output0.txt b/contests/Round897/B/main_output0.txt new file mode 100644 index 0000000..ad36f78 --- /dev/null +++ b/contests/Round897/B/main_output0.txt @@ -0,0 +1,5 @@ +0010100 +111111 +0011111100 +0110 +11 diff --git a/contests/Round897/B/main_output1.txt b/contests/Round897/B/main_output1.txt new file mode 100644 index 0000000..fd594a5 --- /dev/null +++ b/contests/Round897/B/main_output1.txt @@ -0,0 +1 @@ +000 \ No newline at end of file diff --git a/contests/Round897/C/main.cpp b/contests/Round897/C/main.cpp new file mode 100755 index 0000000..82c5879 --- /dev/null +++ b/contests/Round897/C/main.cpp @@ -0,0 +1,129 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +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 +ostream &operator<<(ostream &os, const pair &p); +template ostream &operator<<(ostream &os, const vector &vec); +template +ostream &operator<<(ostream &os, const map &m); +template +ostream &operator<<(ostream &os, const unordered_map &m); +template ostream &operator<<(ostream &os, const set &s); +template +ostream &operator<<(ostream &os, const unordered_set &s); + +template +ostream &operator<<(ostream &os, const pair &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template ostream &operator<<(ostream &os, const vector &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template ostream &operator<<(ostream &os, const set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_set &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 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 main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/contests/Round897/D/main.cpp b/contests/Round897/D/main.cpp new file mode 100755 index 0000000..82c5879 --- /dev/null +++ b/contests/Round897/D/main.cpp @@ -0,0 +1,129 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +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 +ostream &operator<<(ostream &os, const pair &p); +template ostream &operator<<(ostream &os, const vector &vec); +template +ostream &operator<<(ostream &os, const map &m); +template +ostream &operator<<(ostream &os, const unordered_map &m); +template ostream &operator<<(ostream &os, const set &s); +template +ostream &operator<<(ostream &os, const unordered_set &s); + +template +ostream &operator<<(ostream &os, const pair &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template ostream &operator<<(ostream &os, const vector &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template ostream &operator<<(ostream &os, const set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_set &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 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 main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/contests/Round897/E/main.cpp b/contests/Round897/E/main.cpp new file mode 100755 index 0000000..82c5879 --- /dev/null +++ b/contests/Round897/E/main.cpp @@ -0,0 +1,129 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +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 +ostream &operator<<(ostream &os, const pair &p); +template ostream &operator<<(ostream &os, const vector &vec); +template +ostream &operator<<(ostream &os, const map &m); +template +ostream &operator<<(ostream &os, const unordered_map &m); +template ostream &operator<<(ostream &os, const set &s); +template +ostream &operator<<(ostream &os, const unordered_set &s); + +template +ostream &operator<<(ostream &os, const pair &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template ostream &operator<<(ostream &os, const vector &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template ostream &operator<<(ostream &os, const set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_set &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 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 main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/contests/Round897/F/main.cpp b/contests/Round897/F/main.cpp new file mode 100755 index 0000000..82c5879 --- /dev/null +++ b/contests/Round897/F/main.cpp @@ -0,0 +1,129 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +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 +ostream &operator<<(ostream &os, const pair &p); +template ostream &operator<<(ostream &os, const vector &vec); +template +ostream &operator<<(ostream &os, const map &m); +template +ostream &operator<<(ostream &os, const unordered_map &m); +template ostream &operator<<(ostream &os, const set &s); +template +ostream &operator<<(ostream &os, const unordered_set &s); + +template +ostream &operator<<(ostream &os, const pair &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template ostream &operator<<(ostream &os, const vector &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template ostream &operator<<(ostream &os, const set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_set &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 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 main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} -- cgit v1.2.3