oj.uz

답안 #778801

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
778801 2023-07-10T17:34:50 Z epicci23 Red-blue table (IZhO19_stones) C++17
0 / 100
 35 ms 2284 KB 
#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}


void solve()
{
  int n=in(),m=in();
  int ans=0;

  char ar[n+1][m+1];
  

  if(n>m)
  {
    for(int i=1;i<=n;i++)
      for(int j=1;j<=m;j++)
        ar[i][j]='+';
    
    int cog=n/2+1;
    int xd=(m-1)/2;

    for(int j=1;j<=xd;j++)
      for(int i=1;i<=cog;i++)
       ar[i][j]='-';

    for(int j=m;j>=m-xd+1;j--)
      for(int i=n;i>=n-cog+1;i--)
        ar[i][j]='-';
  } 
  else
  {
    for(int i=1;i<=n;i++)
     for(int j=1;j<=m;j++)
        ar[i][j]='-';
    
    int cog=m/2+1;
    int xd=(n-1)/2;
    
    for(int i=1;i<=xd;i++)
      for(int j=1;j<=cog;j++)
       ar[i][j]='+';

    for(int i=n;i>=n-xd+1;i--)
      for(int j=m;j>=m-cog+1;j--)
        ar[i][j]='+';
  }
  
  for(int i=1;i<=n;i++)
  {
    int cu=0;
    for(int j=1;j<=m;j++)
    {
      if(ar[i][j]=='+') cu++;
      else cu--;
    }
    ans+=(cu>0);
  }

  for(int j=1;j<=m;j++)
  {
    int cu=0;
    for(int i=1;i<=n;i++)
    {
      if(ar[i][j]=='-') cu++;
      else cu--;
    }
    ans+=(cu>0);
  }

  cout << ans << endl;

  for(int i=1;i<=n;i++)
    for(int j=1;j<=m;j++)
      cout << ar[i][j] << " \n"[j==m];
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message

stones.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 320 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 340 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 320 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 35 ms 2284 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 34 ms 2252 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 320 KB Wrong answer
2 Halted 0 ms 0 KB -