제출 #681752

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

stones

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define ull unsigned long long
#define ssort sort(s.begin(),s.end());
#define sreverse reverse(s.begin(),s.end());
#define sclear s.clear();
#define ssize s.size();
#define ld long double
#define F first
#define S second
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define sq(a) (a)*(a)
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
ll a,b,c,e,d,f,k,g,h,r,i,j,x,y,z,m,n,l,t,p,s,u,sum,ans,mod=1e18;
char arr[200][200];
int main(){
	ios::sync_with_stdio(0);
    cin.tie(0);
    cin>>a;
    for(i=1;i<=a;i++)
    {
    	cin>>n>>m;
    	if(n==1&&m==1){
    		cout<<1<<endl<<'+'<<endl; continue;
		}
		if(n>m){
			swap(n,m); r=1; //swapped
			
	}
	    for(j=1;j<=n;j++){
		    for(k=1;k<=m;k++){
			    if(r==1) arr[j][k]='+';
			    else arr[j][k]='-';
		}
	}
	l=min(n,(n/2-!(n%2))*m/(m/2+1));
	cout<<m+l<<endl;
	for(j=1;j<= l ;j++){
		for(k=1;k<=m/2+1;k++)
		{
			h++;
			if(h>m) h=1;
			if(r==1){
				arr[j][h]='-';
			}
			else{
				arr[j][h]='+';
			}
		}
	}
	if(r==1){
		
	for(j=1;j<=m;j++)
	{
		for(k=1;k<=n;k++)
		{
			cout<<arr[j][k];
		}
		cout<<endl;
	}
	}
	else{
	
	for(j=1;j<=n;j++)
	{
		for(k=1;k<=m;k++)
		{
			cout<<arr[j][k];
		}
		cout<<endl;
	}
}
}
}

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

stones.cpp: In function 'void fopn(std::string)':
stones.cpp:16:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
stones.cpp:17:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |  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: 0 / 15
• Subtask 6: 0 / 31