oj.uz

답안 #911037

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
911037 2024-01-18T11:39:05 Z penguin133 Red-blue table (IZhO19_stones) C++17
100 / 100
 51 ms 2388 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve(){
	int n, m; cin >> n >> m;
	int ext = (min(n, m) - 1) / 2 * max(n, m);
	int req = (min(n, m) - 1) / 2;
	int ned = max(n, m) / 2 + 1;
	cout << max(n, m) + ext / ned << '\n';
	int cnt[n+1] = {0}, cnt2[m+1] = {0};
	if(n > m){
		char A[n+1][m+1];
		for(int i=1;i<=m;i++){
			vector <pi> tmp;
			for(int j=1;j<=n;j++)if(cnt[j] < req)tmp.push_back({cnt[j], j});
			sort(tmp.begin(), tmp.end());
			for(int j=1;j<=n;j++)A[j][i] = '+';
			for(int j=0;j<min((int)tmp.size(), ned);j++)A[tmp[j].se][i] = '-', cnt[tmp[j].se]++;
		}
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++)cout << A[i][j];
			cout << '\n';
		}
	}
	else{
		char A[n+1][m+1];
		for(int i=1;i<=n;i++){
			vector <pi> tmp;
			for(int j=1;j<=m;j++)if(cnt2[j] < req)tmp.push_back({cnt2[j], j});
			sort(tmp.begin(), tmp.end());
			for(int j=1;j<=m;j++)A[i][j] = '-';
			for(int j=0;j<min((int)tmp.size(), ned);j++)A[i][tmp[j].se] = '+', cnt2[tmp[j].se]++;
		}
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++)cout << A[i][j];
			cout << '\n';
		}
	}
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

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

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 1320 KB Output is correct
2 Correct 42 ms 1872 KB Output is correct
3 Correct 41 ms 1856 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 1364 KB Output is correct
2 Correct 41 ms 1616 KB Output is correct
3 Correct 36 ms 1384 KB Output is correct

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 41 ms 1320 KB Output is correct
6 Correct 42 ms 1872 KB Output is correct
7 Correct 41 ms 1856 KB Output is correct
8 Correct 40 ms 1364 KB Output is correct
9 Correct 41 ms 1616 KB Output is correct
10 Correct 36 ms 1384 KB Output is correct
11 Correct 10 ms 600 KB Output is correct
12 Correct 36 ms 1496 KB Output is correct
13 Correct 39 ms 1360 KB Output is correct
14 Correct 33 ms 1288 KB Output is correct
15 Correct 51 ms 2388 KB Output is correct
16 Correct 35 ms 1736 KB Output is correct
17 Correct 16 ms 1116 KB Output is correct