Submission #466979

#	Time	Username	Problem	Language	Result	Execution time	Memory
466979		hhhhaura	Red-blue table (IZhO19_stones)	C++14	100 / 100	97 ms	5172 KiB

stones

#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)

#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))

using namespace std;
#define pii pair<int, int>

namespace solver {
	int n, m, inv;
	priority_queue<pii,vector<pii>, greater<pii>> pq;
	vector<vector<int>> a;
	void init_(int _n, int _m) {
		n = _n, m = _m, inv = 0 ;
		if(n > m) swap(n, m), inv = 1;
		while(pq.size()) pq.pop();
		a.assign(n + 1, vector<int>(m + 1, 0));
	}
	void solve() {
		int mxn = n - n / 2 - 1, mxm = m / 2 + 1;
		int ans = m;
		rep(i, 1, m) pq.push({0, i});
		rep(i, 1, n) {
			bool done = 0;
			rep(j, 1, mxm) {
				pii p = pq.top(); pq.pop();
				if(p.first == mxn) {
					done = 1;
					break;
				}
				p.first ++; 
				a[i][p.second] = 1;
				pq.push(p);
			}
			if(done) break;
			else ans ++;
		}
		cout << ans << "\n";
		if(inv) rep(i, 1, m) rep(j, 1, n) 
			cout << (a[j][i] ? "-" : "+") << (j == n ? "\n" : "");			
		else rep(i, 1, n) rep(j, 1, m) 
			cout << (a[i][j] ? "+" : "-") << (j == m ? "\n" : "");	
	}

};
using namespace solver;
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int t; cin >> t;
	while(t--) {
		int n, m;
		cin >> n >> m;
		init_(n, m);
		solve();
	}
	return 0;
}  

Compilation message (stderr)

stones.cpp:4: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    4 | #pragma loop-opt(on)
      |

• Subtask 1: 17 / 17
• Subtask 2: 10 / 10
• Subtask 3: 16 / 16
• Subtask 4: 11 / 11
• Subtask 5: 15 / 15
• Subtask 6: 31 / 31