【PER #4】咋克大战纸笔迷题 - المسألة

#21894. 【PER #4】咋克大战纸笔迷题

الإحصائيات

تم استخدام هذه المسألة في المسابقات التالية:

Public Easy Round #4

这是一道提交答案题。

这是一道咋克在 IOI 2024 训练中大战了半个小时的题。

有一个矩形，被划分成了$n \times n$的格子，你要将其中涂黑其中一些格子，要求

涂黑的格子不能有公共边。
未涂黑的格子四连通。

问最多能涂黑多少格子。

实现细节

你不需要提交程序，你只需要提交你构造的答案。

本题共有 $7$ 个测试点，每个测试点 $1$ 分，共 $7$ 分。

输入格式

一个整数 $n$。

输出格式

$n$ 行，每行长度为 $n$ 的 $01$ 串，$1$ 表示涂黑，$0$ 表示未涂黑。

样例输入

样例输出

数据规模与约定

一共$7$个点，保证$n$依次等于$300,301,302,303,304,305,306$。

对于每个$n$，假设最优解黑色个数为$a_n$，你的答案为$b_n$。

$b_n=a_n$，你将获得$1$分。否则你获得 $0$ 分。

أو قم برفع الملفات واحداً تلو الآخر:

About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
Issues must be filed in English or Chinese only.
Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0