| Time Limit | $1$ 秒/Second(s) | Memory Limit | $128$ 兆字节/Megabyte(s) |
| 提交总数 | $2$ | 正确数量 | $1$ | "
| 裁判形式 | 标准裁判/Standard Judge | 我的状态 | 尚未尝试 |
| 难度 | 分类标签 |
Three points example.
Four points example.
In this picture you can draw a line to seperate these 3 points in the two dimensional plane to keep points with the same color lie in the same side no matter how to color each point using either blue or red.
But in k dimensional real Euclidean space Rk, can you find n points satisfying that there always exsit a k−1 dimensional hyperplane to seperate them in any one of 2n coloring schemes?
3
2 2
3 2
4 2
Yes
Yes
No
| 本题记录 | 用 户（点击查看用户） | 运行号（点击购买题解） | 时 间 |
|---|---|---|---|
| 算法最快[$39 $ms] | 只能过个样例~~~ | 789459 | 2021-12-01 17:37:20 |
| 内存最少[$2084 $KB] | 只能过个样例~~~ | 789459 | 2021-12-01 17:37:20 |
| 第一AC | 只能过个样例~~~ | 789459 | 2021-12-01 17:37:20 |
| 第一挑战 | 只能过个样例~~~ | 761669 | 2021-08-04 18:24:49 |
| 竞赛编号 | 竞赛名称 | 竞赛时间 | 访问比赛 |
|---|