From 90c03b3c6301f5d8908ce3e2dec936a74b035014 Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Sun, 5 Mar 2023 20:04:34 +0200 Subject: Solved a bunch of problems --- contests/Round#853/A/main | Bin 0 -> 43664 bytes contests/Round#853/A/main.cpp | 116 ++++++++++++++++++++++++++++ contests/Round#853/A/main_input0.txt | 13 ++++ contests/Round#853/A/main_output0.txt | 6 ++ "contests/Round#853/B/\\" | 105 +++++++++++++++++++++++++ contests/Round#853/B/main | Bin 0 -> 50488 bytes contests/Round#853/B/main.cpp | 107 +++++++++++++++++++++++++ contests/Round#853/B/main_input0.txt | 7 ++ contests/Round#853/B/main_input1.txt | 3 + contests/Round#853/B/main_input2.txt | 3 + contests/Round#853/B/main_input3.txt | 3 + contests/Round#853/B/main_input4.txt | 3 + contests/Round#853/B/main_input5.txt | 3 + contests/Round#853/B/main_input6.txt | 3 + contests/Round#853/B/main_input7.txt | 3 + contests/Round#853/B/main_output0.txt | 3 + contests/Round#853/B/main_output1.txt | 1 + contests/Round#853/B/main_output2.txt | 1 + contests/Round#853/B/main_output3.txt | 1 + contests/Round#853/B/main_output4.txt | 1 + contests/Round#853/B/main_output5.txt | 1 + contests/Round#853/B/main_output6.txt | 1 + contests/Round#853/B/main_output7.txt | 1 + contests/Round#853/C/main.cpp | 89 +++++++++++++++++++++ contests/Round#853/D/main.cpp | 89 +++++++++++++++++++++ contests/Round#853/E/main.cpp | 89 +++++++++++++++++++++ contests/Round#853/F/main.cpp | 89 +++++++++++++++++++++ contests/Round#855(Div3)/A/main | Bin 0 -> 600032 bytes contests/Round#855(Div3)/A/main.cpp | 101 ++++++++++++++++++++++++ contests/Round#855(Div3)/A/main_input0.txt | 15 ++++ contests/Round#855(Div3)/A/main_output0.txt | 7 ++ contests/Round#855(Div3)/B/main | Bin 0 -> 50880 bytes contests/Round#855(Div3)/B/main.cpp | 113 +++++++++++++++++++++++++++ contests/Round#855(Div3)/B/main_input0.txt | 11 +++ contests/Round#855(Div3)/B/main_input1.txt | 3 + contests/Round#855(Div3)/B/main_output0.txt | 5 ++ contests/Round#855(Div3)/B/main_output1.txt | 1 + contests/Round#855(Div3)/C/main | Bin 0 -> 35160 bytes contests/Round#855(Div3)/C/main.cpp | 107 +++++++++++++++++++++++++ contests/Round#855(Div3)/C/main_input0.txt | 11 +++ contests/Round#855(Div3)/C/main_output0.txt | 5 ++ contests/Round#855(Div3)/D/main | Bin 0 -> 18456 bytes contests/Round#855(Div3)/D/main.cpp | 98 +++++++++++++++++++++++ contests/Round#855(Div3)/D/main_input0.txt | 15 ++++ contests/Round#855(Div3)/D/main_output0.txt | 7 ++ contests/Round#855(Div3)/E/main.cpp | 89 +++++++++++++++++++++ contests/Round#855(Div3)/F/main.cpp | 89 +++++++++++++++++++++ contests/Round#856(Div2)/A/main | Bin 0 -> 82000 bytes contests/Round#856(Div2)/A/main.cpp | 108 ++++++++++++++++++++++++++ contests/Round#856(Div2)/A/main_input0.txt | 11 +++ contests/Round#856(Div2)/A/main_output0.txt | 5 ++ contests/Round#856(Div2)/B/main | Bin 0 -> 22480 bytes contests/Round#856(Div2)/B/main.cpp | 95 +++++++++++++++++++++++ contests/Round#856(Div2)/B/main_input0.txt | 7 ++ contests/Round#856(Div2)/B/main_input1.txt | 3 + contests/Round#856(Div2)/B/main_input2.txt | 3 + contests/Round#856(Div2)/B/main_output0.txt | 3 + contests/Round#856(Div2)/B/main_output1.txt | 1 + contests/Round#856(Div2)/B/main_output2.txt | 1 + contests/Round#856(Div2)/C/main | Bin 0 -> 21856 bytes contests/Round#856(Div2)/C/main.cpp | 107 +++++++++++++++++++++++++ contests/Round#856(Div2)/C/main_input0.txt | 7 ++ contests/Round#856(Div2)/C/main_output0.txt | 3 + contests/Round#856(Div2)/D/main.cpp | 89 +++++++++++++++++++++ contests/Round#856(Div2)/E/main.cpp | 89 +++++++++++++++++++++ contests/Round#856(Div2)/F/main.cpp | 89 +++++++++++++++++++++ contests/Starters78/D/main | Bin 57544 -> 56552 bytes contests/Starters78/D/main.cpp | 56 ++++++++------ contests/Starters79/A/main | Bin 0 -> 17832 bytes contests/Starters79/A/main.cpp | 103 ++++++++++++++++++++++++ contests/Starters79/A/main_input0.txt | 5 ++ contests/Starters79/A/main_output0.txt | 4 + contests/Starters79/B/main | Bin 0 -> 17736 bytes contests/Starters79/B/main.cpp | 101 ++++++++++++++++++++++++ contests/Starters79/B/main_input0.txt | 4 + contests/Starters79/B/main_output0.txt | 3 + contests/Starters79/C/main | Bin 0 -> 22360 bytes contests/Starters79/C/main.cpp | 101 ++++++++++++++++++++++++ contests/Starters79/C/main_input0.txt | 5 ++ contests/Starters79/C/main_input1.txt | 5 ++ contests/Starters79/C/main_output0.txt | 4 + contests/Starters79/C/main_output1.txt | 4 + contests/Starters79/D/main | Bin 0 -> 17688 bytes contests/Starters79/D/main.cpp | 102 ++++++++++++++++++++++++ contests/Starters79/D/main_input0.txt | 4 + contests/Starters79/D/main_input1.txt | 3 + contests/Starters79/D/main_output0.txt | 3 + contests/Starters79/D/main_output1.txt | 2 + contests/Starters79/E/main.cpp | 89 +++++++++++++++++++++ contests/Starters79/F/main.cpp | 89 +++++++++++++++++++++ 90 files changed, 2703 insertions(+), 23 deletions(-) create mode 100755 contests/Round#853/A/main create mode 100755 contests/Round#853/A/main.cpp create mode 100644 contests/Round#853/A/main_input0.txt create mode 100644 contests/Round#853/A/main_output0.txt create mode 100644 "contests/Round#853/B/\\" create mode 100755 contests/Round#853/B/main create mode 100755 contests/Round#853/B/main.cpp create mode 100644 contests/Round#853/B/main_input0.txt create mode 100644 contests/Round#853/B/main_input1.txt create mode 100644 contests/Round#853/B/main_input2.txt create mode 100644 contests/Round#853/B/main_input3.txt create mode 100644 contests/Round#853/B/main_input4.txt create mode 100644 contests/Round#853/B/main_input5.txt create mode 100644 contests/Round#853/B/main_input6.txt create mode 100644 contests/Round#853/B/main_input7.txt create mode 100644 contests/Round#853/B/main_output0.txt create mode 100644 contests/Round#853/B/main_output1.txt create mode 100644 contests/Round#853/B/main_output2.txt create mode 100644 contests/Round#853/B/main_output3.txt create mode 100644 contests/Round#853/B/main_output4.txt create mode 100644 contests/Round#853/B/main_output5.txt create mode 100644 contests/Round#853/B/main_output6.txt create mode 100644 contests/Round#853/B/main_output7.txt create mode 100755 contests/Round#853/C/main.cpp create mode 100755 contests/Round#853/D/main.cpp create mode 100755 contests/Round#853/E/main.cpp create mode 100755 contests/Round#853/F/main.cpp create mode 100755 contests/Round#855(Div3)/A/main create mode 100755 contests/Round#855(Div3)/A/main.cpp create mode 100644 contests/Round#855(Div3)/A/main_input0.txt create mode 100644 contests/Round#855(Div3)/A/main_output0.txt create mode 100755 contests/Round#855(Div3)/B/main create mode 100755 contests/Round#855(Div3)/B/main.cpp create mode 100644 contests/Round#855(Div3)/B/main_input0.txt create mode 100644 contests/Round#855(Div3)/B/main_input1.txt create mode 100644 contests/Round#855(Div3)/B/main_output0.txt create mode 100644 contests/Round#855(Div3)/B/main_output1.txt create mode 100755 contests/Round#855(Div3)/C/main create mode 100755 contests/Round#855(Div3)/C/main.cpp create mode 100644 contests/Round#855(Div3)/C/main_input0.txt create mode 100644 contests/Round#855(Div3)/C/main_output0.txt create mode 100755 contests/Round#855(Div3)/D/main create mode 100755 contests/Round#855(Div3)/D/main.cpp create mode 100644 contests/Round#855(Div3)/D/main_input0.txt create mode 100644 contests/Round#855(Div3)/D/main_output0.txt create mode 100755 contests/Round#855(Div3)/E/main.cpp create mode 100755 contests/Round#855(Div3)/F/main.cpp create mode 100755 contests/Round#856(Div2)/A/main create mode 100755 contests/Round#856(Div2)/A/main.cpp create mode 100644 contests/Round#856(Div2)/A/main_input0.txt create mode 100644 contests/Round#856(Div2)/A/main_output0.txt create mode 100755 contests/Round#856(Div2)/B/main create mode 100755 contests/Round#856(Div2)/B/main.cpp create mode 100644 contests/Round#856(Div2)/B/main_input0.txt create mode 100644 contests/Round#856(Div2)/B/main_input1.txt create mode 100644 contests/Round#856(Div2)/B/main_input2.txt create mode 100644 contests/Round#856(Div2)/B/main_output0.txt create mode 100644 contests/Round#856(Div2)/B/main_output1.txt create mode 100644 contests/Round#856(Div2)/B/main_output2.txt create mode 100755 contests/Round#856(Div2)/C/main create mode 100755 contests/Round#856(Div2)/C/main.cpp create mode 100644 contests/Round#856(Div2)/C/main_input0.txt create mode 100644 contests/Round#856(Div2)/C/main_output0.txt create mode 100755 contests/Round#856(Div2)/D/main.cpp create mode 100755 contests/Round#856(Div2)/E/main.cpp create mode 100755 contests/Round#856(Div2)/F/main.cpp create mode 100755 contests/Starters79/A/main create mode 100755 contests/Starters79/A/main.cpp create mode 100644 contests/Starters79/A/main_input0.txt create mode 100644 contests/Starters79/A/main_output0.txt create mode 100755 contests/Starters79/B/main create mode 100755 contests/Starters79/B/main.cpp create mode 100644 contests/Starters79/B/main_input0.txt create mode 100644 contests/Starters79/B/main_output0.txt create mode 100755 contests/Starters79/C/main create mode 100755 contests/Starters79/C/main.cpp create mode 100644 contests/Starters79/C/main_input0.txt create mode 100644 contests/Starters79/C/main_input1.txt create mode 100644 contests/Starters79/C/main_output0.txt create mode 100644 contests/Starters79/C/main_output1.txt create mode 100755 contests/Starters79/D/main create mode 100755 contests/Starters79/D/main.cpp create mode 100644 contests/Starters79/D/main_input0.txt create mode 100644 contests/Starters79/D/main_input1.txt create mode 100644 contests/Starters79/D/main_output0.txt create mode 100644 contests/Starters79/D/main_output1.txt create mode 100755 contests/Starters79/E/main.cpp create mode 100755 contests/Starters79/F/main.cpp (limited to 'contests') diff --git a/contests/Round#853/A/main b/contests/Round#853/A/main new file mode 100755 index 0000000..8a4dd75 Binary files /dev/null and b/contests/Round#853/A/main differ diff --git a/contests/Round#853/A/main.cpp b/contests/Round#853/A/main.cpp new file mode 100755 index 0000000..48a23d2 --- /dev/null +++ b/contests/Round#853/A/main.cpp @@ -0,0 +1,116 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +// pretty printing +template void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 + */ + +bool isGood(vi &v) { + int n = v.size(); + int ans = __gcd(v[0], v[1]); + for (int i = 2; i < n; i++) { + ans = __gcd(ans, v[i]); + } + return ans <= n; +} + +bool isBeautiful(vi &v) { + for (int i = 0; i <= v.size() - 2; i++) { + vi newVec = vector(v.begin(), v.begin() + i + 2); + if (!isGood(newVec)) { + return false; + } + } + return true; +} + +void solve() { + int n; + cin >> n; + vi v(n); + for (auto &x : v) + cin >> x; + if (isBeautiful(v)) { + cout << "Yes" << '\n'; + return; + } else { + sort(all(v)); + do { + if (isBeautiful(v)) { + cout << "Yes" << '\n'; + return; + } + } while (next_permutation(all(v))); + } + 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/Round#853/A/main_input0.txt b/contests/Round#853/A/main_input0.txt new file mode 100644 index 0000000..e0ee38b --- /dev/null +++ b/contests/Round#853/A/main_input0.txt @@ -0,0 +1,13 @@ +6 +2 +3 6 +3 +1 2 4 +3 +3 6 1 +3 +15 35 21 +4 +35 10 35 14 +5 +1261 227821 143 4171 1941 diff --git a/contests/Round#853/A/main_output0.txt b/contests/Round#853/A/main_output0.txt new file mode 100644 index 0000000..14668ea --- /dev/null +++ b/contests/Round#853/A/main_output0.txt @@ -0,0 +1,6 @@ +No +Yes +Yes +No +Yes +Yes diff --git "a/contests/Round#853/B/\\" "b/contests/Round#853/B/\\" new file mode 100644 index 0000000..499f739 --- /dev/null +++ "b/contests/Round#853/B/\\" @@ -0,0 +1,105 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +// pretty printing +template void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 + */ + +bool isPalindrome(string &s) { return string(all(s)) == string(rall(s)); } + +void solve() { + int n; + cin >> n; + string s; + cin >> s; + if (isPalindrome(s)) { + cout << "Yes" << '\n'; + } else { + vector pal(n); + if (n & 1) + pal[n / 2] = 1; + for (int i = 0; i < n / 2; i++) { + pal[i] = pal[n - i - 1] = s[i] == s[n - i - 1]; + } + pal.erase(unique(all(pal))); + // string haystack = ""; + // for (int i = 0; i < n / 2; i++) { + // haystack += (pal[i] ? "R" : "W"); + // } + // if (regex_match(haystack, regex("WR+W"))) { + // cout << "No" << '\n'; + // } else { + // 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/Round#853/B/main b/contests/Round#853/B/main new file mode 100755 index 0000000..71f1358 Binary files /dev/null and b/contests/Round#853/B/main differ diff --git a/contests/Round#853/B/main.cpp b/contests/Round#853/B/main.cpp new file mode 100755 index 0000000..12517e2 --- /dev/null +++ b/contests/Round#853/B/main.cpp @@ -0,0 +1,107 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +// pretty printing +template void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 + */ + +bool isPalindrome(string &s) { return string(all(s)) == string(rall(s)); } + +void solve() { + int n; + cin >> n; + string s; + cin >> s; + vector pal(n); + if (n & 1) + pal[n / 2] = 1; + for (int i = 0; i < n / 2; i++) { + pal[i] = pal[n - i - 1] = s[i] == s[n - i - 1]; + } + pal.erase(unique(all(pal)), pal.end()); + n = pal.size(); + if (count(all(pal), 0) <= 2) { + cout << "Yes" << '\n'; + } else { + cout << "No" << '\n'; + } + // string haystack = ""; + // for (int i = 0; i < n / 2; i++) { + // haystack += (pal[i] ? "R" : "W"); + // } + // if (regex_match(haystack, regex("WR+W"))) { + // cout << "No" << '\n'; + // } else { + // 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/Round#853/B/main_input0.txt b/contests/Round#853/B/main_input0.txt new file mode 100644 index 0000000..27013f6 --- /dev/null +++ b/contests/Round#853/B/main_input0.txt @@ -0,0 +1,7 @@ +3 +4 +1001 +5 +10010 +7 +0111011 diff --git a/contests/Round#853/B/main_input1.txt b/contests/Round#853/B/main_input1.txt new file mode 100644 index 0000000..a3582ad --- /dev/null +++ b/contests/Round#853/B/main_input1.txt @@ -0,0 +1,3 @@ +1 +6 +100100 \ No newline at end of file diff --git a/contests/Round#853/B/main_input2.txt b/contests/Round#853/B/main_input2.txt new file mode 100644 index 0000000..33a4575 --- /dev/null +++ b/contests/Round#853/B/main_input2.txt @@ -0,0 +1,3 @@ +1 +6 +011100 \ No newline at end of file diff --git a/contests/Round#853/B/main_input3.txt b/contests/Round#853/B/main_input3.txt new file mode 100644 index 0000000..8435e27 --- /dev/null +++ b/contests/Round#853/B/main_input3.txt @@ -0,0 +1,3 @@ +1 +7 +0011011 \ No newline at end of file diff --git a/contests/Round#853/B/main_input4.txt b/contests/Round#853/B/main_input4.txt new file mode 100644 index 0000000..c64122e --- /dev/null +++ b/contests/Round#853/B/main_input4.txt @@ -0,0 +1,3 @@ +1 +2 +10 \ No newline at end of file diff --git a/contests/Round#853/B/main_input5.txt b/contests/Round#853/B/main_input5.txt new file mode 100644 index 0000000..82c90df --- /dev/null +++ b/contests/Round#853/B/main_input5.txt @@ -0,0 +1,3 @@ +1 +2 +01 \ No newline at end of file diff --git a/contests/Round#853/B/main_input6.txt b/contests/Round#853/B/main_input6.txt new file mode 100644 index 0000000..4efbaa0 --- /dev/null +++ b/contests/Round#853/B/main_input6.txt @@ -0,0 +1,3 @@ +1 +9 +110000101 \ No newline at end of file diff --git a/contests/Round#853/B/main_input7.txt b/contests/Round#853/B/main_input7.txt new file mode 100644 index 0000000..90e47d5 --- /dev/null +++ b/contests/Round#853/B/main_input7.txt @@ -0,0 +1,3 @@ +1 +8 +00001000 \ No newline at end of file diff --git a/contests/Round#853/B/main_output0.txt b/contests/Round#853/B/main_output0.txt new file mode 100644 index 0000000..3e42eac --- /dev/null +++ b/contests/Round#853/B/main_output0.txt @@ -0,0 +1,3 @@ +Yes +Yes +No diff --git a/contests/Round#853/B/main_output1.txt b/contests/Round#853/B/main_output1.txt new file mode 100644 index 0000000..289cc91 --- /dev/null +++ b/contests/Round#853/B/main_output1.txt @@ -0,0 +1 @@ +No \ No newline at end of file diff --git a/contests/Round#853/B/main_output2.txt b/contests/Round#853/B/main_output2.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round#853/B/main_output2.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round#853/B/main_output3.txt b/contests/Round#853/B/main_output3.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round#853/B/main_output3.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round#853/B/main_output4.txt b/contests/Round#853/B/main_output4.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round#853/B/main_output4.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round#853/B/main_output5.txt b/contests/Round#853/B/main_output5.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round#853/B/main_output5.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round#853/B/main_output6.txt b/contests/Round#853/B/main_output6.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round#853/B/main_output6.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round#853/B/main_output7.txt b/contests/Round#853/B/main_output7.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round#853/B/main_output7.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round#853/C/main.cpp b/contests/Round#853/C/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Round#853/C/main.cpp @@ -0,0 +1,89 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +//pretty printing +template +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round#853/D/main.cpp b/contests/Round#853/D/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Round#853/D/main.cpp @@ -0,0 +1,89 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +//pretty printing +template +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round#853/E/main.cpp b/contests/Round#853/E/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Round#853/E/main.cpp @@ -0,0 +1,89 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +//pretty printing +template +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round#853/F/main.cpp b/contests/Round#853/F/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Round#853/F/main.cpp @@ -0,0 +1,89 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +//pretty printing +template +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round#855(Div3)/A/main b/contests/Round#855(Div3)/A/main new file mode 100755 index 0000000..7f17c3a Binary files /dev/null and b/contests/Round#855(Div3)/A/main differ diff --git a/contests/Round#855(Div3)/A/main.cpp b/contests/Round#855(Div3)/A/main.cpp new file mode 100755 index 0000000..11e6cd2 --- /dev/null +++ b/contests/Round#855(Div3)/A/main.cpp @@ -0,0 +1,101 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +//pretty printing +template +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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; + for (int i = 0; i < s.length(); i++) { + s[i] = tolower(s[i]); + } + if (regex_match(s, regex("^m+e+o+w+$"))) { + 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/Round#855(Div3)/A/main_input0.txt b/contests/Round#855(Div3)/A/main_input0.txt new file mode 100644 index 0000000..3a194d3 --- /dev/null +++ b/contests/Round#855(Div3)/A/main_input0.txt @@ -0,0 +1,15 @@ +7 +4 +meOw +14 +mMmeoOoWWWwwwW +3 +mew +7 +MmeEeUw +4 +MEOW +6 +MmyaVW +5 +meowA diff --git a/contests/Round#855(Div3)/A/main_output0.txt b/contests/Round#855(Div3)/A/main_output0.txt new file mode 100644 index 0000000..222b3f9 --- /dev/null +++ b/contests/Round#855(Div3)/A/main_output0.txt @@ -0,0 +1,7 @@ +YES +YES +NO +NO +YES +NO +NO diff --git a/contests/Round#855(Div3)/B/main b/contests/Round#855(Div3)/B/main new file mode 100755 index 0000000..1fcd57c Binary files /dev/null and b/contests/Round#855(Div3)/B/main differ diff --git a/contests/Round#855(Div3)/B/main.cpp b/contests/Round#855(Div3)/B/main.cpp new file mode 100755 index 0000000..5ef8ae8 --- /dev/null +++ b/contests/Round#855(Div3)/B/main.cpp @@ -0,0 +1,113 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +//pretty printing +template +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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, k; + string s; + cin >> n >> k; + cin >> s; + map fq; + for (auto ch : s) { + fq[ch]++; + } + int ans = 0; + for (int i = 0; i < 26; i++) { + ans += min(fq['a' + i], fq['A' + i]); + } + for (int i = 0; i < 26; i++) { + int mx = max(fq['a' + i], fq['A' + i]); + int mn = min(fq['a' + i], fq['A' + i]); + int xn = (mx - mn) / 2; + if (k > 0) { + ans += (mx - mn) / 2; + k -= (mx - mn) / 2;; + } else { + break; + } + } + cout << ans + (k < 0 ? k : 0) << '\n'; + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round#855(Div3)/B/main_input0.txt b/contests/Round#855(Div3)/B/main_input0.txt new file mode 100644 index 0000000..5edeb84 --- /dev/null +++ b/contests/Round#855(Div3)/B/main_input0.txt @@ -0,0 +1,11 @@ +5 +11 2 +aAaaBACacbE +2 2 +ab +4 1 +aaBB +6 0 +abBAcC +5 3 +cbccb diff --git a/contests/Round#855(Div3)/B/main_input1.txt b/contests/Round#855(Div3)/B/main_input1.txt new file mode 100644 index 0000000..567b03b --- /dev/null +++ b/contests/Round#855(Div3)/B/main_input1.txt @@ -0,0 +1,3 @@ +1 +6 2 +aaaaaa \ No newline at end of file diff --git a/contests/Round#855(Div3)/B/main_output0.txt b/contests/Round#855(Div3)/B/main_output0.txt new file mode 100644 index 0000000..bf5057a --- /dev/null +++ b/contests/Round#855(Div3)/B/main_output0.txt @@ -0,0 +1,5 @@ +5 +0 +1 +3 +2 diff --git a/contests/Round#855(Div3)/B/main_output1.txt b/contests/Round#855(Div3)/B/main_output1.txt new file mode 100644 index 0000000..d8263ee --- /dev/null +++ b/contests/Round#855(Div3)/B/main_output1.txt @@ -0,0 +1 @@ +2 \ No newline at end of file diff --git a/contests/Round#855(Div3)/C/main b/contests/Round#855(Div3)/C/main new file mode 100755 index 0000000..5bfd3ac Binary files /dev/null and b/contests/Round#855(Div3)/C/main differ diff --git a/contests/Round#855(Div3)/C/main.cpp b/contests/Round#855(Div3)/C/main.cpp new file mode 100755 index 0000000..dda4a51 --- /dev/null +++ b/contests/Round#855(Div3)/C/main.cpp @@ -0,0 +1,107 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +//pretty printing +template +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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; + vi v(n); + ll ans = 0; + priority_queue pq; + for (int i = 0; i < n; i++) { + int x; + cin >> x; + if (x > 0) { + pq.push(x); + } + v[i] = x; + if (x == 0 && pq.size()) { + ans += pq.top(); + pq.pop(); + } + } + 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/Round#855(Div3)/C/main_input0.txt b/contests/Round#855(Div3)/C/main_input0.txt new file mode 100644 index 0000000..d850bc4 --- /dev/null +++ b/contests/Round#855(Div3)/C/main_input0.txt @@ -0,0 +1,11 @@ +5 +5 +3 3 3 0 0 +6 +0 3 3 0 0 3 +7 +1 2 3 0 4 5 0 +7 +1 2 5 0 4 3 0 +5 +3 1 0 0 4 diff --git a/contests/Round#855(Div3)/C/main_output0.txt b/contests/Round#855(Div3)/C/main_output0.txt new file mode 100644 index 0000000..26aa2ea --- /dev/null +++ b/contests/Round#855(Div3)/C/main_output0.txt @@ -0,0 +1,5 @@ +6 +6 +8 +9 +4 diff --git a/contests/Round#855(Div3)/D/main b/contests/Round#855(Div3)/D/main new file mode 100755 index 0000000..4a29efb Binary files /dev/null and b/contests/Round#855(Div3)/D/main differ diff --git a/contests/Round#855(Div3)/D/main.cpp b/contests/Round#855(Div3)/D/main.cpp new file mode 100755 index 0000000..ee23437 --- /dev/null +++ b/contests/Round#855(Div3)/D/main.cpp @@ -0,0 +1,98 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +//pretty printing +template +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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; + int ans = 1; + for (int i = 2; i < n; i++) { + ans += s[i] != s[i - 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/contests/Round#855(Div3)/D/main_input0.txt b/contests/Round#855(Div3)/D/main_input0.txt new file mode 100644 index 0000000..cd6670e --- /dev/null +++ b/contests/Round#855(Div3)/D/main_input0.txt @@ -0,0 +1,15 @@ +7 +6 +aaabcc +10 +aaaaaaaaaa +6 +abcdef +7 +abacaba +6 +cccfff +4 +abba +5 +ababa diff --git a/contests/Round#855(Div3)/D/main_output0.txt b/contests/Round#855(Div3)/D/main_output0.txt new file mode 100644 index 0000000..78452a0 --- /dev/null +++ b/contests/Round#855(Div3)/D/main_output0.txt @@ -0,0 +1,7 @@ +4 +1 +5 +3 +3 +3 +1 diff --git a/contests/Round#855(Div3)/E/main.cpp b/contests/Round#855(Div3)/E/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Round#855(Div3)/E/main.cpp @@ -0,0 +1,89 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +//pretty printing +template +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round#855(Div3)/F/main.cpp b/contests/Round#855(Div3)/F/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Round#855(Div3)/F/main.cpp @@ -0,0 +1,89 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +//pretty printing +template +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round#856(Div2)/A/main b/contests/Round#856(Div2)/A/main new file mode 100755 index 0000000..1fa16e6 Binary files /dev/null and b/contests/Round#856(Div2)/A/main differ diff --git a/contests/Round#856(Div2)/A/main.cpp b/contests/Round#856(Div2)/A/main.cpp new file mode 100755 index 0000000..b91d9d6 --- /dev/null +++ b/contests/Round#856(Div2)/A/main.cpp @@ -0,0 +1,108 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +//pretty printing +template +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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; + vector v(2*n - 2); + map> mp; + for (int i = 0; i < 2*n - 2; i++) { + string s; + cin >> s; + v[i] = s; + mp[s.length() - 1].pb(s); + } + bool flag = true; + for (int i = 0; i < n - 1; i++) { + string s1 = mp[i][0]; + string s2 = mp[i][1]; + s2 = string(rall(s2)); + if (s1 != s2) { + flag = false; + } + } + cout << (flag ? "YES" : "NO") << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round#856(Div2)/A/main_input0.txt b/contests/Round#856(Div2)/A/main_input0.txt new file mode 100644 index 0000000..952cb56 --- /dev/null +++ b/contests/Round#856(Div2)/A/main_input0.txt @@ -0,0 +1,11 @@ +5 +4 +bcd cd a d abc ab +3 +i io i oi +2 +g g +3 +t al lt a +4 +bba a ab a abb ba diff --git a/contests/Round#856(Div2)/A/main_output0.txt b/contests/Round#856(Div2)/A/main_output0.txt new file mode 100644 index 0000000..0451473 --- /dev/null +++ b/contests/Round#856(Div2)/A/main_output0.txt @@ -0,0 +1,5 @@ +NO +YES +YES +NO +YES diff --git a/contests/Round#856(Div2)/B/main b/contests/Round#856(Div2)/B/main new file mode 100755 index 0000000..eed0238 Binary files /dev/null and b/contests/Round#856(Div2)/B/main differ diff --git a/contests/Round#856(Div2)/B/main.cpp b/contests/Round#856(Div2)/B/main.cpp new file mode 100755 index 0000000..eb1bc20 --- /dev/null +++ b/contests/Round#856(Div2)/B/main.cpp @@ -0,0 +1,95 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +// pretty printing +template void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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; + vi v(n); + for (auto &x : v) + cin >> x; + for (int i = 0 ; i < n; i++) { + v[i] += v[i] == 1; + } + for (int i = 0; i < n - 1; i++) { + while(v[i + 1] % v[i] == 0) { + v[i + 1]++; + } + } + for (int i = 0; i < n; i++) { + cout << v[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/Round#856(Div2)/B/main_input0.txt b/contests/Round#856(Div2)/B/main_input0.txt new file mode 100644 index 0000000..04652df --- /dev/null +++ b/contests/Round#856(Div2)/B/main_input0.txt @@ -0,0 +1,7 @@ +3 +4 +2 4 3 6 +3 +1 2 3 +2 +4 2 diff --git a/contests/Round#856(Div2)/B/main_input1.txt b/contests/Round#856(Div2)/B/main_input1.txt new file mode 100644 index 0000000..bc4ca8f --- /dev/null +++ b/contests/Round#856(Div2)/B/main_input1.txt @@ -0,0 +1,3 @@ +1 +5 +1 3 4 5 7 \ No newline at end of file diff --git a/contests/Round#856(Div2)/B/main_input2.txt b/contests/Round#856(Div2)/B/main_input2.txt new file mode 100644 index 0000000..b0a2002 --- /dev/null +++ b/contests/Round#856(Div2)/B/main_input2.txt @@ -0,0 +1,3 @@ +1 +5 +1 1 1 1 1 \ No newline at end of file diff --git a/contests/Round#856(Div2)/B/main_output0.txt b/contests/Round#856(Div2)/B/main_output0.txt new file mode 100644 index 0000000..1c5805b --- /dev/null +++ b/contests/Round#856(Div2)/B/main_output0.txt @@ -0,0 +1,3 @@ +4 5 6 7 +3 2 3 +4 2 diff --git a/contests/Round#856(Div2)/B/main_output1.txt b/contests/Round#856(Div2)/B/main_output1.txt new file mode 100644 index 0000000..d1cb357 --- /dev/null +++ b/contests/Round#856(Div2)/B/main_output1.txt @@ -0,0 +1 @@ +2 3 4 5 8 \ No newline at end of file diff --git a/contests/Round#856(Div2)/B/main_output2.txt b/contests/Round#856(Div2)/B/main_output2.txt new file mode 100644 index 0000000..39a5152 --- /dev/null +++ b/contests/Round#856(Div2)/B/main_output2.txt @@ -0,0 +1 @@ +3 2 3 2 3 \ No newline at end of file diff --git a/contests/Round#856(Div2)/C/main b/contests/Round#856(Div2)/C/main new file mode 100755 index 0000000..c45c966 Binary files /dev/null and b/contests/Round#856(Div2)/C/main differ diff --git a/contests/Round#856(Div2)/C/main.cpp b/contests/Round#856(Div2)/C/main.cpp new file mode 100755 index 0000000..c88ff25 --- /dev/null +++ b/contests/Round#856(Div2)/C/main.cpp @@ -0,0 +1,107 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +//pretty printing +template +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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; + vector a(n); + for (int i = 0; i < n; i++) { + cin >> a[i]; + } + for (int k = 0; k < n; k++) { + int lo = 1, hi = k + 2; + while (hi - lo > 1) { + int mid = (lo + hi) >> 1; + if (a[k - mid + 1] >= mid) { + lo = mid; + } else { + hi = mid; + } + } + cout << lo << ' '; + } + cout << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round#856(Div2)/C/main_input0.txt b/contests/Round#856(Div2)/C/main_input0.txt new file mode 100644 index 0000000..d30c37c --- /dev/null +++ b/contests/Round#856(Div2)/C/main_input0.txt @@ -0,0 +1,7 @@ +3 +3 +1 2 3 +2 +1 1 +5 +5 5 5 5 5 diff --git a/contests/Round#856(Div2)/C/main_output0.txt b/contests/Round#856(Div2)/C/main_output0.txt new file mode 100644 index 0000000..73ff3a2 --- /dev/null +++ b/contests/Round#856(Div2)/C/main_output0.txt @@ -0,0 +1,3 @@ +1 1 2 +1 1 +1 2 3 4 5 diff --git a/contests/Round#856(Div2)/D/main.cpp b/contests/Round#856(Div2)/D/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Round#856(Div2)/D/main.cpp @@ -0,0 +1,89 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +//pretty printing +template +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round#856(Div2)/E/main.cpp b/contests/Round#856(Div2)/E/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Round#856(Div2)/E/main.cpp @@ -0,0 +1,89 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +//pretty printing +template +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round#856(Div2)/F/main.cpp b/contests/Round#856(Div2)/F/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Round#856(Div2)/F/main.cpp @@ -0,0 +1,89 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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}; + +//pretty printing +template +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Starters78/D/main b/contests/Starters78/D/main index 15f5057..4b759dd 100755 Binary files a/contests/Starters78/D/main and b/contests/Starters78/D/main differ diff --git a/contests/Starters78/D/main.cpp b/contests/Starters78/D/main.cpp index 3865920..07ec32f 100755 --- a/contests/Starters78/D/main.cpp +++ b/contests/Starters78/D/main.cpp @@ -73,35 +73,45 @@ void print(T val, TS... vals) { */ void solve() { - int n, t; - cin >> n >> t; - vll p(n), b(n); - int ans = 0; - for (auto &x : p) cin >> x; - for (auto &x : b) cin >> x; - vector> tot(n); + int n, k; + cin >> n >> k; + vector> p(n); for (int i = 0; i < n; i++) { - tot[i].first = p[i] + b[i]; - tot[i].second = i; + cin >> p[i].second; } - sort(all(tot)); - vector vis(n); for (int i = 0; i < n; i++) { - if (t - tot[i].first >= 0) { - vis[tot[i].second] = true; - ans++; - t -= tot[i].first; - } + cin >> p[i].first; + p[i].first += p[i].second; } - for (int i = 0; i < n; i++) { - if (t - p[i] >= 0 && !vis[i]) { - vis[i] = true; - ans++; - break; + sort(p.begin(), p.end()); + vector sum(n + 1); + vector mx(n + 1); + mx[0] = p[0].second; + for (int i = 1; i <= n; i++) { + sum[i] = p[i - 1].first + sum[i - 1]; + mx[i] = max(mx[i - 1], p[i].first - p[i].second); + } + printv(sum); + printv(mx); + int lo = 0, hi = n + 1; + while (hi - lo > 1) { + int mid = (lo + hi) >> 1; + bool o