From d2d5b3b5ca9ae0b13c347ae77f6abd15fdb44390 Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Wed, 1 Nov 2023 21:03:55 +0200 Subject: Added a debug.h which contains all nesccseary functions to debug my code --- contests/Round901/A/main.cpp | 68 +++++++++++++++++++++ contests/Round901/A/main_input0.txt | 5 ++ contests/Round901/A/main_input1.txt | 3 + contests/Round901/A/main_input2.txt | 3 + contests/Round901/A/main_output0.txt | 2 + contests/Round901/A/main_output1.txt | 1 + contests/Round901/A/main_output2.txt | 1 + contests/Round901/B/main.cpp | 111 +++++++++++++++++++++++++++++++++++ contests/Round901/B/main_input0.txt | 13 ++++ contests/Round901/B/main_input1.txt | 7 +++ contests/Round901/B/main_input2.txt | 4 ++ contests/Round901/B/main_input3.txt | 13 ++++ contests/Round901/B/main_input4.txt | 4 ++ contests/Round901/B/main_output0.txt | 4 ++ contests/Round901/B/main_output1.txt | 2 + contests/Round901/B/main_output2.txt | 1 + contests/Round901/B/main_output3.txt | 4 ++ contests/Round901/B/main_output4.txt | 1 + contests/Round901/C/main.cpp | 54 +++++++++++++++++ contests/Round901/D/main.cpp | 54 +++++++++++++++++ contests/Round901/E/main.cpp | 54 +++++++++++++++++ contests/Round901/F/main.cpp | 54 +++++++++++++++++ 22 files changed, 463 insertions(+) create mode 100755 contests/Round901/A/main.cpp create mode 100644 contests/Round901/A/main_input0.txt create mode 100644 contests/Round901/A/main_input1.txt create mode 100644 contests/Round901/A/main_input2.txt create mode 100644 contests/Round901/A/main_output0.txt create mode 100644 contests/Round901/A/main_output1.txt create mode 100644 contests/Round901/A/main_output2.txt create mode 100755 contests/Round901/B/main.cpp create mode 100644 contests/Round901/B/main_input0.txt create mode 100644 contests/Round901/B/main_input1.txt create mode 100644 contests/Round901/B/main_input2.txt create mode 100644 contests/Round901/B/main_input3.txt create mode 100644 contests/Round901/B/main_input4.txt create mode 100644 contests/Round901/B/main_output0.txt create mode 100644 contests/Round901/B/main_output1.txt create mode 100644 contests/Round901/B/main_output2.txt create mode 100644 contests/Round901/B/main_output3.txt create mode 100644 contests/Round901/B/main_output4.txt create mode 100755 contests/Round901/C/main.cpp create mode 100755 contests/Round901/D/main.cpp create mode 100755 contests/Round901/E/main.cpp create mode 100755 contests/Round901/F/main.cpp (limited to 'contests') diff --git a/contests/Round901/A/main.cpp b/contests/Round901/A/main.cpp new file mode 100755 index 0000000..cd79e59 --- /dev/null +++ b/contests/Round901/A/main.cpp @@ -0,0 +1,68 @@ +#include + +using namespace std; + +using ll = long long; +using pii = pair; +using vpii = 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}; + +#ifdef LOCAL +#include "debug.h" +#else +#define dbg(...) 42 +#endif + +/* 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 a, b, n; + cin >> a >> b >> n; + vi v(n); + for (int i = 0; i < n; i++) { + cin >> v[i]; + } + int c = b; + ll ans = b - 1; + for (int i = 0; i < n; i++) { + c = min(a, 1 + v[i]); + ans += c - 1; + } + cout << ans + 1 << '\n'; +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/contests/Round901/A/main_input0.txt b/contests/Round901/A/main_input0.txt new file mode 100644 index 0000000..d27f23e --- /dev/null +++ b/contests/Round901/A/main_input0.txt @@ -0,0 +1,5 @@ +2 +5 3 3 +1 1 7 +7 1 5 +1 2 5 6 8 diff --git a/contests/Round901/A/main_input1.txt b/contests/Round901/A/main_input1.txt new file mode 100644 index 0000000..23e1853 --- /dev/null +++ b/contests/Round901/A/main_input1.txt @@ -0,0 +1,3 @@ +1 +7 1 5 +1 5 2 8 6 \ No newline at end of file diff --git a/contests/Round901/A/main_input2.txt b/contests/Round901/A/main_input2.txt new file mode 100644 index 0000000..aa2135a --- /dev/null +++ b/contests/Round901/A/main_input2.txt @@ -0,0 +1,3 @@ +1 +5 3 3 +7 1 1 \ No newline at end of file diff --git a/contests/Round901/A/main_output0.txt b/contests/Round901/A/main_output0.txt new file mode 100644 index 0000000..3a9b486 --- /dev/null +++ b/contests/Round901/A/main_output0.txt @@ -0,0 +1,2 @@ +9 +21 diff --git a/contests/Round901/A/main_output1.txt b/contests/Round901/A/main_output1.txt new file mode 100644 index 0000000..b5045cc --- /dev/null +++ b/contests/Round901/A/main_output1.txt @@ -0,0 +1 @@ +21 \ No newline at end of file diff --git a/contests/Round901/A/main_output2.txt b/contests/Round901/A/main_output2.txt new file mode 100644 index 0000000..f11c82a --- /dev/null +++ b/contests/Round901/A/main_output2.txt @@ -0,0 +1 @@ +9 \ No newline at end of file diff --git a/contests/Round901/B/main.cpp b/contests/Round901/B/main.cpp new file mode 100755 index 0000000..c2e3517 --- /dev/null +++ b/contests/Round901/B/main.cpp @@ -0,0 +1,111 @@ +#include +#include + +using namespace std; + +using ll = long long; +using pii = pair; +using vpii = 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}; + +#ifdef LOCAL +#include "debug.h" +#else +#define dbg(...) 42 +#endif + +/* 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, m, k; + cin >> n >> m >> k; + vll a(n), b(m); + ll min_a = INT_MAX; + ll min_b = INT_MAX; + ll max_a = 0; + ll max_b = 0; + ll sum = 0; + for (auto &x : a) { + cin >> x; + sum += x; + min_a = min(min_a, x); + max_a = max(max_a, x); + } + for (auto &x : b) { + cin >> x; + min_b = min(min_b, x); + max_b = max(max_b, x); + } + ll mx = max(max_a, max_b); + ll mn = min(min_a, min_b); + ll tmp = sum + (max_b - min_a); + if (mx == max_a && mn == min_a) { + if (k % 2 == 1) { + cout << tmp << '\n'; + } else { + cout << tmp + (mn - mx) << '\n'; + } + } else if (mx == max_b && mn == min_b) { + if (k % 2 == 1) { + cout << tmp << '\n'; + } else { + cout << tmp + (mn - mx) << '\n'; + } + } else if (mx == max_a && mn == min_b) { + if (k % 2 == 1) { + if (max_b <= min_a) { + cout << sum << '\n'; + } else { + cout << tmp << '\n'; + } + } else { + if (max_b <= min_a) { + cout << sum + (mn - mx) << '\n'; + } else { + cout << tmp + (mn - mx) << '\n'; + } + } + } else { + if (k % 2 == 1) { + cout << tmp << '\n'; + } else { + cout << sum << '\n'; + } + } +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/contests/Round901/B/main_input0.txt b/contests/Round901/B/main_input0.txt new file mode 100644 index 0000000..850ffe8 --- /dev/null +++ b/contests/Round901/B/main_input0.txt @@ -0,0 +1,13 @@ +4 +2 2 1 +1 2 +3 4 +1 1 10000 +1 +2 +4 5 11037 +1 1 4 5 +1 9 1 9 8 +1 1 1 +2 +1 diff --git a/contests/Round901/B/main_input1.txt b/contests/Round901/B/main_input1.txt new file mode 100644 index 0000000..7507d94 --- /dev/null +++ b/contests/Round901/B/main_input1.txt @@ -0,0 +1,7 @@ +2 +3 3 1 +1 5 9 +6 7 8 +3 3 2 +1 5 9 +6 7 8 \ No newline at end of file diff --git a/contests/Round901/B/main_input2.txt b/contests/Round901/B/main_input2.txt new file mode 100644 index 0000000..cfd13e6 --- /dev/null +++ b/contests/Round901/B/main_input2.txt @@ -0,0 +1,4 @@ +1 +3 3 3 +1 5 9 +6 7 8 \ No newline at end of file diff --git a/contests/Round901/B/main_input3.txt b/contests/Round901/B/main_input3.txt new file mode 100644 index 0000000..6e20ecd --- /dev/null +++ b/contests/Round901/B/main_input3.txt @@ -0,0 +1,13 @@ +4 +3 3 1 +6 7 8 +1 5 9 +3 3 2 +6 7 8 +1 5 9 +3 3 3 +6 7 8 +1 5 9 +3 3 4 +6 7 8 +1 5 9 \ No newline at end of file diff --git a/contests/Round901/B/main_input4.txt b/contests/Round901/B/main_input4.txt new file mode 100644 index 0000000..35f7553 --- /dev/null +++ b/contests/Round901/B/main_input4.txt @@ -0,0 +1,4 @@ +1 +2 2 2 +1 2 +3 4 \ No newline at end of file diff --git a/contests/Round901/B/main_output0.txt b/contests/Round901/B/main_output0.txt new file mode 100644 index 0000000..328e78b --- /dev/null +++ b/contests/Round901/B/main_output0.txt @@ -0,0 +1,4 @@ +6 +1 +19 +2 diff --git a/contests/Round901/B/main_output1.txt b/contests/Round901/B/main_output1.txt new file mode 100644 index 0000000..a8b22d0 --- /dev/null +++ b/contests/Round901/B/main_output1.txt @@ -0,0 +1,2 @@ +22 +14 \ No newline at end of file diff --git a/contests/Round901/B/main_output2.txt b/contests/Round901/B/main_output2.txt new file mode 100644 index 0000000..8fdd954 --- /dev/null +++ b/contests/Round901/B/main_output2.txt @@ -0,0 +1 @@ +22 \ No newline at end of file diff --git a/contests/Round901/B/main_output3.txt b/contests/Round901/B/main_output3.txt new file mode 100644 index 0000000..352ff27 --- /dev/null +++ b/contests/Round901/B/main_output3.txt @@ -0,0 +1,4 @@ +24 +16 +24 +16 \ No newline at end of file diff --git a/contests/Round901/B/main_output4.txt b/contests/Round901/B/main_output4.txt new file mode 100644 index 0000000..e440e5c --- /dev/null +++ b/contests/Round901/B/main_output4.txt @@ -0,0 +1 @@ +3 \ No newline at end of file diff --git a/contests/Round901/C/main.cpp b/contests/Round901/C/main.cpp new file mode 100755 index 0000000..539fdb0 --- /dev/null +++ b/contests/Round901/C/main.cpp @@ -0,0 +1,54 @@ +#include + +using namespace std; + +using ll = long long; +using pii = pair; +using vpii = 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}; + +#ifdef LOCAL +#include "debug.h" +#else +#define dbg(...) 42 +#endif + +/* 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/Round901/D/main.cpp b/contests/Round901/D/main.cpp new file mode 100755 index 0000000..539fdb0 --- /dev/null +++ b/contests/Round901/D/main.cpp @@ -0,0 +1,54 @@ +#include + +using namespace std; + +using ll = long long; +using pii = pair; +using vpii = 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}; + +#ifdef LOCAL +#include "debug.h" +#else +#define dbg(...) 42 +#endif + +/* 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/Round901/E/main.cpp b/contests/Round901/E/main.cpp new file mode 100755 index 0000000..539fdb0 --- /dev/null +++ b/contests/Round901/E/main.cpp @@ -0,0 +1,54 @@ +#include + +using namespace std; + +using ll = long long; +using pii = pair; +using vpii = 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}; + +#ifdef LOCAL +#include "debug.h" +#else +#define dbg(...) 42 +#endif + +/* 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/Round901/F/main.cpp b/contests/Round901/F/main.cpp new file mode 100755 index 0000000..539fdb0 --- /dev/null +++ b/contests/Round901/F/main.cpp @@ -0,0 +1,54 @@ +#include + +using namespace std; + +using ll = long long; +using pii = pair; +using vpii = 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}; + +#ifdef LOCAL +#include "debug.h" +#else +#define dbg(...) 42 +#endif + +/* 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