oj.uz

Submission #859566

# Submission time Handle Problem Language Result Execution time Memory
859566 2023-10-10T10:19:58 Z lucri Gardening (RMI21_gardening) C++17
11 / 100
 16 ms 860 KB 
#include <bits/stdc++.h>
using namespace std;
long long test,n,m,k;
vector<vector<int>>a;
void completeaza(int i,int j,int ii,int jj,int k)
{
  int n=ii-i+1;
  int m=jj-j+1;
  if(k<n*m/4-n-m)
  {
    for(int l=i;l<=ii;++l)
      a[l][j]=a[l][jj]=k;
    for(int c=j;c<=jj;++c)
      a[i][c]=a[ii][c]=k;
    completeaza(i+1,j+1,ii-1,jj-1,k-1);
    return;
  }
  if(k<n*m/4)
  {
    int sum=8,iii,jjj;
    while((n*m-(k-1)*4-sum)/2>m-2)
      sum+=4;
    iii=i-1+sum/2;
    jjj=j-1+(n*m-(k-1)*4-sum)/2+2;
    for(int l=i;l<=iii;++l)
      a[l][j]=a[l][jjj]=k;
    for(int c=j;c<=jjj;++c)
      a[i][c]=a[iii][c]=k;
    --k;
  }
  for(int l=i;l<=ii;++l)
    for(int c=j;c<=jj;++c)
    {
      if(a[l][c]==0)
      {
        a[l][c]=a[l][c+1]=a[l+1][c]=a[l+1][c+1]=k;
        --k;
      }
    }
}
int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin>>test;
  while(test--)
  {
    cin>>n>>m>>k;
    a.clear();
    a.resize(n+5);
    for(int i=1;i<=n;++i)
      a[i].resize(m+5);
    if(n%2==1||m%2==1||k==n*m/4-1||n==m&&k==n/2+1||k>n*m/4||k<max(n/2,m/2))
    {
      cout<<"NO\n";
      continue;
    }
    completeaza(1,1,n,m,k);
    cout<<"YES\n";
    for(int i=1;i<=n;++i)
    {
      for(int j=1;j<=m;++j)
        cout<<a[i][j]<<' ';
      cout<<'\n';
    }
  }
  return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:54:40: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   54 |     if(n%2==1||m%2==1||k==n*m/4-1||n==m&&k==n/2+1||k>n*m/4||k<max(n/2,m/2))
      |                                    ~~~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 860 KB Correct! Azusa and Laika like the garden :)

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 860 KB Correct! Azusa and Laika like the garden :)
2 Correct 9 ms 600 KB Correct! Azusa and Laika like the garden :)
3 Correct 10 ms 600 KB Correct! Azusa and Laika like the garden :)

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 860 KB Correct! Azusa and Laika like the garden :)
2 Correct 9 ms 600 KB Correct! Azusa and Laika like the garden :)
3 Correct 10 ms 600 KB Correct! Azusa and Laika like the garden :)
4 Runtime error 1 ms 604 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 600 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 39.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 860 KB Correct! Azusa and Laika like the garden :)
2 Correct 9 ms 600 KB Correct! Azusa and Laika like the garden :)
3 Correct 10 ms 600 KB Correct! Azusa and Laika like the garden :)
4 Runtime error 1 ms 604 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -