oj.uz

Submission #636579

# Submission time Handle Problem Language Result Execution time Memory
636579 2022-08-29T15:35:43 Z vovamr Sajam (COCI18_sajam) C++17
90 / 90
 459 ms 5204 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

inline void solve() {
	int n, k;
	cin >> n >> k;
	ve<ve<int>> a(n, ve<int> (n));
	for (auto &i : a) for (auto &j : i) {
		char x;
		cin >> x;
		j = (x == 'x' ? 1 : 0);
	}

	int sum = 0;
	for (auto &i : a) for (auto &j : i) sum += j;

	for (int it = 0; it < 300; ++it) {
		for (int i = 0; i < n; ++i) {
			int s = 0;
			for (int j = 0; j < n; ++j) s += a[i][j];
			if (s * 2 > n) for (int j = 0; j < n; ++j) {
				sum -= a[i][j];
				a[i][j] ^= 1;
				sum += a[i][j];
			}
		}
		for (int j = 0; j < n; ++j) {
			int s = 0;
			for (int i = 0; i < n; ++i) s += a[i][j];
			if (s * 2 > n) for (int i = 0; i < n; ++i) {
				sum -= a[i][j];
				a[i][j] ^= 1;
				sum += a[i][j];
			}
		}
		if (sum <= k) return void(cout << "DA");
	}
	cout << "NE";
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 4 ms 1104 KB Output is correct
3 Correct 6 ms 1620 KB Output is correct
4 Correct 15 ms 4308 KB Output is correct
5 Correct 6 ms 1620 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 132 ms 1492 KB Output is correct
8 Correct 378 ms 4564 KB Output is correct
9 Correct 20 ms 584 KB Output is correct
10 Correct 429 ms 4688 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 3 ms 328 KB Output is correct
9 Correct 4 ms 456 KB Output is correct
10 Correct 3 ms 340 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 3028 KB Output is correct
2 Correct 12 ms 3668 KB Output is correct
3 Correct 9 ms 2516 KB Output is correct
4 Correct 8 ms 2260 KB Output is correct
5 Correct 15 ms 4284 KB Output is correct
6 Correct 147 ms 1748 KB Output is correct
7 Correct 255 ms 3028 KB Output is correct
8 Correct 290 ms 3284 KB Output is correct
9 Correct 66 ms 1108 KB Output is correct
10 Correct 443 ms 5136 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 3924 KB Output is correct
2 Correct 16 ms 3856 KB Output is correct
3 Correct 8 ms 2352 KB Output is correct
4 Correct 11 ms 2896 KB Output is correct
5 Correct 12 ms 3148 KB Output is correct
6 Correct 424 ms 4932 KB Output is correct
7 Correct 105 ms 1428 KB Output is correct
8 Correct 245 ms 2880 KB Output is correct
9 Correct 272 ms 3132 KB Output is correct
10 Correct 459 ms 5132 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2416 KB Output is correct
2 Correct 10 ms 2388 KB Output is correct
3 Correct 18 ms 5036 KB Output is correct
4 Correct 6 ms 1740 KB Output is correct
5 Correct 8 ms 2404 KB Output is correct
6 Correct 440 ms 4896 KB Output is correct
7 Correct 145 ms 1620 KB Output is correct
8 Correct 151 ms 1884 KB Output is correct
9 Correct 172 ms 1932 KB Output is correct
10 Correct 150 ms 1900 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 5204 KB Output is correct
2 Correct 20 ms 4948 KB Output is correct
3 Correct 19 ms 4556 KB Output is correct
4 Correct 10 ms 2896 KB Output is correct
5 Correct 11 ms 2944 KB Output is correct
6 Correct 282 ms 3068 KB Output is correct
7 Correct 123 ms 1764 KB Output is correct
8 Correct 354 ms 4092 KB Output is correct
9 Correct 229 ms 2344 KB Output is correct
10 Correct 444 ms 4824 KB Output is correct