oj.uz

Submission #338444

# Submission time Handle Problem Language Result Execution time Memory
338444 2020-12-23T06:30:51 Z IZhO_2021_I_want_Silver Red-blue table (IZhO19_stones) C++14
0 / 100
 36 ms 1516 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
//#define int ll

const int N = 1005;
const int oo = 1e9 + 5;

int n, m, cnt[N];
char a[N][N];

void solve() {
    cin >> n >> m;
    int ans = 0;
    if (n >= m) {
        ans += n;
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= m; ++j) {
                a[i][j] = '+';
            }
        }
        int pr = (m >> 1) + (m & 1);
        int pos = 1;
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= (m - 1) / 2; ++j) {
                a[i][pos] = '-';
                ++cnt[pos];
                ++pos;
                if (pos == pr + 1) { pos = 1; }
            }
        }
        for (int i = 1; i <= pr; ++i) {
            if (cnt[i] >= (n / 2) + 1) { ++ans; }
            cnt[i] = 0;
        }
    }
    else {
        ans += m;
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= m; ++j) {
                a[i][j] = '-';
            }
        }
        int pr = (n >> 1) + (n & 1);
        int pos = 1;
        for (int j = 1; j <= m; ++j) {
            for (int i = 1; i <= (n - 1) / 2; ++i) {
                a[pos][i] = '+';
                ++cnt[pos];
                ++pos;
                if (pos == pr + 1) { pos = 1; }
            }
        }

        for (int i = 1; i <= pr; ++i) {
            if (cnt[i] >= (m / 2) + 1) { ++ans; }
            cnt[i] = 0;
        }
    }
    cout << ans <<"\n";
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            cout << a[i][j];
        }
        cout <<"\n";
    }
}

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tests = 1;
	cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
*/

Compilation message

stones.cpp:101:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  101 |  main () {
      |        ^

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong answer in test 4 4: 4 < 5

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB in the table A+B is not equal to 46

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong answer in test 4 4: 4 < 5

Subtask #4
0 / 11.0

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

Subtask #5
0 / 15.0

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

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong answer in test 4 4: 4 < 5