From 6411812a630e4230af27705d11f30405fbd83a68 Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Mon, 20 Mar 2023 01:21:59 +0200 Subject: Solved 7 problems in Div4 --- codeforces/Line/main | Bin 0 -> 42568 bytes codeforces/Line/main.cpp | 166 +++++++++++++++++++++++++++++++++++++++ codeforces/Line/main_input0.txt | 13 +++ codeforces/Line/main_input1.txt | 3 + codeforces/Line/main_input2.txt | 3 + codeforces/Line/main_input3.txt | 3 + codeforces/Line/main_output0.txt | 6 ++ codeforces/Line/main_output1.txt | 1 + codeforces/Line/main_output2.txt | 1 + codeforces/Line/main_output3.txt | 1 + 10 files changed, 197 insertions(+) create mode 100755 codeforces/Line/main create mode 100755 codeforces/Line/main.cpp create mode 100644 codeforces/Line/main_input0.txt create mode 100644 codeforces/Line/main_input1.txt create mode 100644 codeforces/Line/main_input2.txt create mode 100644 codeforces/Line/main_input3.txt create mode 100644 codeforces/Line/main_output0.txt create mode 100644 codeforces/Line/main_output1.txt create mode 100644 codeforces/Line/main_output2.txt create mode 100644 codeforces/Line/main_output3.txt (limited to 'codeforces/Line') diff --git a/codeforces/Line/main b/codeforces/Line/main new file mode 100755 index 0000000..a52a8c4 Binary files /dev/null and b/codeforces/Line/main differ diff --git a/codeforces/Line/main.cpp b/codeforces/Line/main.cpp new file mode 100755 index 0000000..7a06f97 --- /dev/null +++ b/codeforces/Line/main.cpp @@ -0,0 +1,166 @@ +#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 print() { + cerr << "\n"; +} + +template +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; + ll ans = 0; + if (n == 1) { + cout << 0 << '\n'; + return; + } + for (int i = 0; i < n; i++) { + if (s[i] == 'L') { + ans += i; + } else { + ans += n - 1 - i; + } + } + vll ret; + for (int i = 0; i < n / 2; i++) { + int r = n - i - 1; + if (s[i] == 'L') { + ans += r - i; + ret.pb(ans); + } + if (s[r] == 'R') { + ans += 2 * r + 1 - n; + ret.pb(ans); + } + } + ret.pb(ans); + sort(all(ret)); + for (int i = 0; i < n; i++) { + int mn = min(i, (int)ret.size() - 1); + cout << ret[mn] << " "; + } + cout << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/Line/main_input0.txt b/codeforces/Line/main_input0.txt new file mode 100644 index 0000000..89d0350 --- /dev/null +++ b/codeforces/Line/main_input0.txt @@ -0,0 +1,13 @@ +6 +3 +LLR +5 +LRRLL +1 +L +12 +LRRRLLLRLLRL +10 +LLLLLRRRRR +9 +LRLRLRLRL diff --git a/codeforces/Line/main_input1.txt b/codeforces/Line/main_input1.txt new file mode 100644 index 0000000..0fb1697 --- /dev/null +++ b/codeforces/Line/main_input1.txt @@ -0,0 +1,3 @@ +1 +2 +LL \ No newline at end of file diff --git a/codeforces/Line/main_input2.txt b/codeforces/Line/main_input2.txt new file mode 100644 index 0000000..dd63b98 --- /dev/null +++ b/codeforces/Line/main_input2.txt @@ -0,0 +1,3 @@ +1 +2 +LR \ No newline at end of file diff --git a/codeforces/Line/main_input3.txt b/codeforces/Line/main_input3.txt new file mode 100644 index 0000000..4ed6e0b --- /dev/null +++ b/codeforces/Line/main_input3.txt @@ -0,0 +1,3 @@ +1 +100 +LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR \ No newline at end of file diff --git a/codeforces/Line/main_output0.txt b/codeforces/Line/main_output0.txt new file mode 100644 index 0000000..7112271 --- /dev/null +++ b/codeforces/Line/main_output0.txt @@ -0,0 +1,6 @@ +3 5 5 +16 16 16 16 16 +0 +86 95 98 101 102 102 102 102 102 102 102 102 +29 38 45 52 57 62 65 68 69 70 +44 50 54 56 56 56 56 56 56 diff --git a/codeforces/Line/main_output1.txt b/codeforces/Line/main_output1.txt new file mode 100644 index 0000000..6ad1e30 --- /dev/null +++ b/codeforces/Line/main_output1.txt @@ -0,0 +1 @@ +2 2 \ No newline at end of file diff --git a/codeforces/Line/main_output2.txt b/codeforces/Line/main_output2.txt new file mode 100644 index 0000000..1c6ae71 --- /dev/null +++ b/codeforces/Line/main_output2.txt @@ -0,0 +1 @@ +1 2 \ No newline at end of file diff --git a/codeforces/Line/main_output3.txt b/codeforces/Line/main_output3.txt new file mode 100644 index 0000000..a7a0df5 --- /dev/null +++ b/codeforces/Line/main_output3.txt @@ -0,0 +1 @@ +1 2 3 4 5 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 \ No newline at end of file -- cgit v1.2.3