제출 #1148191

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1148191		8pete8	Red-blue table (IZhO19_stones)	C++20	15 / 100	15 ms	1860 KiB

stones

#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<cassert>
#include<unordered_map>
#include <queue>
#include <cstdint>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
#define int long long
using namespace std;
const int mod=1e9+7,mxn=2e5+5,inf=1e18,minf=-1e18,lg=30;
//#undef int
int n,k,m;
void setIO(string name){		
	ios_base::sync_with_stdio(0); cin.tie(0);		
	freopen((name+".in").c_str(),"r",stdin);		
	freopen((name+".out").c_str(),"w",stdout);	
}
char grid[1001][1001];
int cnt[mxn+10];
void solve(){
	int yes=0;
	cin>>n>>m;
	if(n>m)swap(n,m),yes=1;
	int have=0;
	pii ans={minf,0};
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)grid[i][j]='?';
	for(int A=0;A<=n;A++){
		int need=((n/2)+1)-(n-A);
		if(need<=0)ans=max(ans,{A+m,A});
		else{
			ans=max(ans,{A+min(m,((m-1)/2)*(A/need)),A});
		}
	}
	cout<<ans.f<<'\n';
	for(int i=ans.s+1;i<=n;i++){
		for(int j=1;j<=m;j++)grid[i][j]='-';
	}
	int need=(n/2)+1-(n-ans.s);
	int B=min(m,((m-1)/2)*(ans.s/need));
	if(need<=0){
		for(int i=1;i<=ans.s;i++){
			for(int j=1;j<=m;j++)grid[i][j]='+';
		}
	}
	else{
		for(int j=1;j<=B;j++)cnt[j]=need;
		for(int i=1;i<=ans.s;i++){
			int c=(m-1)/2;
			for(int j=1;j<=m;j++)if(c&&cnt[j]){
				cnt[j]--;
				grid[i][j]='-';
				c--;
			}
			for(int j=1;j<=m;j++)if(grid[i][j]!='-'){
				grid[i][j]='+';
			}
		}
	}
	if(yes){
		for(int j=1;j<=m;j++){
			for(int i=1;i<=n;i++)cout<<grid[i][j];
			cout<<'\n';
		}
	}
	else{
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++)cout<<grid[i][j];
			cout<<'\n';
		}
	}
	/*
	int check=0;
	for(int i=1;i<=n;i++){
		int c=0;
		for(int j=1;j<=m;j++)if(grid[i][j]=='+')c++;
		if(c>=(m+2)/2)check++;
	}
	for(int j=1;j<=m;j++){
		int c=0;
		for(int i=1;i<=n;i++)if(grid[i][j]=='-')c++;
		if(c>=(n+2)/2)check++;
	}
	if(check!=ans.f)assert(0);
	*/

}
int32_t main(){
    fastio
	int t;cin>>t;
	while(t--)solve();
}
/*
fixed A maximise B
*/

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

stones.cpp:32:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   32 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
stones.cpp:38:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   38 | void setIO(string name){
      |                       ^
stones.cpp:45:12: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   45 | void solve(){
      |            ^
stones.cpp:112:14: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
  112 | int32_t main(){
      |              ^
stones.cpp: In function 'void setIO(std::string)':
stones.cpp:40:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         freopen((name+".in").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
stones.cpp:41:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |         freopen((name+".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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