From 6411812a630e4230af27705d11f30405fbd83a68 Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Mon, 20 Mar 2023 01:21:59 +0200 Subject: Solved 7 problems in Div4 --- contests/Round859(Div4)/A/main | Bin 0 -> 17688 bytes contests/Round859(Div4)/A/main.cpp | 139 +++++++++++++++++++++ contests/Round859(Div4)/A/main_input0.txt | 12 ++ contests/Round859(Div4)/A/main_output0.txt | 11 ++ contests/Round859(Div4)/B/main | Bin 0 -> 22328 bytes contests/Round859(Div4)/B/main.cpp | 150 +++++++++++++++++++++++ contests/Round859(Div4)/B/main_input0.txt | 7 ++ contests/Round859(Div4)/B/main_output0.txt | 3 + contests/Round859(Div4)/C/main | Bin 0 -> 17040 bytes contests/Round859(Div4)/C/main.cpp | 164 +++++++++++++++++++++++++ contests/Round859(Div4)/C/main_input0.txt | 17 +++ contests/Round859(Div4)/C/main_output0.txt | 8 ++ contests/Round859(Div4)/D/main | Bin 0 -> 26472 bytes contests/Round859(Div4)/D/main.cpp | 174 +++++++++++++++++++++++++++ contests/Round859(Div4)/D/main_input0.txt | 15 +++ contests/Round859(Div4)/D/main_output0.txt | 10 ++ contests/Round859(Div4)/E/main | Bin 0 -> 34136 bytes contests/Round859(Div4)/E/main.cpp | 160 ++++++++++++++++++++++++ contests/Round859(Div4)/F/main.cpp | 132 ++++++++++++++++++++ contests/Round859(Div4)/G1/main | Bin 0 -> 39584 bytes contests/Round859(Div4)/G1/main.cpp | 154 ++++++++++++++++++++++++ contests/Round859(Div4)/G1/main_input0.txt | 13 ++ contests/Round859(Div4)/G1/main_input1.txt | 2 + contests/Round859(Div4)/G1/main_input10.txt | 3 + contests/Round859(Div4)/G1/main_input11.txt | 3 + contests/Round859(Div4)/G1/main_input12.txt | 3 + contests/Round859(Div4)/G1/main_input2.txt | 3 + contests/Round859(Div4)/G1/main_input3.txt | 3 + contests/Round859(Div4)/G1/main_input4.txt | 3 + contests/Round859(Div4)/G1/main_input5.txt | 3 + contests/Round859(Div4)/G1/main_input6.txt | 3 + contests/Round859(Div4)/G1/main_input7.txt | 3 + contests/Round859(Div4)/G1/main_input8.txt | 3 + contests/Round859(Div4)/G1/main_input9.txt | 3 + contests/Round859(Div4)/G1/main_output0.txt | 6 + contests/Round859(Div4)/G1/main_output1.txt | 1 + contests/Round859(Div4)/G1/main_output10.txt | 1 + contests/Round859(Div4)/G1/main_output11.txt | 1 + contests/Round859(Div4)/G1/main_output12.txt | 1 + contests/Round859(Div4)/G1/main_output2.txt | 1 + contests/Round859(Div4)/G1/main_output3.txt | 1 + contests/Round859(Div4)/G1/main_output4.txt | 1 + contests/Round859(Div4)/G1/main_output5.txt | 1 + contests/Round859(Div4)/G1/main_output6.txt | 1 + contests/Round859(Div4)/G1/main_output7.txt | 1 + contests/Round859(Div4)/G1/main_output8.txt | 1 + contests/Round859(Div4)/G1/main_output9.txt | 1 + 47 files changed, 1222 insertions(+) create mode 100755 contests/Round859(Div4)/A/main create mode 100755 contests/Round859(Div4)/A/main.cpp create mode 100644 contests/Round859(Div4)/A/main_input0.txt create mode 100644 contests/Round859(Div4)/A/main_output0.txt create mode 100755 contests/Round859(Div4)/B/main create mode 100755 contests/Round859(Div4)/B/main.cpp create mode 100644 contests/Round859(Div4)/B/main_input0.txt create mode 100644 contests/Round859(Div4)/B/main_output0.txt create mode 100755 contests/Round859(Div4)/C/main create mode 100755 contests/Round859(Div4)/C/main.cpp create mode 100644 contests/Round859(Div4)/C/main_input0.txt create mode 100644 contests/Round859(Div4)/C/main_output0.txt create mode 100755 contests/Round859(Div4)/D/main create mode 100755 contests/Round859(Div4)/D/main.cpp create mode 100644 contests/Round859(Div4)/D/main_input0.txt create mode 100644 contests/Round859(Div4)/D/main_output0.txt create mode 100755 contests/Round859(Div4)/E/main create mode 100755 contests/Round859(Div4)/E/main.cpp create mode 100755 contests/Round859(Div4)/F/main.cpp create mode 100755 contests/Round859(Div4)/G1/main create mode 100755 contests/Round859(Div4)/G1/main.cpp create mode 100644 contests/Round859(Div4)/G1/main_input0.txt create mode 100644 contests/Round859(Div4)/G1/main_input1.txt create mode 100644 contests/Round859(Div4)/G1/main_input10.txt create mode 100644 contests/Round859(Div4)/G1/main_input11.txt create mode 100644 contests/Round859(Div4)/G1/main_input12.txt create mode 100644 contests/Round859(Div4)/G1/main_input2.txt create mode 100644 contests/Round859(Div4)/G1/main_input3.txt create mode 100644 contests/Round859(Div4)/G1/main_input4.txt create mode 100644 contests/Round859(Div4)/G1/main_input5.txt create mode 100644 contests/Round859(Div4)/G1/main_input6.txt create mode 100644 contests/Round859(Div4)/G1/main_input7.txt create mode 100644 contests/Round859(Div4)/G1/main_input8.txt create mode 100644 contests/Round859(Div4)/G1/main_input9.txt create mode 100644 contests/Round859(Div4)/G1/main_output0.txt create mode 100644 contests/Round859(Div4)/G1/main_output1.txt create mode 100644 contests/Round859(Div4)/G1/main_output10.txt create mode 100644 contests/Round859(Div4)/G1/main_output11.txt create mode 100644 contests/Round859(Div4)/G1/main_output12.txt create mode 100644 contests/Round859(Div4)/G1/main_output2.txt create mode 100644 contests/Round859(Div4)/G1/main_output3.txt create mode 100644 contests/Round859(Div4)/G1/main_output4.txt create mode 100644 contests/Round859(Div4)/G1/main_output5.txt create mode 100644 contests/Round859(Div4)/G1/main_output6.txt create mode 100644 contests/Round859(Div4)/G1/main_output7.txt create mode 100644 contests/Round859(Div4)/G1/main_output8.txt create mode 100644 contests/Round859(Div4)/G1/main_output9.txt (limited to 'contests') diff --git a/contests/Round859(Div4)/A/main b/contests/Round859(Div4)/A/main new file mode 100755 index 0000000..bc6e935 Binary files /dev/null and b/contests/Round859(Div4)/A/main differ diff --git a/contests/Round859(Div4)/A/main.cpp b/contests/Round859(Div4)/A/main.cpp new file mode 100755 index 0000000..333bd0b --- /dev/null +++ b/contests/Round859(Div4)/A/main.cpp @@ -0,0 +1,139 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int a, b, c; + cin >> a >> b >> c; + if (a + b == c) { + cout << "+" << '\n'; + } else { + cout << "-" << '\n'; + } + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round859(Div4)/A/main_input0.txt b/contests/Round859(Div4)/A/main_input0.txt new file mode 100644 index 0000000..91dc315 --- /dev/null +++ b/contests/Round859(Div4)/A/main_input0.txt @@ -0,0 +1,12 @@ +11 +1 2 3 +3 2 1 +2 9 -7 +3 4 7 +1 1 2 +1 1 0 +3 3 6 +9 9 18 +9 9 0 +1 9 -8 +1 9 10 diff --git a/contests/Round859(Div4)/A/main_output0.txt b/contests/Round859(Div4)/A/main_output0.txt new file mode 100644 index 0000000..a4d808b --- /dev/null +++ b/contests/Round859(Div4)/A/main_output0.txt @@ -0,0 +1,11 @@ ++ +- +- ++ ++ +- ++ ++ +- +- ++ diff --git a/contests/Round859(Div4)/B/main b/contests/Round859(Div4)/B/main new file mode 100755 index 0000000..9c85033 Binary files /dev/null and b/contests/Round859(Div4)/B/main differ diff --git a/contests/Round859(Div4)/B/main.cpp b/contests/Round859(Div4)/B/main.cpp new file mode 100755 index 0000000..0c93911 --- /dev/null +++ b/contests/Round859(Div4)/B/main.cpp @@ -0,0 +1,150 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int n; + cin >> n; + vi v(n); + for (auto &x : v) cin >> x; + int even = 0; + int odd = 0; + for (int i = 0; i < n; i++) { + if (v[i] & 1) { + odd += v[i]; + } else { + even += v[i]; + } + } + if (even > odd) { + 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/Round859(Div4)/B/main_input0.txt b/contests/Round859(Div4)/B/main_input0.txt new file mode 100644 index 0000000..bdafd50 --- /dev/null +++ b/contests/Round859(Div4)/B/main_input0.txt @@ -0,0 +1,7 @@ +3 +4 +1 2 3 4 +4 +1 1 1 2 +3 +1 4 3 diff --git a/contests/Round859(Div4)/B/main_output0.txt b/contests/Round859(Div4)/B/main_output0.txt new file mode 100644 index 0000000..c6e03a3 --- /dev/null +++ b/contests/Round859(Div4)/B/main_output0.txt @@ -0,0 +1,3 @@ +YES +NO +NO diff --git a/contests/Round859(Div4)/C/main b/contests/Round859(Div4)/C/main new file mode 100755 index 0000000..17ac24c Binary files /dev/null and b/contests/Round859(Div4)/C/main differ diff --git a/contests/Round859(Div4)/C/main.cpp b/contests/Round859(Div4)/C/main.cpp new file mode 100755 index 0000000..566b95c --- /dev/null +++ b/contests/Round859(Div4)/C/main.cpp @@ -0,0 +1,164 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int n; + cin >> n; + string s; + cin >> s; + set st1; + set st2; + for (int i = 0; i < n; i+=2) { + st1.insert(s[i]); + } + for (int i = 1; i < n; i++) { + st2.insert(s[i]); + } + for (auto ch : st1) { + for (int i = 0; i < n ; i++) { + if (s[i] == ch) { + s[i] = '0'; + } + } + } + for (auto ch : st2) { + for (int i = 0; i < n ; i++) { + if (s[i] == ch) { + s[i] = '1'; + } + } + } + for (int i = 0; i < n - 1; i++) { + if (s[i] == s[i + 1]) { + 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/contests/Round859(Div4)/C/main_input0.txt b/contests/Round859(Div4)/C/main_input0.txt new file mode 100644 index 0000000..e3b21b8 --- /dev/null +++ b/contests/Round859(Div4)/C/main_input0.txt @@ -0,0 +1,17 @@ +8 +7 +abacaba +2 +aa +1 +y +4 +bkpt +6 +ninfia +6 +banana +10 +codeforces +8 +testcase diff --git a/contests/Round859(Div4)/C/main_output0.txt b/contests/Round859(Div4)/C/main_output0.txt new file mode 100644 index 0000000..3876667 --- /dev/null +++ b/contests/Round859(Div4)/C/main_output0.txt @@ -0,0 +1,8 @@ +YES +NO +YES +YES +NO +YES +NO +NO diff --git a/contests/Round859(Div4)/D/main b/contests/Round859(Div4)/D/main new file mode 100755 index 0000000..7778923 Binary files /dev/null and b/contests/Round859(Div4)/D/main differ diff --git a/contests/Round859(Div4)/D/main.cpp b/contests/Round859(Div4)/D/main.cpp new file mode 100755 index 0000000..62f9db4 --- /dev/null +++ b/contests/Round859(Div4)/D/main.cpp @@ -0,0 +1,174 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int n, q; + cin >> n >> q; + vi v(n); + vi odd(n); + for (auto &x : v) { + cin >> x; + } + odd[0] = (v[0] & 1); + for (int i = 1; i < n; i++) { + odd[i] = odd[i - 1] + (v[i] & 1); + } + int o = odd[odd.size() - 1]; + for (int i = 0; i < q; i++) { + int l, r, k; + cin >> l >> r >> k; + if (k & 1) { + int oddsInRange = odd[r - 1]; + if (l - 2 >= 0) { + oddsInRange = odd[r - 1] - odd[l - 2]; + } + int noElements = r - l + 1; + int newOdds = o + (noElements - oddsInRange); + if (newOdds & 1) { + cout << "YES\n"; + } else { + cout << "NO\n"; + } + } else { + int oddsInRange = odd[r - 1]; + if (l - 2 >= 0) { + oddsInRange = odd[r - 1] - odd[l - 2]; + } + int noElements = r - l + 1; + int newOdds = o - oddsInRange; + if (newOdds & 1) { + 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/Round859(Div4)/D/main_input0.txt b/contests/Round859(Div4)/D/main_input0.txt new file mode 100644 index 0000000..d7ea228 --- /dev/null +++ b/contests/Round859(Div4)/D/main_input0.txt @@ -0,0 +1,15 @@ +2 +5 5 +2 2 1 3 2 +2 3 3 +2 3 4 +1 5 5 +1 4 9 +2 4 3 +10 5 +1 1 1 1 1 1 1 1 1 1 +3 8 13 +2 5 10 +3 8 10 +1 10 2 +1 9 100 diff --git a/contests/Round859(Div4)/D/main_output0.txt b/contests/Round859(Div4)/D/main_output0.txt new file mode 100644 index 0000000..aa44313 --- /dev/null +++ b/contests/Round859(Div4)/D/main_output0.txt @@ -0,0 +1,10 @@ +YES +YES +YES +NO +YES +NO +NO +NO +NO +YES diff --git a/contests/Round859(Div4)/E/main b/contests/Round859(Div4)/E/main new file mode 100755 index 0000000..31ed974 Binary files /dev/null and b/contests/Round859(Div4)/E/main differ diff --git a/contests/Round859(Div4)/E/main.cpp b/contests/Round859(Div4)/E/main.cpp new file mode 100755 index 0000000..e15145d --- /dev/null +++ b/contests/Round859(Div4)/E/main.cpp @@ -0,0 +1,160 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int n; + cin >> n; + vi v(n); + for (auto &x : v) { + cin >> x; + } + vll pref(n + 1); + pref[0] = 0; + for (int i = 0; i < n; i++) { + pref[i + 1] = pref[i] + v[i]; + } + int l = 0, r = n - 1, mid; + while (l < r) { + int q; + mid = (r + l) / 2; + cout << "? " << mid - l + 1 << " "; + for (int i = l; i <= mid; i++) { + cout << i + 1 << " \n"[i == mid]; + } + cout.flush(); + cin >> q; + if (q > pref[mid + 1] - pref[l]) { + r = mid; + } else { + l = mid + 1; + } + } + cout << "! " << l + 1 << '\n'; + cout.flush(); +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round859(Div4)/F/main.cpp b/contests/Round859(Div4)/F/main.cpp new file mode 100755 index 0000000..70c7757 --- /dev/null +++ b/contests/Round859(Div4)/F/main.cpp @@ -0,0 +1,132 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round859(Div4)/G1/main b/contests/Round859(Div4)/G1/main new file mode 100755 index 0000000..2d8e3e3 Binary files /dev/null and b/contests/Round859(Div4)/G1/main differ diff --git a/contests/Round859(Div4)/G1/main.cpp b/contests/Round859(Div4)/G1/main.cpp new file mode 100755 index 0000000..eda5e97 --- /dev/null +++ b/contests/Round859(Div4)/G1/main.cpp @@ -0,0 +1,154 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int n; + cin >> n; + vi v(n); + for (auto &x : v) { + cin >> x; + } + sort(all(v)); + if (v[0] != 1) { + cout << "NO\n"; + return; + } + ll sum = 1; + for (int i = 1; i < n; i++) { + if (sum >= v[i]) { + sum += v[i]; + } else { + 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/contests/Round859(Div4)/G1/main_input0.txt b/contests/Round859(Div4)/G1/main_input0.txt new file mode 100644 index 0000000..cced71f --- /dev/null +++ b/contests/Round859(Div4)/G1/main_input0.txt @@ -0,0 +1,13 @@ +6 +1 +1 +1 +2 +5 +5 1 3 2 1 +5 +7 1 5 2 1 +3 +1 1 1 +5 +1 1 4 2 1 diff --git a/contests/Round859(Div4)/G1/main_input1.txt b/contests/Round859(Div4)/G1/main_input1.txt new file mode 100644 index 0000000..65c9f64 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_input1.txt @@ -0,0 +1,2 @@ +1 +1 1 2 4 6 7 \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_input10.txt b/contests/Round859(Div4)/G1/main_input10.txt new file mode 100644 index 0000000..425d434 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_input10.txt @@ -0,0 +1,3 @@ +1 +3 +1 1 3 \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_input11.txt b/contests/Round859(Div4)/G1/main_input11.txt new file mode 100644 index 0000000..8cea45f --- /dev/null +++ b/contests/Round859(Div4)/G1/main_input11.txt @@ -0,0 +1,3 @@ +1 +4 +1 1 1 3 \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_input12.txt b/contests/Round859(Div4)/G1/main_input12.txt new file mode 100644 index 0000000..fab2bce --- /dev/null +++ b/contests/Round859(Div4)/G1/main_input12.txt @@ -0,0 +1,3 @@ +1 +2 +2 2 \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_input2.txt b/contests/Round859(Div4)/G1/main_input2.txt new file mode 100644 index 0000000..9f54a91 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_input2.txt @@ -0,0 +1,3 @@ +1 +5 +1 1 2 3 8 \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_input3.txt b/contests/Round859(Div4)/G1/main_input3.txt new file mode 100644 index 0000000..4a6ddb0 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_input3.txt @@ -0,0 +1,3 @@ +1 +5 +1 1 2 3 8 17 \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_input4.txt b/contests/Round859(Div4)/G1/main_input4.txt new file mode 100644 index 0000000..d726d72 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_input4.txt @@ -0,0 +1,3 @@ +1 +2 +2 3 \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_input5.txt b/contests/Round859(Div4)/G1/main_input5.txt new file mode 100644 index 0000000..eafd65c --- /dev/null +++ b/contests/Round859(Div4)/G1/main_input5.txt @@ -0,0 +1,3 @@ +1 +2 +1 2 \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_input6.txt b/contests/Round859(Div4)/G1/main_input6.txt new file mode 100644 index 0000000..35e5999 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_input6.txt @@ -0,0 +1,3 @@ +1 +3 +1 2 3 \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_input7.txt b/contests/Round859(Div4)/G1/main_input7.txt new file mode 100644 index 0000000..425d434 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_input7.txt @@ -0,0 +1,3 @@ +1 +3 +1 1 3 \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_input8.txt b/contests/Round859(Div4)/G1/main_input8.txt new file mode 100644 index 0000000..b9152d8 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_input8.txt @@ -0,0 +1,3 @@ +1 +10 +1 1 2 3 4 5 12 20 22 71 \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_input9.txt b/contests/Round859(Div4)/G1/main_input9.txt new file mode 100644 index 0000000..9a716b0 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_input9.txt @@ -0,0 +1,3 @@ +1 +1 +200 \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_output0.txt b/contests/Round859(Div4)/G1/main_output0.txt new file mode 100644 index 0000000..60052d7 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_output0.txt @@ -0,0 +1,6 @@ +YES +NO +YES +NO +YES +YES diff --git a/contests/Round859(Div4)/G1/main_output1.txt b/contests/Round859(Div4)/G1/main_output1.txt new file mode 100644 index 0000000..d2bb323 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_output1.txt @@ -0,0 +1 @@ +YES \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_output10.txt b/contests/Round859(Div4)/G1/main_output10.txt new file mode 100644 index 0000000..ba28208 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_output10.txt @@ -0,0 +1 @@ +NO \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_output11.txt b/contests/Round859(Div4)/G1/main_output11.txt new file mode 100644 index 0000000..d2bb323 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_output11.txt @@ -0,0 +1 @@ +YES \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_output12.txt b/contests/Round859(Div4)/G1/main_output12.txt new file mode 100644 index 0000000..ba28208 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_output12.txt @@ -0,0 +1 @@ +NO \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_output2.txt b/contests/Round859(Div4)/G1/main_output2.txt new file mode 100644 index 0000000..ba28208 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_output2.txt @@ -0,0 +1 @@ +NO \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_output3.txt b/contests/Round859(Div4)/G1/main_output3.txt new file mode 100644 index 0000000..ba28208 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_output3.txt @@ -0,0 +1 @@ +NO \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_output4.txt b/contests/Round859(Div4)/G1/main_output4.txt new file mode 100644 index 0000000..ba28208 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_output4.txt @@ -0,0 +1 @@ +NO \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_output5.txt b/contests/Round859(Div4)/G1/main_output5.txt new file mode 100644 index 0000000..ba28208 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_output5.txt @@ -0,0 +1 @@ +NO \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_output6.txt b/contests/Round859(Div4)/G1/main_output6.txt new file mode 100644 index 0000000..ba28208 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_output6.txt @@ -0,0 +1 @@ +NO \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_output7.txt b/contests/Round859(Div4)/G1/main_output7.txt new file mode 100644 index 0000000..ba28208 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_output7.txt @@ -0,0 +1 @@ +NO \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_output8.txt b/contests/Round859(Div4)/G1/main_output8.txt new file mode 100644 index 0000000..ba28208 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_output8.txt @@ -0,0 +1 @@ +NO \ No newline at end of file diff --git a/contests/Round859(Div4)/G1/main_output9.txt b/contests/Round859(Div4)/G1/main_output9.txt new file mode 100644 index 0000000..ba28208 --- /dev/null +++ b/contests/Round859(Div4)/G1/main_output9.txt @@ -0,0 +1 @@ +NO \ No newline at end of file -- cgit v1.2.3