diff options
Diffstat (limited to 'contests/Round#856(Div2)')
19 files changed, 0 insertions, 621 deletions
diff --git a/contests/Round#856(Div2)/A/main b/contests/Round#856(Div2)/A/main Binary files differdeleted file mode 100755 index 1fa16e6..0000000 --- a/contests/Round#856(Div2)/A/main +++ /dev/null diff --git a/contests/Round#856(Div2)/A/main.cpp b/contests/Round#856(Div2)/A/main.cpp deleted file mode 100755 index b91d9d6..0000000 --- a/contests/Round#856(Div2)/A/main.cpp +++ /dev/null @@ -1,108 +0,0 @@ -#include<bits/stdc++.h> -using namespace std; - -using ll = long long; -using pi = pair<int, int>; -using vpi = vector<pi>; -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 - -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; - cin >> n; - vector<string> v(2*n - 2); - map<int, vector<string>> mp; - for (int i = 0; i < 2*n - 2; i++) { - string s; - cin >> s; - v[i] = s; - mp[s.length() - 1].pb(s); - } - bool flag = true; - for (int i = 0; i < n - 1; i++) { - string s1 = mp[i][0]; - string s2 = mp[i][1]; - s2 = string(rall(s2)); - if (s1 != s2) { - flag = false; - } - } - cout << (flag ? "YES" : "NO") << '\n'; -} - -int main () { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while(tt--) { - solve(); - } -} - - diff --git a/contests/Round#856(Div2)/A/main_input0.txt b/contests/Round#856(Div2)/A/main_input0.txt deleted file mode 100644 index 952cb56..0000000 --- a/contests/Round#856(Div2)/A/main_input0.txt +++ /dev/null @@ -1,11 +0,0 @@ -5 -4 -bcd cd a d abc ab -3 -i io i oi -2 -g g -3 -t al lt a -4 -bba a ab a abb ba diff --git a/contests/Round#856(Div2)/A/main_output0.txt b/contests/Round#856(Div2)/A/main_output0.txt deleted file mode 100644 index 0451473..0000000 --- a/contests/Round#856(Div2)/A/main_output0.txt +++ /dev/null @@ -1,5 +0,0 @@ -NO -YES -YES -NO -YES diff --git a/contests/Round#856(Div2)/B/main b/contests/Round#856(Div2)/B/main Binary files differdeleted file mode 100755 index eed0238..0000000 --- a/contests/Round#856(Div2)/B/main +++ /dev/null diff --git a/contests/Round#856(Div2)/B/main.cpp b/contests/Round#856(Div2)/B/main.cpp deleted file mode 100755 index eb1bc20..0000000 --- a/contests/Round#856(Div2)/B/main.cpp +++ /dev/null @@ -1,95 +0,0 @@ -#include <bits/stdc++.h> -using namespace std; - -using ll = long long; -using pi = pair<int, int>; -using vpi = vector<pi>; -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 - -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; - cin >> n; - vi v(n); - for (auto &x : v) - cin >> x; - for (int i = 0 ; i < n; i++) { - v[i] += v[i] == 1; - } - for (int i = 0; i < n - 1; i++) { - while(v[i + 1] % v[i] == 0) { - v[i + 1]++; - } - } - for (int i = 0; i < n; i++) { - cout << v[i] << " \n"[i == n - 1]; - } -} - -int main() { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while (tt--) { - solve(); - } -} diff --git a/contests/Round#856(Div2)/B/main_input0.txt b/contests/Round#856(Div2)/B/main_input0.txt deleted file mode 100644 index 04652df..0000000 --- a/contests/Round#856(Div2)/B/main_input0.txt +++ /dev/null @@ -1,7 +0,0 @@ -3 -4 -2 4 3 6 -3 -1 2 3 -2 -4 2 diff --git a/contests/Round#856(Div2)/B/main_input1.txt b/contests/Round#856(Div2)/B/main_input1.txt deleted file mode 100644 index bc4ca8f..0000000 --- a/contests/Round#856(Div2)/B/main_input1.txt +++ /dev/null @@ -1,3 +0,0 @@ -1 -5 -1 3 4 5 7
\ No newline at end of file diff --git a/contests/Round#856(Div2)/B/main_input2.txt b/contests/Round#856(Div2)/B/main_input2.txt deleted file mode 100644 index b0a2002..0000000 --- a/contests/Round#856(Div2)/B/main_input2.txt +++ /dev/null @@ -1,3 +0,0 @@ -1 -5 -1 1 1 1 1
\ No newline at end of file diff --git a/contests/Round#856(Div2)/B/main_output0.txt b/contests/Round#856(Div2)/B/main_output0.txt deleted file mode 100644 index 1c5805b..0000000 --- a/contests/Round#856(Div2)/B/main_output0.txt +++ /dev/null @@ -1,3 +0,0 @@ -4 5 6 7 -3 2 3 -4 2 diff --git a/contests/Round#856(Div2)/B/main_output1.txt b/contests/Round#856(Div2)/B/main_output1.txt deleted file mode 100644 index d1cb357..0000000 --- a/contests/Round#856(Div2)/B/main_output1.txt +++ /dev/null @@ -1 +0,0 @@ -2 3 4 5 8
\ No newline at end of file diff --git a/contests/Round#856(Div2)/B/main_output2.txt b/contests/Round#856(Div2)/B/main_output2.txt deleted file mode 100644 index 39a5152..0000000 --- a/contests/Round#856(Div2)/B/main_output2.txt +++ /dev/null @@ -1 +0,0 @@ -3 2 3 2 3
\ No newline at end of file diff --git a/contests/Round#856(Div2)/C/main b/contests/Round#856(Div2)/C/main Binary files differdeleted file mode 100755 index c45c966..0000000 --- a/contests/Round#856(Div2)/C/main +++ /dev/null diff --git a/contests/Round#856(Div2)/C/main.cpp b/contests/Round#856(Div2)/C/main.cpp deleted file mode 100755 index c88ff25..0000000 --- a/contests/Round#856(Div2)/C/main.cpp +++ /dev/null @@ -1,107 +0,0 @@ -#include<bits/stdc++.h> -using namespace std; - -using ll = long long; -using pi = pair<int, int>; -using vpi = vector<pi>; -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 - -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; - cin >> n; - vector<int> a(n); - for (int i = 0; i < n; i++) { - cin >> a[i]; - } - for (int k = 0; k < n; k++) { - int lo = 1, hi = k + 2; - while (hi - lo > 1) { - int mid = (lo + hi) >> 1; - if (a[k - mid + 1] >= mid) { - lo = mid; - } else { - hi = mid; - } - } - cout << lo << ' '; - } - cout << '\n'; -} - -int main () { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while(tt--) { - solve(); - } -} - - diff --git a/contests/Round#856(Div2)/C/main_input0.txt b/contests/Round#856(Div2)/C/main_input0.txt deleted file mode 100644 index d30c37c..0000000 --- a/contests/Round#856(Div2)/C/main_input0.txt +++ /dev/null @@ -1,7 +0,0 @@ -3 -3 -1 2 3 -2 -1 1 -5 -5 5 5 5 5 diff --git a/contests/Round#856(Div2)/C/main_output0.txt b/contests/Round#856(Div2)/C/main_output0.txt deleted file mode 100644 index 73ff3a2..0000000 --- a/contests/Round#856(Div2)/C/main_output0.txt +++ /dev/null @@ -1,3 +0,0 @@ -1 1 2 -1 1 -1 2 3 4 5 diff --git a/contests/Round#856(Div2)/D/main.cpp b/contests/Round#856(Div2)/D/main.cpp deleted file mode 100755 index 7590c13..0000000 --- a/contests/Round#856(Div2)/D/main.cpp +++ /dev/null @@ -1,89 +0,0 @@ -#include<bits/stdc++.h> -using namespace std; - -using ll = long long; -using pi = pair<int, int>; -using vpi = vector<pi>; -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 - -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/Round#856(Div2)/E/main.cpp b/contests/Round#856(Div2)/E/main.cpp deleted file mode 100755 index 7590c13..0000000 --- a/contests/Round#856(Div2)/E/main.cpp +++ /dev/null @@ -1,89 +0,0 @@ -#include<bits/stdc++.h> -using namespace std; - -using ll = long long; -using pi = pair<int, int>; -using vpi = vector<pi>; -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 - -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/Round#856(Div2)/F/main.cpp b/contests/Round#856(Div2)/F/main.cpp deleted file mode 100755 index 7590c13..0000000 --- a/contests/Round#856(Div2)/F/main.cpp +++ /dev/null @@ -1,89 +0,0 @@ -#include<bits/stdc++.h> -using namespace std; - -using ll = long long; -using pi = pair<int, int>; -using vpi = vector<pi>; -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 - -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(); - } -} - - |