diff options
| author | omagdy7 <omar.professional8777@gmail.com> | 2023-07-24 13:11:33 +0300 |
|---|---|---|
| committer | omagdy7 <omar.professional8777@gmail.com> | 2023-07-24 13:11:33 +0300 |
| commit | 6b548332bfc6469756526002971c422f43f86d0a (patch) | |
| tree | 261fde23f07c3e20cea375030f0c52863b59228c /contests/Round864/B | |
| parent | cff8cae22ee9c25d193ff976143813f93e658e55 (diff) | |
| download | competitive-programming-6b548332bfc6469756526002971c422f43f86d0a.tar.xz competitive-programming-6b548332bfc6469756526002971c422f43f86d0a.zip | |
Removed some empty *.cpp files and Solved some new problems
Diffstat (limited to 'contests/Round864/B')
| -rwxr-xr-x | contests/Round864/B/main | bin | 0 -> 44920 bytes | |||
| -rwxr-xr-x | contests/Round864/B/main.cpp | 151 | ||||
| -rw-r--r-- | contests/Round864/B/main_input0.txt | 17 | ||||
| -rw-r--r-- | contests/Round864/B/main_input1.txt | 5 | ||||
| -rw-r--r-- | contests/Round864/B/main_input2.txt | 7 | ||||
| -rw-r--r-- | contests/Round864/B/main_input3.txt | 7 | ||||
| -rw-r--r-- | contests/Round864/B/main_input4.txt | 3 | ||||
| -rw-r--r-- | contests/Round864/B/main_output0.txt | 3 | ||||
| -rw-r--r-- | contests/Round864/B/main_output1.txt | 1 | ||||
| -rw-r--r-- | contests/Round864/B/main_output2.txt | 1 | ||||
| -rw-r--r-- | contests/Round864/B/main_output3.txt | 1 | ||||
| -rw-r--r-- | contests/Round864/B/main_output4.txt | 1 |
12 files changed, 197 insertions, 0 deletions
diff --git a/contests/Round864/B/main b/contests/Round864/B/main Binary files differnew file mode 100755 index 0000000..92d89e6 --- /dev/null +++ b/contests/Round864/B/main diff --git a/contests/Round864/B/main.cpp b/contests/Round864/B/main.cpp new file mode 100755 index 0000000..7cfc4c0 --- /dev/null +++ b/contests/Round864/B/main.cpp @@ -0,0 +1,151 @@ +#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 dbg() { cerr << "\n"; } + +template <typename T, typename... TS> void dbg(T val, TS... vals) { + cerr << val << " "; + dbg(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; + cin >> n >> k; + vector<vi> v(n, vi(n)); + for (int i = 0; i < n; i++) { + for (int j = 0; j < n; j++) { + cin >> v[i][j]; + } + } + int diff = 0; + for (int i = 0; i < n; i++) { + vi tmp = vi(rall(v[n - 1 - i])); + for (int j = 0; j < n; j++) { + diff += (v[i][j] != tmp[j]); + } + } + diff /= 2; + if ((k >= diff) && (n % 2 == 1 || (k - diff) % 2 == 0)) { + cout << "YES\n"; + } else { + cout << "NO\n"; + } +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/contests/Round864/B/main_input0.txt b/contests/Round864/B/main_input0.txt new file mode 100644 index 0000000..490fc11 --- /dev/null +++ b/contests/Round864/B/main_input0.txt @@ -0,0 +1,17 @@ +3 +4 0 +1 1 1 1 +0 0 0 1 +1 0 1 0 +1 1 1 1 +4 3 +1 0 1 1 +1 0 0 0 +0 1 0 1 +1 1 0 1 +5 4 +0 0 0 0 0 +0 1 1 1 1 +0 1 0 0 0 +1 1 1 1 1 +0 0 0 0 0 diff --git a/contests/Round864/B/main_input1.txt b/contests/Round864/B/main_input1.txt new file mode 100644 index 0000000..9b4878d --- /dev/null +++ b/contests/Round864/B/main_input1.txt @@ -0,0 +1,5 @@ +1 +3 0 +1 0 1 +0 0 1 +1 0 1
\ No newline at end of file diff --git a/contests/Round864/B/main_input2.txt b/contests/Round864/B/main_input2.txt new file mode 100644 index 0000000..570d349 --- /dev/null +++ b/contests/Round864/B/main_input2.txt @@ -0,0 +1,7 @@ +1 +5 3 +1 1 0 0 1 +1 1 0 0 1 +1 0 1 0 0 +1 1 0 0 1 +1 1 0 0 1
\ No newline at end of file diff --git a/contests/Round864/B/main_input3.txt b/contests/Round864/B/main_input3.txt new file mode 100644 index 0000000..15bcb35 --- /dev/null +++ b/contests/Round864/B/main_input3.txt @@ -0,0 +1,7 @@ +1 +5 10 +1 0 0 0 1 +0 1 1 1 0 +0 0 1 1 1 +1 1 0 0 0 +1 0 0 0 1
\ No newline at end of file diff --git a/contests/Round864/B/main_input4.txt b/contests/Round864/B/main_input4.txt new file mode 100644 index 0000000..43b3b78 --- /dev/null +++ b/contests/Round864/B/main_input4.txt @@ -0,0 +1,3 @@ +1 +1 0 +2
\ No newline at end of file diff --git a/contests/Round864/B/main_output0.txt b/contests/Round864/B/main_output0.txt new file mode 100644 index 0000000..5158019 --- /dev/null +++ b/contests/Round864/B/main_output0.txt @@ -0,0 +1,3 @@ +NO +YES +YES diff --git a/contests/Round864/B/main_output1.txt b/contests/Round864/B/main_output1.txt new file mode 100644 index 0000000..ba28208 --- /dev/null +++ b/contests/Round864/B/main_output1.txt @@ -0,0 +1 @@ +NO
\ No newline at end of file diff --git a/contests/Round864/B/main_output2.txt b/contests/Round864/B/main_output2.txt new file mode 100644 index 0000000..d2bb323 --- /dev/null +++ b/contests/Round864/B/main_output2.txt @@ -0,0 +1 @@ +YES
\ No newline at end of file diff --git a/contests/Round864/B/main_output3.txt b/contests/Round864/B/main_output3.txt new file mode 100644 index 0000000..ba28208 --- /dev/null +++ b/contests/Round864/B/main_output3.txt @@ -0,0 +1 @@ +NO
\ No newline at end of file diff --git a/contests/Round864/B/main_output4.txt b/contests/Round864/B/main_output4.txt new file mode 100644 index 0000000..d2bb323 --- /dev/null +++ b/contests/Round864/B/main_output4.txt @@ -0,0 +1 @@ +YES
\ No newline at end of file |
