QOJ.ac

QOJ

Time Limit: 3 s Memory Limit: 512 MB Total points: 100 Difficulty: [show]

#1836. Glory Graph

統計

题解 by @ezoilearner,你可以通过以下联系方式联系作者:

  • QQ: 2939863838

题意:给一个完全图,每条边要么是蓝色,要么是黄色。

定义 $A$ 为四个点的生成子图,满足其中五条边颜色一样剩下一条边颜色不一样,的个数。

定义 $B$ 为四个点的生成子图,满足不同颜色数五五开,且不会有个颜色形成同色三角形,的个数。

求 $A-B$ .

$n\leq 2000$

题解:计算两种情况的数量

2 $\times$ 一种颜色的边形成了十字架 $+$ 一种颜色的边恰有一种(即 $A$ )

4 $\times$ 一种颜色的边形成了十字架 $+$ 2 $\times$ B

时间复杂度 $O(\frac{n^3}{w})$

Discussions

About Discussions

The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues. Submitting multiple issues may cause your account to be banned.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.