diff options
Diffstat (limited to 'contests')
64 files changed, 1950 insertions, 78 deletions
diff --git a/contests/NeviusWelcomeRound(div1+div2)/A/main b/contests/NeviusWelcomeRound(div1+div2)/A/main Binary files differnew file mode 100755 index 0000000..2ab498b --- /dev/null +++ b/contests/NeviusWelcomeRound(div1+div2)/A/main diff --git a/contests/NeviusWelcomeRound(div1+div2)/A/main.cpp b/contests/NeviusWelcomeRound(div1+div2)/A/main.cpp new file mode 100755 index 0000000..a54c436 --- /dev/null +++ b/contests/NeviusWelcomeRound(div1+div2)/A/main.cpp @@ -0,0 +1,106 @@ +#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 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}; + +//pretty printing +template<typename K, typename V> +void printm(const map<K, V> &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template<typename T> +void printv(const vector<T> &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template<typename T> +void printvv(const vector<vector<T>> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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; + cin >> a >> b; + a = abs(a); + b = abs(b); + ll ans = 0; + if (a > b || a < b) { + int tmp = min(a, b); + int mx = max(a, b); + print(tmp); + ans += tmp * 2; + ans += (mx - tmp) * 2 - 1; + cout << ans << '\n'; + } else { + cout << abs(a) * 2 << '\n'; + } + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/NeviusWelcomeRound(div1+div2)/A/main_input0.txt b/contests/NeviusWelcomeRound(div1+div2)/A/main_input0.txt new file mode 100644 index 0000000..c45dff2 --- /dev/null +++ b/contests/NeviusWelcomeRound(div1+div2)/A/main_input0.txt @@ -0,0 +1,6 @@ +5 +-4 1 +4 4 +0 -6 +-5 -4 +7 -8 diff --git a/contests/NeviusWelcomeRound(div1+div2)/A/main_output0.txt b/contests/NeviusWelcomeRound(div1+div2)/A/main_output0.txt new file mode 100644 index 0000000..9637260 --- /dev/null +++ b/contests/NeviusWelcomeRound(div1+div2)/A/main_output0.txt @@ -0,0 +1,5 @@ +7 +8 +11 +9 +15 diff --git a/contests/NeviusWelcomeRound(div1+div2)/B/main b/contests/NeviusWelcomeRound(div1+div2)/B/main Binary files differnew file mode 100755 index 0000000..7ff53f1 --- /dev/null +++ b/contests/NeviusWelcomeRound(div1+div2)/B/main diff --git a/contests/NeviusWelcomeRound(div1+div2)/B/main.cpp b/contests/NeviusWelcomeRound(div1+div2)/B/main.cpp new file mode 100755 index 0000000..1ed836d --- /dev/null +++ b/contests/NeviusWelcomeRound(div1+div2)/B/main.cpp @@ -0,0 +1,105 @@ +#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 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}; + +//pretty printing +template<typename K, typename V> +void printm(const map<K, V> &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template<typename T> +void printv(const vector<T> &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template<typename T> +void printvv(const vector<vector<T>> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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, k, d, w; + cin >> n >> k >> d >> w; + vi v(n); + int ans = 1; + for (auto &x : v) cin >> x; + pii p = make_pair(v[0], 0); + for (int i = 1; i < n; i++) { + if (v[i] - p.first - w > d || i - p.second >= k) { + ans++; + p.first = v[i]; + p.second = i; + } + } + cout << ans << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/NeviusWelcomeRound(div1+div2)/B/main_input0.txt b/contests/NeviusWelcomeRound(div1+div2)/B/main_input0.txt new file mode 100644 index 0000000..6b9dff9 --- /dev/null +++ b/contests/NeviusWelcomeRound(div1+div2)/B/main_input0.txt @@ -0,0 +1,11 @@ +5 +6 3 5 3 +1 2 3 10 11 18 +6 4 0 0 +3 3 3 3 3 4 +9 10 2 2 +0 1 2 3 4 5 6 7 8 +3 10 3 6 +10 20 30 +5 5 4 4 +0 2 4 6 8 diff --git a/contests/NeviusWelcomeRound(div1+div2)/B/main_output0.txt b/contests/NeviusWelcomeRound(div1+div2)/B/main_output0.txt new file mode 100644 index 0000000..dd56969 --- /dev/null +++ b/contests/NeviusWelcomeRound(div1+div2)/B/main_output0.txt @@ -0,0 +1,5 @@ +2 +3 +2 +3 +1 diff --git a/contests/NeviusWelcomeRound(div1+div2)/C/main.cpp b/contests/NeviusWelcomeRound(div1+div2)/C/main.cpp new file mode 100755 index 0000000..9af49f8 --- /dev/null +++ b/contests/NeviusWelcomeRound(div1+div2)/C/main.cpp @@ -0,0 +1,91 @@ +#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 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}; + +//pretty printing +template<typename K, typename V> +void printm(const map<K, V> &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template<typename T> +void printv(const vector<T> &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template<typename T> +void printvv(const vector<vector<T>> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/NeviusWelcomeRound(div1+div2)/D/main.cpp b/contests/NeviusWelcomeRound(div1+div2)/D/main.cpp new file mode 100755 index 0000000..9af49f8 --- /dev/null +++ b/contests/NeviusWelcomeRound(div1+div2)/D/main.cpp @@ -0,0 +1,91 @@ +#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 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}; + +//pretty printing +template<typename K, typename V> +void printm(const map<K, V> &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template<typename T> +void printv(const vector<T> &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template<typename T> +void printvv(const vector<vector<T>> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/NeviusWelcomeRound(div1+div2)/E/main.cpp b/contests/NeviusWelcomeRound(div1+div2)/E/main.cpp new file mode 100755 index 0000000..9af49f8 --- /dev/null +++ b/contests/NeviusWelcomeRound(div1+div2)/E/main.cpp @@ -0,0 +1,91 @@ +#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 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}; + +//pretty printing +template<typename K, typename V> +void printm(const map<K, V> &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template<typename T> +void printv(const vector<T> &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template<typename T> +void printvv(const vector<vector<T>> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +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 main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/NeviusWelcomeRound(div1+div2)/F/main.cpp b/contests/NeviusWelcomeRound(div1+div2)/F/main.cpp new file mode 100755 index 0000000..9af49f8 --- /dev/null +++ b/contests/NeviusWelcomeRound(div1+div2)/F/main.cpp @@ -0,0 +1,91 @@ +#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 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}; + +//pretty printing +template<typename K, typename V> +void printm(const map<K, V> &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template<typename T> +void printv(const vector<T> &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template<typename T> +void printvv(const vector<vector<T>> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); |