oj.uz

Submission #170232

# Submission time Handle Problem Language Result Execution time Memory
170232 2019-12-24T09:56:36 Z div2der Red-blue table (IZhO19_stones) C++14
38 / 100
 115 ms 4960 KB 
#include <iostream>
#include <set>
#include <map>
#include <algorithm>
using namespace std;

#define sz(s) (int)(s.size())
#define eb emplace_back
#define all(x) x.begin(), x.end()

const int N = 2e6;
const int NN = 4e3;

char a[NN][NN];

int c[N], r[N];

void solve(int n, int m) {
	if (n <= m) {
		for (int i = 1; i <= n; ++ i) {
			r[i] = 0;
			for (int j = 1; j <= m; ++ j) {
				a[i][j] = '-';
				c[j] = 0;
			}
		}
		int need = (m / 2 + 1);
		int mx = n - (n / 2 + 1);
		int pos = 1;
		int ans = 0;
		for (int i = 1; i <= n; ++ i) {
			int cnt = 0;
			int rev = pos++;
			int res = 0;
			while(cnt <= m and r[i] < need) {
				++cnt;
				if (res == need)
					break;
				if (c[rev] < mx) {
					a[i][rev] = '+';
					c[rev]++;
					r[i]++;
					++res;
				}
				++rev;
				if (rev > m)
					rev = 1;
			}
			if (r[i] == need)
				++ans;
			if (cnt == m)
				if (res != need)
					break;
		}
		
		cout << m + ans << '\n';
		for (int i = 1; i <= n; ++ i) {
			for (int j = 1; j <= m; ++ j)
				cout << a[i][j];
			cout << '\n';
		}
		return;
	}
	else {
		for (int j = 1; j <= m; ++ j){
			c[j] = 0;
			for (int i = 1; i <= n; ++ i){
				r[i] = 0;
				a[i][j] = '+';
			}
		}
		int need = (n / 2 + 1);
		int mx = m - (m / 2 + 1);
		int pos = 1;
		int ans = 0;
		for (int i = 1; i <= m; ++ i) {
			int cnt = 0;
			int rev = pos++;
			int res = 0;
			while(cnt <= n and c[i] < need) {
				++cnt;
				if (res == need)
					break;
				if (r[rev] < mx) {
					a[rev][i] = '-';
					r[rev]++;
					c[i]++;
					++res;
				}
				++rev;
				if (rev > n)
					rev = 1;
			}
			if (c[i] == need)
				++ans;
			if (cnt == n)
				if (res != need)
					break;
		}
		cout << n + ans << '\n';
		for (int i = 1; i <= n; ++ i) {
			for (int j = 1; j <= m; ++ j)
				cout << (a[i][j] != '-' ? '+' : '-');
			cout << '\n';
		}
	}
}

int main () {	
	int t;
	cin >> t;
	while(t--) {
		int n, m;
		cin >> n >> m;
		solve(n, m);
	}

	return 0;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Incorrect 6 ms 504 KB Wrong answer in test 38 5: 40 < 41

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 1784 KB Output is correct
2 Correct 44 ms 4168 KB Output is correct
3 Correct 115 ms 4960 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 44 ms 1912 KB Wrong answer in test 6 6: 8 < 9
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Incorrect 6 ms 504 KB Wrong answer in test 38 5: 40 < 41