oj.uz

답안 #384825

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
384825 2021-04-02T11:19:25 Z Kalashnikov Red-blue table (IZhO19_stones) C++17
15 / 100
 418 ms 9196 KB 
#include <bits/stdc++.h>
 
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
 
using namespace std;
using ll = long long;
 
const int N = 1000+5 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7 , P = 6547;

int a[N][N] , b[N][N];

void solve() {
	int n , m;
	cin >> n >> m;
	for(int i = 1; i <= n; i ++) {
		for(int j = 1; j <= m; j ++) {
			a[i][j] = -1;
			b[i][j] = 1;
		}
	}
	int ans = m , ans1 = n;
	{
		set<pair<int,int>> st;
		int mx = (n-1)/2;
		for(int i = 1; i <= m; i ++) {
			if(mx)
				st.insert({0 , i});
		}
		int x = m/2+1;
		for(int i = 1; i <= n; i ++) {
			int p = x;
			int ok = 1;
			vector<int> v;
			while(p --) {
				if(st.empty()) {
					ok = 0;
					break;
				}
				pair<int,int> cur = *st.begin();
				v.push_back(cur.S);
				st.erase(cur);
				cur.F ++;
				if(cur.F < mx) {
					st.insert(cur);
				}
			}
			if(ok) {
				for(auto to: v) {
					a[i][to] = 1;
				}
				ans ++;
			}
		}
	}
	{
		set<pair<int,int>> st;
		int mx = (m-1)/2;
		for(int i = 1; i <= n; i ++) {
			if(mx)
				st.insert({0 , i});
		}
		int x = n/2+1;
		for(int i = 1; i <= m; i ++) {
			int p = x;
			int ok = 1;
			vector<int> v;
			while(p --) {
				if(st.empty()) {
					ok = 0;
					break;
				}
				pair<int,int> cur = *st.begin();
				v.push_back(cur.S);
				st.erase(cur);
				cur.F ++;
				if(cur.F < mx) {
					st.insert(cur);
				}
			}
			if(ok) {
				for(auto to: v) {
					b[to][i] = 1;
				}
				ans1 ++;
			}
		}
	}
	if(ans1 > ans) {
		swap(ans1 , ans);
		swap(a , b);
	}
	
	cout << ans << '\n';
	for(int i = 1; i <= n; i ++) {
		for(int j = 1; j <= m; j ++)
			if(a[i][j] == 1) cout << '+';
			else cout << '-';
			
		cout << '\n';
	}
}
/*
*/
main() {
  //  ios;
    int tt = 1;
    cin >> tt;
    while(tt --) {
        solve();
    }
    return 0;
}

Compilation message

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

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 13 ms 8172 KB in the table A+B is not equal to 5

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 201 ms 8428 KB in the table A+B is not equal to 5

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 13 ms 8172 KB in the table A+B is not equal to 5

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 418 ms 9196 KB in the table A+B is not equal to 116
2 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 186 ms 2540 KB Output is correct
2 Correct 165 ms 6892 KB Output is correct
3 Correct 145 ms 5612 KB Output is correct

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 13 ms 8172 KB in the table A+B is not equal to 5