제출 #169952

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

stones

#include <bits/stdc++.h>
#define ll long long
#define x first
#define y second
using namespace std;
int main (){
ll t;
cin>>t;
while (t--)
{
  ll n,m;
  cin>>n>>m;
  char g[n+1][m+1];
  ll n1=(n+2)/2;
  ll m1=(m+2)/2;
  ll n2=(n-1)/2;
  ll m2=(m-1)/2;
  if (n>=m)
  {
      for (int i=1;i<=n;i++)
      for (int k=1;k<=m;k++)
        g[i][k]='+';

     ll ans=n;
      vector<pair<ll,ll> >tk;
      tk.resize(n+1);
      for (int i=0;i<=n;i++)
        tk[i].x=0,tk[i].y=i;
     for (int i=1;i<=m;i++)
     {
         sort(tk.begin()+1,tk.end());
         if (tk[n1].x==m2)break;
         for (int k=1;k<=n1;k++)
         {
        //   cout<<k<<' '<<tk[k].x<<endl<<"sdfsadfsaf"<<endl;
           tk[k].x++;
           g[tk[k].y][i]='-';

         }
         ans++;
     }
  cout<<ans<<endl;
  for (int i=1;i<=n;i++)
{
        for (ll k=1;k<=m;k++)
        cout<<g[i][k]<<' ';
      cout<<endl;
}
  }
  else
  {
      for (int i=1;i<=n;i++)
      for (int k=1;k<=m;k++)
        g[i][k]='-';

     ll ans=m;
      vector<pair<ll,ll> >tk;
      tk.resize(m+1);
      for (int i=0;i<=m;i++)
        tk[i].x=0,tk[i].y=i;
     for (int i=1;i<=n;i++)
     {
         sort(tk.begin()+1,tk.end());
         if (tk[m1].x==n2)break;
         for (int k=1;k<=m1;k++)
         {
        //   cout<<k<<' '<<tk[k].x<<endl<<"sdfsadfsaf"<<endl;
           tk[k].x++;
           g[i][tk[k].y]='+';

         }
         ans++;
     }
  cout<<ans<<endl;
  for (int i=1;i<=n;i++)
{
        for (ll k=1;k<=m;k++)
        cout<<g[i][k]<<' ';
      cout<<endl;
}
  }



}


return 0;}

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