제출 #1338552

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1338552		rafsanamin2020	Gardening (RMI21_gardening)	C++20	0 / 100	14 ms	908 KiB

Main

#include <bits/stdc++.h>

using namespace std;
typedef long long int ll;
ll MOD = 1E9 + 7, MX = 1E6 + 2;
int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int T;
  cin >> T;
  for (int t = 1; t <= T; t++)
  {
    int n, m, k;
    cin >> n >> m >> k;

    int ans = (m / 2) * (m / 2);
    if (k > ans)
    {
      cout << "NO\n";
    }
    else
    {
      cout << "YES\n";

      int strt = 1;

      vector<vector<int>> g(m, vector<int>(m, 0));

      int rev = 0;

      for (int i = 0; i < m; i++)
      {
        for (int j = 0; j < m; j++)
        {
          if ((j == m - 1) && (m % 2 > 0))
          {

            g[i][j] = strt + (j / 2) - 1;
          }
          else
          {
            g[i][j] = strt + (j / 2);
          }
        }

        if (rev)
        {
          reverse(g[i].begin(), g[i].end());
        }

        if (i % 2 == 1 && i != m - 2)
        {
          strt += (m / 2);
          rev ^= 1;
        }
        // cout << "\n";
      }

      map<int, int> mapping;

      while (ans > 0)
      {
        if (ans < k)
        {
          k--;
        }
        mapping[ans] = k;

        ans--;
      }

      for (int i = 0; i < m; i++)
      {
        for (int j = 0; j < m; j++)
        {
          g[i][j] = mapping[g[i][j]];
        }
      }

      for (vector<int> x : g)
      {
        for (int y : x)
        {
          cout << y << " ";
        }
        cout << "\n";
      }
    }
  }
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 6
• Subtask 3: 0 / 10
• Subtask 4: 0 / 18
• Subtask 5: 0 / 39
• Subtask 6: 0 / 22