oj.uz

Submission #335785

# Submission time Handle Problem Language Result Execution time Memory
335785 2020-12-14T02:50:43 Z tengiz05 Red-blue table (IZhO19_stones) C++17
0 / 100
 34 ms 1516 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
const int mod = 1e9+7, N = 1005;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val);}
int n, m, k;
char a[N][N];
void solve(int test_case){
	int i, j;
	cin >> n >> m;
	int need = m/2+1;
	for(i=0;i<n;i++){
		for(j=0;j<need;j++){
			a[i][j] = '+';
		}
	}
	for(i=0;i<n;i++){
		for(j=need;j<m;j++){
			a[i][j] = '-';
		}
	}
	cout << n + m-need << '\n';
	for(i=0;i<n;i++){
		for(j=0;j<m;j++){
			cout << a[i][j];
		}cout << '\n';
	}
	return;
}

signed main(){
	FASTIO;
#define MULTITEST 1
#if MULTITEST
	int ___T;
	cin >> ___T;
	for(int T_CASE = 1; T_CASE <= ___T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Wrong answer in test 1 3: 2 < 3
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Wrong answer in test 3 45: 25 < 46

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Wrong answer in test 1 3: 2 < 3
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 1516 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 33 ms 1516 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 Incorrect 1 ms 384 KB Wrong answer in test 1 3: 2 < 3
2 Halted 0 ms 0 KB -