diff options
Diffstat (limited to 'codeforces')
22 files changed, 720 insertions, 0 deletions
diff --git a/codeforces/Colourblindness/main b/codeforces/Colourblindness/main Binary files differnew file mode 100755 index 0000000..532fff1 --- /dev/null +++ b/codeforces/Colourblindness/main diff --git a/codeforces/Colourblindness/main.cpp b/codeforces/Colourblindness/main.cpp new file mode 100755 index 0000000..1142da3 --- /dev/null +++ b/codeforces/Colourblindness/main.cpp @@ -0,0 +1,147 @@ +#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; + vector<string> v(2); + for (auto &s : v) { + cin >> s; + } + bool ok = true; + for (int j = 0; j < n; j++) { + char f = v[0][j]; + char s = v[1][j]; + if ((f == 'R' and s != 'R') or (s == 'R' and f != 'R')) { + 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/codeforces/Colourblindness/main_input0.txt b/codeforces/Colourblindness/main_input0.txt new file mode 100644 index 0000000..187ca0b --- /dev/null +++ b/codeforces/Colourblindness/main_input0.txt @@ -0,0 +1,19 @@ +6 +2 +RG +RB +4 +GRBG +GBGB +5 +GGGGG +BBBBB +7 +BBBBBBB +RRRRRRR +8 +RGBRRGBR +RGGRRBGR +1 +G +G diff --git a/codeforces/Colourblindness/main_output0.txt b/codeforces/Colourblindness/main_output0.txt new file mode 100644 index 0000000..60052d7 --- /dev/null +++ b/codeforces/Colourblindness/main_output0.txt @@ -0,0 +1,6 @@ +YES +NO +YES +NO +YES +YES diff --git a/codeforces/Line/main b/codeforces/Line/main Binary files differnew file mode 100755 index 0000000..a52a8c4 --- /dev/null +++ b/codeforces/Line/main 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<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; + 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 diff --git a/codeforces/SpellCheck/main b/codeforces/SpellCheck/main Binary files differnew file mode 100755 index 0000000..5b26632 --- /dev/null +++ b/codeforces/SpellCheck/main diff --git a/codeforces/SpellCheck/main.cpp b/codeforces/SpellCheck/main.cpp new file mode 100755 index 0000000..c1be581 --- /dev/null +++ b/codeforces/SpellCheck/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 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; + sort(all(s)); + print(s); + if (s == "Timru") { + 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/codeforces/SpellCheck/main_input0.txt b/codeforces/SpellCheck/main_input0.txt new file mode 100644 index 0000000..d8e5471 --- /dev/null +++ b/codeforces/SpellCheck/main_input0.txt @@ -0,0 +1,21 @@ +10 +5 +Timur +5 +miurT +5 +Trumi +5 +mriTu +5 +timur +4 +Timr +6 +Timuur +10 +codeforces +10 +TimurTimur +5 +TIMUR diff --git a/codeforces/SpellCheck/main_output0.txt b/codeforces/SpellCheck/main_output0.txt new file mode 100644 index 0000000..fbba558 --- /dev/null +++ b/codeforces/SpellCheck/main_output0.txt @@ -0,0 +1,10 @@ +YES +YES +YES +YES +NO +NO +NO +NO +NO +NO diff --git a/codeforces/WordGame/main b/codeforces/WordGame/main Binary files differnew file mode 100755 index 0000000..e8c358b --- /dev/null +++ b/codeforces/WordGame/main diff --git a/codeforces/WordGame/main.cpp b/codeforces/WordGame/main.cpp new file mode 100755 index 0000000..47effe0 --- /dev/null +++ b/codeforces/WordGame/main.cpp @@ -0,0 +1,161 @@ +#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; + vector<vector<string>> v(3, vector<string>(n)); + unordered_map<string, pair<int, vector<int>>> fq; + set<string> st; + for (int i = 0; i < 3; i++) { + for (int j = 0; j < n; j++) { + string s; + cin >> s; + v[i][j] = s; + st.insert(s); + fq[s].first++; + fq[s].second.pb(i); + } + } + vi ans(3); + for (auto s : st) { + auto x = fq[s]; + if (x.first == 1) { + ans[x.second[0]] += 3; + } else if (x.first == 2) { + for (auto e : x.second) { + ans[e] += 1; + } + } + } + for (auto x : ans) { + cout << x << " "; + } + cout << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/WordGame/main_input0.txt b/codeforces/WordGame/main_input0.txt new file mode 100644 index 0000000..b10577d --- /dev/null +++ b/codeforces/WordGame/main_input0.txt @@ -0,0 +1,13 @@ +3 +1 +abc +def +abc +3 +orz for qaq +qaq orz for +cod for ces +5 +iat roc hem ica lly +bac ter iol ogi sts +bac roc lly iol iat diff --git a/codeforces/WordGame/main_output0.txt b/codeforces/WordGame/main_output0.txt new file mode 100644 index 0000000..ccde6af --- /dev/null +++ b/codeforces/WordGame/main_output0.txt @@ -0,0 +1,3 @@ +1 3 1 +2 2 6 +9 11 5 |