diff options
| author | omagdy7 <omar.professional8777@gmail.com> | 2023-03-19 11:58:33 +0200 |
|---|---|---|
| committer | omagdy7 <omar.professional8777@gmail.com> | 2023-03-19 11:58:33 +0200 |
| commit | ba391960d9d26180335fccc2f3d593021324de76 (patch) | |
| tree | 7fb520af7ba4ff0b56a2e67282bf8c3f686fb36d /codeforces/WalkingMaster | |
| parent | ef09dc1158cfb989a59af5e987d1791d159ad055 (diff) | |
| download | competitive-programming-ba391960d9d26180335fccc2f3d593021324de76.tar.xz competitive-programming-ba391960d9d26180335fccc2f3d593021324de76.zip | |
Solved new problems from codeforces
Diffstat (limited to 'codeforces/WalkingMaster')
| -rwxr-xr-x | codeforces/WalkingMaster/main | bin | 0 -> 17784 bytes | |||
| -rwxr-xr-x | codeforces/WalkingMaster/main.cpp | 142 | ||||
| -rw-r--r-- | codeforces/WalkingMaster/main_input0.txt | 7 | ||||
| -rw-r--r-- | codeforces/WalkingMaster/main_output0.txt | 6 |
4 files changed, 155 insertions, 0 deletions
diff --git a/codeforces/WalkingMaster/main b/codeforces/WalkingMaster/main Binary files differnew file mode 100755 index 0000000..2813aca --- /dev/null +++ b/codeforces/WalkingMaster/main diff --git a/codeforces/WalkingMaster/main.cpp b/codeforces/WalkingMaster/main.cpp new file mode 100755 index 0000000..3efb42c --- /dev/null +++ b/codeforces/WalkingMaster/main.cpp @@ -0,0 +1,142 @@ +#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 a, b, c, d; + cin >> a >> b >> c >> d; + int xAfterUp = (d - b) + a; + print(xAfterUp); + if (d > b && c <= a) + if ((d <= b && c > a) || c > xAfterUp) { + cout << -1 << '\n'; + return; + } + cout << (d - b) + abs(xAfterUp - c) << '\n'; + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/WalkingMaster/main_input0.txt b/codeforces/WalkingMaster/main_input0.txt new file mode 100644 index 0000000..fd8aabe --- /dev/null +++ b/codeforces/WalkingMaster/main_input0.txt @@ -0,0 +1,7 @@ +6 +-1 0 -1 2 +0 0 4 5 +-2 -1 1 1 +-3 2 -3 2 +2 -1 -1 -1 +1 1 0 2 diff --git a/codeforces/WalkingMaster/main_output0.txt b/codeforces/WalkingMaster/main_output0.txt new file mode 100644 index 0000000..1382439 --- /dev/null +++ b/codeforces/WalkingMaster/main_output0.txt @@ -0,0 +1,6 @@ +4 +6 +-1 +0 +3 +3 |
