diff options
| author | omagdy7 <omar.professional8777@gmail.com> | 2023-03-20 01:21:59 +0200 |
|---|---|---|
| committer | omagdy7 <omar.professional8777@gmail.com> | 2023-03-20 01:21:59 +0200 |
| commit | 6411812a630e4230af27705d11f30405fbd83a68 (patch) | |
| tree | e441d9a77f17364c14d6d0fadd6cab23daf6754a /AtCoder/CallTheIdNumber | |
| parent | ba391960d9d26180335fccc2f3d593021324de76 (diff) | |
| download | competitive-programming-6411812a630e4230af27705d11f30405fbd83a68.tar.xz competitive-programming-6411812a630e4230af27705d11f30405fbd83a68.zip | |
Solved 7 problems in Div4
Diffstat (limited to 'AtCoder/CallTheIdNumber')
| -rwxr-xr-x | AtCoder/CallTheIdNumber/main | bin | 0 -> 35888 bytes | |||
| -rwxr-xr-x | AtCoder/CallTheIdNumber/main.cpp | 149 | ||||
| -rw-r--r-- | AtCoder/CallTheIdNumber/main_input0.txt | 2 | ||||
| -rw-r--r-- | AtCoder/CallTheIdNumber/main_input1.txt | 2 | ||||
| -rw-r--r-- | AtCoder/CallTheIdNumber/main_output0.txt | 2 | ||||
| -rw-r--r-- | AtCoder/CallTheIdNumber/main_output1.txt | 2 |
6 files changed, 157 insertions, 0 deletions
diff --git a/AtCoder/CallTheIdNumber/main b/AtCoder/CallTheIdNumber/main Binary files differnew file mode 100755 index 0000000..a4d9237 --- /dev/null +++ b/AtCoder/CallTheIdNumber/main diff --git a/AtCoder/CallTheIdNumber/main.cpp b/AtCoder/CallTheIdNumber/main.cpp new file mode 100755 index 0000000..b0d575d --- /dev/null +++ b/AtCoder/CallTheIdNumber/main.cpp @@ -0,0 +1,149 @@ +#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 + */ +// 1 0 1 1 0 + +void solve() { + int n; + cin >> n; + vi v(n); + vector<bool> checked(n); + int len = n; + for (auto &x : v) cin >> x; + for (int i = 0; i < n; i++) { + if (!checked[i]) { + checked[v[i] - 1] = true; + len--; + } + } + cout << count(all(checked), false) << '\n'; + for (int i = 0; i < checked.size(); i++) { + if (!checked[i]) { + cout << i + 1 << ' '; + } + } + cout << '\n'; + + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + solve(); +} + + diff --git a/AtCoder/CallTheIdNumber/main_input0.txt b/AtCoder/CallTheIdNumber/main_input0.txt new file mode 100644 index 0000000..60c723c --- /dev/null +++ b/AtCoder/CallTheIdNumber/main_input0.txt @@ -0,0 +1,2 @@ +5 +3 1 4 5 4 diff --git a/AtCoder/CallTheIdNumber/main_input1.txt b/AtCoder/CallTheIdNumber/main_input1.txt new file mode 100644 index 0000000..d4e3ed5 --- /dev/null +++ b/AtCoder/CallTheIdNumber/main_input1.txt @@ -0,0 +1,2 @@ +20 +9 7 19 7 10 4 13 9 4 8 10 15 16 3 18 19 12 13 2 12 diff --git a/AtCoder/CallTheIdNumber/main_output0.txt b/AtCoder/CallTheIdNumber/main_output0.txt new file mode 100644 index 0000000..810122a --- /dev/null +++ b/AtCoder/CallTheIdNumber/main_output0.txt @@ -0,0 +1,2 @@ +2 +2 4 diff --git a/AtCoder/CallTheIdNumber/main_output1.txt b/AtCoder/CallTheIdNumber/main_output1.txt new file mode 100644 index 0000000..78d261c --- /dev/null +++ b/AtCoder/CallTheIdNumber/main_output1.txt @@ -0,0 +1,2 @@ +10 +1 2 5 6 8 11 14 17 18 20 |
