Submission #882574

#	Time	Username	Problem	Language	Result	Execution time	Memory
882574		vjudge1	Red-blue table (IZhO19_stones)	C++17	27 / 100	39 ms	1364 KiB

stones

#include <bits/stdc++.h>
using namespace std;
#define sp << " " << 
#define int long long
#define vi vector<int>
#define F(xxx,yyy) for (int xxx=1;xxx<=yyy;xxx++)
#define pii pair<int,int>

void solve() {
  int n,m;
  cin >> n >> m;
  int fullfill= m/2+1;
  int should= 0;
  int best = 0;
  for (int i=0;i<=n;i++) {
    int got = i+(i>=(n+1)/2?0:fullfill)+m-fullfill;
    if (got > best) {
      best = got;
      should = i;
    }
  }
  char grid[n+1][m+1];
  F(i,n) F(j,m) grid[i][j] = '-';
  for (int i=1;i<=should;i++) {
    F(j,fullfill) {
      grid[i][j] = '+';
    }
  }
  cout << best << endl;
  F(i,n) {
    F(j,m) cout << grid[i][j];
    cout << endl;
  }
}
    
                  
                             
signed main() { 
  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  #ifdef Local
  freopen("in","r",stdin);
  freopen("out","w",stdout); 
  #endif
  int t = 1;
  cin >> t;
	F(i,t) solve();
}

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