diff options
| author | omagdy7 <omar.professional8777@gmail.com> | 2023-03-25 15:43:13 +0200 |
|---|---|---|
| committer | omagdy7 <omar.professional8777@gmail.com> | 2023-03-25 15:43:13 +0200 |
| commit | 41e4a123e8a63a0a33bc7c89569731c2daf65d95 (patch) | |
| tree | 35be45dcccfdd37c7a269b42ae55e07d96b47d76 /codeforces/TheDoors | |
| parent | 6411812a630e4230af27705d11f30405fbd83a68 (diff) | |
| download | competitive-programming-41e4a123e8a63a0a33bc7c89569731c2daf65d95.tar.xz competitive-programming-41e4a123e8a63a0a33bc7c89569731c2daf65d95.zip | |
Solve some problems
Diffstat (limited to 'codeforces/TheDoors')
| -rwxr-xr-x | codeforces/TheDoors/main | bin | 0 -> 22568 bytes | |||
| -rwxr-xr-x | codeforces/TheDoors/main.cpp | 148 | ||||
| -rw-r--r-- | codeforces/TheDoors/main_input0.txt | 2 | ||||
| -rw-r--r-- | codeforces/TheDoors/main_input1.txt | 2 | ||||
| -rw-r--r-- | codeforces/TheDoors/main_output0.txt | 1 | ||||
| -rw-r--r-- | codeforces/TheDoors/main_output1.txt | 1 |
6 files changed, 154 insertions, 0 deletions
diff --git a/codeforces/TheDoors/main b/codeforces/TheDoors/main Binary files differnew file mode 100755 index 0000000..d99ba2b --- /dev/null +++ b/codeforces/TheDoors/main diff --git a/codeforces/TheDoors/main.cpp b/codeforces/TheDoors/main.cpp new file mode 100755 index 0000000..856aa11 --- /dev/null +++ b/codeforces/TheDoors/main.cpp @@ -0,0 +1,148 @@ +#include<bits/stdc++.h> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = vector<pii>; +using vi = vector<int>; +using vll = vector<long long>; +using mpii = map<int, int>; +using mpll = map<ll, ll>; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p); +template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec); +template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m); +template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m); +template<typename T> ostream& operator<<(ostream& os, const set<T>& s); +template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s); + +template<typename K, typename V> +ostream& operator<<(ostream& os, const pair<K, V>& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const vector<T>& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template<typename K, typename V> +ostream& operator<<(ostream& os, const map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename K, typename V> +ostream& operator<<(ostream& os, const unordered_map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const unordered_set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template<typename T, typename... TS> +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + int n; + cin >> n; + vi v(n); + int z = 0; + int o = 0; + for (auto &x : v) { + cin >> x; + z += (x == 0); + o += x; + } + for (int i = 0; i < n; i++) { + if (v[i] == 0) { + z--; + } else { + o--; + } + if (z < 1 || o < 1) { + cout << i + 1 << '\n'; + break; + } + } +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + solve(); +} + + diff --git a/codeforces/TheDoors/main_input0.txt b/codeforces/TheDoors/main_input0.txt new file mode 100644 index 0000000..d6b6bea --- /dev/null +++ b/codeforces/TheDoors/main_input0.txt @@ -0,0 +1,2 @@ +5 +0 0 1 0 0 diff --git a/codeforces/TheDoors/main_input1.txt b/codeforces/TheDoors/main_input1.txt new file mode 100644 index 0000000..6a7711a --- /dev/null +++ b/codeforces/TheDoors/main_input1.txt @@ -0,0 +1,2 @@ +4 +1 0 0 1 diff --git a/codeforces/TheDoors/main_output0.txt b/codeforces/TheDoors/main_output0.txt new file mode 100644 index 0000000..00750ed --- /dev/null +++ b/codeforces/TheDoors/main_output0.txt @@ -0,0 +1 @@ +3 diff --git a/codeforces/TheDoors/main_output1.txt b/codeforces/TheDoors/main_output1.txt new file mode 100644 index 0000000..00750ed --- /dev/null +++ b/codeforces/TheDoors/main_output1.txt @@ -0,0 +1 @@ +3 |
