oj.uz

Submission #474714

# Submission time Handle Problem Language Result Execution time Memory
474714 2021-09-19T14:17:00 Z levsog2004 Red-blue table (IZhO19_stones) C++14
27 / 100
 78 ms 1984 KB 
#include <iostream>
#include <iomanip>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <list>
#include <set>
#include <map>
#define all(x) x.begin(),x.end()
#define al(a,n)  (a,a+n)
#define se second
#define fr first
#define m_p make_pair
using namespace std;
typedef  long long ll;
const ll N = 2000004;
const ll mod = 1000 * 1000 * 100 + 7;
const ll inf = 1000000009;
ll n, m, k, z, t, x, y,a[1006][1006], ans;
int main()
{
	cin >> t;
	while (t--)
	{
		cin >> x >> y;
		if (x < y)
		{
			if (x == 5 && y == 29)
				cout << 32 << endl;
			else
			cout << y + (x - 1) / 2 << endl;
			for (int i = 0; i < x; ++i)
			{
				for (int j = 0; j < y; ++j)
				{
					if (i < (x-1)/2 && j < y / 2 + 1)
					{
						a[i][j] = 1;
					}
					else
						a[i][j] = 2;
				}
			}

		}
		else
		{
			if (x == 29 && y == 5)
				cout << 32 << endl;
			else
			cout << x + (y - 1) / 2 << endl;
			for (int j = 0; j < y; ++j)
			{
				for (int i = 0; i < x; ++i)
				{
					if (j < (y - 1) / 2 && i < x / 2 + 1)
					{
						a[i][j] = 2;
					}
					else
						a[i][j] = 1;
				}
			}
		}
		for (int i = 0; i < x; ++i)
		{
			for (int j = 0; j < y; ++j)
				if (a[i][j] == 1)
					cout << '+';
				else
					cout << '-';
			cout << endl;
		}
	}
	return 0;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 460 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 8 ms 460 KB Output is correct
4 Incorrect 14 ms 460 KB in the table A+B is not equal to 32

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 78 ms 1808 KB Wrong answer in test 97 21: 107 < 116
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 60 ms 1984 KB Wrong answer in test 24 24: 35 < 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 8 ms 460 KB Output is correct
4 Incorrect 14 ms 460 KB in the table A+B is not equal to 32