QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#741176	#8217. King's Dinner	ucup-team3646	WA	1ms	3616kb	C++20	1.5kb	2024-11-13 13:41:12	2024-11-13 13:41:14

Judging History

你现在查看的是最新测评结果

[2024-11-13 13:41:14]
评测

测评结果：WA
用时：1ms
内存：3616kb

查看

[2024-11-13 13:41:12]
提交

answer

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, l, r) for (ll i = l; i < r; i++)

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;

/* ---- */
#define all(A) A.begin(), A.end()
#define elif else if
using pii = pair<ll, ll>;

bool chmin(auto &a, const auto &b) { return a > b ? a = b, 1 : 0; }
bool chmax(auto &a, const auto &b) { return a < b ? a = b, 1 : 0; }

struct IOSetup
{
  IOSetup()
  {
    cin.tie(0);
    ios::sync_with_stdio(0);
  }
} iosetup;

template <class T>
void print(vector<T> a)
{
  for (auto x : a)
    cerr << x << ' ';
  cerr << endl;
}

void print(auto x) { cerr << x << endl; }

template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail)
{
  cerr << head << ' ';
  print(forward<Tail>(tail)...);
}

void solve()
{
  int n;
  cin >> n;
  if (n == 1)
  {
    cout << ".\n";
    return;
  }
  vector<string> S(n, string(n, '.'));
  if (n % 2 == 0)
  {
    rep(i, n) rep(j, n)
    {
      if ((((i / 2) ^ j) & 1) == 0)
        S[i][j] = '#';
    }
    rep(i, n) cout << S[i] << '\n';
    return;
  }
  rep(i, n - 3) rep(j, n)
  {
    if ((((i / 2) ^ j) & 1) == 0)
      S[i][j] = '#';
  }

  for (int j = 0; j < n; j += 2)
  {
    S[n - 2][j] = '#';
    S[n - 1][j] = '#';
  }
  rep(i, n)
  {
    cout << S[i] << '\n';
  }
}

int main()
{
  int T;
  cin >> T;
  rep(i, T) solve();
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 3616kb

input:

output:

.
#.
#.
...
#.#
#.#

result:

ok all tests correct (3 test cases)

Test #2:

score: -100

Wrong Answer

time: 1ms

memory: 3532kb

input:

output:

.
#.
#.
...
#.#
#.#
#.#.
#.#.
.#.#
.#.#
#.#.#
#.#.#
.....
#.#.#
#.#.#
#.#.#.
#.#.#.
.#.#.#
.#.#.#
#.#.#.
#.#.#.
#.#.#.#
#.#.#.#
.#.#.#.
.#.#.#.
.......
#.#.#.#
#.#.#.#
#.#.#.#.
#.#.#.#.
.#.#.#.#
.#.#.#.#
#.#.#.#.
#.#.#.#.
.#.#.#.#
.#.#.#.#
#.#.#.#.#
#.#.#.#.#
.#.#.#.#.
.#.#.#.#.
#.#.#.#.#
#.#.#.#.#
...

result:

wrong answer grid contains two dominoes that are adjacent (test case 4)