oj.uz

Submission #779497

# Submission time Handle Problem Language Result Execution time Memory
779497 2023-07-11T13:25:55 Z epicci23 Red-blue table (IZhO19_stones) C++17
0 / 100
 21 ms 1300 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,ans2=0;

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

  for(int i=1;i<=n;i++)
    for(int j=1;j<=m;j++)
      {ar[i][j]='-';ar2[i][j]='+';}


  int kac=0,hm=0;
  int cur=m;ans=cur;
  int xd=m,cog=m/2+1;

  for(int i=1;i<=n;i++)
  {
    cur++;xd+=cog;
    if(xd>m)
    {
      xd-=m;
      hm++;
    }
    if(hm==(n+1)/2) cur-=(xd-max(0LL,xd-cog));
    if(cur>ans) {ans=cur;kac=i;}
  }
   
  int last=1; 
  for(int i=1;i<=kac;i++)
  {
    for(int j=1;j<=cog;j++)
    {
      ar[i][last]='+'; 
      last++;
      if(last>m) last-=m;
    }
  }
 

  
  int cur2=n;ans2=cur2;
  hm=kac=0;
  xd=n,cog=n/2+1;
  
  //what_is(cur2);
  for(int i=1;i<=m;i++)
  {
    cur2++;xd+=cog;
    if(xd>n)
    {
      xd-=n;
      hm++;
    }
    if(hm==(m+1)/2) cur2-=(xd-max(0LL,xd-cog));
    if(cur2>ans2) {ans2=cur2;kac=i;}
  }
 
  last=1;
  for(int i=1;i<=kac;i++)
  {
    for(int j=1;j<=cog;j++)
    {
      ar2[last][i]='-'; 
      last++;
      if(last>n) last-=n;
    }
  }

  
  cout << max(ans,ans2) << endl;

  if(ans>ans2)
  {
    for(int i=1;i<=n;i++)
    {
      for(int j=1;j<=m;j++)
        cout << ar[i][j];
      cout << endl;
    }
  }
  else
  {
    for(int i=1;i<=n;i++)
    {
      for(int j=1;j<=m;j++)
        cout << ar2[i][j];
      cout << endl;
    }
  }
}

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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Incorrect 1 ms 212 KB in the table A+B is not equal to 6
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB in the table A+B is not equal to 46
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Incorrect 1 ms 212 KB in the table A+B is not equal to 6
3 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 1300 KB in the table A+B is not equal to 18
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 1264 KB in the table A+B is not equal to 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Incorrect 1 ms 212 KB in the table A+B is not equal to 6
3 Halted 0 ms 0 KB -