From 6b548332bfc6469756526002971c422f43f86d0a Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Mon, 24 Jul 2023 13:11:33 +0300 Subject: Removed some empty *.cpp files and Solved some new problems --- contests/Round859(Div4)/A/main | Bin 17688 -> 0 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 22328 -> 0 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 17040 -> 0 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 26472 -> 0 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 34136 -> 0 bytes contests/Round859(Div4)/E/main.cpp | 160 ------------------------ contests/Round859(Div4)/F/main.cpp | 132 -------------------- contests/Round859(Div4)/G1/main | Bin 39584 -> 0 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 deletions(-) delete mode 100755 contests/Round859(Div4)/A/main delete mode 100755 contests/Round859(Div4)/A/main.cpp delete mode 100644 contests/Round859(Div4)/A/main_input0.txt delete mode 100644 contests/Round859(Div4)/A/main_output0.txt delete mode 100755 contests/Round859(Div4)/B/main delete mode 100755 contests/Round859(Div4)/B/main.cpp delete mode 100644 contests/Round859(Div4)/B/main_input0.txt delete mode 100644 contests/Round859(Div4)/B/main_output0.txt delete mode 100755 contests/Round859(Div4)/C/main delete mode 100755 contests/Round859(Div4)/C/main.cpp delete mode 100644 contests/Round859(Div4)/C/main_input0.txt delete mode 100644 contests/Round859(Div4)/C/main_output0.txt delete mode 100755 contests/Round859(Div4)/D/main delete mode 100755 contests/Round859(Div4)/D/main.cpp delete mode 100644 contests/Round859(Div4)/D/main_input0.txt delete mode 100644 contests/Round859(Div4)/D/main_output0.txt delete mode 100755 contests/Round859(Div4)/E/main delete mode 100755 contests/Round859(Div4)/E/main.cpp delete mode 100755 contests/Round859(Div4)/F/main.cpp delete mode 100755 contests/Round859(Div4)/G1/main delete mode 100755 contests/Round859(Div4)/G1/main.cpp delete mode 100644 contests/Round859(Div4)/G1/main_input0.txt delete mode 100644 contests/Round859(Div4)/G1/main_input1.txt delete mode 100644 contests/Round859(Div4)/G1/main_input10.txt delete mode 100644 contests/Round859(Div4)/G1/main_input11.txt delete mode 100644 contests/Round859(Div4)/G1/main_input12.txt delete mode 100644 contests/Round859(Div4)/G1/main_input2.txt delete mode 100644 contests/Round859(Div4)/G1/main_input3.txt delete mode 100644 contests/Round859(Div4)/G1/main_input4.txt delete mode 100644 contests/Round859(Div4)/G1/main_input5.txt delete mode 100644 contests/Round859(Div4)/G1/main_input6.txt delete mode 100644 contests/Round859(Div4)/G1/main_input7.txt delete mode 100644 contests/Round859(Div4)/G1/main_input8.txt delete mode 100644 contests/Round859(Div4)/G1/main_input9.txt delete mode 100644 contests/Round859(Div4)/G1/main_output0.txt delete mode 100644 contests/Round859(Div4)/G1/main_output1.txt delete mode 100644 contests/Round859(Div4)/G1/main_output10.txt delete mode 100644 contests/Round859(Div4)/G1/main_output11.txt delete mode 100644 contests/Round859(Div4)/G1/main_output12.txt delete mode 100644 contests/Round859(Div4)/G1/main_output2.txt delete mode 100644 contests/Round859(Div4)/G1/main_output3.txt delete mode 100644 contests/Round859(Div4)/G1/main_output4.txt delete mode 100644 contests/Round859(Div4)/G1/main_output5.txt delete mode 100644 contests/Round859(Div4)/G1/main_output6.txt delete mode 100644 contests/Round859(Div4)/G1/main_output7.txt delete mode 100644 contests/Round859(Div4)/G1/main_output8.txt delete mode 100644 contests/Round859(Div4)/G1/main_output9.txt (limited to 'contests/Round859(Div4)') diff --git a/contests/Round859(Div4)/A/main b/contests/Round859(Div4)/A/main deleted file mode 100755 index bc6e935..0000000 Binary files a/contests/Round859(Div4)/A/main and /dev/null differ diff --git a/contests/Round859(Div4)/A/main.cpp b/contests/Round859(Div4)/A/main.cpp deleted file mode 100755 index 333bd0b..0000000 --- a/contests/Round859(Div4)/A/main.cpp +++ /dev/null @@ -1,139 +0,0 @@ -#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 deleted file mode 100644 index 91dc315..0000000 --- a/contests/Round859(Div4)/A/main_input0.txt +++ /dev/null @@ -1,12 +0,0 @@ -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 deleted file mode 100644 index a4d808b..0000000 --- a/contests/Round859(Div4)/A/main_output0.txt +++ /dev/null @@ -1,11 +0,0 @@ -+ -- -- -+ -+ -- -+ -+ -- -- -+ diff --git a/contests/Round859(Div4)/B/main b/contests/Round859(Div4)/B/main deleted file mode 100755 index 9c85033..0000000 Binary files a/contests/Round859(Div4)/B/main and /dev/null differ diff --git a/contests/Round859(Div4)/B/main.cpp b/contests/Round859(Div4)/B/main.cpp deleted file mode 100755 index 0c93911..0000000 --- a/contests/Round859(Div4)/B/main.cpp +++ /dev/null @@ -1,150 +0,0 @@ -#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 deleted file mode 100644 index bdafd50..0000000 --- a/contests/Round859(Div4)/B/main_input0.txt +++ /dev/null @@ -1,7 +0,0 @@ -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 deleted file mode 100644 index c6e03a3..0000000 --- a/contests/Round859(Div4)/B/main_output0.txt +++ /dev/null @@ -1,3 +0,0 @@ -YES -NO -NO diff --git a/contests/Round859(Div4)/C/main b/contests/Round859(Div4)/C/main deleted file mode 100755 index 17ac24c..0000000 Binary files a/contests/Round859(Div4)/C/main and /dev/null differ diff --git a/contests/Round859(Div4)/C/main.cpp b/contests/Round859(Div4)/C/main.cpp deleted file mode 100755 index 566b95c..0000000 --- a/contests/Round859(Div4)/C/main.cpp +++ /dev/null @@ -1,164 +0,0 @@ -#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 deleted file mode 100644 index e3b21b8..0000000 --- a/contests/Round859(Div4)/C/main_input0.txt +++ /dev/null @@ -1,17 +0,0 @@ -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 deleted file mode 100644 index 3876667..0000000 --- a/contests/Round859(Div4)/C/main_output0.txt +++ /dev/null @@ -1,8 +0,0 @@ -YES -NO -YES -YES -NO -YES -NO -NO diff --git a/contests/Round859(Div4)/D/main b/contests/Round859(Div4)/D/main deleted file mode 100755 index 7778923..0000000 Binary files a/contests/Round859(Div4)/D/main and /dev/null differ diff --git a/contests/Round859(Div4)/D/main.cpp b/contests/Round859(Div4)/D/main.cpp deleted file mode 100755 index 62f9db4..0000000 --- a/contests/Round859(Div4)/D/main.cpp +++ /dev/null @@ -1,174 +0,0 @@ -#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 deleted file mode 100644 index d7ea228..0000000 --- a/contests/Round859(Div4)/D/main_input0.txt +++ /dev/null @@ -1,15 +0,0 @@ -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 deleted file mode 100644 index aa44313..0000000 --- a/contests/Round859(Div4)/D/main_output0.txt +++ /dev/null @@ -1,10 +0,0 @@ -YES -YES -YES -NO -YES -NO -NO -NO -NO -YES diff --git a/contests/Round859(Div4)/E/main b/contests/Round859(Div4)/E/main deleted file mode 100755 index 31ed974..0000000 Binary files a/contests/Round859(Div4)/E/main and /dev/null differ diff --git a/contests/Round859(Div4)/E/main.cpp b/contests/Round859(Div4)/E/main.cpp deleted file mode 100755 index e15145d..0000000 --- a/contests/Round859(Div4)/E/main.cpp +++ /dev/null @@ -1,160 +0,0 @@ -#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 deleted file mode 100755 index 70c7757..0000000 --- a/contests/Round859(Div4)/F/main.cpp +++ /dev/null @@ -1,132 +0,0 @@ -#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 deleted file mode 100755 index 2d8e3e3..0000000 Binary files a/contests/Round859(Div4)/G1/main and /dev/null differ diff --git a/contests/Round859(Div4)/G1/main.cpp b/contests/Round859(Div4)/G1/main.cpp deleted file mode 100755 index eda5e97..0000000 --- a/contests/Round859(Div4)/G1/main.cpp +++ /dev/null @@ -1,154 +0,0 @@ -#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 deleted file mode 100644 index cced71f..0000000 --- a/contests/Round859(Div4)/G1/main_input0.txt +++ /dev/null @@ -1,13 +0,0 @@ -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 deleted file mode 100644 index 65c9f64..0000000 --- a/contests/Round859(Div4)/G1/main_input1.txt +++ /dev/null @@ -1,2 +0,0 @@ -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 deleted file mode 100644 index 425d434..0000000 --- a/contests/Round859(Div4)/G1/main_input10.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index 8cea45f..0000000 --- a/contests/Round859(Div4)/G1/main_input11.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index fab2bce..0000000 --- a/contests/Round859(Div4)/G1/main_input12.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index 9f54a91..0000000 --- a/contests/Round859(Div4)/G1/main_input2.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index 4a6ddb0..0000000 --- a/contests/Round859(Div4)/G1/main_input3.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index d726d72..0000000 --- a/contests/Round859(Div4)/G1/main_input4.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index eafd65c..0000000 --- a/contests/Round859(Div4)/G1/main_input5.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index 35e5999..0000000 --- a/contests/Round859(Div4)/G1/main_input6.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index 425d434..0000000 --- a/contests/Round859(Div4)/G1/main_input7.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index b9152d8..0000000 --- a/contests/Round859(Div4)/G1/main_input8.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index 9a716b0..0000000 --- a/contests/Round859(Div4)/G1/main_input9.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index 60052d7..0000000 --- a/contests/Round859(Div4)/G1/main_output0.txt +++ /dev/null @@ -1,6 +0,0 @@ -YES -NO -YES -NO -YES -YES diff --git a/contests/Round859(Div4)/G1/main_output1.txt b/contests/Round859(Div4)/G1/main_output1.txt deleted file mode 100644 index d2bb323..0000000 --- a/contests/Round859(Div4)/G1/main_output1.txt +++ /dev/null @@ -1 +0,0 @@ -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 deleted file mode 100644 index ba28208..0000000 --- a/contests/Round859(Div4)/G1/main_output10.txt +++ /dev/null @@ -1 +0,0 @@ -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 deleted file mode 100644 index d2bb323..0000000 --- a/contests/Round859(Div4)/G1/main_output11.txt +++ /dev/null @@ -1 +0,0 @@ -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 deleted file mode 100644 index ba28208..0000000 --- a/contests/Round859(Div4)/G1/main_output12.txt +++ /dev/null @@ -1 +0,0 @@ -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 deleted file mode 100644 index ba28208..0000000 --- a/contests/Round859(Div4)/G1/main_output2.txt +++ /dev/null @@ -1 +0,0 @@ -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 deleted file mode 100644 index ba28208..0000000 --- a/contests/Round859(Div4)/G1/main_output3.txt +++ /dev/null @@ -1 +0,0 @@ -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 deleted file mode 100644 index ba28208..0000000 --- a/contests/Round859(Div4)/G1/main_output4.txt +++ /dev/null @@ -1 +0,0 @@ -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 deleted file mode 100644 index ba28208..0000000 --- a/contests/Round859(Div4)/G1/main_output5.txt +++ /dev/null @@ -1 +0,0 @@ -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 deleted file mode 100644 index ba28208..0000000 --- a/contests/Round859(Div4)/G1/main_output6.txt +++ /dev/null @@ -1 +0,0 @@ -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 deleted file mode 100644 index ba28208..0000000 --- a/contests/Round859(Div4)/G1/main_output7.txt +++ /dev/null @@ -1 +0,0 @@ -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 deleted file mode 100644 index ba28208..0000000 --- a/contests/Round859(Div4)/G1/main_output8.txt +++ /dev/null @@ -1 +0,0 @@ -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 deleted file mode 100644 index ba28208..0000000 --- a/contests/Round859(Div4)/G1/main_output9.txt +++ /dev/null @@ -1 +0,0 @@ -NO \ No newline at end of file -- cgit v1.2.3