oj.uz

Submission #954676

# Submission time Handle Problem Language Result Execution time Memory
954676 2024-03-28T10:30:47 Z atom Red-blue table (IZhO19_stones) C++17
43 / 100
 51 ms 428 KB 
#include "bits/stdc++.h"
// @JASPER'S BOILERPLATE
using namespace std;
using ll = long long;

#ifdef JASPER
#include "debug.h"
#else
#define debug(...) 166
#endif

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    
    #ifdef JASPER
        freopen("in1", "r", stdin);
    #endif

    int T; 
    cin >> T;
    while (T--) {
    	int n, m;
    	cin >> n >> m;

    	if (n <= 4 && m <= 4) {
    		int sz = (n * m);
	    	int opt = -1;
	    	int ans = 0;
	    	for (int msk = 0; msk < (1 << sz); ++msk) {
	    		vector <vector <int>> a(n, vector <int> (m));
	    		for (int i = 0; i < sz; ++i) {
	    			if (msk & (1 << i)) {
	    				int r = i / m;
	    				int c = i % m;
	    				a[r][c] = 1;
	    			}
	    		}

	    		int A = 0, B = 0;
		    	for (int i = 0; i < n; ++i) {
		    		int r = 0, b = 0;
		    		for (int j = 0; j < m; ++j) {
		    			if (a[i][j]) ++r;
		    			else ++b;
		    		}
		    		if (r > b) ++A;
		    	}

		    	for (int j = 0; j < m; ++j) {
		    		int r = 0, b = 0;
		    		for (int i = 0; i < n; ++i) {
		    			if (a[i][j]) ++r;
		    			else ++b;
		    		}
		    		if (b > r) ++B;
		    	}

		    	// debug(A, B, msk);
		    	if (A + B > ans) {
		    		ans = A + B;
		    		opt = msk;
		    	}
	    	}

	    	vector <vector <int>> a(n, vector <int> (m));
	    	for (int i = 0; i < sz; ++i) {
	    		if (opt & (1 << i)) {
	    			int r = i / m;
					int c = i % m;
					a[r][c] = 1;
	    		}
	    	}

	    	cout << ans << "\n";
	    	for (int i = 0; i < n; ++i) {
	    		for (int j = 0; j < m; ++j) {
	    			cout << (a[i][j]? "+" : "-");
	    		}
	    		cout << "\n";
	    	}
	    	continue;
	    }

	    // sub2
	    if (n <= 4 || m <= 4) {
	    	if (min(n, m) == n) {
	    		int r = n / 2;
	    		if (n % 2 == 0) --r;
	    		cout << (m + r) << "\n";
	    		for (int i = 1; i <= r; ++i) {
	    			for (int j = 1; j <= m; ++j)
	    				cout << "+";
	    			cout << "\n";
	    		}
 
	    		for (int i = r + 1; i <= n; ++i) {
	    			for (int j = 1; j <= m; ++j)
	    				cout << "-";
	    			cout << "\n";
	    		}
	    		continue;
	    	}
 
	    	if (min(n, m) == m) {
	    		int c = m / 2;
	    		if (m % 2 == 0) --c;
	    		cout << (n + c) << "\n";
	    		for (int i = 1; i <= n; ++i) {
	    			for (int j = 1; j <= m; ++j) {
	    				cout << (j <= c? "-" : "+");
	    			}
	    			cout << "\n";
	    		}
	    		continue;
	    	}
	    }

	    //sub3
	    if (min(n, m) <= 5) {
	    	if (min(n, m) == n) {
	    		cout << (m + (n + 1)/ 2) << "\n";
	    		for (int i = 1; i <= m; ++i) 
	    			cout << ((i <= m / 2 + 1)? "+" : "-");
	    		cout << "\n";
	    		for (int i = 1; i <= m; ++i) 
	    			cout << ((i < m / 2)? "-" : "+");
	    		cout << "\n";
	    		for (int i = 1; i <= m; ++i) 
	    			cout << ((m / 2 <= i && i <= m / 2 + 1)? "-" : "+");
	    		cout << "\n";

	    		for (int i = 4; i <= n; ++i) {
	    			for (int j = 1; j <= m; ++j) 
	    				cout << "-";
	    			cout << "\n";
	    		}
	    		continue;
	    	}

	    	if (min(n, m) == m) {
	    		cout << (n + (m + 1)/ 2) << "\n";

	    		vector <vector <char>> a(n + 5, vector <char> (m + 5, '+'));
	    		for (int i = 1; i <= n; ++i) 
	    			a[i][1] = ((i <= n / 2 + 1)? '-' : '+');

	    		for (int i = 1; i <= n; ++i) 
	    			a[i][2] = ((i < n / 2)? '+' : '-');

	    		for (int i = 1; i <= n; ++i) 
	    			a[i][3] = ((n / 2 <= i && i <= n / 2 + 1)? '+' : '-');

	    		for (int i = 1; i <= n; ++i) {
	    			for (int j = 1; j <= m; ++j) 
	    				cout << a[i][j];
	    			cout << "\n";
	    		}
	    		continue;
	    	}
	    }
    }
    
    return 0;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 21 ms 428 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 21 ms 428 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 51 ms 348 KB Output is correct

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 348 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 21 ms 428 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 51 ms 348 KB Output is correct
5 Incorrect 1 ms 348 KB Wrong answer
6 Halted 0 ms 0 KB -