제출 #499873

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
499873		lukameladze	Red-blue table (IZhO19_stones)	C++14	0 / 100	69 ms	1828 KiB

stones

# include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
using namespace std;
const int N = 1005;
int t,n,m,a[N][N],ans,rem,cur[N],canrow,val,val1,all;
main() {
    //std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>t;
   // t = 1;
    while (t--) {
        cin>>n>>m;
        ans = max(n,m);
        for (int i = 1; i <= n; i++) {
        	all = i*((m+1)/2);
        	canrow = min(n - (n+2)/2, i);
        //	if (i == 5)cout<<canrow<<"\n";
			for (int j = 0; j < m; j++) {
				if ((m-j)*canrow >= all) {
					if (i + (m - j) > ans) {
						val = i;
					    val1 = j;
					}
					ans = max(ans,i + (m - j));
				}
				all -= i;
			}
		}
		cout<<ans<<endl;
		//cout<<ans<<" "<<val<<" "<<val1<<endl;
		if (ans == m) {
			for (int i = 1; i <= n; i++) {
				for (int j = 1; j <=m ;j++) {
					cout<<"-";
				}
				cout<<"\n";
			}
			continue;
		}
		if (ans == n) {
			for (int i = 1; i <= n; i++) {
				for (int j = 1; j <= m; j++) {
					cout<<"+";
				}
			}
			cout<<"\n";
		}
		for (int i = 1; i <= val; i++) {
			canrow = min(n-(n+2)/2,i);
			for (int j = 1; j <= val1; j++) {
				a[i][j] = 1;
			}
			rem = (m+1)/2;
			vector < pair <int, int > > v;
			v.clear();
			for (int j = 1; j <= m; j++) {
				v.pb({cur[j],j});
				/*if (cur[j] < canrow && rem) {
				   cur[j]++;
				   rem--;
				   a[i][j] = 1;
				}*/
			}
			sort(v.begin(),v.end());
			for (int j = 0; j < rem; j++) {
			//	cout<<i<<"  "<<v[j].s<<endl;
				a[i][v[j].s] = 1;
				cur[v[j].s]++;
			}
			//cout<<endl;
		}
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {cur[j] = 0;
				if (a[i][j] == 1) cout<<"+";
				else cout<<"-";
			}
			cout<<"\n";
		}
    }
}

컴파일 시 표준 에러 (stderr) 메시지

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

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