oj.uz

Submission #779509

# Submission time Handle Problem Language Result Execution time Memory
779509 2023-07-11T13:36:00 Z epicci23 Red-blue table (IZhO19_stones) C++17
100 / 100
 21 ms 3164 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)
    {
      if(hm==(n+1)/2) cur-=(m+1)-(xd-cog);
      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)
    {
      if(hm==(m+1)/2) cur2-=(n+1)-(xd-cog);
      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
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1284 KB Output is correct
2 Correct 17 ms 2508 KB Output is correct
3 Correct 21 ms 2536 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1248 KB Output is correct
2 Correct 15 ms 2112 KB Output is correct
3 Correct 15 ms 1672 KB Output is correct

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 19 ms 1284 KB Output is correct
6 Correct 17 ms 2508 KB Output is correct
7 Correct 21 ms 2536 KB Output is correct
8 Correct 19 ms 1248 KB Output is correct
9 Correct 15 ms 2112 KB Output is correct
10 Correct 15 ms 1672 KB Output is correct
11 Correct 5 ms 448 KB Output is correct
12 Correct 14 ms 1932 KB Output is correct
13 Correct 15 ms 1716 KB Output is correct
14 Correct 14 ms 1216 KB Output is correct
15 Correct 18 ms 3164 KB Output is correct
16 Correct 14 ms 2388 KB Output is correct
17 Correct 6 ms 1236 KB Output is correct